A heuristic algorithm for minimum connected dominating set with maximal weight in ad hoc networks

被引：0
|
作者：
Yan, XF [1 ]
Sun, YG
Wang, YL
机构：
[1] Tianjin Univ, Sch Elect Engn & Automat, Tianjin 300072, Peoples R China
[2] Zhengzhou Univ, Coll Informat Engn, Zhengzhou 450052, Peoples R China
来源：
GRID AND COOPERATIVE COMPUTING, PT 2 | 2004年 / 3033卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Routing based on a minimum connected dominating set (MCDS) is a promising approach in mobile ad hoc networks, where the search space for a route is reduced to nodes in the set (also called gateway nodes). This paper introduces MWMCDS, a simple and efficient heuristic algorithm for calculating MCDS with maximal weight. The choiceness based on maximal weight of gateway nodes guarantees that the most suitable nodes have been chosen for the role of gateway nodes so that they can properly coordinate all the other nodes. As a result, the method can keep stability of the MCDS and provide a high effective communication base for broadcast and routing operation in the whole network.
引用
收藏
页码：719 / 722
页数：4
相关论文
共 50 条
  • [1] A Better Heuristic for the Minimum Connected Dominating Set in Ad Hoc Networks
    Ugurlu, Onur
    Tanir, Deniz
    Nuri, Elnur
    2016 IEEE 10TH INTERNATIONAL CONFERENCE ON APPLICATION OF INFORMATION AND COMMUNICATION TECHNOLOGIES (AICT), 2016, : 497 - 500
  • [2] A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks
    Butenko, S
    Cheng, XZ
    Oliveira, CA
    Pardalos, PM
    RECENT DEVELOPMENTS IN COOPERATIVE CONTROL AND OPTIMIZATION, 2004, 3 : 61 - 73
  • [3] On calculating minimum connected dominating set for wireless ad hoc networks using a new distributed heuristic algorithm
    Gao, B
    Yang, YH
    Ma, HY
    ICWN'04 & PCC'04, VOLS, 1 AND 2, PROCEEDINGS, 2004, : 946 - 951
  • [4] Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks
    Misra, Rajiv
    Mandal, Chittaranjan
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2010, 21 (03) : 292 - 302
  • [5] Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
    Sun, Xuemei
    Yang, Yongxin
    Ma, Maode
    SENSORS, 2019, 19 (08)
  • [6] Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks
    Balaji, S.
    Kannan, K.
    Venkatakrishnan, Y.B.
    WSEAS Transactions on Mathematics, 2013, 12 (12) : 1164 - 1172
  • [7] A randomized connected dominating set algorithm in wireless ad hoc networks
    Cao, GT
    ICWN'04 & PCC'04, VOLS, 1 AND 2, PROCEEDINGS, 2004, : 16 - 21
  • [8] An efficient algorithm for constructing connected dominating set in Ad Hoc networks
    Yin, Bolian
    Shi, Hongchi
    Shang, Yi
    2007 4TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, 2007, : 244 - 248
  • [9] An effective distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Yang, YH
    Ma, HY
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 658 - 663
  • [10] A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Yang, YH
    Ma, HY
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2005, 18 (08) : 743 - 762
12345