Abstract
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 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 K, while in IRA, this quantity can take much larger values.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
