On the problem of placing Mobility Anchor Points in Wireless Mesh Networks
(2006) 1st Workshop on Operator-Assisted (Wireless Mesh) Community Networks, 2006- Abstract
- Over the past few years, wireless mesh networks are emerging as a strong technology for cheap wireless coverage. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. Since a mesh network usually has very different characteristics than those of current fixed mobile networks, traditional fixed deployments such as those in cellular IP and HMIP will not perform well. In wireless mesh networks, the topology is usually an unplanned graph and there are no root nodes for the placements of mobility anchor points (MAP). Furthermore, the connections between mesh routers are wireless and have very high variability which make the MAP placement problem even harder as the changes of the topology... (More)
- Over the past few years, wireless mesh networks are emerging as a strong technology for cheap wireless coverage. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. Since a mesh network usually has very different characteristics than those of current fixed mobile networks, traditional fixed deployments such as those in cellular IP and HMIP will not perform well. In wireless mesh networks, the topology is usually an unplanned graph and there are no root nodes for the placements of mobility anchor points (MAP). Furthermore, the connections between mesh routers are wireless and have very high variability which make the MAP placement problem even harder as the changes of the topology have to be adhered to. In this paper, we will explore the MAP placement problem in a graphic model. We point out the factors that have to be considered in the placement problem and give a simple solution. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3173903
- author
- Wu, L. and Landfeldt, Björn LU
- publishing date
- 2006
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- conference name
- 1st Workshop on Operator-Assisted (Wireless Mesh) Community Networks, 2006
- conference location
- Berlin, Germany
- conference dates
- 0001-01-02
- external identifiers
-
- scopus:46149094882
- ISBN
- 1-4244-0692-7
- DOI
- 10.1109/WOACN.2006.337187
- language
- English
- LU publication?
- no
- id
- 767e6f2c-1945-48bb-b072-5b5e38c578a2 (old id 3173903)
- date added to LUP
- 2016-04-04 14:30:11
- date last changed
- 2022-01-30 02:06:27
@inproceedings{767e6f2c-1945-48bb-b072-5b5e38c578a2,
abstract = {{Over the past few years, wireless mesh networks are emerging as a strong technology for cheap wireless coverage. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. Since a mesh network usually has very different characteristics than those of current fixed mobile networks, traditional fixed deployments such as those in cellular IP and HMIP will not perform well. In wireless mesh networks, the topology is usually an unplanned graph and there are no root nodes for the placements of mobility anchor points (MAP). Furthermore, the connections between mesh routers are wireless and have very high variability which make the MAP placement problem even harder as the changes of the topology have to be adhered to. In this paper, we will explore the MAP placement problem in a graphic model. We point out the factors that have to be considered in the placement problem and give a simple solution.}},
author = {{Wu, L. and Landfeldt, Björn}},
booktitle = {{[Host publication title missing]}},
isbn = {{1-4244-0692-7}},
language = {{eng}},
title = {{On the problem of placing Mobility Anchor Points in Wireless Mesh Networks}},
url = {{http://dx.doi.org/10.1109/WOACN.2006.337187}},
doi = {{10.1109/WOACN.2006.337187}},
year = {{2006}},
}