Multi‐criteria routing in wireless sensor‐based pervasive environments

Abstract

Wireless sensor networks are expected to be an integral part of any pervasive computing environment. This implies an ever‐increasing need for efficient energy and resource management of both the sensor nodes, as well as the overall sensor network, in order to meet the expected quality of data and service requirements. There have been numerous studies that have looked at the routing of data in sensor networks with the sole intention of reducing communication power consumption. However, there has been comparatively little prior art in the area of multi‐criteria based routing that exploit both the semantics of queries and the state of sensor nodes to improve network service longevity. In this paper, we look at routing in sensor networks from this perspective and propose an adaptive multi‐criteria routing protocol. Our algorithm offers automated reconfiguration of the routing tree as demanded by variations in the network state to meet application service requirements. Our experimental results show that our approach consistently outperforms, in terms of Network Lifetime and Coverage, the leading semantic‐based routing algorithm which reconfigures the routing tree at fixed periods.

Citation

Li, Q., Beaver, J., Amer, A., Chrysanthis, P.K., Labrinidis, A. and Santhanakrishnan, G. (2005), "Multi‐criteria routing in wireless sensor‐based pervasive environments", International Journal of Pervasive Computing and Communications, Vol. 1 No. 4, pp. 313-326. https://doi.org/10.1108/17427370580000134