Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

WSNHA-GAHR: a greedy and A* heuristic routing algorithm for wireless sensor networks in home automation

WSNHA-GAHR: a greedy and A* heuristic routing algorithm for wireless sensor networks in home automation

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The use of wireless sensor networks in home automation (WSNHA) is a growing trend, on account of their self-organisation, low cost and potential for rapid deployment. Routing in WSNHA is a challenging research topic, because of the requirements of low energy consumption, low storage, low computational complexity, fast response, self-adaptation to unpredictable topological changes and robustness with respect to discontinuous interference. With the development of localisation techniques, localised routing offers a number of attractive benefits, but not all are suitable for WSNHA. In this study, the authors propose a new routing algorithm for WSNHA, called WSNHA-GAHR (greedy and A* heuristic routing for WSNHA). The algorithm uses greedy forwarding, based on the smallest Euclidean distance, to minimise the number of hops for data packet transmission, and thus conserve energy. It also automatically adjusts the route, using the A* heuristic algorithm, when local minimum problems and unpredictable topological changes occur in WSNHA. In addition, link priority classification gives WSNHA-GAHR a greater tolerance than ZigBee routing algorithm for discontinuous interference. Simulation results show that this routing protocol dramatically improves reliability and reduces average packet delay, without introducing additional overhead.

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • ZigBee Specification, ZigBee Alliance Std. Document 053 474r17, 2007.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
      • Li, X.H., Xu, H.Q., Hong, S.H., Wang, Z., Piao, X.F.: `Routing protocol for wireless sensor networks in home automation', Eighth IFAC Int. Conf. on Fieldbuses & neTworks in Industrial & Embedded Systems (FeT’2009), May 2009, Ansan, Korea.
    14. 14)
      • K. Fall , K. Varadhan . (2009) The ns Manual, A Collaboration between researchers at UC Berkeley.
    15. 15)
      • Perkins, C.E., Royer, E.M.: `Ad hoc on-demand distance vector routing', Proc. Second IEEE Workshop on Mobile Computing Systems and Applications, 1999, New Orleans, p. 90–100.
    16. 16)
    17. 17)
    18. 18)
    19. 19)
      • Karp, B., Kung, H.T.: `GPSR greedy perimeter stateless routing for wireless networks', Proc. Sixth Annual Int. Conf. on Mobile Computing and Networking (MobiCom 2000), August 2000, p. 243–254.
    20. 20)
    21. 21)
      • Reinisch, C., Kastner, W., Neugschwandtner, G., Granzer, W.: `Wireless technologies in home and building automation', Fifth IEEE Int. Conf. on Industrial Informatics, July 2007, p. 93–98.
    22. 22)
    23. 23)
    24. 24)
    25. 25)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0746
Loading

Related content

content/journals/10.1049/iet-com.2010.0746
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address