The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
IEEE Transactions on Parallel and Distributed Systems
Minimum energy paths for reliable communication in multi-hop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Low latency wireless ad hoc networking: power and bandwidth challenges and a solution
IEEE/ACM Transactions on Networking (TON)
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
Link stability-aware reliable packet transmitting mechanism in mobile ad hoc network
International Journal of Communication Systems
Hi-index | 0.00 |
With the growing abundance of portable wireless communication devices, a challenging question that arises is whether one can efficiently harness the collective communication and computation power of these devices. In this paper, we investigate this question by studying a streaming application. Consider a network of N wireless nodes, each of power P, in which one or more nodes are interested in receiving a data stream from a fixed server node S. We ask whether distributed communication mechanisms exist to route media packets from S to the arbitrary but fixed receiver, such that 1) the average communication delay L is short, 2) the load is balanced, i.e., all nodes in the ensemble spend roughly the same amount of average power, and, more importantly, 3) power resources of all nodes are optimally shared, i.e., the lifetime of the network is comparable to an optimally designed network with L nodes whose total power is N × P. We develop a theoretical framework for incorporation of random long range routes into wireless ad hoc networking protocols that can achieve such performance. Surprisingly, we show that wireless ad hoc routing algorithms, based on this framework, exist that can deliver this performance. The proposed solution is a randomized network structuring and packet routing framework whose communication latency is only L=O(log2 N) hops, on average, compared to O(√N) in nearest neighbor communications while distributing the power requirement almost equally over all nodes. Interestingly, all network formation and routing algorithms are completely decentralized, and the packets arriving at a node are routed randomly and independently, based only on the source and destination locations. The distributed nature of the algorithm allows it to be implemented within standard wireless ad hoc communication protocols and makes the proposed framework a compelling candidate for harnessing collective network resources in a truly large-scale wireless ad hoc networking environment.