9th International Conference on Body Area Networks

Research Article

Gradient based Temperature-aware routing in Body Area Sensor Networks

  • @INPROCEEDINGS{10.4108/icst.bodynets.2014.257002,
        author={Ashwin Ganesh Krishnamurthy and Junghyun Jun and Dharma P. Agrawal},
        title={Gradient based Temperature-aware routing in Body Area Sensor Networks},
        proceedings={9th International Conference on Body Area Networks},
        publisher={ICST},
        proceedings_a={BODYNETS},
        year={2014},
        month={11},
        keywords={biomedical sensors routing algorithm body area networl},
        doi={10.4108/icst.bodynets.2014.257002}
    }
    
  • Ashwin Ganesh Krishnamurthy
    Junghyun Jun
    Dharma P. Agrawal
    Year: 2014
    Gradient based Temperature-aware routing in Body Area Sensor Networks
    BODYNETS
    ACM
    DOI: 10.4108/icst.bodynets.2014.257002
Ashwin Ganesh Krishnamurthy1,*, Junghyun Jun2, Dharma P. Agrawal1
  • 1: University of Cincinnati
  • 2: Indian Institute of Technology
*Contact email: krishnag@mail.uc.edu

Abstract

One promising area of wireless body area networks is remotely diagnosing human health by implanting bio-medical sensors on or inside of a human body. Despite the benefit of such networks, one key challenge is that it should not cause harm at any time. Although the material of bio-medical sensors are made to be harmless, the heat produced from sensing and communicating between sensors can still harm the surrounding human tissues. Therefore, unlike traditional wireless sensor networks, any operations performed in this network must be aware of this issue.\ In this paper, our goal is to route a packet along a cool path towards a coordinator node which is responsible for communication with the outside the world. Our approach is formulating this thermal routing problem as an artificial intelligence search problem. We use a temperature gradient as a cost function and select neighboring sensors that offer a cooler gradient value. Our approach is loosely based on the fringe search which avoids the overhead of sorting the nodes on every iteration of the search. We perform simulations and compare our proposed scheme with other existing well known schemes.