Files in this item



application/pdfOn the Critical ... y in Wireless Networks.pdf (324kB)
(no description provided)PDF


Title:On the Critical Total Power for Asymptotic $k$-Connectivity in Wireless Networks
Author(s):Zhang, Honghai; Hou, Jennifer C.
Subject(s):Wireless Networks
Abstract:In this paper, we investigate the minimum total power (termed as {\em critical total power}) required to ensure asymptotic k-connectivity in heterogeneous wireless networks where nodes may transmit using different levels of power. We show that under the assumption that wireless nodes form a homogeneous Poisson point process with density \lambda on a unit square region [0,1]^2 and the Toroidal model \cite{penrose97}, the critical total power required for maintaining k-connectivity is \Theta({\Gamma(c/2+k) \over (k-1)!}\lambda^{1-c/2}) with probability approaching one as \lambda goes to infinity, where c is the path loss exponent. Compared with the result that all nodes use a {\em common} critical transmission power for maintaining k-connectivity \cite{penrose99,wan04}, we show that the critical total power can be reduced by an order of (\log \lambda)^{c/2} by allowing node to optimally choose different levels of transmission power. These results are not subject to any specific power/topology control algorithm, but rather a fundamental property in wireless networks.
Issue Date:2004-07
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2004-2454
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-16

This item appears in the following Collection(s)

Item Statistics