Authors: G. Merrett, B.M. Al-Hashimi, N.M. White and N.R. Harris
Affilation: University of Southampton, United Kingdom
Pages: 371 - 374
Keywords: wireless, sensor, networks, information, energy
We propose an algorithm whereby each node in a WSN decides its network involvement independently of its neighbouring nodes, based on its own resources and the information contained in the message. The concept of our algorithm is that a node with a high energy reserve acts for the good of the network by forwarding all messages that come to it, and by creating messages from all locally detected events. However, a node with a near-depleted energy reserve acts selfishly, by only forwarding or creating messages that have a high information content. If a node does not wish to participate in the routing of a message, it appears invisible by not responding to neighbour’s requests. The local energy level is also used to dynamically adjust the sensor sampling rate. The proposed algorithm supplements a conventional routing algorithm and, for the purposes of obtaining comparative results, message flooding is considered.