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 条
  • [11] A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Ma, HY
    Yang, YH
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 352 - 356
  • [12] Minimum Connected Dominating Set Algorithm with Weight in Wireless Sensor Networks
    Zhang Jing
    Jia Chun-fu
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 3973 - 3976
  • [13] An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
    Yin, Bolian
    Shi, Hongchi
    Shang, Yi
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (01) : 27 - 39
  • [14] An efficient approximation scheme for minimum connected dominating set in wireless ad hoc networks
    Gao, B
    Yang, YH
    Ma, HY
    VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7: WIRELESS TECHNOLOGIES FOR GLOBAL SECURITY, 2004, : 2744 - 2748
  • [15] Connected dominating set for wireless ad hoc networks: a survey
    Yadav, Anil Kumar
    Yadav, Rama Shankar
    Singh, Raghuraj
    Singh, Ashutosh Kumar
    INTERNATIONAL JOURNAL OF ENGINEERING SYSTEMS MODELLING AND SIMULATION, 2015, 7 (01) : 22 - 34
  • [16] Connected Dominating Set Based Hybrid Routing Algorithm in Ad Hoc Networks with Obstacles
    Di, Wu
    Yan, Qu
    Ning, Tong
    2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 4008 - 4013
  • [17] An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
    Dai, F
    Wu, J
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2004, 15 (10) : 908 - 920
  • [18] A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad hoc Networks
    Cokuslu, Deniz
    Erciyes, Kayhan
    PROCEEDINGS OF MASCOTS '07: 15TH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, 2007, : 60 - +
  • [19] Distributed algorithm for power aware minimum connected dominating set for routing in wireless ad hoc network
    Acharya, T
    Roy, R
    2005 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2005, : 387 - 394
  • [20] Distributed construction of connected dominating set in wireless ad hoc networks
    Wan, PJ
    Alzoubi, KM
    Frieder, O
    IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 1597 - 1604
12345