English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The existing distributed TDMA-scheduling techniques can be classified aseither static or dynamic. The primary purpose of static TDMA-schedulingalgorithms is to improve the channel utilization by generating a schedule ofshorter length. But, they usually take a longer time to schedule, and hence,are not suitable for WSNs, in which the network topology changes dynamically.On the other hand, dynamic TDMA-scheduling algorithms generate a schedulequickly, but they are not efficient in terms of generated schedule length. Inthis paper, we propose a new approach to TDMA scheduling for WSNs, that bridgesthe gap between the above two extreme types of TDMA-scheduling techniques, byproviding the flexibility to trade-off between the schedule length and the timerequired to generate the schedule (scheduling time). The proposed TDMAscheduling works in two phases. In the first phase, we generate a TDMA schedulequickly, which need not have to be very efficient in terms of schedule length.In the second phase, we iteratively reduce the schedule length in a manner,such that the process of schedule length reduction can be terminated after theexecution of an arbitrary number of iterations, and still be left with a validschedule. This step provides the capability to trade-off between schedulelength and scheduling time. We have used Castalia network simulator to evaluatethe performance of proposed TDMA-scheduling scheme. The simulation resulttogether with theoretical analysis shows that in addition to the advantage oftrading-off the schedule length with scheduling time, the proposed TDMAscheduling approach achieves better performance than existing algorithms interms of schedule length and scheduling time.

A Two-Phase Scheme for Distributed TDMA Scheduling in WSNs with Flexibility to Trade-off between Schedule Length and Scheduling Time