Cookies?
Library Header Image
LSE Research Online LSE Library Services

Gateway selection and routing in wireless mesh networks

Papadaki, Katerina and Friderikos, Vasilis (2009) Gateway selection and routing in wireless mesh networks. Computer Networks, 54 (2). pp. 319-329. ISSN 1389-1286 (Submitted)

Full text not available from this repository.
Identification Number: 10.1016/j.comnet.2009.04.017

Abstract

This paper deals with issues regarding network planning and optimization in multi-hop wireless mesh networks (WMNs). The central focus is on mathematical programming formulations for both the uncapacitated and capacitated joint gateway selection and routing (U/C-GSR) problem in WMNs, which are in general -complete, when expressed as decision problems. We detail a reformulation using the shortest path cost matrix (SPM) and prove that it gives the optimal solution when applied to the uncapacitated case. We extend the SPM formulation to the capacitated case and show computationally, by using a lower bound on the optimal solution, that it performs within a small optimality gap. Evidence from numerical investigations shows that, the proposed formulation can dramatically improve the computation time for WMNs with realistic network sizes. Furthermore, a set of extensions to the basic formulation is detailed to allow modeling issues such as multi-rate transmission, restricting the number of hops in each routing sub-tree and declaring unreliable nodes as leaf nodes in the routing tree.

Item Type: Article
Official URL: http://www.elsevier.com/wps/find/journaldescriptio...
Divisions: Management
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Research centres and groups > Management Science Group
Departments > Management
Date Deposited: 08 Dec 2009 09:31
Last Modified: 20 Jan 2020 03:50
URI: http://eprints.lse.ac.uk/id/eprint/26213

Actions (login required)

View Item View Item