Pith. sign in

REVIEW

A Classification Framework for TDMA Scheduling techniques in WSNs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.00458 v1 pith:5ATI3MNR submitted 2020-02-02 cs.NI

classification cs.NI
keywords algorithmsexistingtdma-schedulingclassificationframeworkwsnsavailablechannel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

One of the major challenges in wireless sensor networks (WSNs) is the mitigation of collisions due to simultaneous transmissions by multiple nodes over a common channel which are located in a proximity. TDMA-based channel access provides energy-efficient and collision-free transmissions. It is especially suitable for traffic with periodic transmission patterns and guaranteed QoS requirements. For that reason, a large number of TDMA-scheduling algorithms are available in the literature, and consequently, a good number of survey papers on TDMA-scheduling algorithms have been written. In this work, we propose a novel classification framework to categorize the existing TDMA-scheduling algorithms available for WSNs. As against existing survey works, the proposed framework possess certain new dimensions (categories) to classify existing TDMA-scheduling algorithms. Additionally, we introduce a couple of new sub-categories for the existing classes which would help researchers to even differentiate between two TDMA-Scheduling algorithms that are assumed to be similar as per existing classification schemes. Finally, we also discuss few important works in the context of proposed classification scheme.

Discussion (0). Sign in to comment.

Pith tools