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 条
  • [21] 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
  • [22] 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
  • [23] Navigation Route based Stable Connected Dominating Set for Vehicular Ad Hoc Networks
    Chen, Yishun
    Wu, Weigang
    Cao, Hui
    INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH, 2015, 12 (01) : 12 - 26
  • [24] 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
  • [25] A timer-based protocol for connected dominating set construction in IEEE 802.11 multihop mobile ad hoc networks
    Zhou, D
    Sun, MT
    Lai, TH
    2005 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS, 2005, : 2 - 8
  • [26] 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 - +
  • [27] A Dominating-Set-Based Broadcast Gossip Protocol in Mobile Ad Hoc Networks
    Meng, Chun
    Song, Meina
    Song, Junde
    Jia, Junmin
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 2487 - +
  • [28] A simple protocol for dominating set construction in mobile ad hoc networks
    Kim, D
    Kim, B
    Sun, MT
    2003 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2003, : 35 - 41
  • [29] 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
  • [30] Graph coloring based minimal connected dominating set algorithm in wireless ad hoc networks
    School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, China
    Tongxin Xuebao, 2007, 3 (108-114):