- Accepted Version
Restricted to Repository staff only until 14 June 2018.
Available under License : See the attached licence file.
Download (406kB) | Request a copy
Text (Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International)
Download (201kB) | Preview
In this article we tackle the problem of co-ordinating transmission of data across a Wireless Mesh Network. The single task nature of mesh nodes imposes simultaneous activation of adjacent nodes during transmission. This makes the co-ordinated scheduling of local mesh node traffic with forwarded traffic across the access network to the Internet via the Gateway notoriously difficult. Moreover, with packet data the nature of the co-ordinated transmission schedule has a big impact upon both the data throughput and energy consumption. Perfect Periodic Scheduling, in which each demand is itself serviced periodically, provides a robust solution. In this paper we explore the properties of Perfect Periodic Schedules with modulo arithmetic using the Chinese Remainder Theorem. We provide a polynomial time, optimisation algorithm, when the access network routing tree has a chain or binary tree structure. Results demonstrate that energy savings and high throughput can be achieved simultaneously. The methodology is generalisable.
|Additional Information:||© 2015, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/|
|Uncontrolled Keywords:||Scheduling, OR in Telecommunications, Mobile and Ad hoc NETworks (MANETs), Combinatorial Optimization, Chinese Remainder Theorem|
|Subjects:||H Social Sciences > HB Economic Theory
H Social Sciences > HE Transportation and Communications
|Divisions:||Cass Business School > Faculty of Actuarial Science & Insurance|
Actions (login required)
Downloads per month over past year