Mathematical modelling of metric-driven routing and resource allocation in wireless mesh networks
(2014) 16th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)- Abstract
- The traditional routing protocols used in wireless mesh networks like AODV are not very efficient since the number of hops to a destination is mainly considered as the routing metric. This may lead to shorter paths; however, the throughput can decrease when traffic is routed through those paths. Various contributions have proposed different metrics or completely different routing algorithms. Nevertheless, for many of these metrics, real-time network performance monitoring is required, increasing their overhead, while the implementation of many of the proposed routing protocols is not feasible in practice because of their complexity. In this paper, we aim to optimize link metrics together with routing. We preserve the shortest path routing... (More)
- The traditional routing protocols used in wireless mesh networks like AODV are not very efficient since the number of hops to a destination is mainly considered as the routing metric. This may lead to shorter paths; however, the throughput can decrease when traffic is routed through those paths. Various contributions have proposed different metrics or completely different routing algorithms. Nevertheless, for many of these metrics, real-time network performance monitoring is required, increasing their overhead, while the implementation of many of the proposed routing protocols is not feasible in practice because of their complexity. In this paper, we aim to optimize link metrics together with routing. We preserve the shortest path routing principle but with optimizing the link metrics; thus, combining the shortest path algorithm's low overhead with an optimized link metrics scheme. We present a two-phase scheme for the considered problem. During the first phase, we seek for the optimal link scheduling for minimizing the required time slots and then, in the second phase, we present a mixed integer programming model for metric-driven routing design. For comparison, we also present the optimization models for global optimized routing and shortest-hop routing, providing numerical results. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4584135
- author
- Li, Yuan LU ; Pioro, Michal LU ; Angelakisi, Vangelis ; Yuan, Di and Fragkiadakis, Alexandros
- organization
- publishing date
- 2014
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 6 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 16th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)
- conference location
- Funchal, Madeira Island, Portugal
- conference dates
- 2014-09-17
- external identifiers
-
- wos:000356141000080
- scopus:84919341635
- DOI
- 10.1109/NETWKS.2014.6959265
- language
- English
- LU publication?
- yes
- id
- 49c4d33d-e5a5-45e6-a757-97986da852ee (old id 4584135)
- date added to LUP
- 2016-04-04 11:41:34
- date last changed
- 2022-01-29 22:14:57
@inproceedings{49c4d33d-e5a5-45e6-a757-97986da852ee,
abstract = {{The traditional routing protocols used in wireless mesh networks like AODV are not very efficient since the number of hops to a destination is mainly considered as the routing metric. This may lead to shorter paths; however, the throughput can decrease when traffic is routed through those paths. Various contributions have proposed different metrics or completely different routing algorithms. Nevertheless, for many of these metrics, real-time network performance monitoring is required, increasing their overhead, while the implementation of many of the proposed routing protocols is not feasible in practice because of their complexity. In this paper, we aim to optimize link metrics together with routing. We preserve the shortest path routing principle but with optimizing the link metrics; thus, combining the shortest path algorithm's low overhead with an optimized link metrics scheme. We present a two-phase scheme for the considered problem. During the first phase, we seek for the optimal link scheduling for minimizing the required time slots and then, in the second phase, we present a mixed integer programming model for metric-driven routing design. For comparison, we also present the optimization models for global optimized routing and shortest-hop routing, providing numerical results.}},
author = {{Li, Yuan and Pioro, Michal and Angelakisi, Vangelis and Yuan, Di and Fragkiadakis, Alexandros}},
booktitle = {{[Host publication title missing]}},
language = {{eng}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Mathematical modelling of metric-driven routing and resource allocation in wireless mesh networks}},
url = {{http://dx.doi.org/10.1109/NETWKS.2014.6959265}},
doi = {{10.1109/NETWKS.2014.6959265}},
year = {{2014}},
}