A Connected Dominating Set Based on Connectivity and Energy in Mobile Ad Hoc Networks

被引:0
|
作者
Kies, Ali [1 ]
Maaza, Zoulikha Mekkakia [1 ]
Belbachir, Redouane [1 ]
机构
[1] Univ Sci & Technol Oran, Dept Data Proc, Oran, Algeria
关键词
ad hoc; self-organization; CDS; energy; routing;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A connected dominating set (CDS) has been proposed as a virtual backbone for routing in wireless ad hoc networks. Ad hoc networks offer new routing paradigms. Therefore, the routing operation needs a broadcast algorithm. Broadcasting in an ad hoc network is still an open issue. The main focus here will be on optimizing the energy and the bandwidth utilization for packet diffusion. In this paper, we describe the Connected Dominating Set-Energy Protocol (CDSEP) for mobile ad hoc networks to optimize broadcast in the network The key concept used in this protocol is a new distributed algorithm which computes the connected dominating set (CDS) based on node energy and node connectivity. In the CDSEP protocol, the CDS nodes are selected to forward broadcast packets during the flooding process, and the information flooded in the network through these CDS is also about the CDS. Thus, a second optimization is achieved by minimizing the contents of the control packets flooded in the network Hence, only a small subset of links with the nodes is declared instead of all the links and the nodes. Our simulation experiment results demonstrate that the CDSEP responds well to scaling in terms of broadcast control packet and energy consumption.
引用
收藏
页码:139 / 154
页数:16
相关论文
共 50 条
  • [41] Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
    Xu, Zhenyu
    Wang, James
    Srimani, Pradip K.
    JOURNAL OF SUPERCOMPUTING, 2010, 53 (01): : 182 - 195
  • [42] 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
  • [43] 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
  • [44] A heuristic algorithm for minimum connected dominating set with maximal weight in ad hoc networks
    Yan, XF
    Sun, YG
    Wang, YL
    GRID AND COOPERATIVE COMPUTING, PT 2, 2004, 3033 : 719 - 722
  • [45] 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
  • [46] Reducing connected dominating set size with multipoint relays in ad hoc wireless networks
    Chen, X
    Shen, J
    I-SPAN 2004: 7TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2004, : 539 - 543
  • [47] Connected Dominating Set Construction Using an Efficient Pruning Method in Ad hoc Networks
    Ghasemi, Vahid
    Hashemi, Seyed Naser
    Mozaffari, Mojtaba
    2010 5TH ANNUAL ICST WIRELESS INTERNET CONFERENCE (WICON 2010), 2010,
  • [48] Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
    Vahdatpour, Alireza
    Dabiri, Foad
    Moazeni, Maryam
    Sarrafzadeh, Majid
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2008, 5218 : 481 - 495
  • [49] Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
    Zhenyu Xu
    James Wang
    Pradip K. Srimani
    The Journal of Supercomputing, 2010, 53 : 182 - 195
  • [50] Performance Comparison Study of Connected Dominating Set Algorithms for Mobile Ad hoc Networks under Different Mobility Models
    Meghanathan, Natarajan
    Dasari, Ilin
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2013, 4 (02): : 12 - 30