A Distributed Prime Node-ID Connected Dominating Set for Target Coverage Using Adjustable Sensing Range

Anita Chandra

doi:10.1007/978-81-322-2009-1_12

A Distributed Prime Node-ID Connected Dominating Set for Target Coverage Using Adjustable Sensing Range

2014-08-29

0

PRE

AI

DOI：10.1007/978-81-322-2009-1_12

原文链接

原文求助

摘要

En 中文

The wireless sensor network (WSN) consisting of a large number of autonomous sensors with limited battery. It is a challenging aim to design an energy efficient routing protocol along with original coverage which can save the energy and thereby extend the lifetime of the network. However, in the context of WSN, connected dominating set (CDS) principle has emerged as the most popular approach for energy efficient routing mechanism in WSNs. In this paper, the target coverage is achieved with adjustable sensing range to the proposed distributed CDS based on prime node-ID (P-CDS) modeled in unit disk graph (UDG) (Wan et al. in Distributed construction of CDS in wireless ad hoc networks, 2002) [1]. P-CDS has time complexity O(n) and message complexity of O(n). Theoretical analysis and simulation results are also presented to verify efficiency of our approach.

Keyword:

Connecting dominating set (CDS)

Maximal independent set (MIS)

Prime node ID

Target coverage

Adjustable sensing range

A Distributed Prime Node-ID Connected Dominating Set for Target Coverage Using Adjustable Sensing Range

摘要

期刊

机构

引用论文