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 条
  • [31] Incremental construction of k-dominating sets in wireless sensor networks
    Couture, Mathieu
    Barbeau, Michel
    Bose, Prosenjit
    Kranakis, Evangelos
    PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2006, 4305 : 202 - 214
  • [32] A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets
    Balbal, Samir
    Bouamama, Salim
    Blum, Christian
    ALGORITHMS, 2021, 14 (06)
  • [33] Strongly connected dominating sets in wireless sensor networks with unidirectional links
    Du, DZ
    Thai, MT
    Li, YS
    Liu, D
    Zhu, SW
    FRONTIERS OF WWW RESEARCH AND DEVELOPMENT - APWEB 2006, PROCEEDINGS, 2006, 3841 : 13 - 24
  • [34] Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
    Islam, Kamrul
    Akl, Selim G.
    Meijer, Henk
    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, PROCEEDINGS, 2009, 5516 : 343 - 355
  • [35] A survey on routing algorithms based on Connected Dominating Sets in MANETS
    Prasanna, D. S. John Deva
    Aravindhar, D. John
    Amalanathan, A. George
    2017 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2017, : 1206 - 1209
  • [36] Algorithms for Efficient Broadcasting in Wireless Multi-hop Networks
    Liu, Yaoda
    Schwefel, Hans-Peter
    GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
  • [37] Energy-optimal online algorithms for broadcasting in wireless networks
    Kutten, S
    Ono, H
    Peleg, D
    Sadakane, K
    Yamashita, M
    SECOND ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES, PROCEEDINGS, 2005, : 125 - 130
  • [38] Approximation algorithms for broadcasting in duty cycled wireless sensor networks
    Zhao, Dianbo
    Chin, Kwan-Wu
    Raad, Raad
    WIRELESS NETWORKS, 2014, 20 (08) : 2219 - 2236
  • [39] Approximation algorithms for broadcasting in duty cycled wireless sensor networks
    Dianbo Zhao
    Kwan-Wu Chin
    Raad Raad
    Wireless Networks, 2014, 20 : 2219 - 2236
  • [40] Low-overhead dominating set based algorithms for maximizing lifetime in wireless sensor networks
    Ma, Jian
    Ni, Lionel M.
    2007 IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS, VOLS 1-3, 2007, : 102 - 110