An Energy-Efficient Transmission Range Assignment for 1-D Wireless Ad Hoc Networks

摘要

We propose a novel transmission range assignment for one-dimensional wireless networks. Unlike the commonly used identical range assignment (IRA), the proposed scheme depends on the spatial density of network nodes and is based on maintaining the same average number of nodes cal K in the transmission range of any arbitrary network node. We demonstrate that, for a given average power consumption, the proposed assignment can achieve a higher probability of connectivity between source and destination compared with IRA. Furthermore, our approach, on average, has a contention level bounded above by cal K, while in IRA, this quantity can take much larger values.