Ad hoc wireless distribution service

About: Ad hoc wireless distribution service is a research topic. Over the lifetime, 17734 publications have been published within this topic receiving 488205 citations.

AODV-PA: AODV with path accumulation

Abstract: Ad hoc networks meet the demands of spontaneous network set-up. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanisms and decision-making. AODV and DSR are the two most widely studied on-demand ad hoc routing protocols. Previous studies have shown limitations of these protocols in certain network scenarios. To improve the performance of AODV, we modify AODV to include the source route accumulation feature of DSR. We call this AODV with path accumulation. This protocol optimizes AODV to perform effectively in terms of routing overhead and delay during high load. The performance of the protocol is evaluated by a simulation model under a variety of network conditions. We also compare its performance with that of unmodified AODV and DSR. We demonstrate how a small change to the AODV protocol can lead to significantly improved performance results.

CD-MAC: Cooperative Diversity MAC for Robust Communication in Wireless Ad Hoc Networks

Abstract: This paper proposes a medium access control (MAC) algorithm, called Cooperative Diversity MAC (CD-MAC), which exploits the cooperative communication capability to improve robustness in wireless ad hoc networks. In CD-MAC, each terminal proactively selects a relay for cooperation and lets it transmit simultaneously when it is beneficial in mitigating interference from nearby terminals and thus improving the network performance. For practicability, CD-MAC is designed based on the widely adopted IEEE 802.11 MAC. System-level simulation study shows that CD-MAC significantly outperforms the original IEEE 802.11 MAC in terms of packet delivery ratio.

Evaluating the communication performance of an ad hoc wireless network

Abstract: Adaptive and self-organizing wireless networks are gaining in popularity. Several media access and routing protocols were proposed for such networks and the performance of such protocols were evaluated based on simulations. In this paper, we evaluate the practicality of realizing an ad hoc wireless network and investigate on performance issues. Several mobile computers were enhanced with ad hoc routing capability and were deployed in an outdoor environment and communication performance associated with ad hoc communications were evaluated. These computers periodically send beacons to their neighbors to declare their presence. We examined the impact of varying packet size, beaconing interval, and route hop count on route discovery time, communication throughput, end-to-end delay, and packet loss. We had also performed mobility experiments and evaluated the route reconstruction time incurred. File transfer times associated with sending information reliably (via TCP) over multihop wireless links are also presented. The experimental results obtained revealed that it is feasible to augment existing wireless computers with ad hoc networking capability. End-to-end performance in ad hoc routes are less affected by beaconing intervals than packet size or route length. Similarly, communication throughput is more dependent on packet size and route length with the exception at very high beaconing frequencies. Packet loss, on the other hand, is not significantly affected by packet size, route length or beaconing frequency. Finally, route discovery time in ad hoc wireless networks are more dependent on channel conditions and route length than variations in beaconing intervals.

SecMR – a secure multipath routing protocol for ad hoc networks

Abstract: Multipath routing in ad hoc networks increases the resiliency against security attacks of collaborating malicious nodes, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols vulnerable to collaborating malicious nodes. We propose an on-demand multipath routing protocol, the secure multipath routing protocol (SecMR), and we analyze its security properties. Finally, through simulations, we evaluate the performance of the SecMR protocol in comparison with existing secure multipath routing protocols.

Consistent group membership in ad hoc networks

Abstract: The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Such views are important because they simplify both the programming and verification tasks. Essential to constructing a consistent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose an algorithm that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this algorithm are its reliance on location information and a conservative notion of logical connectivity that creates the illusion of announced disconnection. Movement patterns and delays are factored in the policy that determines which physical connections are susceptible to disconnection.