A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks
The personalized broadcast problem calls for a link schedule with the shortest makespan or slots to deliver all data located at a gateway destined for nodes in a multi-hop wireless network. In this paper, we address this fundamental problem with consideration for the multiple transmit or receive cap...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Communications Society
2015
|
| Online Access: | http://hdl.handle.net/20.500.11937/27599 |
| _version_ | 1848752308652867584 |
|---|---|
| author | He, W. Chin, K. Soh, Sie Teng |
| author2 | Jiangzhou Wang |
| author_facet | Jiangzhou Wang He, W. Chin, K. Soh, Sie Teng |
| author_sort | He, W. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | The personalized broadcast problem calls for a link schedule with the shortest makespan or slots to deliver all data located at a gateway destined for nodes in a multi-hop wireless network. In this paper, we address this fundamental problem with consideration for the multiple transmit or receive capability of nodes as well as their ability to boost the capacity of a link via spatial multiplexing or multiple radios. We derive new makespan bounds for arbitrary tree topologies and propose a new link scheduler called Algo-PB to generate a personalised broadcast schedule with minimal schedule length. Simulation results show that the schedule length generated by Algo-PB outperforms state-of-the-art algorithms by at most 20% and the difference between Algo-PB and the theoretical lower bound is at most 10%. |
| first_indexed | 2025-11-14T08:06:34Z |
| format | Conference Paper |
| id | curtin-20.500.11937-27599 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:06:34Z |
| publishDate | 2015 |
| publisher | IEEE Communications Society |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-275992017-09-15T23:19:48Z A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks He, W. Chin, K. Soh, Sie Teng Jiangzhou Wang The personalized broadcast problem calls for a link schedule with the shortest makespan or slots to deliver all data located at a gateway destined for nodes in a multi-hop wireless network. In this paper, we address this fundamental problem with consideration for the multiple transmit or receive capability of nodes as well as their ability to boost the capacity of a link via spatial multiplexing or multiple radios. We derive new makespan bounds for arbitrary tree topologies and propose a new link scheduler called Algo-PB to generate a personalised broadcast schedule with minimal schedule length. Simulation results show that the schedule length generated by Algo-PB outperforms state-of-the-art algorithms by at most 20% and the difference between Algo-PB and the theoretical lower bound is at most 10%. 2015 Conference Paper http://hdl.handle.net/20.500.11937/27599 10.1109/ICCW.2015.7247235 IEEE Communications Society restricted |
| spellingShingle | He, W. Chin, K. Soh, Sie Teng A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks |
| title | A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks |
| title_full | A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks |
| title_fullStr | A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks |
| title_full_unstemmed | A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks |
| title_short | A Novel Link Scheduler for Personalized Broadcast in Multi Tx/Rx Wireless Mesh Networks |
| title_sort | novel link scheduler for personalized broadcast in multi tx/rx wireless mesh networks |
| url | http://hdl.handle.net/20.500.11937/27599 |