Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks

被引:426
|
作者
Stojmenovic, I
Seddigh, M
Zunic, J
机构
[1] Univ Nacl Autonoma Mexico, IIMAS, DISCA, Mexico City 04510, DF, Mexico
[2] Univ Ottawa, SITE, Ottawa, ON K1N 6N5, Canada
[3] Nortel Networks, Ottawa, ON, Canada
[4] Cardiff Univ, Dept Comp Sci, Cardiff CF24 3XF, S Glam, Wales
基金
加拿大自然科学与工程研究理事会;
关键词
broadcasting; wireless networks; distributed algorithms; dominating sets; clustering;
D O I
10.1109/71.980024
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In a multihop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. In this paper, we propose to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets. Their maintenance does not require any communication overhead in addition to maintaining positions of neighboring nodes. Retransmissions by only internal nodes in a dominating set is sufficient for reliable broadcasting. Existing dominating sets are improved by using node degrees instead of their ids as primary keys. We also propose to eliminate neighbors that already received the message and rebroadcast only if the list of neighbors that might need the message is nonempty. A retransmission after negative acknowledgements scheme is also described. The important features of proposed algorithms are their reliability (reaching all nodes in the absence of message collisions), significant rebroadcast savings, and their localized and parameterless behavior. The reduction in communication overhead for broadcasting task is measured experimentally, Dominating sets based broadcasting, enhanced by neighbor elimination scheme and highest degree key, provides reliable broadcast with less than or equal to 53 percent of node retransmissions (on random unit graphs with 100 nodes) for all average degrees d. Critical d is around less than or equal to 48, with 18 percent for less than or equal to 3, less than or equal to 40 percent for d greater than or equal to 10, and < 20 percent for d greater than or equal to 25. The proposed methods are better than existing ones in all considered aspects: reliability, rebroadcast savings, and maintenance communication overhead. In particular, the cluster structure is inefficient for broadcasting because of considerable communication overhead for maintaining the structure and is also inferior in terms of rebroadcast savings.
引用
收藏
页码:14 / 25
页数:12
相关论文
共 50 条
  • [11] Approximating minimum independent dominating sets in wireless networks
    Hurink, Johann L.
    Nieberg, Tim
    INFORMATION PROCESSING LETTERS, 2008, 109 (02) : 155 - 160
  • [12] On greedy construction of connected dominating sets in wireless networks
    Li, YS
    Thai, MT
    Wang, F
    Yi, CW
    Wan, PJ
    Du, DZ
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2005, 5 (08): : 927 - 932
  • [13] Efficient Algorithms for Neighbor Discovery in Wireless Networks
    Vasudevan, Sudarshan
    Adler, Micah
    Goeckel, Dennis
    Towsley, Don
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2013, 21 (01) : 69 - 83
  • [14] Dominating Set Algorithms for Wireless Sensor Networks Survivability
    Pino, Tayler
    Choudhury, Salimur
    Al-Turjman, Fadi
    IEEE ACCESS, 2018, 6 : 17527 - 17532
  • [15] Connected dominating set algorithms for wireless sensor networks
    Al-Nabhan, Najla
    Al-Rodhaan, Mznah
    Al-Dhelaan, Abdullah
    Cheng, Xiuzhen
    INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2013, 13 (02) : 121 - 134
  • [16] Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks
    Kassaei, Hossein
    Mehrandish, Mona
    Narayanan, Lata
    Opatrny, Jaroslav
    2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010), 2010,
  • [17] Connected dominating sets in wireless networks with different transmission ranges
    Thai, My T.
    Wang, Feng
    Liu, Dan
    Zhu, Shiwei
    Du, Ding-Zhu
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (07) : 721 - 730
  • [18] Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks
    Indukuri, R. Krishnam Raju
    Penumathsa, Suresh Varma
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2011, 2 (02) : 75 - 81
  • [19] A Performance Evaluation of Broadcasting Algorithms in Wireless Nanosensor Networks
    Oukhatar, Ayoub
    Bakhouya, Mohamed
    El Ouadghiri, Driss
    Zine-Dine, Khalid
    PROCEEDINGS OF 2016 5TH INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2016, : 616 - 620
  • [20] Three connected dominating set algorithms for wireless sensor networks
    Al-Nabhan, Najla
    Zhang, Bowu
    Cheng, Xiuzhen
    Al-Rodhaan, Mznah
    Al-Dhelaan, Abdullah
    INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2016, 21 (01) : 53 - 66