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 条
  • [21] Two Connected Dominating Set Algorithms for Wireless Sensor Networks
    Al-Nabhan, Najla
    Zhang, Bowu
    Al-Rodhaan, Mznah
    Al-Dhelaan, Abdullah
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2012, 2012, 7405 : 705 - 713
  • [22] Minimum dominating sets for solving the coverage problem in wireless sensor networks
    Pazand, Babak
    Datta, Amitava
    UBIQUITOUS COMPUTING SYSTEMS, PROCEEDINGS, 2006, 4239 : 454 - 466
  • [23] An Improved Greedy Construction of Minimum Connected Dominating Sets in Wireless Networks
    Das, Ariyam
    Mandal, Chittaranjan
    Reade, Chris
    Aasawat, Manish
    2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2011, : 790 - 795
  • [24] Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
    Kim, Donghyun
    Wu, Yiwei
    Li, Yingshu
    Zou, Feng
    Du, Ding-Zhu
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (02) : 147 - 157
  • [25] Construction of strongly connected dominating sets in asymmetric multihop wireless networks
    Li, Deying
    Du, Hongwei
    Wan, Peng-Jun
    Gao, Xiaofeng
    Zhang, Zhao
    Wu, Weili
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 661 - 669
  • [26] Sizes of Minimum Connected Dominating Sets of a class of wireless sensor networks
    Li, Ji
    Foh, Chuan Heng
    Andrew, Lachlan L. H.
    Zukerman, Moshe
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 332 - 336
  • [27] Building Dominating Sets to Minimize Energy Wastage in Wireless Sensor Networks
    Chauhan, Nilanshi
    Chauhan, Siddhartha
    INFORMATION, COMMUNICATION AND COMPUTING TECHNOLOGY (ICICCT 2019), 2019, 1025 : 3 - 11
  • [28] A distributed algorithm for connecting dominating sets in wireless ad hoc networks
    Cao Yongtao
    He Chen
    Wang Jun
    Zheng Chunlei
    2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 1472 - +
  • [29] Distributed heuristics for connected dominating sets in wireless ad hoc networks
    Alzoubi, KM
    Wan, PJ
    Frieder, O
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2002, 4 (01) : 22 - 29
  • [30] Incremental Construction of k-Dominating Sets in Wireless Sensor Networks
    Couture, Mathieu
    Barbeau, Michel
    Bose, Prosenjit
    Kranakis, Evangelos
    AD HOC & SENSOR WIRELESS NETWORKS, 2008, 5 (1-2) : 47 - 67