A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Meme tags and community mirrors: moving from conferences to collaboration
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
Pollen: using people as a communication medium
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
LANDMARC: indoor location sensing using active RFID
Wireless Networks - Special issue: Pervasive computing and communications
Computer Networks ISE: A Systems Approach
Computer Networks ISE: A Systems Approach
Hi-index | 0.00 |
This work presents a distributed routing protocol to help mobile users locate items in passive wireless environments. In these environments, a mobile user can detect items that are in its proximity, but items can not communicate directly with each other. For example, an area where passive RFID tags are embedded in the environment and mobile users are provided with RFID readers. The localization protocol is based on the following idea: while searching for a specific node, mobile users populate the memory of the nodes they encounter with information about the nodes they have already seen; later, this information is used to guide other users. The contribution of our work is to demonstrate the feasibility of the proposed protocol, in particular, we provide: (a) a lower bound for the required memory space (in the nodes) to store routing information, (b) a proof that disseminate-while-search routing is loop-free and (c) an study on the extent of user mobility required to disseminate the routing information. A proof-of-concept of the proposed protocol was implemented in a small test-bed of MicaZ motes resembling a passive environment.