.png){kind=icon}
.png){kind=icon}
Return
TDMA-Based Time Slots assignment Algorithm
.png){kind=icon}
PRE
AI
DOI：10.4028/www.scientific.net/AMM.241-244.2445.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we studied timeliness of TDMA-based MAC scheduling mechanisms. TDMA-based MAC protocols require sensor nodes to deliver data individually so as to eliminate collisions in shared channel. This scheduling mechanism can assist sensor nodes in managing energy efficiently since data resending that collisions induced has a significant impact on battery life. But during medium access arbitration, the elected central node has to receive other nodes' state messages one by one before assigning time slots for each node. While in large-scale sensor networks, the waiting time would be a relatively long duration and result in timeliness decrease in time-sensitive environments. We propose a novel time slots assignment algorithm for TDMA-based MAC protocols that allows sensor nodes to deliver state messages simultaneously to central node for medium access arbitration and present an analysis in which these two approaches are compared in respect to timeliness. The algorithm is evaluated through simulation. Simulation results have confirmed the timeliness of our new algorithm.
Keywords:
Collision-Utilization
digit-identify
priority generation
contention
arbitration
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
21
Citations:
0