Routing to mobile users by exploiting mobility prediction in wireless mesh networks
Abstract/Contents
- Abstract
- With the advent of ubiquitous wireless networks, supporting user mobility has become crucial. Routing algorithms face challenges in supporting mobility while remaining energy efficient. Mobility of human or vehicle makes wireless links in these mobile networks much more volatile than the links in wireless networks of stationary nodes, and the wireless connectivity varies frequently due to moving speeds. Hence reliable data delivery to mobile users is often hard to achieve. In this thesis, we propose a new routing algorithm for wireless mesh networks with mobile users based on the following components: (i) predicting likely next association node of mobile user (short-term mobility prediction), and (ii) predicting a sequence of the future association nodes of mobile user (long-term mobility prediction). Our approach is to understand and characterize the mobility of the mobile users by looking at connectivity patterns over stationary mesh nodes using past history of connectivity information. Our main contribution is the design of techniques that can be used by routing algorithms to leverage the predictive knowledge of user mobility to efficiently deliver data to those users. This work enables a long-term routing plan through a network optimization process, called "data stashing". The data stashing scheme enables reliable data delivery from stationary mesh nodes to mobile users. In this scheme, each mesh node selects a set of possible association nodes on which to stash its data, to be picked up whenever the mobile user passes the stashing node. We show that data stashing significantly decreases routing cost for delivering data from stationary mesh nodes to multiple mobile users compared to immediate routing protocols where mesh nodes immediately deliver data to the last known association nodes of mobile users. We also show that the scheme provides better load balancing, avoiding collisions and consuming energy resources evenly throughout the network, leading to longer overall network lifetime over the immediate routing protocols. More importantly, we demonstrate that given even limited information about the future node associations of mobile users, optimization of routing paths leads to significant improvements in routing performance.
Description
| Type of resource | text |
|---|---|
| Form | electronic; electronic resource; remote |
| Extent | 1 online resource. |
| Publication date | 2010 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Associated with | Lee, HyungJune |
|---|---|
| Associated with | Stanford University, Department of Electrical Engineering |
| Primary advisor | Guibas, Leonidas J |
| Primary advisor | Tobagi, Fouad A, 1947- |
| Thesis advisor | Guibas, Leonidas J |
| Thesis advisor | Tobagi, Fouad A, 1947- |
| Thesis advisor | Bambos, Nicholas |
| Advisor | Bambos, Nicholas |
Subjects
| Genre | Theses |
|---|
Bibliographic information
| Statement of responsibility | HyungJune Lee. |
|---|---|
| Note | Submitted to the Department of Electrical Engineering. |
| Thesis | Thesis (Ph.D.)--Stanford University, 2010. |
| Location | electronic resource |
Access conditions
- Copyright
- © 2010 by HyungJune Lee
- License
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...