๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enhanced tree routing for wireless sensor networks

โœ Scribed by Wanzhi Qiu; Efstratios Skafidas; Peng Hao

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
486 KB
Volume
7
Category
Article
ISSN
1570-8705

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Data aggregated maximum lifetime routing
Data aggregated maximum lifetime routing for wireless sensor networks
โœ Cunqing Hua; Tak-Shing Peter Yum ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 304 KB

In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing so that the network lifetime can be maximized. A recursive smoothing method is adopted to overcome the non-differentiabi

A dynamic reconfigurable routing framewo
A dynamic reconfigurable routing framework for wireless sensor networks
โœ Mukundan Venkataraman; Mainak Chatterjee; Kevin Kwiat ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 733 KB

Sensornet deployments of the future are expected to deliver a multitude of services, ranging from reliable sensing, real time streams, mission critical support, network reprogramming and so on. Naturally, no one routing protocol can sufficiently cater to the network layer functionalities expected. S

Minimum latency joint scheduling and rou
Minimum latency joint scheduling and routing in wireless sensor networks
โœ Gang Lu; Bhaskar Krishnamachari ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 654 KB

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. In this pap