2010
DOI: 10.1109/tc.2009.170
|View full text |Cite
|
Sign up to set email alerts
|

Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

Abstract: Abstract-In wireless sensor networks, some sensor nodes are put in sleep mode while other sensor nodes are in active mode for sensing and communication tasks in order to reduce energy consumption and extend network lifetime. This approach is a special case (k ¼ 2) of a randomized scheduling algorithm, in which k subsets of sensors work alternatively. In this paper, we first study the randomized scheduling algorithm via both analysis and simulations in terms of network coverage intensity, detection delay, and d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
48
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
9

Relationship

4
5

Authors

Journals

citations
Cited by 74 publications
(48 citation statements)
references
References 21 publications
0
48
0
Order By: Relevance
“…The stochastic scheduling algorithm was studied, including simulation of network coverage intensity, delay detection and probability of detection. Bounded detection delay, detection probability, and network coverage intensity with constraints of network life cycle QOS [14]. A distribution method was proposed to provide complete coverage performance with the help of random scheduling, including random partitions and coverage improvement.…”
Section: Related Workmentioning
confidence: 99%
“…The stochastic scheduling algorithm was studied, including simulation of network coverage intensity, delay detection and probability of detection. Bounded detection delay, detection probability, and network coverage intensity with constraints of network life cycle QOS [14]. A distribution method was proposed to provide complete coverage performance with the help of random scheduling, including random partitions and coverage improvement.…”
Section: Related Workmentioning
confidence: 99%
“…Though extensive research for scheduling the sleep/wake times of sensor nodes [5,13,15,16,33,71,72,58,89,94,92,97,109,108,112,116,128,120] have been conducted only a few studies exist in the literature on the packet scheduling of sensor nodes [27,88,102,119] that schedule the processing of data events available at a sensor node and also reduces energy consumptions. Indeed, most existing Wireless Sensor Network (WSN) applications use First Come First Serve (FCFS) [96] schedulers that process data packets in the order of their arrival time and, thus, require a lot of time to be delivered to a relevant base station (BS).…”
Section: Motivationmentioning
confidence: 99%
“…1,2 As a result of the rapid development of information technology, a wireless sensor network can be applied in all types of engineering fields, such as military affairs, environmental monitoring, disaster relief, smart homes, health care, agricultural production, and transportation. 3,4 Energy consumption and coverage quality are the two key issues in wireless sensor network research, 5,6 the behavioral characteristic of which is the deployment of sensor nodes. The problem of energy consumption includes how to effectively suppress rapid energy consumption of sensor nodes to extend the network lifetime and improve Internet service.…”
Section: Introductionmentioning
confidence: 99%