Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Throughput of ideally routed wireless ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Power-Aware Localized Routing in Wireless Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
Optimal throughput-delay scaling in wireless networks: part I: the fluid model
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The capacity of wireless networks
IEEE Transactions on Information Theory
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Distributed resource sharing in low-latency wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
This paper is concerned with the scaling of the number of relay nodes (i.e., hops) individual messages have to transit through in a large-scale wireless ad hoc network (WANET); we call this hop-count as network latency (NL). A large network latency affects all aspects of data communication in a WANET, including an increase in delay, packet loss, and the power needed to process and store messages in nodes lying on the relay path. We consider network management and data routing challenges in WANETs with scalable network latency, e.g., when NL increases only polylogarithmically in the network size. On the physical side, reducing network latency imposes a significantly higher power and bandwidth demand on nodes, and are captured in a set of new bounds derived in this paper. On the protocol front, designing distributed routing protocols that can guarantee the delivery of data packets within a scalable number of hops is a challenging task. To solve this, we introduce multiresolution randomized hierarchy (MRRH), a novel power and bandwidth efficient WANET protocol with scalable network latency. MRRH uses a randomized algorithm for building and maintaining a random hierarchical network topology, which together with the proposed routing algorithm, can guarantee efficient delivery of data packets in the wireless network. For a network of size N, MRRH can provide an average latency of only O(log3 N). The power consumption and bandwidth requirements of MRRH are shown to be nearly optimal for the latency it provides. Therefore, MRRH is a provably efficient candidate for truly large-scale wireless ad hoc networking.