SOCCP: Self Organize Coverage and Connectivity Protocol

Khosravi, Hamid; Aslanyan, Levon

doi:10.1109/cimsim.2011.64

Cited by 5 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Power scheduling is a technique to switch some sensors off to save power while keeping the network connectivity to satisfy a given coverage preservation requirement [10,[18][19][20][21]. An approach called SPAN [19] was proposed to save power consumption by putting some nodes into sleep mode for ad hoc wireless networks.…”

Section: Related Workmentioning

confidence: 99%

“…Most previous clustering approaches [4][5][6][7] mainly focus on the head selection and the cluster construction, rather than the coverage preservation and the data routing after the cluster formation. Sensor scheduling is a technique used in [18][19][20][21] to put some sensors into the sleep mode whose sensing areas are totally covered by other sensors. This technique can be combined into the clustering process, and it usually faces the challenges of network connectivity and coverage preservation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Flow-balanced routing for multi-hop clustered wireless sensor networks

Tao

Zhang

2013

Ad Hoc Networks

View full text Add to dashboard Cite

Power efficiency and coverage preservation are two important performance metrics for a wireless sensor network. However, there is scarcely any protocol to consider them at the same time. In this paper, we propose a flow-balanced routing (FBR) protocol for multi-hop clustered wireless sensor networks that attempts to achieve both power efficiency and coverage preservation. The proposed protocol consists of four algorithms, one each for network clustering, multi-hop backbone construction, flow-balanced transmission, and rerouting. The proposed clustering algorithm groups several sensors into one cluster on the basis of overlapping degrees of sensors. The backbone construction algorithm constructs a novel multi-level backbone, which is not necessarily a tree, using the cluster heads and the sink. Furthermore, the flow-balanced routing algorithm assigns the transferred data over multiple paths from the sensors to the sink in order to equalize the power consumption of sensors. Lastly, the rerouting algorithm reconstructs the network topology only in a place where a head drops out from the backbone due to the head running out of its energy. Two metrics called the network lifetime and the coverage lifetime are used to evaluate the performance of FBR protocol in comparison with previous ones. The simulation results show that FBR yields both much longer lifetime and better coverage preservation than previous protocols. For example, FBR yields more than twice network lifetime and better coverage preservation than a previous efficient protocol, called the coverage-preserving clustering protocol (CPCP) [18], when the first sensor dies and the network coverage is kept at 100%, respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Flow-balanced routing for multi-hop clustered wireless sensor networks

Tao

Zhang

2013

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…In this section we will introduce a modified version of our previous method which we have used to check the coverage of the sensor network [14]. This method can guarantee One-Cover of the network with desired percentage of coverage.…”

Section: Coverage Constraintmentioning

confidence: 99%

Optimal Node Scheduling for Desired Percentage of Coverage in Wireless Sensor Networks

Khosravi¹

2012

WSN

Self Cite

View full text Add to dashboard Cite

Recent developments in wireless communication and embedded computing technologies have led to the advent of wireless sensor network technology. Hundreds of thousands of these micro sensors can be deployed in many areas including health, environment and battlefield in order to monitor the domain with desired level of accuracy. When wireless sensors are deployed in an area, the lifetime of the network should last as long as possible according to the original amount of energy. Therefore, reducing energy consumption in WSNs is of primary concern. We have proposed a node scheduling solution that solves the coverage and connectivity problem in sensor networks in an integrated manner. In this way we will divide network life time to finite number of rounds and in each round we will generate a coverage bitmap of sensors of the domain and based on this bitmap it will decided which sensors remain active or go to sleep. We will check the connection of the sensor network by using Laplacian of adjancy graph of active nodes in each round. Also the network will be capable of producing desired percentage of coverage by using coverage bitmap. We will define the connected coverage problem as an optimization problem and we will seek a solution for the problem by using Genetic Algorithm optimization method

show abstract

“…To verify the validity of ECAPM algorithm in the paper future, we choose Self-Organized Coverage and Connectivity Protocol (SOCCP) [24] and Square Region Based Coverage and Connectivity Probability (SCCP) model [25] to be the contrast experiments. The algorithm in the paper adopts = 3, and the monitored area is 400 * 400 m 2 , as shown in Figure 5.…”

Section: Methodsmentioning

confidence: 99%

“…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). The agreement by calculating the location information located in the monitoring area of the sensor nodes and a subset of nodes determines the coverage area of coverage and the completion of the conversion node status by scheduling mechanism of nodes.…”

Section: Related Workmentioning

confidence: 99%

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

SOCCP: Self Organize Coverage and Connectivity Protocol

Cited by 5 publications

References 17 publications

Flow-balanced routing for multi-hop clustered wireless sensor networks

Flow-balanced routing for multi-hop clustered wireless sensor networks

Optimal Node Scheduling for Desired Percentage of Coverage in Wireless Sensor Networks

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

Contact Info

Product

Resources

About