z-logo
open-access-imgOpen Access
On the construction of load-balanced (k, r-hop)-connected dominating set for WSNs
Author(s) -
Tarek Moulahi,
Hervé Guyennet,
Salem Nasri,
Rjab Hajlaoui
Publication year - 2012
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
ISSN - 2153-1676
ISBN - 978-1-4673-5130-0
DOI - 10.1109/ants.2012.6524232
Subject(s) - connected dominating set , computer science , construct (python library) , wireless sensor network , load balancing (electrical power) , reuse , distributed computing , fault tolerance , computer network , set (abstract data type) , mathematics , theoretical computer science , engineering , graph , geometry , programming language , grid , waste management
Connected Dominating Sets (CDS) are selected to construct a virtual backbone in Wireless Sensor Networks (WSNs). Indeed, CDS are used for fault tolerant broadcasting, routing and even efficient gathering of data. On the other hand, r-hop connected k-dominating sets ((k, r)-CDS) are introduced to reduce the size of CDS and the total amount of information to be transmitted. Unfortunately, no work considers the load-balance factor of (k, r)-CDS. Recently, there is a proposition of constructing load-balanced CDS for WSNs. In this paper we reuse the same concept of selecting load-balanced CDS to construct a Load-Balanced (k, r)-CDS (LB(k, r)-CDS). Then, the allocation of dominatees to the appropriate dominators is done. Through simulations, the proposed method of constructing LB(k, r)-CDS extends network lifetime by an important rate compared with the most recent (k, r)-CDS construction method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom