On k-connectivity for a geometric random graph
Random Structures & Algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Iterative maximum likelihood on networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Undirected connectivity of sparse Yao graphs
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Throughput and energy efficiency in wireless ad hoc networks with Gaussian channels
IEEE/ACM Transactions on Networking (TON)
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
An important issue in wireless ad hoc networks is to reduce the transmission power subject to certain connectivity requirement. In this paper, we study the fundamental scaling law of the minimum total power (termed as critical total power) required to ensure k-connectivity in wireless networks. Contrary to several previous results that assume all nodes use a (minimum) common power, we allow nodes to choose different levels of transmission power. We show that under the assumption that wireless nodes form a homogeneous Poisson point process with density λ in a unit square region [0, 1]2, the critical total power required to maintain k-connectivity is Θ ((Γ(c/2+k)/(k-1)!)λ1-c/2) with probability approaching one as λ goes to infinity, where c is the path loss exponent. If k also goes to infinity, the expected critical total power is of the order of kc/2λ1-c/2. Compared with the results that all nodes use a common critical transmission power for maintaining k-connectivity, we show that the critical total power can be reduced by an order of (log λ)c/2 by allowing nodes to optimally choose different levels of transmission power. This result is not subject to any specific power/topology control algorithm, but rather a fundamental property of wireless networks.