TY - JOUR
T1 - Near-optimal multicriteria spanner constructions in wireless Ad Hoc networks
AU - Shpungin, Hanan
AU - Segal, Michael
N1 - Funding Information:
Manuscript received April 13, 2009; revised February 20, 2010; accepted May 27, 2010; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Sarkar. Date of publication July 15, 2010; date of current version December 17, 2010. This work was supported in part by the Lynn and William Frankel Center for Computer Science and the U.S. Air Force, European Office of Aerospace Research and Development, Grant #FA8655-09-1-3016. This is an extended version of a paper titled “Near optimal multicriteria spanner constructions in wireless ad-hoc networks,” which appears in the proceedings of IEEE INFOCOM 2009.
PY - 2010/7/19
Y1 - 2010/7/19
N2 - In this paper, we study asymmetric power assignments that induce a low-energy k-strongly connected communication graph with spanner properties. We address two spanner models: energy and distance. The former serves as an indicator for the energy consumed in a message propagation between two nodes, while the latter reflects the geographic properties of routing in the induced communication graph. We consider a random wireless ad hoc network with IVI = n nodes distributed uniformly and independently in a unit square. For k {1, 2}, we propose several power assignments that obtain a good bicriteria approximation on the total cost and stretch factor under the two models. For k > 2, we analyze a power assignment developed by Carmi et al. and derive some interesting bounds on the stretch factor for both models as well. We also describe how to compute all the power assignments distributively, and we provide simulation results. To the best of our knowledge, these are the first provable theoretical bounds for low-cost spanners in wireless ad hoc networks.
AB - In this paper, we study asymmetric power assignments that induce a low-energy k-strongly connected communication graph with spanner properties. We address two spanner models: energy and distance. The former serves as an indicator for the energy consumed in a message propagation between two nodes, while the latter reflects the geographic properties of routing in the induced communication graph. We consider a random wireless ad hoc network with IVI = n nodes distributed uniformly and independently in a unit square. For k {1, 2}, we propose several power assignments that obtain a good bicriteria approximation on the total cost and stretch factor under the two models. For k > 2, we analyze a power assignment developed by Carmi et al. and derive some interesting bounds on the stretch factor for both models as well. We also describe how to compute all the power assignments distributively, and we provide simulation results. To the best of our knowledge, these are the first provable theoretical bounds for low-cost spanners in wireless ad hoc networks.
KW - Communication systems
KW - network fault tolerance
KW - point processes
KW - stochastic approximation
UR - http://www.scopus.com/inward/record.url?scp=80052811465&partnerID=8YFLogxK
U2 - 10.1109/TNET.2010.2053381
DO - 10.1109/TNET.2010.2053381
M3 - Article
AN - SCOPUS:80052811465
SN - 1063-6692
VL - 18
SP - 1963
EP - 1976
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 6
M1 - 5510012
ER -