Access scheduling on the control channels in TDMA wireless mesh networks
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Mobile Ad-hoc and Sensor Networks |
| Subtitle of host publication | Third International Conference, MSN 2007, Proceedings |
| Publisher | Springer Verlag |
| Pages | 421-432 |
| Volume | 4864 LNCS |
| ISBN (print) | 9783540770237 |
| Publication status | Published - 2007 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4864 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (electronic) | 1611-3349 |
Conference
| Title | 3rd International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2007 |
|---|---|
| Place | China |
| City | Beijing |
| Period | 12 - 14 December 2007 |
Link(s)
Abstract
The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can transmit a control packet to any one-hop neighbor in the scheduling cycle. The objective is to minimize the total number of different time-slots in the cycle. This paper has taken the large interference range problem into consideration and proposed two algorithms for the scheduling problem, namely, One Neighbor Per Cycle (ONPC) algorithm and All Neighbors Per Cycle (ANPC) algorithm. The number of time-slots by ANPC algorithm is upper-bounded by min(n, 4K- 2) in some special cases, where n is the node number and K is the maximum node degree. Both centralized and fully distributed versions are given. Simulation results also show that the performance of ONPC is rather better than ANPC © Springer-Verlag Berlin Heidelberg 2007.
Citation Format(s)
Access scheduling on the control channels in TDMA wireless mesh networks. / Cheng, Hongju; Jia, Xiaohua; Liu, Hai.
Mobile Ad-hoc and Sensor Networks: Third International Conference, MSN 2007, Proceedings. Vol. 4864 LNCS Springer Verlag, 2007. p. 421-432 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4864 LNCS).
Mobile Ad-hoc and Sensor Networks: Third International Conference, MSN 2007, Proceedings. Vol. 4864 LNCS Springer Verlag, 2007. p. 421-432 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4864 LNCS).
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
