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 条
  • [31] Routing in ad-hoc networks using minimum connected dominating sets
    Das, B
    Bharghavan, V
    ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, 1997, : 376 - 380
  • [32] A Heuristic for Minimum Connected Dominating Set With Local Repair for Wireless Sensor Networks
    Rai, Mritunjay
    Verma, S.
    Tapaswi, S.
    2009 EIGHTH INTERNATIONAL CONFERENCE ON NETWORKS, 2009, : 106 - +
  • [33] A New Heuristic Approach for Minimum Connected Dominating Set In Adhoc Wireless Networks
    Rai, M.
    Garg, N.
    Verma, S.
    Tapaswi, S.
    2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3, 2009, : 284 - 289
  • [34] A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
    Cheng, XZ
    Huang, X
    Li, DY
    Wu, WL
    Du, DZ
    NETWORKS, 2003, 42 (04) : 202 - 208
  • [35] An efficient algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks
    Li, Yamin
    Peng, Shietung
    Chu, Wanming
    2006 IEEE INTERNATIONAL CONFERENCE ON MOBILE ADHOC AND SENSOR SYSTEMS, VOLS 1 AND 2, 2006, : 119 - +
  • [36] Distributed algorithm for power aware connected dominating set for efficient routing in mobile Ad hoc networks
    Bhattacharjee, Subhasis
    Tripathi, Joydeep
    Mistry, Oly
    Dattagupta, Jayasree
    2006 INTERNATIONAL SYMPOSIUM ON AD HOC AND UBIQUITOUS COMPUTING, 2007, : 66 - +
  • [37] Compromising Ad-hoc Networks by Attacking Weakly Connected Dominating Set
    Lin, Chi
    Wu, Guowei
    Yim, Kangbin
    Yao, Lin
    Hou, Gang
    2015 9TH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING IMIS 2015, 2015, : 213 - 220
  • [38] A Connected Dominating Set Based on Connectivity and Energy in Mobile Ad Hoc Networks
    Kies, Ali
    Maaza, Zoulikha Mekkakia
    Belbachir, Redouane
    ACTA POLYTECHNICA HUNGARICA, 2012, 9 (05) : 139 - 154
  • [39] A Dominating Set based Clustering algorithm for Mobile Ad hoc Networks
    Cokuslu, Deniz
    Erciyes, Kayhan
    Dagdeviren, Orhan
    COMPUTATIONAL SCIENCE - ICCS 2006, PT 1, PROCEEDINGS, 2006, 3991 : 571 - 578
  • [40] An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
    Liu, H
    Pan, Y
    Cao, JN
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 340 - 351
12345