
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tiziana Calamoneri, Andrea E.F. Clementi, Emanuele G. Fusco, Riccardo Silvestri, "Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 2, pp. 208216, February, 2011.  
BibTex  x  
@article{ 10.1109/TPDS.2010.77, author = {Tiziana Calamoneri and Andrea E.F. Clementi and Emanuele G. Fusco and Riccardo Silvestri}, title = {Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {22}, number = {2}, issn = {10459219}, year = {2011}, pages = {208216}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.77}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks IS  2 SN  10459219 SP208 EP216 EPD  208216 A1  Tiziana Calamoneri, A1  Andrea E.F. Clementi, A1  Emanuele G. Fusco, A1  Riccardo Silvestri, PY  2011 KW  Energyaware systems KW  wireless communication KW  graph algorithms KW  network problems. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] 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.
[2] R. BarYehuda, O. Goldreich, and A. Itai, "On the TimeComplexity of Broadcast in MultiHop Radio Networks: An Exponential Gap between Determinism and Randomization," J. Computer and System Sciences (JCSS), vol. 45, pp. 104126, 1992.
[3] R. BarYehuda, A. Israeli, and A. Itai, "Multiple Communication in MultiHop Radio Networks," SIAM J. Computing (SICOMP), vol. 22, no. 4, pp. 875887, 1993.
[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] I. Caragiannis, M. Flammini, and L. Moscardelli, "An Exponential Improvement on the MST Heuristic for the Minimum Energy Broadcast Problem," Proc. Int'l Colloquium Automata, Languages and Programming (ICALP '07), pp. 447458, 2007.
[7] M. Cardei and D.Z. Du, "Improving Wireless Sensor Network Lifetime through Power Organization," Wireless Networks, vol. 11, pp. 333340, 2005.
[8] 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.
[9] T. Calamoneri, A. Clementi, A. Monti, G. Rossi, and R. Silvestri, "MinimumEnergy Broadcast in RandomGrid AdHoc Networks: Approximation and Distributed Algorithms," Proc. 11th ACM Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), 2008.
[10] A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, "On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs," Proc. 18th Ann. Symp. Theoretical Aspects of Computer Science (STACS), pp. 121131, www.dia.unisa.it~penna, Feb. 2001.
[11] A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y.C. Verhoeven, "On the Approximation Ratio of the MSTBased Heuristic for the EnergyEfficient Broadcast Problem in Static AdHoc Radio Networks," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '03), vol. 222, 2003.
[12] A.E.F. Clementi, A. Monti, and R. Silvestri, "Distributed Broadcast in Radio Networks of Unknown Topology," Theoretical Computer Science, vol. 302, nos. 13, pp. 337364, 2003.
[13] M. Chrobak, L. Gasieniec, and W. Rytter, "Fast Broadcasting and Gossiping in Radio Networks," J. Algorithms, vol. 43, no. 2, pp. 177189, 2002.
[14] W. Chu, C.J. Colbourn, and V.R. Syrotiuk, "The Effects of Synchronization on Topology Transparent Scheduling," Wireless Networks, vol. 12, pp. 681690, 2006.
[15] A. Czumaj and W. Rytter, "Broadcasting Algorithms in Radio Networks with Unknown Topology," J. Algorithms, vol. 60, no. 2, pp. 115143, 2006.
[16] A. Dessmark and A. Pelc, "Broadcasting in Geometric Radio Networks," J. Discrete Algorithms, vol. 5, no. 1, pp. 187201, 2007.
[17] 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.
[18] 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.
[19] 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.
[20] P. Gupta and P.R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks," Stochastic Analysis, Control, Optimization and Applications, pp. 547566, Birkhauser, 1999.
[21] 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.
[22] L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, "Power Consumption in Packet Radio Networks," Theoretical Computer Science, vol. 243, pp. 289305, 2000.
[23] M. Mitzenmacher and E. Upfal, Probability and Computing. Cambridge Univ. Press, 2005.
[24] K. Pahlavan and A. Levesque, Wireless Information Networks. WileyInterscience, 1995.
[25] M. Penrose, Random Geometric Graphs. Oxford Univ. Press, 2003.
[26] P. Santi and D.M. Blough, "The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 2539, Jan.Mar. 2003.