Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Integration of routing and time synchronization protocols for wireless sensor networks
Proceedings of the 2008 Euro American Conference on Telematics and Information Systems
Hi-index | 0.00 |
In sensor networks, the unpredictable dynamics caused by the disruption of communication in harsh environments, the depletion of battery resources, and node mobility make coordination between sensor nodes more challenging than coordination between nodes in typical wired and wireless networks. While the literature is rich in coordination protocols for sensor networks and routing protocols for ad-hoc wireless networks, they assume relatively static environments. Using these protocols in highly dynamic environments leads to increased coordination traffic, high energy-consumption, increased event loss, and excessive latency in reporting events. In this paper we propose SWIFT, a coordination protocol that reacts to changes in nodes' connectivity with a local repair process, significantly reducing the coordination traffic. SWIFT eliminates routing loops through a combination of avoidance and detection mechanisms; and does not require GPS support, which cannot be used in closed environments and consumes significant energy resources. Experimental results reveal that SWIFT outperforms existing protocols and achieves significant energy efficiency, reduces event loss, and the latency in reporting events under various network dynamics.