ECCRA: An energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks

Jin, Yan; Jo, Ju-Yeon; Kim, Yoohwan; Yang, Xiaobo

doi:10.1016/j.comcom.2008.03.001

Cited by 31 publications

(24 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When there are several nodes that work together and all of the Euler distances between any two nodes are smaller than or equal to the perceived radius, there will be many redundant nodes; thus, only through the dispatching schema of a node are some redundant nodes closed; when they are awoken again, the coverage rate of the redundant nodes complete coverage of the target nodes only after specific conditions are met. 6,22,23 Thus, when redundant nodes are transformed to working nodes, if the coverage rate of the redundant node did not reach the minimal value, the redundant node will go to sleep. As for the target nodes in the monitoring area, the random movements of the target nodes will make a specific sensor node cover a specific target node several times, and the value of the expected coverage value of the target node depends on the proportional relationship of the coverage rate with the movement of the target.…”

Section: Redundancy Coveragementioning

confidence: 99%

Optimization coverage conserving protocol with authentication in wireless sensor networks

Sun

Long-xing

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In the k-coverage process of target nodes, substantial data redundancy occurs, which leads to the phenomenon of congestion, reducing the network communication capability and coverage as well as accelerating network energy consumption. Therefore, this article proposes an Optimization Coverage Conserving Protocol with Authentication. This protocol provides a solution to obtain the largest coverage probability for multi-nodes. In the optimization and authenticated calculation, the protocol provides the calculation method and verification process of the expected value of multinode coverage; when the moving target nodes are continuously covered, this protocol provides a process to solve for the focused target nodes; when there is redundancy coverage, this article provides a process to calculate the coverage probability when any sensor node is covered by a redundant node. Furthermore, through comparisons of the coverage quality and network lifetime with other algorithms, the performance indexes of this protocol have been substantially increased by the simulation experiment, which verified the effectiveness and viability of the protocol in this article.

show abstract

Section: Redundancy Coveragementioning

confidence: 99%

Optimization coverage conserving protocol with authentication in wireless sensor networks

Sun

Long-xing

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Associated property relationships of the working sensor nodes can be found in the sensor node set [22,23]. Number of the least covered nodes can be determined by the function relation between coverage fractions.…”

Section: Realization Of the Ecapm Algorithmmentioning

confidence: 99%

“…Reference [22] through artificial bee colony algorithm and particle swarm optimizes scheduling problems for the sensor nodes by heuristic configuring methods to identify the optimal deployment path, giving the position after the best deployment of sensor nodes and theoretical calculations calculation of the lifetime limit network. Reference [23] proposed an energy efficient routing algorithm maintaining connectivity coverage, an Energy-Efficient Coverage and Connectivity Preserving Routing Algorithm (ECCRA), the algorithm uses the network model to construct double coverage area, the expected value of the final upper limit is determined on completion of the monitoring area covered, and the effective coverage of at least knowledge of sensor nodes calculated probability covered by probability value and the number of coverage desired values. References [22,23], to some extent, have completed the monitoring area effective coverage and suppressed rapid energy consumption of sensor nodes, but the calculation of the two algorithms is large, owning a high complexity of the algorithm, and the nodes of the monitoring area covered a longer time to complete.…”

Section: Related Workmentioning

confidence: 99%

“…Reference [23] proposed an energy efficient routing algorithm maintaining connectivity coverage, an Energy-Efficient Coverage and Connectivity Preserving Routing Algorithm (ECCRA), the algorithm uses the network model to construct double coverage area, the expected value of the final upper limit is determined on completion of the monitoring area covered, and the effective coverage of at least knowledge of sensor nodes calculated probability covered by probability value and the number of coverage desired values. References [22,23], to some extent, have completed the monitoring area effective coverage and suppressed rapid energy consumption of sensor nodes, but the calculation of the two algorithms is large, owning a high complexity of the algorithm, and the nodes of the monitoring area covered a longer time to complete. Reference [24] proposed a self-organizing overlay control protocol (SOCCP: Self-Organized Coverage and Connectivity Protocol).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

ECAPM: An Enhanced Coverage Algorithm in Wireless Sensor Network Based on Probability Model

Sun

Wang

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

How to cover a monitored area with the minimum number of sensor nodes is a fundamental in wireless sensor network (WSN). To address this problem, this paper proposes ECAPM, that is, Enhanced Coverage Algorithm Based on Probability Model. Given an area to monitor, ECAPM can calculate the minimum number of sensor nodes to cover that area. Firstly, ECAPM introduces the method to compute the expectation of probability that a sensor node is covered. Then ECAPM presents the procedure of expected value calculation when target node is covered by one sensor node and N sensor nodes. Finally ECAPM verifies the relation of proportional function when random variables are not independent. The simulation results show that ECAPM can cover the monitored area effectively with less sensor nodes and improve the quality of coverage.

show abstract

“…Nodes in dense areas are turned off in this method as a reason coverage degree cannot be saved and like previous methods detected event's pattern has not been considered. In [24], the authors proposed the notion of connection and cover of a routing protocol. Authors first derive the network coverage provided by n sensor nodes by the mathematical formula.…”

Section: Coverage Preserving Routingmentioning

confidence: 99%

K-Coverage Persevering Routing Technique Based on Event Occurrence Patterns for Wireless Sensor Networks

Rafigh

Abbaspour

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) comprising of tiny, power-constrained nodes are gaining popularity due to their potential use in a wide range of applications, including monitoring of environmental attributes, intrusion detection, and various military and civilian environments. While the sensing objectives of these environments are unique and application dependent, a common performance criteria for wireless sensor networks is prolonging network lifetime while satisfying coverage and connectivity in the deployment region. In many real-world scenarios, reoccurring spatial patterns of occurrence could be identified in the sensed event information. This paper proposes a new routing algorithm schema based on event occurrence history to secure K-Coverage of event paths and maintain the maximum degree of coverage. In the proposed method the nodes located around event path try to save their battery power by not participating in data packet forwarding to neighbor nodes. The simulation results show that the proposed method improves network lifetime by shifting the routing responsibility from sensing nodes to communication nodes, while maximizing the degree of coverage in the main path of event occurrence. As a consequence, the lifetime of main path coverage is increased dramatically as compared to previous methods.

show abstract

ECCRA: An energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks

Cited by 31 publications

References 14 publications

Optimization coverage conserving protocol with authentication in wireless sensor networks

Optimization coverage conserving protocol with authentication in wireless sensor networks

ECAPM: An Enhanced Coverage Algorithm in Wireless Sensor Network Based on Probability Model

K-Coverage Persevering Routing Technique Based on Event Occurrence Patterns for Wireless Sensor Networks

Contact Info

Product

Resources

About