Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

被引：5
|
作者：
Sinha, Koushik [1 ]
Ghose, Suranjan [2 ]
Srimani, Pradip K. [3 ]
机构：
[1] Honeywell Technol Solut, Bangalore 560226, Karnataka, India
[2] Jadavpur Univ, Dept Comp Sci & Engn, Kolkata 700032, W Bengal, India
[3] Clemson Univ, Dept Comp Sci, Clemson, SC 29634 USA
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2008年 / 68卷 / 07期
基金：
美国国家科学基金会;
关键词：
ad hoc networks; MANET; deterministic broadcast; breadth-first broadcast; gossiping; all-to-all broadcast;
D O I：
10.1016/j.jpdc.2008.01.008
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O (n log n) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O(Dn log n) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement. (c) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码：922 / 938
页数：17
相关论文
共 50 条
  • [1] Deterministic broadcast and gossiping algorithms for ad hoc networks
    Sinha, Koushik
    Srimani, Pradip K.
    [J]. JOURNAL OF SUPERCOMPUTING, 2006, 37 (02): : 115 - 144
  • [2] Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
    Koushik Sinha
    Pradip K. Srimani
    [J]. The Journal of Supercomputing, 2006, 37 : 115 - 144
  • [3] Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
    Sinha, K
    Srimani, PK
    [J]. DISTRIBUTED COMPUTING - IWDC 2004, PROCEEDINGS, 2004, 3326 : 459 - 470
  • [4] Survey on Broadcast Algorithms for Mobile Ad Hoc Networks
    Ruiz, Patricia
    Bouvry, Pascal
    [J]. ACM COMPUTING SURVEYS, 2015, 48 (01)
  • [5] On adaptive deterministic gossiping in ad hoc radio networks
    Gasieniec, L
    Lingas, A
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 689 - 690
  • [6] On adaptive deterministic gossiping in ad hoc radio networks
    Gasieniec, L
    Lingas, A
    [J]. INFORMATION PROCESSING LETTERS, 2002, 83 (02) : 89 - 93
  • [7] Faster deterministic gossiping in directed ad hoc radio networks
    Gasieniec, L
    Radzik, T
    Xin, Q
    [J]. ALGORITHM THEORY- SWAT 2004, 2004, 3111 : 397 - 407
  • [8] Algorithms for Mobile Ad hoc Networks
    Ghazani, Seyed Hossein Hosseini Nazhad
    [J]. 2013 7TH INTERNATIONAL CONFERENCE ON APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES (AICT), 2013, : 236 - 239
  • [9] Context delivery in ad hoc networks using enhanced gossiping algorithms
    Anawar, Syarulnaziah
    Coyle, Lorcan
    Dobson, Simon
    Nixon, Paddy
    [J]. SMART SENSING AND CONTEXT, PROCEEDINGS, 2006, 4272 : 218 - +
  • [10] Controlled Gossiping in Ad Hoc Networks
    Lysiuk, Ivan S.
    Haas, Zygmunt J.
    [J]. 2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010), 2010,
12345