摘要

Large wireless sensor networks consisting of hundreds of devices are often used to conduct distinct monitoring tasks simultaneously. Furthermore, the significant events that can be detected by the network may be detected in many different parts of the network. As a consequence, these multiple tasks and diverse events may also cause resource contention and degradation of network quality of service. For instance, congestion created by regularly occurring events which do not need urgent forwarding to the monitoring centres may create delays for other events which need to be reported very rapidly. The Random Re-Routing (RRR) protocol for wireless sensor networks has therefore been proposed to adaptively prioritise the packets of certain urgent events above those of other less urgent events which may be of a more routine nature. In this paper we extend the RRR protocol to improve performance, and we use simulation experiments to illustrate heuristic algorithms for matching routing priorities to the requirements of the sensor network's monitoring tasks. The approaches are based on selecting the protocol's parameters prior to network deployment, and on using an acknowledgement mechanism for adapting the parameters during network operation.

  • 出版日期2011-10