
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Khabbazian, I. F. Blake, V. K. Bhargava, "Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions," IEEE Transactions on Mobile Computing, vol. 11, no. 3, pp. 402413, March, 2012.  
BibTex  x  
@article{ 10.1109/TMC.2011.67, author = {M. Khabbazian and I. F. Blake and V. K. Bhargava}, title = {Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions}, journal ={IEEE Transactions on Mobile Computing}, volume = {11}, number = {3}, issn = {15361233}, year = {2012}, pages = {402413}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2011.67}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions IS  3 SN  15361233 SP402 EP413 EPD  402413 A1  M. Khabbazian, A1  I. F. Blake, A1  V. K. Bhargava, PY  2012 KW  telecommunication network topology KW  ad hoc networks KW  approximation theory KW  computational complexity KW  optimisation KW  radio broadcasting KW  NPhard problem KW  local broadcast algorithm KW  wireless ad hoc network KW  local topology information KW  globally known priority function KW  approximation factor KW  Approximation algorithms KW  Heuristic algorithms KW  Approximation methods KW  Algorithm design and analysis KW  Decision support systems KW  Network topology KW  Broadcasting KW  Ad hoc networks KW  Mobile ad hoc networks KW  constant approximation. KW  Mobile ad hoc networks KW  distributed algorithms KW  broadcasting KW  connected dominating set VL  11 JA  IEEE Transactions on Mobile Computing ER   
[1] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman & Co., 1990.
[2] B. Clark, C. Colbourn, and D. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165177, 1990.
[3] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on SelfPruning,” Proc. IEEE INFOCOM, pp. 22402250, 2003.
[4] J. Wu and W. Lou, “ForwardNodeSetBased Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 155173, 2003.
[5] J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks,” IEEE Trans. Computers, vol. 53, no. 10, pp. 13431354, Oct. 2004.
[6] S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom, pp. 151162, 1999.
[7] Z. Haas, J. Halpern, and L. Li, “GossipBased Ad Hoc Routing,” Proc. IEEE INFOCOM, pp. 17071716, 2002.
[8] D.Y. Sasson and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 11241130, 2003.
[9] 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.
[10] J. Wu, W. Lou, and F. Dai, “Extended Multipoint Relays to Determine Connected Dominating Sets in Manets,” IEEE Trans. Computers, vol. 55, no. 3, pp. 334347, Mar. 2006.
[11] M. Khabbazian and V.K. Bhargava, “Efficient Broadcasting in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 2, pp. 231245, Feb. 2009.
[12] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 129130, 2000.
[13] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor EliminationBased Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 1425, Jan. 2002.
[14] M. Khabbazian and V.K. Bhargava, “Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy,” IEEE Trans. Computers, vol. 57, no. 8, pp. 10721086, Aug. 2008.
[15] Y. Xu, J. Heidemann, and D. Estrin, “GeographyInformed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, 2001.
[16] Y. Chen and J.L. Welch, “LocationBased Broadcasting for Dense Mobile Ad Hoc Networks,” Proc. ACM Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 6370, 2005.
[17] A. KeshavarzHaddad, V. Ribeiro, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. IEEE Fourth Ann. Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), pp. 253262, 2007.
[18] C.T. Zahn, “Black Box Maximization of Circular Coverage,” J. Research of the Nat'l Bureau of Standards B., vol. 66, pp. 181216, 1962.
[19] L. Barriére, P. Fraigniaud, and L. Narayanan, “Robust PositionBased Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges,” Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. pp. 1927, 2001.
[20] Y. Cai, K. Hua, and A. Phillips, “Leveraging 1Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks,” Proc. IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '05), pp. 347354, 2005.
[21] P. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, vol. 3, pp. 15971604, 2002.
[22] A. Vahdatpour, F. Dabiri, M. Moazeni, and M. Sarrafzadeh, “Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks,” Proc. 22nd Int'l Symp. Distributed Computing (DISC '08), pp. 481495, 2008.
[23] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DiaLM '99), pp. 714, 1999.
[24] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing (WCMC '02), vol. 2, pp. 483502, 2002.