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.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:miun-16870 |
| Creators | Dobslaw, Felix |
| Publisher | Mittuniversitetet, Institutionen för informationsteknologi och medier |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Manuscript (preprint), info:eu-repo/semantics/preprint, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0018 seconds