On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks
A key problem in wireless mesh networks is forwarding packets to/from one or more gateways with connectivity to the Internet. In this respect, a short link schedule, which determines the transmission time of links, is critical. To date, existing link schedulers do not consider routers that incorpora...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
IEEE Access
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/50201 |
| _version_ | 1848758419714998272 |
|---|---|
| author | Wang, H. Chin, K. Soh, Sie Teng |
| author_facet | Wang, H. Chin, K. Soh, Sie Teng |
| author_sort | Wang, H. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | A key problem in wireless mesh networks is forwarding packets to/from one or more gateways with connectivity to the Internet. In this respect, a short link schedule, which determines the transmission time of links, is critical. To date, existing link schedulers do not consider routers that incorporate advances in multiple input multiple output communications, i.e., interference cancellation and spatial multiplexing. In particular, these routers are able to transmit or receive distinct packets on all their links concurrently as well as deliver multiple packets to a neighbor simultaneously. To this end, we consider the problem of deriving a time division multiple access schedule that forwards packets to their respective destination quickly. We first consider the personalized broadcast problem, which assumes a single gateway and present Algo-PB, a solution that produces a schedule that is within 34.5% of the lower bound, and is 45.5% shorter than those computed by the state-of-the-art algorithms. We then extend the problem to consider multiple gateways. This so-called forest construction problem is modeled as an integer linear program (ILP). We then outline Algo-FC, a novel heuristic that generates a balanced forest by repeatedly picking a node from the heaviest tree and migrating it to another tree if doing so reduces the overall load. Experiment results show that the resulting forest generated by Algo-FC is within 9.1% of the ILP solution. |
| first_indexed | 2025-11-14T09:43:42Z |
| format | Journal Article |
| id | curtin-20.500.11937-50201 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:43:42Z |
| publishDate | 2016 |
| publisher | IEEE Access |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-502012017-09-13T15:42:01Z On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks Wang, H. Chin, K. Soh, Sie Teng A key problem in wireless mesh networks is forwarding packets to/from one or more gateways with connectivity to the Internet. In this respect, a short link schedule, which determines the transmission time of links, is critical. To date, existing link schedulers do not consider routers that incorporate advances in multiple input multiple output communications, i.e., interference cancellation and spatial multiplexing. In particular, these routers are able to transmit or receive distinct packets on all their links concurrently as well as deliver multiple packets to a neighbor simultaneously. To this end, we consider the problem of deriving a time division multiple access schedule that forwards packets to their respective destination quickly. We first consider the personalized broadcast problem, which assumes a single gateway and present Algo-PB, a solution that produces a schedule that is within 34.5% of the lower bound, and is 45.5% shorter than those computed by the state-of-the-art algorithms. We then extend the problem to consider multiple gateways. This so-called forest construction problem is modeled as an integer linear program (ILP). We then outline Algo-FC, a novel heuristic that generates a balanced forest by repeatedly picking a node from the heaviest tree and migrating it to another tree if doing so reduces the overall load. Experiment results show that the resulting forest generated by Algo-FC is within 9.1% of the ILP solution. 2016 Journal Article http://hdl.handle.net/20.500.11937/50201 10.1109/ACCESS.2016.2553048 IEEE Access unknown |
| spellingShingle | Wang, H. Chin, K. Soh, Sie Teng On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks |
| title | On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks |
| title_full | On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks |
| title_fullStr | On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks |
| title_full_unstemmed | On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks |
| title_short | On Minimizing Data Forwarding Schedule in Multi Transmit/Receive Wireless Mesh Networks |
| title_sort | on minimizing data forwarding schedule in multi transmit/receive wireless mesh networks |
| url | http://hdl.handle.net/20.500.11937/50201 |