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 条
  • [41] Adaptive Broadcasting Method Using Neighbor Type Information in Wireless Sensor Networks
    Jeong, Hyocheol
    Kim, Jeonghyun
    Yoo, Younghwan
    SENSORS, 2011, 11 (06) : 5952 - 5967
  • [42] Analysis on controlling complex networks based on dominating sets
    Nacher, Jose C.
    Akutsu, Tatsuya
    IC-MSQUARE 2012: INTERNATIONAL CONFERENCE ON MATHEMATICAL MODELLING IN PHYSICAL SCIENCES, 2013, 410
  • [43] Randomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks
    Dhawan, Akshaye
    Tanco, Michelle
    Yeiser, Aaron
    2015 INTERNATIONAL CONFERENCE ON COMPUTING AND NETWORK COMMUNICATIONS (COCONET), 2015, : 589 - 596
  • [44] Neighbor Discovery Algorithms in Wireless Networks Using Directional Antennas
    Cai, Hao
    Liu, Bo
    Gui, Lin
    Wu, Min-You
    2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,
  • [45] Efficient Approximation Algorithms to Determine Minimum Partial Dominating Sets in Social Networks
    Campan, Alina
    Truta, Traian Marius
    Beckerich, Matthew
    PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIG DATA, 2015, : 2390 - 2397
  • [46] A Data Gathering Algorithm Based on Energy-Balanced Connected Dominating Sets in Wireless Sensor Networks
    Kui, Xiaoyan
    Wang, Jianxin
    Zhang, Shigeng
    2013 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2013, : 1139 - 1144
  • [47] Quorum and connected dominating sets based location service in wireless ad hoc, sensor and actuator networks
    Liu, Dandan
    Jia, Xiaohua
    Stojmenovic, Ivan
    COMPUTER COMMUNICATIONS, 2007, 30 (18) : 3627 - 3643
  • [48] Constructing distributed connected dominating sets in wireless Ad Hoc and sensor networks
    Zheng C.
    Sun S.-X.
    Huang T.-Y.
    Ruan Jian Xue Bao/Journal of Software, 2011, 22 (05): : 1053 - 1066
  • [49] A local algorithm to compute multiple connected dominating sets in wireless sensor networks
    Islam, Kamrul
    Akl, Selim G.
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2011, 26 (05) : 369 - 380
  • [50] Connected D-Hop dominating sets in wireless ad hoc networks
    Vuong, THP
    Huynh, DT
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IV, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS I, 2002, : 54 - 58