A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks
2011
IEEE Transactions on Parallel and Distributed Systems
We consider static ad-hoc wireless networks whose nodes, equipped with the same initial battery charge, may dynamically change their transmission range. When a node v transmits with range r(v), its battery charge is decreased by β r(v) 2 where β > 0 is a fixed constant. The goal is to provide a range assignment schedule that maximizes the number of broadcast operations from a given source (this number is denoted as the length of the schedule). This maximization problem, denoted as Max LifeTime,
doi:10.1109/tpds.2010.77
fatcat:c3twbk55bnbapgrragwpdr7uaa