Maximizing The Number Of Broadcast Operations In Random Geometric Adhoc Wireless Networks

Full Text(PDF, ) PP.10091016


Author(s) 
P.Abdul Wahid, Avadhanula Karthik, Ch. Srinath Reddy 

KEYWORDS 
Energy aware systems, wireless communication, graph algorithms,network problems 

ABSTRACT 
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 , where > 0 is a fixed co 

References 

[1] A. Ephremides, G.D. Nguyen, and J.E. Wieselthier,
“On the Construction of EnergyEfficient Broadcast
and Multicast Trees in Wireless Networks,” Proc.
IEEE INFOCOM, pp. 585594, 2000.
[2] I. Kang and R. Poovendran, “Maximizing Network
Lifetime of Wireless Broadcast Ad Hoc Networks,” J.
ACM Mobile Networks and Applications, vol. 10, no.
6, pp. 879896, 2005.
[3] C. Ambuehl, “An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees
in Wireless Networks,” Proc. Int’l Colloquium Automata, Languages and Programming (ICALP ’05),
pp. 11391150, 2005.
[4] G. Calinescu, X.Y. Li, O. Frieder, and P.J. Wan,
“MinimumEnergy Broadcast Routing in Static Ad
Hoc Wireless Networks,” Proc. IEEE INFOCOM, pp.
11621171, Apr. 2001.
[5] G. Calinescu, S. Kapoor, A. Olshevsky, and A. Zelikovsky, “Network Lifetime and Power Assignment in
Ad Hoc Wireless Networks,” Proc. European Symp.
Algorithms (ESA ’03), pp. 114126, 2003.
[6] G. Calinescu, X.Y. Li, O. Frieder, and P.J. Wan,
“MinimumEnergy Broadcast Routing in Static Ad
Hoc Wireless Networks,” Proc. IEEE INFOCOM, pp.
11621171, Apr. 2001.
[7] M. Cardei, J. Wu, and M. Lu, “Improving Network
Lifetime Using Sensors with Adjustable Sensing
Ranges,” Int’l J. Sensor Networks, vol. 1, nos. 1/2, pp.
4149, 2006.
[8] A. Ephremides, G.D. Nguyen, and J.E. Wieselthier,
“On the Construction of EnergyEfficient Broadcast
and Multicast Trees in Wireless Networks,” Proc.
IEEE INFOCOM, pp. 585594, 2000.
[9] A.D. Flaxman, A.M. Frieze, and J.C. Vera, “On the
Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem,” Proc. ACM Symp. Theory of Computing (STOC ’05), pp. 441449, 2005.
[10] M. Flammini, A. Navarra, and S. Perennes, “The
Real Approximation Factor of the MST Heuristic for
the Minimum Energy Broadcast,” Proc. Int’l Workshop Experimental and Efficient Algorithms (WEA
’05), pp. 2231, 2005.
[11] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547566, Birkhauser, 1999.
[12] I. Kang and R. Poovendran, “Maximizing Network
Lifetime of Wireless Broadcast Ad Hoc Networks,” J.
ACM Mobile Networks and Applications, vol. 10, no.
6, pp. 879896, 2005.
[13] L.M. Kirousis, E. Kranakis, D. Krizanc, and A.
Pelc, “Power Consumption in Packet Radio Networks,” Theoretical Computer Science, vol. 243, pp.
289305, 2000.
[14] M. Mitzenmacher and E. Upfal, Probability and
Computing.Cambridge Univ. Press, 2005.
[15] K. Pahlavan and A. Levesque, Wireless Information Networks.WileyInterscience, 1995.


