Maximization of multicast periodic traffic throughput in multi-hop wireless networks with broadcast transmissions
(2018) In Ad Hoc Networks 77. p.119-142- Abstract
Although a number of different medium access control (MAC) schemes are adopted for wireless multi-hop networks, time division multiple access (TDMA) approaches based on a periodic frame of time slots are the most common when very high efficiency is needed in terms of use of radio and energy resources. Efficient resource usage is typically based on parallel compatible transmissions from multiple nodes that guarantee interference control at the receivers. Optimization of transmission scheduling in multi-hop packet delivery from sources to destinations for a set of traffic relations can be achieved by minimizing the frame length where all necessary transmissions are organized in compatible sets and assigned to the time slots of the frame.... (More)
Although a number of different medium access control (MAC) schemes are adopted for wireless multi-hop networks, time division multiple access (TDMA) approaches based on a periodic frame of time slots are the most common when very high efficiency is needed in terms of use of radio and energy resources. Efficient resource usage is typically based on parallel compatible transmissions from multiple nodes that guarantee interference control at the receivers. Optimization of transmission scheduling in multi-hop packet delivery from sources to destinations for a set of traffic relations can be achieved by minimizing the frame length where all necessary transmissions are organized in compatible sets and assigned to the time slots of the frame. When properly designed, the resulting TDMA scheme guarantees the delivery of packets for each traffic relation at a rate of up to one packet per frame duration regardless of the number of the packet transmissions (hops) necessary from source to destination, and thus it is particularly suitable for periodic traffic. While similar traffic maximization problems have been studied quite extensively for the case of unicast traffic, its multicast generalization (where each packet should be delivered from the source node to possibly multiple destination nodes) has not been elaborated so far. In this paper we present such a (non-trivial) generalization, namely a mathematical programming model based on the extension of the compatible set concept where the signal-to-noise and interference (SINR) ratio is guaranteed above a threshold at multiple receivers. We first propose an algorithm for solving the problem that generates compatible sets and schedules the frame by splitting the (predefined) multicast routing trees into one-hop transmissions. The high computational efficiency of the algorithm is proven through numerical results on large networks. Next, we enrich the model by adding multicast tree optimization, illustrating its efficiency numerically as well. Finally, we present possible extensions that consider packets of different lengths (requiring multiple slots for transmission), multiple modulation and coding schemes (MCS) requiring different SINR thresholds at the receivers, and packet delay minimization.
(Less)
- author
- Pióro, Michał LU ; Tomaszewski, Artur and Capone, Antonio
- organization
- publishing date
- 2018-08-01
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Compatible sets, Integer programming, Multicast traffic optimization, Physical interference model, TDMA, Wireless multi-hop networks
- in
- Ad Hoc Networks
- volume
- 77
- pages
- 24 pages
- publisher
- Elsevier
- external identifiers
-
- scopus:85048470892
- ISSN
- 1570-8705
- DOI
- 10.1016/j.adhoc.2018.04.011
- language
- English
- LU publication?
- yes
- id
- 557b2ce9-5a82-425b-bace-9debb46a0755
- date added to LUP
- 2018-06-28 11:38:24
- date last changed
- 2022-04-17 21:15:39
@article{557b2ce9-5a82-425b-bace-9debb46a0755,
abstract = {{<p>Although a number of different medium access control (MAC) schemes are adopted for wireless multi-hop networks, time division multiple access (TDMA) approaches based on a periodic frame of time slots are the most common when very high efficiency is needed in terms of use of radio and energy resources. Efficient resource usage is typically based on parallel compatible transmissions from multiple nodes that guarantee interference control at the receivers. Optimization of transmission scheduling in multi-hop packet delivery from sources to destinations for a set of traffic relations can be achieved by minimizing the frame length where all necessary transmissions are organized in compatible sets and assigned to the time slots of the frame. When properly designed, the resulting TDMA scheme guarantees the delivery of packets for each traffic relation at a rate of up to one packet per frame duration regardless of the number of the packet transmissions (hops) necessary from source to destination, and thus it is particularly suitable for periodic traffic. While similar traffic maximization problems have been studied quite extensively for the case of unicast traffic, its multicast generalization (where each packet should be delivered from the source node to possibly multiple destination nodes) has not been elaborated so far. In this paper we present such a (non-trivial) generalization, namely a mathematical programming model based on the extension of the compatible set concept where the signal-to-noise and interference (SINR) ratio is guaranteed above a threshold at multiple receivers. We first propose an algorithm for solving the problem that generates compatible sets and schedules the frame by splitting the (predefined) multicast routing trees into one-hop transmissions. The high computational efficiency of the algorithm is proven through numerical results on large networks. Next, we enrich the model by adding multicast tree optimization, illustrating its efficiency numerically as well. Finally, we present possible extensions that consider packets of different lengths (requiring multiple slots for transmission), multiple modulation and coding schemes (MCS) requiring different SINR thresholds at the receivers, and packet delay minimization.</p>}},
author = {{Pióro, Michał and Tomaszewski, Artur and Capone, Antonio}},
issn = {{1570-8705}},
keywords = {{Compatible sets; Integer programming; Multicast traffic optimization; Physical interference model; TDMA; Wireless multi-hop networks}},
language = {{eng}},
month = {{08}},
pages = {{119--142}},
publisher = {{Elsevier}},
series = {{Ad Hoc Networks}},
title = {{Maximization of multicast periodic traffic throughput in multi-hop wireless networks with broadcast transmissions}},
url = {{http://dx.doi.org/10.1016/j.adhoc.2018.04.011}},
doi = {{10.1016/j.adhoc.2018.04.011}},
volume = {{77}},
year = {{2018}},
}