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 条
  • [41] Neighbor Mobility-based Clustering Scheme for Vehicular Ad Hoc Networks
    Kwon, Jung-Hyok
    Kwon, Cheolhee
    Kim, Eui-Jik
    2015 INTERNATIONAL CONFERENCE ON PLATFORM TECHNOLOGY AND SERVICE (PLATCON), 2015, : 31 - 32
  • [42] A Novel k-Hop Compound Metric Based Clustering Scheme for Ad Hoc Wireless Networks
    Leng, Supeng
    Zhang, Yan
    Chen, Hsiao-Hwa
    Zhang, Liren
    Liu, Ke
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (01) : 367 - 375
  • [43] Stable neighbor based adaptive replica allocation in mobile ad hoc networks
    Zheng, J
    Su, JS
    Yang, K
    Wang, YJ
    COMPUTATIONAL SCIENCE - ICCS 2004, PT 1, PROCEEDINGS, 2004, 3036 : 373 - 380
  • [44] A scalable neighbor-based routing protocol for mobile ad hoc networks
    Ejmaa, Ali Mohamed E.
    Subramaniam, Shamala
    Zukarnain, Zuriati Ahmad
    Hanapi, Zurina Mohd
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2016, 12 (09):
  • [45] Robust MPR-Based Flooding in Mobile Ad-hoc Networks
    Nilsson, Jan
    Sterner, Ulf
    2012 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2012), 2012,
  • [46] Selective Rebroadcast Suppression (SRS) scheme for Directional Border Flooding in Mobile Ad Hoc Networks
    Kim, Il-Whan
    Jeong, Min-seop
    Kang, Chung G.
    International Symposium on Wireless Pervasive Computing 2006, Conference Program, 2006, : 177 - 181
  • [47] A novel mechanism for flooding based route discovery in ad hoc networks
    Li, J
    Mohapatra, P
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 692 - 696
  • [48] A k-hop Scalable Management Scheme for Large Scale Mobile Ad Hoc Networks
    Abdelhak Bentaleb
    Saad Harous
    Abdelhak Boubetra
    Wireless Personal Communications, 2017, 96 : 6239 - 6271
  • [49] A k-hop Scalable Management Scheme for Large Scale Mobile Ad Hoc Networks
    Bentaleb, Abdelhak
    Harous, Saad
    Boubetra, Abdelhak
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 96 (04) : 6239 - 6271
  • [50] A neighbor detection algorithm based on multiple virtual mobile nodes for mobile ad hoc networks
    Bostanipour, Behnaz
    Garbinato, Benoit
    COMPUTER NETWORKS, 2017, 112 : 294 - 313