A novel convex hull-based flooding scheme using 1-hop neighbor information for mobile ad hoc networks

被引:1
|
作者
Yang, Shun-Ren [1 ,2 ]
Chiu, Chun-Wei [3 ]
Yen, Wei-Torng [3 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 300, Taiwan
[2] Natl Tsing Hua Univ, Inst Commun Engn, Hsinchu 300, Taiwan
[3] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 300, Taiwan
关键词
Broadcasting; Convex hull; Flooding; Mobile ad hoc networks; Wireless networks; ALGORITHMS;
D O I
10.1007/s11276-011-0374-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Flooding is one of the most essential and commonly used operations in mobile ad hoc networks. Different sender-based and receiver-based flooding algorithms have been presented separately in the literature. To integrate the advantages of sender-based and receiver-based flooding algorithms, this paper proposes a novel joint 1-hop neighbor information-based flooding scheme that consists of two sub-algorithms: the sender-phase algorithm and the receiver-phase algorithm. The sender-phase algorithm of our flooding scheme helps a node select a subset of its 1-hop neighbors to forward the flooding message. Based on the convex-hull concept, this algorithm selects forwarding nodes with the highest contribution to flooding message dissemination. On the other hand, the receiver-phase algorithm complements the sender-phase algorithm, allowing our flooding scheme to guarantee full delivery. We prove that our flooding scheme requires lower time complexity O(n log h), where h is the number of forwarding nodes, than the best known 1-hop neighbor information-based flooding algorithms proposed by Liu et al. and Khabbazian et al. Additionally, to alleviate the local optimal problem caused by sender-based flooding algorithms, we relax the full delivery requirement and modify our flooding scheme to discard more redundant rebroadcasting operations. Simulation experiments are conducted to compare the performance of our flooding schemes with those of Liu et al.'s and Khabbazian et al.'s flooding algorithms. The simulation results show that our flooding schemes accomplish a lower ratio of broadcasting nodes and a higher message delivery ratio simultaneously under various network conditions. Moreover, since our flooding schemes have lower ratios of broadcasting nodes, they incur fewer packet collisions on the network. Consequently, message disseminations applying our flooding schemes have a smaller effect on other transmissions of different message types.
引用
收藏
页码:1715 / 1729
页数:15
相关论文
共 50 条
  • [1] A novel convex hull-based flooding scheme using 1-hop neighbor information for mobile ad hoc networks
    Shun-Ren Yang
    Chun-Wei Chiu
    Wei-Torng Yen
    Wireless Networks, 2011, 17 : 1715 - 1729
  • [2] Efficient flooding scheme based on 1-hop information in mobile ad hoc networks
    Liu, Hai
    Wan, Pengjun
    Jia, Xiaohua
    Liu, Xinxin
    Yao, Frances
    25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, : 13 - 24
  • [3] A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks
    Liu, Hai
    Jia, Xiaohua
    Wan, Peng-Jun
    Liu, Xinxin
    Yao, Frances F.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (05) : 658 - 671
  • [4] Flooding in 3-dimensional mobile ad hoc networks using 1-hop information
    Bai, Xin
    Wei, Xiaohui
    Bai, Sen
    INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2018, 26 (02) : 69 - 80
  • [5] A Secure Routing Using Reliable 1-Hop Broadcast in Mobile Ad Hoc Networks
    Park, Seungjin
    Yoo, Seong-Moo
    COMMUNICATION AND NETWORKING, PT II, 2010, 120 : 102 - +
  • [6] Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks
    Cai, Y
    Hua, KA
    Phillips, A
    CONFERENCE PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, 2005, : 347 - 354
  • [7] Optimal Number of 1-hop Neighbor Nodes Considering Routing Overhead in Ad hoc Networks
    Lim, Ji Hyeok
    Lee, Dong Jun
    2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2009, : 681 - 685
  • [8] Connectivity Restorability of Mobile Ad hoc Networks Based on K-hop Neighbor Information
    Mi, Zhenqiang
    Yang, Yang
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [9] Efficient flooding scheme based on 2-hop backward information in ad hoc networks
    Le, Trong Duc
    Choo, Hyunseung
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 2443 - 2447
  • [10] An Efficient Distributed Flooding Scheme Using One-Hop Information in Heterogeneous Ad Hoc Networks
    Huo, Ruilong
    Li, Deying
    Zhu, Qinghua
    Yang, Huiqiang
    2009 WRI INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND MOBILE COMPUTING: CMC 2009, VOL I, 2009, : 513 - +