On the problem of placing Mobility Anchor Points in Wireless Mesh Networks

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