Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
MobiCom poster: top five myths about the energy consumption of wireless communication
ACM SIGMOBILE Mobile Computing and Communications Review
Design Considerations for Ultra-Low Energy Wireless Microsensor Nodes
IEEE Transactions on Computers
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
The capacity of wireless networks
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
Throughput scaling and optimal hop distance of interference-limited wireless networks have been well characterized in literature. For some emerging wireless networks, throughput may be more limited by battery energy rather than by interference. In characterizing throughput scaling and optimal hop distance of such power-limited networks, prior work have invoked a zero signal processing energy assumption, which led to the belief that whispering to the nearest neighbor (WtNN, with the average number of hops per source destination pair increasing with increasing node density) achieves the optimal throughput scaling. We show that this belief must be modified for power-limited networks when signal processing energy is not an insignificant factor. In fact, for a power-limited network with nodes uniformly randomly distributed in a bounded region and in the limit of interference-free operation, taking Θ(1) (i.e. does not increase or decrease with increasing node density) number of hops is throughput, energy, and delay optimal, achieving Θ(1) pairwise throughput, energy per bit, and packet delay under uniform traffic, whereas WtNN is strictly suboptimal, achieving a pairwise throughput of O(√log n/n), which decreases with increasing node density. In addition, we show that a constant characteristic hop distance of dchar simultaneously achieves the pairwise throughput scaling and minimum network energy consumption for random networks.