Finding Optimal Size TDMA Schedules using Integer Programming
The problem of finding a shortest TDMA is formally described as anInteger Program (IP). A brief user manual explains how the attached implementation can be used to find an optimal size TDMA for any givenWSN and routing table, fulfilling the validity criteria.
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Mittuniversitetet, Institutionen för informationsteknologi och medier
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-16870 |