
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Majid Khabbazian, Vijay K. Bhargava, "Efficient Broadcasting in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 2, pp. 231245, February, 2009.  
BibTex  x  
@article{ 10.1109/TMC.2008.94, author = {Majid Khabbazian and Vijay K. Bhargava}, title = {Efficient Broadcasting in Mobile Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {8}, number = {2}, issn = {15361233}, year = {2009}, pages = {231245}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.94}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Efficient Broadcasting in Mobile Ad Hoc Networks IS  2 SN  15361233 SP231 EP245 EPD  231245 A1  Majid Khabbazian, A1  Vijay K. Bhargava, PY  2009 KW  Wireless communication KW  Network communications KW  Mobile environments VL  8 JA  IEEE Transactions on Mobile Computing ER   
[1] C. Perkins, Ad Hoc on Demand Distance Vector (AODV) Routing, IETF Internet draft, work in progress, 1997.
[2] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H.F.Korth, eds., Kluwer Academic Publishers, 1996.
[3] S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom '99, pp. 151162, 1999.
[4] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman, 1990.
[5] B. Clark, C. Colbourn, and D. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165177, 1990.
[6] P. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM '02, vol. 3, pp. 15971604, 2002.
[7] S. Funke, A. Kesselman, U. Meyer, and M. Segal, “A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs,” ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 444453, 2006.
[8] H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, “Efficient Flooding Scheme Based on 1Hop Information in Mobile Ad Hoc Networks,” Proc. IEEE INFOCOM, 2006.
[9] Y. Tseng, S. Ni, and E. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Networks,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS '01), pp. 481488, 2001.
[10] Y. Sasson, D. Cavin, and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), pp. 11241130, 2003.
[11] W. Lou and J. Wu, “DoubleCovered Broadcast (DCB): A Simple Reliable Broadcast Algorithm in Manets,” Proc. IEEE INFOCOM '04, pp. 20842095, 2004.
[12] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on SelfPruning,” Proc. IEEE INFOCOM '03, pp. 22402250, 2003.
[13] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '00, pp. 129130, 2000.
[14] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “RangeFree Localization Schemes in Large Scale Sensor Networks,” Proc. ACM MobiCom '03, pp. 8195, 2003.
[15] A. KeshavarzHaddad, V. Ribeiro, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. Fourth Ann. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), June 2007.
[16] R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed Topology Control for Power Efficient Operation in Multihop Wireless AdHoc Networks,” Proc. IEEE INFOCOM '01, pp. 13881397, 2001.
[17] L. Li, J. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “A ConeBased Distributed TopologyControl Algorithm for Wireless MultiHop Networks,” IEEE/ACM Trans. Networking, vol. 13, pp.147159, 2005.
[18] M. Sun, W. Feng, and T. Lai, “Broadcasting in Ad Hoc Networks Based on SelfPruning,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '01), pp. 28422846, 2001.
[19] A. Papoulis, Probability and Statistics. Prentice Hall, 1990.
[20] R. Chang and R. Lee, “On the Average Length of Delaunay Triangulations,” BIT Numerical Math., vol. 24, pp. 269273, 1984.
[21] M. Khabbazian and V.K. Bhargava, “Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy,” IEEE Trans. Computers, vol. 57, no. 8, pp. 10721086, Mar. 2008.
[22] Y. Cai, K. Hua, and A. Phillips, “Leveraging 1Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks,” Proc. 24th IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '05), pp. 347354, 2005.
[23] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '99), pp. 714, 1999.