Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks
Multiple transmit (Tx) or receive (Rx) capability is a significant advance in wireless communications. This so called MTR capability allows the creation of wireless mesh networks (WMNs) that are ideal for use as a high-speed wireless backbone that spans vast geographical areas. A fundamental problem...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier Science
2015
|
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S014036641500211X http://hdl.handle.net/20.500.11937/3187 |
| _version_ | 1848744162713665536 |
|---|---|
| author | Wang, L. Chin, K. Soh, Sie Teng Raad, R. |
| author_facet | Wang, L. Chin, K. Soh, Sie Teng Raad, R. |
| author_sort | Wang, L. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Multiple transmit (Tx) or receive (Rx) capability is a significant advance in wireless communications. This so called MTR capability allows the creation of wireless mesh networks (WMNs) that are ideal for use as a high-speed wireless backbone that spans vast geographical areas. A fundamental problem, however, is deriving a minimal transmission schedule or superframe that yields low end-to-end delays, with the primary constraint that routers are not allowed to Tx and Rx simultaneously. In this paper, we consider a joint routing and link scheduling approach that addresses two fundamental issues that influence end-to-end delays: superframe length and transmission slot order. Shortening the superframe length, in terms of slots, is expected to minimize the inter-link activation time while reordering transmission slots increases the likelihood that links on a path are activated consecutively. We propose two algorithms. The first called JRS-Multi-DEC uses a novel metric to minimize the load of each link while the second, called JRS-BIP, uses a Binary Integer Program approach. Both algorithms aim to minimize the overall delay and use slot re-ordering on the resulting schedule to further reduce delay. Numerical results show both algorithms are able to reduce the average end-to-end delay by approximately 50% as compared to a non joint routing algorithm. |
| first_indexed | 2025-11-14T05:57:05Z |
| format | Journal Article |
| id | curtin-20.500.11937-3187 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T05:57:05Z |
| publishDate | 2015 |
| publisher | Elsevier Science |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-31872017-09-15T23:19:44Z Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks Wang, L. Chin, K. Soh, Sie Teng Raad, R. Wireless mesh network Joint routing and scheduling End-to-end delay Multi-transmit-receive Multiple transmit (Tx) or receive (Rx) capability is a significant advance in wireless communications. This so called MTR capability allows the creation of wireless mesh networks (WMNs) that are ideal for use as a high-speed wireless backbone that spans vast geographical areas. A fundamental problem, however, is deriving a minimal transmission schedule or superframe that yields low end-to-end delays, with the primary constraint that routers are not allowed to Tx and Rx simultaneously. In this paper, we consider a joint routing and link scheduling approach that addresses two fundamental issues that influence end-to-end delays: superframe length and transmission slot order. Shortening the superframe length, in terms of slots, is expected to minimize the inter-link activation time while reordering transmission slots increases the likelihood that links on a path are activated consecutively. We propose two algorithms. The first called JRS-Multi-DEC uses a novel metric to minimize the load of each link while the second, called JRS-BIP, uses a Binary Integer Program approach. Both algorithms aim to minimize the overall delay and use slot re-ordering on the resulting schedule to further reduce delay. Numerical results show both algorithms are able to reduce the average end-to-end delay by approximately 50% as compared to a non joint routing algorithm. 2015 Journal Article http://hdl.handle.net/20.500.11937/3187 10.1016/j.comcom.2015.05.014 http://www.sciencedirect.com/science/article/pii/S014036641500211X Elsevier Science restricted |
| spellingShingle | Wireless mesh network Joint routing and scheduling End-to-end delay Multi-transmit-receive Wang, L. Chin, K. Soh, Sie Teng Raad, R. Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks |
| title | Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks |
| title_full | Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks |
| title_fullStr | Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks |
| title_full_unstemmed | Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks |
| title_short | Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks |
| title_sort | novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi tx-rx wireless mesh networks |
| topic | Wireless mesh network Joint routing and scheduling End-to-end delay Multi-transmit-receive |
| url | http://www.sciencedirect.com/science/article/pii/S014036641500211X http://hdl.handle.net/20.500.11937/3187 |