Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets

Carle, Jean; Gallais, Antoine; Simplot‐Ryl, David

doi:10.1109/iscc.2005.126

Cited by 41 publications

(26 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Literatures [11][12][13][14][15] have considered coverage property for the CDS. A surface coverage dominating set construction is proposed by Carle et al [11].…”

Section: Cds For 1-coverage and Connectivitymentioning

confidence: 99%

See 1 more Smart Citation

Connected k-Coverage Topology Control for Area Monitoring in Wireless Sensor Networks

Ramalakshmi

Shanmugasundaram

2015

Wireless Pers Commun

View full text Add to dashboard Cite

One of the design challenges in Wireless sensor network (WSN) is to save limited energy resource to prolong the lifetime of the network without affecting their communication connectivity or sensing coverage. In dense WSN, the sensing areas of sensor node may overlap with each other. In general, the larger the overlap of the sensing range, the more redundant data will be generated with more energy consumption. In WSN, connected dominating set (CDS) has been used for energy efficient topology control, where a virtual backbone is formed, which allows communication between any arbitrary pair of nodes in the network. Nodes which are not in CDS can go to sleep state for energy conservation. Applications related to security and reliability require a certain amount of active nodes to ensure desired level of coverage at all time. These active nodes should be connected to reduce the delay during the communication. Therefore, it is necessary to construct a fault-tolerant CDS that continues to function during node or link failure, for both coverage and connectivity requirements of WSN. In this paper, we propose k-coverage connected dominating set (k-CCDS) for connected area coverage. We also propose a weight metric named weighted coverage cost (WCC), which consists of energy of sensing neighbors. The proposed protocol selects a CDS based on WCC to ensure that every nondominating node is connected with the CDS even if k À 1 dominating nodes are dead. This CDS is named k-CCDS, in which every non-dominating node is covered by atleast k dominating nodes. Simulation results show that it performs better when comparing with A3Cov in terms of CDS size, coverage, energy consumption and lifetime of the network.

show abstract

“…Literatures [11][12][13][14][15] have considered coverage property for the CDS. A surface coverage dominating set construction is proposed by Carle et al [11].…”

Section: Cds For 1-coverage and Connectivitymentioning

confidence: 99%

“…A surface coverage dominating set construction is proposed by Carle et al [11]. Zeng et al [12] have proposed an energy efficient mechanism for connectivity and coverage maintenance in WSN.…”

Section: Cds For 1-coverage and Connectivitymentioning

confidence: 99%

Connected k-Coverage Topology Control for Area Monitoring in Wireless Sensor Networks

Ramalakshmi

Shanmugasundaram

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…2 Several algorithms have been proposed for exploiting the area coverage problem in sensor networks [7,8,9]. Contrary to SAND, all these solutions assume that the sensors are aware of their own positions.…”

Section: Related Workmentioning

confidence: 99%

“…Authors in [8] do not address the connectivity problem and require every sensor to know all their neighbors positions before making its monitoring decisions [8]. The proposal presented by Carle and Simplot-Ryl [7] specifies that each sensor needs to construct its subset of relays and broadcast it to its neighbors, which generates higher communication overhead than SAND. The solution proposed by A. Gallais et al [9] relies on low communication overhead and does not need any neighborhood discovery.…”

Section: Related Workmentioning

confidence: 99%

Energy aware self-organizing density management in wireless sensor networks

Merrer

Gramoli

Kermarrec

et al. 2006

Proceedings of the 1st International Workshop on Decentralized Resource Sharing in Mobile Computing and Networking

View full text Add to dashboard Cite

Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy consumption of a single sensor node but also the extension of the entire network lifetime. We propose a simple and adaptive energy-conserving topology management scheme, called SAND (Self-Organizing Active Node Density). SAND is fully decentralized and relies on a distributed probing approach and on the redundancy resolution of sensors for energy optimizations, while preserving the data forwarding and sensing capabilities of the network. We present the SAND's algorithm, its analysis of convergence, and simulation results. Simulation results show that, though slightly increasing path lengths from sensor to sink nodes, the proposed scheme improves significantly the network lifetime for different neighborhood densities degrees, while preserving both sensing and routing fidelity.

show abstract

“…The algorithms proposed by Carbunar et al (2004), Carle et al (2005), Zhang and Hou (2005), and Bai et al (2005) also use the working-in-round scheme as in Tian and Georganas (2002). But they adopt different off duty eligibility rules.…”

mentioning

confidence: 99%

A Location-free Algorithm of Energy-Efficient Connected Coverage for High Density Wireless Sensor Networks

Bai

Chen

et al. 2007

Discrete Event Dyn Syst

View full text Add to dashboard Cite

One of the most serious concerns for wireless sensor networks (WSN) is energy. To obtain long lifetime, one potential method is deploying redundant sensors in the WSN and let each sensor switch its state between ACTIVE and OFF. At the same time, the WSN should meet various requirements of quality of service (QoS). This paper focuses on two important measurements of OoS: sensing coverage and network connectivity. Existing researches have provided many algorithms to schedule the nodes' states for coverage preserving, including location-free ones. Our work differs from existing location-free algorithms in several key ways: (1). We propose a novel principle on coverage preserving that is suitable for location-free schemes; (2). Following the principle, a distributed, localized and location-free node scheduling algorithm, Stand Guard Algorithm (StanGA), is proposed for treating coverage and connectivity in a unified scheme. Under certain conditions, StanGA can guarantee network connectivity and any degree of sensing coverage. Simulation results show that StanGA is scalable and robust, and also show that StanGA outperforms existing location-free algorithms even when only coverage issue is considered.

show abstract

Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets

Cited by 41 publications

References 10 publications

Connected k-Coverage Topology Control for Area Monitoring in Wireless Sensor Networks

Connected k-Coverage Topology Control for Area Monitoring in Wireless Sensor Networks

Energy aware self-organizing density management in wireless sensor networks

A Location-free Algorithm of Energy-Efficient Connected Coverage for High Density Wireless Sensor Networks

Contact Info

Product

Resources

About