Advanced Search
Volume 32 Issue 10
Dec.  2010
Turn off MathJax
Article Contents
Liu Jing-Yong, Li Le-Min, Jing Xiao-Rong. Space-covered Broadcast Algorithm without Neighbor Information in Multi-hop Wireless Networks[J]. Journal of Electronics & Information Technology, 2010, 32(10): 2434-2439. doi: 10.3724/SP.J.1146.2009.00920
Citation: Liu Jing-Yong, Li Le-Min, Jing Xiao-Rong. Space-covered Broadcast Algorithm without Neighbor Information in Multi-hop Wireless Networks[J]. Journal of Electronics & Information Technology, 2010, 32(10): 2434-2439. doi: 10.3724/SP.J.1146.2009.00920

Space-covered Broadcast Algorithm without Neighbor Information in Multi-hop Wireless Networks

doi: 10.3724/SP.J.1146.2009.00920
  • Received Date: 2009-06-23
  • Rev Recd Date: 2010-01-18
  • Publish Date: 2010-10-19
  • This paper presents a broadcast algorithm called Space-Covered Broadcast (SCB) that does not need and neighbor information to address broadcast storm problem in multi-hop wireless networks. The SCB algorithm uses the minimum number of forwarding nodes to cover the network by optimizing the spatial distribution of the forwarding nodes, thereby it reduces retransmissions considerably while providing high deliverability. The SCB algorithm reduces the communication and memory overhead for it does not need any neighbor information or network topology awareness, and the algorithm adapts itself to and gets the best out of existing channel conditions for the forwarding nodes are entirely self-selected at each receiving node using a delayed retransmitting mechanism. Simulation results show that SCB can significantly improve broadcast efficiency for different network density and network load.
  • loading
  • [1] Heissenbel M, Braun T, Wlchli M, and Bernoulli T. Optimized stateless broadcasting in wireless multi-hop networks [C]. Proc. IEEE INFOCOM2006, Barcelona, Spanish, April 23-29 2006: 1-12. [2] Khan I A.[J].Javaid A, and Qian H L. Distance-based dynamically adjusted probabilistic forwarding for wireless mobile Ad Hoc networks [C]. IEEE and IFIP WOCN08, Surabaya, Indonesia, May 5-.2008,:- [3] Liarokapis D, Shahrabi A, and Komninos A. DibA: An adaptive broadcasting scheme in mobile Ad hoc networks [C]. Communication Networks and Services Research Conference 2009, Moncton, Canada, May 11-13, 2009: 224-231. [4] Durresi A, Paruchuri V K, Iyengar S S, and Kannan R. Optimized broadcast protocol for sensor networks [J].IEEE Transactions on Computers.2005, 54(8):1013-1024 [5] Liu H, Jia X H, Wan P J, Liu X X, and Yao F. A distributed and efficient flooding scheme using 1-hop information in mobile Ad Hoc networks [J].IEEE Transactions on Parallel and Distributed Systems.2007, 18(5):658-671 [6] Khabbazian M and Bhargava V K. Efficient broadcasting in mobile Ad hoc networks [J].IEEE Transactions on Mobile Computing.2009, 8(2):231-245 [7] al-Humoud S O, Mackenzie L M, and Abdulai J. Neighbourhood-aware counter-based broadcast scheme for wireless Ad hoc networks [C]. IEEE GLOBECOM 2008 Workshops, New Orleans, USA, Nov. 30-Dec. 4 2008: 1-6. [8] Lee Y, Shim Y, Choi Y, and Kwon T. A reliability aware flooding algorithm (RAFA) in wireless multi-hop networks [C]. IEEE Symposium on Computers and Communications 2008, Marrakech, Morocco, July 6-9, 2008: 1070-1075. [9] Stojmenovic I, Seddigh M, and Zunic J. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks [J].IEEE Transactions on Parallel and Distributed Systems.2002, 13(1):14-25 [10] Thai M T, Wang F, Liu D, Zhu S, and Du D Z. Connected dominating sets in wireless networks with different transmission ranges [J].IEEE Transactions on Mobile Computing.2007, 6(7):721-730 [11] Yang H Y, Lin C H, and Tsai M J. Distributed algorithm for efficient construction and maintenance of connected k-hop dominating sets in mobile Ad hoc networks [J].IEEE Transactions on Mobile Computing.2008, 7(4):444-457 [12] Dai F and Wu J. Performance analysis of broadcast protocols in Ad hoc networks based on self-pruning [J].IEEE Transactions on Parallel and Distributed Systems.2004, 15(11):1-14 [13] Kadi N and Al agha K. Optimized MPR-based flooding in wireless ad hoc network using network coding [C]. Wireless Days 2008 1st IFIP, Dubai, UAE, Nov 24-27, 2008: 1-5. [14] Cai Y, Hua K A, and Phillips A. Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless Ad hoc networks [C]. Proc. IPCCC 2005, Phoenix, Arizona, April 7-9, 2005: 347-354. [15] Kershner R. The number of circles covering a set [J].American Journal of Mathematics.1939, 61(1):665-671 [16] Ho C, Obraczka K, Tsudik G, and Viswanath K. Flooding for reliable multicast in multi-hop Ad hoc networks [C]. Proc. DiaLM99, Seattle, USA, 1999: 64-71.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3080) PDF downloads(794) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return