A Survey on Scheduling Algorithms for Wireless Sensor Networks

Kumar, Sumit; Chauhan, Siddhartha

doi:10.5120/2432-3271

Cited by 40 publications

(24 citation statements)

References 11 publications

(1 reference statement)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, if idle listening is minimized then energy can be conserved. This can be done by scheduling the nodes using TDMA method [21][22][23]. In addition to this, energy can be conserved more by making the nodes to be in active or inactive states periodically.…”

Section: Related Workmentioning

confidence: 99%

Ant Colony and Tolerable Delay Based Modified Virtual Backoff Algorithm for Wireless Sensor Networks

Babu¹,

Krishna²

2017

IJIES

View full text Add to dashboard Cite

Abstract:The MAC layer plays a major role in the enhancement of the performance of any network. Hence this paper proposes a modified virtual backoff algorithm which queues the packets based on the delay that application can tolerate and ant colony optimization technique is used to choose the best of all available forwarding nodes. Two counter referred as Naccess and Nattempt are maintained for each node which is used to calculate the success rate of each node based on which the node is given the channel access of all contending nodes. Sleep scheduling is incorporated in order to enhance the energy conservation and hence increase the lifetime of the network. The performance of the proposed algorithm is proved to be better when compared to the legacy systems like VBA, S-MAC and EACAODV. The parameters used for testing are packet delivery ratio, average energy consumption, delay and number of collisions.

show abstract

Section: Related Workmentioning

confidence: 99%

Ant Colony and Tolerable Delay Based Modified Virtual Backoff Algorithm for Wireless Sensor Networks

Babu¹,

Krishna²

2017

IJIES

View full text Add to dashboard Cite

show abstract

“…The first one is collisions, which occur when two or more nodes try to transmit their data to the same destination node simultaneously. Indeed, the packets collide with each other and the destination node cannot receive either one correctly [6]. As a result, retransmission is needed, which leads to the use of more energy to send out the packets again.…”

Section: Introductionmentioning

confidence: 99%

“…The third case where energy can be wasted, and the most relevant to our work, is idle listening. Idle listening occurs when a node is listening to the channel to receive a packet but there is the possibility that the sending node does not have data and remains silent [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Reducing Idle Listening during Data Collection in Wireless Sensor Networks

Rasul

Erlebach

2014

2014 10th International Conference on Mobile Ad-Hoc and Sensor Networks

View full text Add to dashboard Cite

Abstract-Data collection is one of the predominant operations in wireless sensor networks. This paper focuses on the problem of efficient data collection in a setting where some nodes may not possess data each time data is collected. In that case, idle listening slots may occur, which lead to a waste of energy and an increase in latency. To alleviate these problems, successiveslot schedules were proposed by Zhao and Tang (Infocom 2011). In this paper, we introduce a so-called extra-bit technique to reduce idle listening further. Each packet includes an extra bit that informs the receiver whether further data packets will follow or not. The extra-bit technique leads to significantly reduced idle listening and improved latency in many cases. We prove that every successive-slot schedule is also an extra-bit schedule. We then consider the special case of linear networks and prove that the optimal length of a successive-slot schedule (or extra-bit schedule) is 4N − 6 time slots, where N ≥ 3 is the number of nodes excluding the sink. Then the proposed extra-bit technique is compared with the successive-slot technique with respect to the expected amount of idle listening, and it is shown that the extra-bit technique reduces idle listening substantially.

show abstract

“…Data flows from leaf nodes to sink nodes through one or more intermediate nodes [6,7]. These intermediate nodes are called aggregator nodes.…”

Section: Distributed Algorithmmentioning

confidence: 99%

A Dynamic and Distributed Scheduling for Data Aggregation in Ubiquitous Sensor Networks Using Power Control

Madhavi

Kim

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Data aggregation scheduling in ubiquitous sensor networks is a major research interest for many researchers. Very little research is carried out to schedule the nodes in ubiquitous sensor networks for maximizing the throughput and utilize the hardware resources effectively. The traditional graph model does not model the interferences occurring from the concurrent transmissions in the Ubiquitous Sensor Networks. Hence in this paper we propose a new network model for the USN called a power control collision interference free model and a novel distributed data aggregation scheduling protocol which is adaptive to the rate and power. We tested the protocol in a USN consisting of 50, 100, 150, 200, and 250 number of nodes with different topologies and varying degree 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, . . ., 40. We compared our results with the other protocols and proved that our proposed power control collision interference free model yields better results.

show abstract

A Survey on Scheduling Algorithms for Wireless Sensor Networks

Cited by 40 publications

References 11 publications

Ant Colony and Tolerable Delay Based Modified Virtual Backoff Algorithm for Wireless Sensor Networks

Ant Colony and Tolerable Delay Based Modified Virtual Backoff Algorithm for Wireless Sensor Networks

Reducing Idle Listening during Data Collection in Wireless Sensor Networks

A Dynamic and Distributed Scheduling for Data Aggregation in Ubiquitous Sensor Networks Using Power Control

Contact Info

Product

Resources

About