Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSecuring Mobile Ad hoc Networks:Key Management and Routing
162
0
0.0
(
0
)
Added by
Kamal Chauhan
Publication date
2012
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Secure communication between two nodes in a network depends on reliable key management systems that generate and distribute keys between communicating nodes and a secure routing protocol that establishes a route between them. But due to lack of central server and infrastructure in Mobile Ad hoc Networks (MANETs), this is major problem to manage the keys in the network. Dynamically changes in networks topology causes weak trust relationship among the nodes in the network. In MANETs a mobile node operates as not only end terminal but also as an intermediate router. Therefore, a multi-hop scenario occurs for communication in MANETs; where there may be one or more malicious nodes in between source and destination. A routing protocol is said to be secure that detects the detrimental effects of malicious node(s in the path from source to destination). In this paper, we proposed a key management scheme and a secure routing protocol that secures on demand routing protocol such as DSR and AODV. We assume that MANETs is divided into groups having a group leader in each group. Group leader has responsibility of key management in its group. Proposed key management scheme is a decentralized scheme that does not require any Trusted Third Party (TTP) for key management. In proposed key management system, both a new node and group leader authenticates each other mutually before joining the network. While proposed secure routing protocol allows both communicating parties as well as intermediate nodes to authenticate other nodes and maintains message integrity
rate research
Read More
Cognitive radio (CR) technology will have significant impacts on upper layer performance in mobile ad hoc networks (MANETs). In this paper, we study topology control and routing in CR-MANETs. We propose a distributed Prediction-based Cognitive Topology Control (PCTC) scheme to provision cognition capability to routing in CR-MANETs. PCTC is a midware-like cross-layer module residing between CR module and routing. The proposed PCTC scheme uses cognitive link availability prediction, which is aware of the interference to primary users, to predict the available duration of links in CR-MANETs. Based on the link prediction, PCTC constructs an efficient and reliable topology, which is aimed at mitigating re-routing frequency and improving end-to-end network performance such as throughput and delay. Simulation results are presented to show the effectiveness of the proposed scheme.
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of the multicast structure and by providing robustness to mobility by performing broadcasts in densely clustered local regions, the proposed protocol achieves packet delivery statistics that are comparable to that with a pure multicast protocol but with significantly lower overheads. By our simulation results, we show that our proposed protocol achieves increased Packet Delivery Fraction (PDF) with reduced overhead and routing load.
Routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied for more than fifteen years. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). Different position-based protocols use different strategies to pick the neighbor to forward the packet. If a node has no neighbor that is closer to the destination than itself, greedy forwarding fails. In this case, we say there is void (no neighboring nodes) in the direction of the destination. Different position-based routing protocols use different methods for dealing with voids. In this paper, we use a simple backtracking technique to deal with voids and design a position-based routing protocol called Greedy Routing Protocol with Backtracking (GRB). We compare the performance of our protocol with the well known Greedy Perimeter Stateless Routing (GPSR) routing and the Ad-Hoc On-demand Distance Vector (AODV) routing protocol as well as the Dynamic Source Routing (DSR) protocol. Our protocol needs much less routing-control packets than those needed by DSR, AODV, and GPSR. Simulation results also show that our protocol has a higher packet-delivery ratio, lower end-to-end delay, and less hop count on average than AODV.
In cellular systems using frequency division duplex, growing Internet services cause unbalance of uplink and downlink traffic, resulting in poor uplink spectrum utilization. Addressing this issue, this paper considers overlaying an ad hoc network onto a cellular uplink network for improving spectrum utilization and spatial reuse efficiency. Transmission capacities of the overlaid networks are analyzed, which are defined as the maximum densities of the ad hoc nodes and mobile users under an outage constraint. Using tools from stochastic geometry, the capacity tradeoff curves for the overlaid networks are shown to be linear. Deploying overlaid networks based on frequency separation is proved to achieve higher network capacities than that based on spatial separation. Furthermore, spatial diversity is shown to enhance network capacities.
This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a very attractive technology for many civilian and military applications. Due to the high mobility of the nodes, maintaining a communication link between the UAVs is a challenging task. The topology of these networks is more dynamic than that of typical mobile ad hoc networks (MANETs) and of typical vehicle ad hoc networks (VANETs). As a consequence, the existing routing protocols designed for MANETs partly fail in tracking network topology changes. In this work, we compare two different routing algorithms for ad hoc networks: optimized link-state routing (OLSR), and predictive-OLSR (P-OLSR). The latter is an OLSR extension that we designed for FANETs; it takes advantage of the GPS information available on board. To the best of our knowledge, P-OLSR is currently the only FANET-specific routing technique that has an available Linux implementation. We present results obtained by both Media Access Control (MAC) layer emulations and real-world experiments. In the experiments, we used a testbed composed of two autonomous fixed-wing UAVs and a node on the ground. Our experiments evaluate the link performance and the communication range, as well as the routing performance. Our emulation and experimental results show that P-OLSR significantly outperforms OLSR in routing in the presence of frequent network topology changes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
