Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks
dc.contributor.author | Wang, L. | |
dc.contributor.author | Chin, K. | |
dc.contributor.author | Soh, Sie Teng | |
dc.contributor.author | Raad, R. | |
dc.date.accessioned | 2017-01-30T10:29:18Z | |
dc.date.available | 2017-01-30T10:29:18Z | |
dc.date.created | 2016-09-22T12:29:04Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | Wang, L. and Chin, K. and Soh, S.T. and Raad, R. 2015. Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks. Computer Communications. 72: pp. 63-77. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/3187 | |
dc.identifier.doi | 10.1016/j.comcom.2015.05.014 | |
dc.description.abstract |
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. | |
dc.publisher | Elsevier Science | |
dc.relation.uri | http://www.sciencedirect.com/science/article/pii/S014036641500211X | |
dc.subject | Wireless mesh network | |
dc.subject | Joint routing and scheduling | |
dc.subject | End-to-end delay | |
dc.subject | Multi-transmit-receive | |
dc.title | Novel joint routing and scheduling algorithms for minimizing end-to-end delays in multi Tx-Rx wireless mesh networks | |
dc.type | Journal Article | |
dcterms.source.volume | 72 | |
dcterms.source.startPage | 63 | |
dcterms.source.endPage | 77 | |
dcterms.source.issn | 01403664 | |
dcterms.source.title | Computer Communications | |
curtin.department | Department of Computing | |
curtin.accessStatus | Fulltext not available |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |