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 条
  • [1] Comments and corrections to "Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks"
    Stojmenovic, I
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2004, 15 (11) : 1054 - 1055
  • [2] The impact of delay in dominating set and neighbor elimination based broadcasting in ad hoc networks
    Garcia-Nocetti, Fabian
    Ovalle-Martinez, Francisco Javier
    Solano-Gonzalez, Julio
    Stojmenovic, Ivan
    AD-HOC, MOBILE, AND WIRELESS NETWORKS, PROCEEDINGS, 2007, 4686 : 115 - +
  • [3] Application of dominating sets in wireless sensor networks
    Karbasi, A.H. (amirhassanikarbasi@gmail.com), 1600, Science and Engineering Research Support Society, 20 Virginia Court, Sandy Bay, Tasmania, Australia (07):
  • [4] Connected Dominating sets in Wireless Sensor networks
    Zhang, Lili
    Li, Chengming
    Mao, Yingchi
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 3441 - 3444
  • [5] Application of Dominating Sets in Wireless Sensor Networks
    Karbasi, Amir Hassani
    Atani, Reza Ebrahimi
    INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS, 2013, 7 (04): : 185 - 202
  • [6] Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks
    Yu, Jiguo
    Wang, Nannan
    Wang, Guanghui
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, 2010, 6221 : 11 - +
  • [7] Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms
    Mahjoub, Dhia
    Matula, David W.
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, 2009, 5682 : 32 - 42
  • [8] Construction Algorithms for k-Connected m-Dominating Sets in Wireless Sensor Networks
    Wu, Yiwei
    Li, Yingshu
    MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2008, : 83 - 90
  • [9] Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets
    Wu, H
    Wu, B
    Stojmenovic, I
    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON WIRELESS AND OPTICAL COMMUNICATIONS, 2002, : 668 - 673
  • [10] Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets
    Wu, J
    Wu, B
    Stojmenovic, I
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2003, 3 (04): : 425 - 438