TDMA scheduling algorithms for wireless sensor networks
Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In se...
Saved in:
| Published in: | Wireless networks Vol. 16; no. 4; pp. 985 - 997 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Boston
Springer US
01.05.2010
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1022-0038, 1572-8196 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!