The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Improved capacity bounds for wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue: Scalability Issues in Wireless Networks—Architectures, Protocols and Services
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.