Welcome to the InfoSci Platform
Reference Hub4
A Soft Computing Approach for Data Routing in Hospital Area Networks (HAN)

A Soft Computing Approach for Data Routing in Hospital Area Networks (HAN)

Rakhee, M. B. Srinivas
Copyright: © 2016 |Volume: 12 |Issue: 2 |Pages: 12
ISSN: 1548-0631|EISSN: 1548-064X|EISBN13: 9781466689336|DOI: 10.4018/IJBDCN.2016070102
Cite Article Cite Article

MLA

Rakhee, and M. B. Srinivas. "A Soft Computing Approach for Data Routing in Hospital Area Networks (HAN)." IJBDCN vol.12, no.2 2016: pp.16-27. http://doi.org/10.4018/IJBDCN.2016070102

APA

Rakhee & Srinivas, M. B. (2016). A Soft Computing Approach for Data Routing in Hospital Area Networks (HAN). International Journal of Business Data Communications and Networking (IJBDCN), 12(2), 16-27. http://doi.org/10.4018/IJBDCN.2016070102

Chicago

Rakhee, and M. B. Srinivas. "A Soft Computing Approach for Data Routing in Hospital Area Networks (HAN)," International Journal of Business Data Communications and Networking (IJBDCN) 12, no.2: 16-27. http://doi.org/10.4018/IJBDCN.2016070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper proposes an alternative model to deliver vital signs of patients in a hospital indoor environment where a large number of patients exist and the traffic generated rapidly changes over time using Body Area Network (BAN). The methodology for finding an optimal path includes a meta-heuristic that combines ANT Colony Optimization (ACO). The authors propose an ACO based framework for monitoring data originating from a BAN to improve network life, energy and load balancing of the overall network. Since the traffic generated by BANs on the network changes with time, finding a shortest path is important for Hospital Area Network. In this paper, the authors implemented an ACO based method and have carried out simulations using OMNeT++ to prove that the proposed method can find a better solution than conventional methods.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.