Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to algorithms
Negotiation-based protocols for disseminating information in wireless sensor networks
Wireless Networks - Selected Papers from Mobicom'99
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Rumor routing algorthim for sensor networks
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
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
Although numerous routing protocols have been designed for wireless sensor networks, not all are suitable for wireless sensor networks in home automation (WSNHA). In this paper, we evaluate some popular wireless sensor network routing protocols for their suitability to WSNHA. We also propose a greedy-algorithm heuristic routing (GAHR) protocol and an A* algorithm for route finding. We compared the performance of this heuristic routing with the ad-hoc on-demand distance-vector protocol using a simulation. The simulation results showed that this routing protocol dramatically reduced the routing overhead and the average packet delay without impacting reliability, and demonstrated that WSNHA-GAHR adapts automatically to changes in the network topology.