Wireless information networks
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Power consumption in packet radio networks
Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
On random points in the unit disk
Random Structures & Algorithms
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Mobile Networks and Applications
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Asymptotic critical total power for k-connectivity of wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Understanding the paradoxical effects of power control on the capacity of wireless networks
IEEE Transactions on Wireless Communications
The capacity of wireless ad hoc networks with multi-packet reception
IEEE Transactions on Communications
Achieving single channel, full duplex wireless communication
Proceedings of the sixteenth annual international conference on Mobile computing and networking
The design space of wireless sensor networks
IEEE Wireless Communications
Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper studies the bottleneck link capacity under the Gaussian channel model in strongly connected random wireless ad hoc networks, with n nodes independently and uniformly distributed in a unit square. We assume that each node is equipped with two transceivers (one for transmission and one for reception) and allow all nodes to transmit simultaneously. We draw lower and upper bounds, in terms of bottleneck link capacity, for homogeneous networks (all nodes have the same transmission power level) and propose an energy-efficient power assignment algorithm (CBPA) for heterogeneous networks (nodes may have different power levels), with a provable bottleneck link capacity guarantee of, Ω (Blog(1+1/√nlog2n)), where B is the channel bandwidth. In addition, we develop a distributed implementation of CBPA with O(n2) message complexity and provide extensive simulation results.