.png){kind=icon}
.png){kind=icon}
Return
Effective TDMA scheduling for tree-based data collection using genetic algorithm in wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s12083-019-00818-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data collection is a major operation in Wireless Sensor Networks (WSNs) and minimizing the delay in transmitting the collected data is critical for a lot of applications where specific actions depend on the required deadline, such as event-based mission-critical applications. Scheduling algorithms such as Time Division Multiple Access (TDMA) are extensively used for data delivery with the aim of minimizing the time duration for transporting data to the sink. To minimize the average latency and the average normalized latency in TDMA, we propose a new efficient scheduling algorithm (ETDMA-GA) based on Genetic Algorithm(GA). ETDMA-GA minimizes the latency of communication where two dimensional encoding representations are designed to allocate slots and minimizes the total network latency using a proposed fitness function. The simulation results show that the performance of the proposed algorithm outperforms the existing state-of-the-art approaches such as Rand-LO, Depth-LO, DepthRe-LO, IDegRe-LO, and IDeg-LO in terms of average latency, average normalized latency, and average schedule length.
Keywords:
Genetic algorithm
Routing tree
Time division multiple access
Two dimensional encoding representation
Tree traversal
Wireless sensor networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
2.2K
Citations:
2.9K