research-article

An algorithm on constructing routing-based multiple CDSs to prolong lifetime of WSN

Authors:

Seong Tae JhangAuthors Info & Claims

RACS '15: Proceedings of the 2015 Conference on research in adaptive and convergent systems

Pages 251 - 255

https://doi.org/10.1145/2811411.2811487

Published: 09 October 2015 Publication History

Abstract

Connected dominating set (CDS) is a representative technique to construct virtual backbones in wireless networks. Most of existing works on CDS aim to construct the minimum CDS (MCDS). However, MCDS may be useless for prolonging the lifetime of the network since the energy of some nodes in MCDS may be consumed much faster. To solve the problem, we present an novel algorithm to construct a family of non-trivial CDSs (S₁, S₂, . . ., S_m) to distribute the energy consumption. The algorithm tries to construct small CDSs as many as possible while minimizing the frequencies of each node as a member in the generated CDSs. The simulation results show that the CDSs generated by the proposed algorithm can prolong the life time of the network significantly.

References

[1]

J. Yu, N. wang, G. Wang and D. Yu, Connected dominating sets in wireless ad hoc and sensor networks -- A comprehensive survey,Computer Communication 36(2013) 121--134

Digital Library

[2]

S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 374--387

Digital Library

[3]

P. Wan, K. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless networks, in: Proceedings of IEEE Conference on,Computer Communications (INFOCOM), April 2002, pp. 141--149

[4]

Y. Li, M. T. Thai, F. Wang, C. W. Yi, P. J. Wan, D. Z. Du, On greedy construction of connected dominating sets in wireless networks, Wireless Communications and Mobile Computing 5 (8) (2005) 927--932.

Digital Library

[5]

K. Alzoubi, P. Wan, and O. Frieder,New distributed algorithm for connected dominating set inwireless ad hoc networks, in Proceedings of the IEEE HICSS35, 2002.

Digital Library

[6]

S. Funke, A. Kesselman, U. Meyer, and M. Segal,A simple improved distributed algorithm for minimum connected dominating set in unit disk graphs, ACM Trans. Sensor Netw. 2(3) (2006), pp. 444--453.

Digital Library

[7]

X. Li, P. Wan, and O. Frieder, Coverage in wireless ad-hoc sensor networks,IEEE Trans. Comput. 52(6) (2003), pp. 753--763

Digital Library

[8]

M. Marathe, H. Breu, H. Hunt, S. Ravi, and D. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995), pp. 59--68

[9]

T. Moscibroda and R. Wattenhofer,Maximizing the lifetime of dominating sets, in Proceedings of the WMASN, 2005

Digital Library

[10]

S. Pemmaraju and I. Pirwani, Energy conservation in wireless sensor networks via domatic partitions, in Proceedings of the MobiHoc, 2006.

Digital Library

[11]

S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks, in Proceedings of the ICC, 2001.

[12]

X. Zhao, J. Wu, F. Li and L. Lu, On maximizing the lifetime of wireless sensor networks using virtual backbone scheduling. Transaction on parallel and distributed processing, 2012(23) pp.1528--1535

Digital Library

[13]

T. Moscibroda and R. Wattenhofer,Maximizing the lifetime of dominating sets, in Proceedings of the WMASN, 2005

Digital Library

[14]

Wu,J., Dai,F., Gao, M.,& Stojmenovic,I. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. IEEE/KICS Journal of Communication and Networks, 4, 59-70.

[15]

Hedetniemi S,Liestman A(1988) A survey of gossiping and broadcasting in communication networks. Networks 18(4):319--349

[16]

Revathi s, Rangaswamy T R. Efficient Flooding and Local Route Repair using Stable Connected Dominating Set for Mobile Ad Hoc Networks{J}. Asian Journey of Scientific Research, 2014, 7(1)

Cited By

Larbi-Mezeghrane WBouallouche-Medjkoune LLarbi A(2017)Minimum Perimeter Coverage Set Based on Points of Tangency and Strong Barrier for an Extended WSN LifetimeWireless Personal Communications: An International Journal10.1007/s11277-017-4611-797:2(2339-2358)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s11277-017-4611-7

Index Terms

An algorithm on constructing routing-based multiple CDSs to prolong lifetime of WSN
1. Networks
  1. Network algorithms
    1. Control path algorithms
      1. Network control algorithms

Recommendations

Backbone-based location-aided routing algorithm to reduce control packets of AODV protocol
Mobility '06: Proceedings of the 3rd international conference on Mobile technology, applications & systems

A mobile Ad hoc network (MANETs) consists of wireless hosts that may move often. Movements of hosts result in changes in routes, requiring some mechanisms for determining new routes. The well-known Ad hoc On-demand Distance Vector (AODV) protocol ...
Infrastructure-based routing in wireless mobile ad hoc networks

In this paper, we propose a new protocol for wireless mobile ad hoc communications, which establishes a dynamic wireless mobile infrastructure to mimic and maintain the operation of the fixed infrastructure in cellular networks, namely, the Virtual Base ...
Sensor-aided routing for mobile ad hoc networks
IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly

The widespread of mobile devices, such as Wi-Fi enabled laptops, PDAs and smart phones, makes mobile ad hoc networks (MANET) an attractive and low-cost alternative to create extended network service areas for users on the move. Unfortunately, the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

RACS '15: Proceedings of the 2015 Conference on research in adaptive and convergent systems

October 2015

540 pages

ISBN:9781450337380

DOI:10.1145/2811411

Conference Chairs:
Esmaeil S. Nadimi
University of Southern Denmark, Denmark
,
Tomas Cerny
Czech Technical University, Czech Republic
,
Program Chairs:
Sung-Ryul Kim
Konkuk University, Korea
,
Wei Wang
San Diego State University

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing
ACCT: Association of Convergent Computing Technology

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 October 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

RACS '15

Sponsor:

SIGAPP
ACCT

RACS '15: International Conference on Research in Adaptive and Convergent Systems

October 9 - 12, 2015

Prague, Czech Republic

Acceptance Rates

RACS '15 Paper Acceptance Rate 75 of 309 submissions, 24%;

Overall Acceptance Rate 393 of 1,581 submissions, 25%

Upcoming Conference

RACS '24

Sponsor:
sigapp

International Conference on Research in Adaptive and Convergent Systems

November 5 - 8, 2024

Pompei , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
44
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Larbi-Mezeghrane WBouallouche-Medjkoune LLarbi A(2017)Minimum Perimeter Coverage Set Based on Points of Tangency and Strong Barrier for an Extended WSN LifetimeWireless Personal Communications: An International Journal10.1007/s11277-017-4611-797:2(2339-2358)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s11277-017-4611-7

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents