Analysis of the contention access period of IEEE 802.15.4 MAC
ACM Transactions on Sensor Networks (TOSN)
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Numerical solutions of continuum equilibria for routing in dense ad-hoc networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
End-to-end energy-bandwidth tradeoff in multihop wireless networks
IEEE Transactions on Information Theory
Continuum equilibria and global optimization for routing in dense static ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-aware utility regions: multiple access Pareto boundary
IEEE Transactions on Wireless Communications
On the energy-bandwidth tradeoff for AWGN relay channels
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Cross-layer channel-aware approaches for modern wireless networks
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Optimal Relay Selection for Energy-Efficient Multicast
Wireless Personal Communications: An International Journal
Energy efficient communications for future broadband cellular networks
Computer Communications
| Hi-index | 0.07 |
For a wireless network in which every node is bounded in its energy supply, we define a new concept of network capacity called "bits-per-Joule capacity", which is the maximum total number of bits that the network can deliver per Joule of energy deployed into the network. For a fixed network size, a finite number of information bits is delivered for each source-destination pair, under a fixed end-to-end probability of error constraint. We prove that under the one-to-one traffic model in which every node wants to send traffic to a randomly chosen destination node, the bits-per-Joule capacity of a stationary wireless network grows asymptotically as Omega((N/logN)(q-1)/2 ), where N is the number of nodes randomly deployed onto the surface of a sphere and q is the path loss exponent. Further, the length of the block codes used grows only logarithmically in N, which indicates manageable decoder complexity as the network scales. The fact that the bits-per-Joule capacity grows with the number of nodes contrasts sharply with the scaling laws that have been derived for throughput capacity and implies that large-scale deployments for energy-limited sensor and ad hoc networks may be suitable for delay-tolerant data applications