A Cluster-Based Coverage-Preserved Node Scheduling Scheme in Wireless Sensor Networks

Hwang, Shu-Yuen; Su, Yu-Ting; Lin, Yi-Yo; Dow, Chi-Ren

doi:10.1109/mobiq.2006.340443

Cited by 7 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If this number is less than the sleeping probability, the node remains in sleep mode. A network coverage-aware clusterbased node scheduling (CCNS) scheme is introduced in [23] where nodes of a cluster are grouped into a number of sponsor sets. Only one sponsor set remains active in each round while others remain in sleep mode.…”

Section: Related Workmentioning

confidence: 99%

“…12 and 13 that EN CENM−idle < EN CCNS−idle (15) Thus, Eq. 15 represents that sensors energy consumption in idle state in the proposed CENM scheme is less than that in the existing CCNS [23] scheme. This is because all nodes in an active node set consume for idle listening in CCNS scheme, whereas only the alternative node of an active node consumes energy for idle listening in CENM scheme.…”

Section: Analysis Of Energy Consumptionsmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Cluster-Based Sleep Scheduling for M2M Communication Network

Al-kahtani

2015

Arab J Sci Eng

View full text Add to dashboard Cite

Machine-to-machine (M2M) communication networks comprise a large number of machine-type communication (MTC) devices such as sensors, radio frequency identification readers, and smart meters. Thus, M2M networks are becoming popular in real-time monitoring, surveillance, and security applications. Scheduling the active and idle states of MTC devices is significantly important to achieve a longer network lifetime and reduce collision during data transmission. Existing node sleep scheduling schemes are mainly designed to reduce the energy consumption of MTC devices. These schemes do not support mobility of MTC devices and thus cannot be used in mobility-centric M2M applications. Thus, we propose a cluster-based energy-efficient, mobility-centric node scheduling scheme for M2M (CENM) communication networks. The proposed CENM scheduling scheme provides (i) network coverage by keeping a minimum number of MTC devices in active state and (ii) fault tolerance by selecting alternative cluster heads and member nodes. Simulation results show that the CENM scheduling scheme is more reliable than the existing CCNS scheduling scheme since the first node in CENM scheme fails much later than that in CCNS scheduling scheme. Simulation results also show that the CENM scheduling scheme outperforms the CCNS, LEACH-M and LEACH-ME scheduling schemes in terms of network energy consumptions, network lifetime, and total message transmissions.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Analysis Of Energy Consumptionsmentioning

confidence: 99%

Efficient Cluster-Based Sleep Scheduling for M2M Communication Network

Al-kahtani

2015

Arab J Sci Eng

View full text Add to dashboard Cite

show abstract

“…[ [16][17][18][19][20][21][22][23][24] Various algorithm have been formulated for kcovered problem, k-barrier coverage, accurate estimation for information coverage, connectivity-aware coverage solution, partition protocol that partitions the set of available sensors into disjoint sets such that each set covers all targets in different rounds is proposed. Various cost metrics were proposed such as cost metric as the average distance between nodes to its neighbours divided by the number of its neighbours and cost metric being proportional to the product between the expected coverage and the residual energy.…”

Section: Energy Efficient Heterogeneous Clustered (Eehc)mentioning

confidence: 99%

Improved Routing Protocol for Coverage and Connectivity (RPCC) in Heterogeneous Wireless Sensor Network (HWSN)

Kaur¹,

Kumar²

2015

IJCA

View full text Add to dashboard Cite

One of the active research fields in wireless sensor network is that of coverage. Coverage can be defined as how well each point of interest is monitored by sensor network. In addition to coverage it is important for a sensor network to maintain connectivity. Both of these are measure of quality of service of wireless sensor network. In this paper we have improved Coverage and connectivity in heterogeneous wireless sensor network. Routing protocol for coverage and connectivity (RPCC) is proposed in which point coverage as well as connectivity is enhanced. In this paper both CCPRP and RPCC algorithms are compared in two level and three level heterogeneous network. In two level heterogeneous network RPCC provides 68% more increase in service time with 100% sensing coverage ratio. In three level heterogeneous network RPCC provides 21% more increase in service time with 100% sensing coverage ratio and connectivity is maintained till 5551 th round in case of RPCC as comparison to 2833 th round in CCPRP. General TermsWireless sensor network, energy efficiency, clusters.

show abstract

“…However, the proposed algorithm is not optimal because it only takes into account each sensor's range and not its residual energy so any node that has a very little remaining energy can be chosen in the subset and run out of energy during the next time interval. In [12], Hwang et al propose a cluster-based coverage-preserved node scheduling scheme. This mechanism assumes a dense network and makes states' assignment to sensors (turned-on, turned-off, cluster head) in a distributed and self-organized way.…”

Section: Related Workmentioning

confidence: 99%

Power-Efficient Clustering in Wireless Sensor Networks under Coverage Constraint

Chamam

Pierre

2008

2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

View full text Add to dashboard Cite

Maximizing network lifetime and minimizing energy consumption and are two central issues in the design wireless sensor networks (WSN) protocols. In this paper, we address energy-efficient state assignment to sensors in cluster-based WSN, under the constraint of full coverage of the area the sensors are deployed in and connectivity of cluster heads. We consider that any sensor can be turned on, turned off or promoted cluster head, each of these states having a predefined power consumption level. We propose a sensor state assignment heuristic that processes an energy-efficient sensor configuration where every sensor is connected to a cluster head. Besides, we constraint any admissible configuration to have all its cluster heads forming a spanning tree used as a logical routing topology. First, we formulate this global problem as an Integer Linear Programming model that we prove NP-Complete. Then, we implement a greedy heuristic and we show that, compared to its lower bound, this heuristic provides quite good network lifetime values while performing low computation times, practically suitable for large-sized sensor networks.

show abstract

A Cluster-Based Coverage-Preserved Node Scheduling Scheme in Wireless Sensor Networks

Cited by 7 publications

References 12 publications

Efficient Cluster-Based Sleep Scheduling for M2M Communication Network

Efficient Cluster-Based Sleep Scheduling for M2M Communication Network

Improved Routing Protocol for Coverage and Connectivity (RPCC) in Heterogeneous Wireless Sensor Network (HWSN)

Power-Efficient Clustering in Wireless Sensor Networks under Coverage Constraint

Contact Info

Product

Resources

About