Scalable routing protocol for ad hoc networks
Wireless Networks
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
On profiling mobility and predicting locations of wireless users
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
AP and MN-centric mobility prediction: a comparative study based on wireless traces
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Toward self-organized mobile ad hoc networks: the terminodes project
IEEE Communications Magazine
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
An alternative strategy for location tracking
IEEE Journal on Selected Areas in Communications
Link quality prediction in mesh networks
Computer Communications
An analysis of human mobility using real traces
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Near-zero triangular location through time-slotted mobility prediction
Wireless Networks
Price: Hybrid geographic and co-based forwarding in delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We propose Otiy, a node-centric location service that limits the impact of location updates generate by mobile nodes in IEEE 802.11-based wireless mesh networks. Existing location services use node identifiers to determine the locator (aka anchor) that is responsible for keeping track of a node's location. Such a strategy can be inefficient because: (i) identifiers give no clue on the node's mobility and (ii) locators can be far from the destination thus increasing location updates path length and bandwidth consumption. To solve these issues, Otiy introduces a new strategy that identifies nodes to play the role of locators based on the likelihood of a destination to be close to these nodes -- i.e., locators are identified depending on the mobility pattern of nodes. Otiy relies on the cyclic mobility patterns of nodes and creates a slotted agenda composed of a set of predicted locations, defined according to the past and present patterns of mobility. Correspondent nodes fetch this agenda and use it as a reference for identifying which locator is currenty in charge for the node. Over a period of about one year, the weekly proportion of nodes having at least 50% of exact location predictions is in average about 75%. This proportion increases by 10% when nodes also consider their closeness to the locator from only what they know about the network. In this paper we focus on the analysis of the concepts behind Otiy leaving more quantitative and comparative results for future work.