PARIS: path availability routing in sensors

In this paper, we propose a new energy-efficient routing algorithm for mobile ad hoc sensor networks. The network architecture is based on a two-tier energy-efficient clustering scheme. The number of active nodes is estimated in real-time based on signal power a node received from others. Each node tries to become a cluster head (CH) in an optimal probability that minimizes the total clustering energy consumption. For the multihop routing domain formed by the CHs, we propose a new routing algorithm, that is, path availability routing in sensors (PARIS), by incorporating the availability of mobile links into routing metrics, in addition to energy consumption metrics, to establish multihop routes between a source node and a sink node. It has been shown that the routing algorithm is not only energy-efficient but also avoids link breakages in moderate to high mobility scenarios, while the existing ad hoc routing algorithms fail to maintain the links. Compared to the existing routing algorithms, the proposed routing algorithm is more energy efficient and has 40 ~ 60% less link breakages, therefore significantly increases route reliability and extends network lifetime