Name
Abstract | ||
|---|---|---|
Topology-transparent scheduling (TTS) via the Chinese remainder theorem (CRT) has succeeded in providing guaranteed collision-free transmissions in each schedule without the need to know the maximum nodal degree of the graph representing connectivity of a mobile ad hoc network. Its main limitation is due to the restriction on the moduli imposed by the CRT. To address the shortcoming, this letter p... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LSP.2016.2581860 | IEEE Signal Processing Letters |
Keywords | Field | DocType |
Schedules,Ad hoc networks,Mobile computing,Instruction sets,Interference,Systematics,Protocols | Mobile ad hoc network,Topology,Instruction set,Chinese remainder theorem,Scheduling (computing),Schedule,Integer programming,Wireless ad hoc network,Mathematics,Integer sequence | Journal |
Volume | Issue | ISSN |
23 | 8 | 1070-9908 |
Citations | PageRank | References |
1 | 0.34 | 14 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi-Sheng Su | 1 | 48 | 8.42 |