Critical Power for Asymptotic Connectivity in Wireless Networks-英文文献.pdf

Critical Power for Asymptotic Connectivity in Wireless Networks Piyush Gupta P R Kumar KEYWORDS Wireless networks connectivity critical p ower critical range continuum p ercolation ABSTRACT In wireless data networks each transmitters p ower needs to b e high enough to reach the intended receivers while generating minimum interference on other receivers sharing the same channel In particular if the no des in the network are assumed to co op erate in routing each oth ers packets as is the case in ad hoc wireless networks each no de should transmit with just enough p ower to guarantee connectivity in the network Towards this end we derive the critical p ower a no de in the network needs to transmit in order to ensure that the network is connected with probabil ity one as the numb er of no des in the network go es to innity It is shown 2 that if n no des are placed in a disc of unit area in and each no de trans mits at a p ower level so as to cover an area of r2 log n c nn then the resulting network is asymptotically connected with probability one if and only if c n Intro duction Wireless communication systems consist of no des which share a common communication medium namely radio Signals intended for a receiver cause interference at other receiver no des This results in reduced signal to noise ratio at the latter receivers and thus in the lowering of their informationpro cessing capacity Hence it b ecomes essential to control the transmitter p ower such that the information signals reach their intended receivers while causing minimal interference for other receivers sharing the same channel To achieve this ob jective many iterative p ower control al gorithms have b een develop ed