2013 27th International Conference on Advanced Information Networking and Applications Workshops 2013
DOI: 10.1109/waina.2013.23
|View full text |Cite
|
Sign up to set email alerts
|

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 28 publications
0
17
0
Order By: Relevance
“…However, a device will have to wait a longer time if the deployment is dense in the networks with limited resource. To resolve the collision issue associated with resource-limited networks, a distributed TDMAenabled scheduling scheme, which is specifically designed for the correlated contentions, is presented (Bhatia & Hansdah, 2013). However, a tightly coupled issue with this approach is the synchronization of various neighbouring devices, which is not always possible particularly if devices are resource limited.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, a device will have to wait a longer time if the deployment is dense in the networks with limited resource. To resolve the collision issue associated with resource-limited networks, a distributed TDMAenabled scheduling scheme, which is specifically designed for the correlated contentions, is presented (Bhatia & Hansdah, 2013). However, a tightly coupled issue with this approach is the synchronization of various neighbouring devices, which is not always possible particularly if devices are resource limited.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The algorithm clusters the nodes to dead nodes and cluster head (CH) nodes and has shown reducing the energy consumption average, especially for longrange communication without affecting the network lifetime. The Distributed TDMA Slot-scheduling (DTSS) algorithm for WSNs has been proposed by Bhatia and Hansdah [7]. The DTSS priority is to perform the scheduling with schedule length restriction requirement to a maximum degree of interference graph and accessing time.…”
Section: Energy Efficiency In Wsn Nodesmentioning
confidence: 99%
“…Bhatia et al [4] proposed an RD-TDMA scheduling algorithm for handling collision in WSNs. Most of the existing TDMA scheduling algorithm tries to find out an optimal schedule.…”
Section: Journal Of Communications Software and Systems Vol 15 Nomentioning
confidence: 99%
“…Among various sources of energy wastage, reducing collision during the data transmission is one of the important consideration to conserve energy in WSN. Various slot scheduling algorithms [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [24] and MAC protocols [1], [2], [14], [15], [16], [17], [18], [19], [20], [25], [26] has been proposed to fulfill the above requirements. Nevertheless, none of the existing literature focuses on achieving both feasible schedule and optimal schedule in quick time.…”
Section: Introductionmentioning
confidence: 99%