A bounded heuristic for collection-based routing in wireless sensor networks

Schütz, Gabriela; Correia, Noélia; Martins, Jaime; Mazayev, Andriy; Barradas, Álvaro

http://hdl.handle.net/10400.1/11968

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
A Bounded Heuristic for Collection-Based Routing in Wireless Sensor Networks.pdf		3.88 MB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Schütz, Gabriela

Correia, Noélia

Martins, Jaime

Mazayev, Andriy

Barradas, Álvaro

Resumo(s)

Wireless sensor networks are used to monitor and control physical phenomena and to provide interaction between clients and the physical environment. Clients have been typically users or user applications, but next generation wireless sensor networks will also work in machine-to-machine scenarios where some nodes can be interested in some other nodes' data. These scenarios may run the risk of becoming overloaded with messaging, a pernicious fact in particular for constrained networks where both bandwidth and power supply are limited. Resource collections can be used in wireless sensor networks to improve bandwidth usage and to reduce energy consumption, reducing the overall number of notification packets and wrapping overhead, required for the delivery of sensor data. This article proposes a heuristic algorithm for the planning of both routing and collections, in wireless sensor networks. Results show that collections are always worthwhile, and that the heuristic is able to find feasible and cost effective solutions, approaching its lower bound.