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.

Challenges: towards truly scalable ad hoc networks

Abstract: The protocols used in ad hoc networks today are based on the assumption that the best way to approach multiple access interference (MAI) is to avoid it. Unfortunately, as the seminal work by Gupta and Kumar has shown, this approach does not scale. Recently, Ahlswede, Ning, Li, and Yeung showed that network coding (NC) can attain the max-flow min-cut throughput for multicast applications in directed graphs with point-to-point links. Motivated by this result, many researchers have attempted to make ad hoc networks scale using NC. However, the work by Liu, Goeckel, and Towsley has shown that NC does not increase the order capacity of wireless ad hoc networks for multi-pair unicast applications. We demonstrate that protocol architectures that exploit multi-packet reception (MPR) do increase the order capacity of random wireless ad hoc networks by a factor Θ(log n) under the protocol model. We also show that MPR provides a better capacity improvement for ad hoc networks than NC when the network experiences a single-source multicast and multi-pair unicasts. Based on these results, we introduce design problems for channel access and routing based on MPR, such that nodes communicate with one another on a many-to-many basis, rather than one-to-one as it is done today, in order to make ad hoc networks truly scalable.

Energy Efficient Design of Wireless Ad Hoc Networks

Abstract: One of the most critical issues in wireless ad hoc networks is represented by the limited availability of energy within network nodes. The time period from the instant when the network starts functioning to the instant when the first networkno de runs out of energy, the so-called network life-time, strictly depends on the system energy efficiency. Our objective is to devise techniques to maximize the network life-time in the case of cluster-based systems, which represent a significant subset of ad hoc networks. We propose an original approach to maximize the network life-time by determining the optimal clusters size and the optimal assignment of nodes to cluster-heads. The presented solution greatly outperforms the standard assignment of nodes to cluster-heads, based on the minimum distance criterion.

Hierarchical routing in ad hoc mobile networks

Abstract: Clustering is a method by which nodes are hierarchically organized on the basis of their relative proximity to one another. Routes can be recorded hierarchically, across clusters, to increase routing flexibility. Hierarchical routing greatly increases the scalability of routing in ad hoc networks by increasing the robustness of routes. This paper presents the Adaptive Routing using Clusters (ARC) protocol, a protocol that creates a cluster hierarchy composed of cluster leaders and gateway nodes to interconnect clusters. ARC introduces a new algorithm for cluster leader revocation that eliminates the ripple effect caused by leadership changes. Further, ARC utilizes a limited broadcast algorithm for reducing the impact of network floods. The performance of ARC is evaluated by comparing it both with other clustering schemes and with an on-demand ad hoc routing protocol. It is shown that the cluster topology created by ARC is more stable than that created by other clustering algorithms and that the use of ARC can result in throughput increases of over 100%. Copyright © 2002 John Wiley & Sons, Ltd.

Integrating mobile IP with ad hoc networks

Abstract: Extending traditional IEEE 802.11-based access points to incorporate the flexibility of mobile ad hoc networks would help make the dream of ubiquitous broadband wireless access a reality. The authors discuss several issues related to integrating the mobile Internet protocol with Manets.

A Scalable Quorum Based Location Service in Ad Hoc and Sensor Networks

Abstract: Location service provides position of mobile destination to source node to enable geo-routing. Previous location service protocols suffer from partial flooding overhead, and/or location failures in group movement scenarios. To overcome those deficiencies, we propose a quorum-based location service. The basic idea is that destination node registers its location along a `column' to form an update quorum. Source node makes a query along a `row' to form a search quorum. The destination location is found at the intersection between the update and search quorums. Four strategies are proposed to adjust the quorum system. To guarantee the success of location retrieval, both search and update quorums are extended by face routing which traverses outer network boundary.