On resource discovery in distributed systems with mobile hosts
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
An efficient mobility management strategy for personal communication systems
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Self-stabilization with path algebra
Theoretical Computer Science
Trail: A distance-sensitive sensor network service for distributed object tracking
ACM Transactions on Sensor Networks (TOSN)
Trail: a distance sensitive WSN service for distributed object tracking
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
Suggests a new data structure for location management in mobile networks. The data structure is based on the tree location database structure. The authors suggest replacing the root and some of the higher levels of the tree with another structure that balances the average load of search requests. For this modification they use a set-ary butterfly network, which is a generalization of the well-known k-ary butterfly. They also suggest modifying the lowest level of the tree in order to reflect neighboring geographical regions more accurately and to support simple location data management. The modification of the lowest level also supports simple handoffs. The update of the proposed location database ensures correct location data following any number of transient faults that corrupt the location database information and thus is self-stabilizing.