Publikation

Multi-Pole Field Persistent Routing with Bounded Delay in Wireless Sensor Networks

Oliviu Ghica, Goce Trajcevski, René Schubotz, Marco Zuniga, Peter Scheuermann, Manfred Hauswirth

Technical Report Northwestern University Northwestern University Technical Reports NWU-EECS-11-04 2011.

Abstrakt

This work addresses the problem of balancing the spatial distribution of the routing among the nodes in a given sensor network and the tradeoff that can be achieved for providing certain level of quality of service several studies have proposed field traffic load throughout the network. However, as network density decreases, we observe major shortcomings of the current st of path diversity, and (ii) the paths a single path along the border. These path merging effects energy balance, and as consequence, the lifetime of the network. In this article, we propose a novel mechanism to enable better load balancing for single multiple-source scenarios, while minimizing end-to-end packet delivery la proposed methodology, the network lifetime can be significantly prolonged, when long term point-to-point queries are considered. Abstract This work addresses the problem of balancing the spatial distribution of the routing given sensor network and the tradeoff that can be achieved for providing certain level of quality of service (QoS) guarantees. For high-density networks, several studies have proposed field-based routing paradigms to uniformly traffic load throughout the network. However, as network density decreases, we observe of the current state-of-the-art: (i) path-merging leads to a reduction of path diversity, and (ii) the paths directed towards the border of the network merge into a single path along the border. These path merging effects decrease significantly the onsequence, the lifetime of the network. In this article, we a novel mechanism to enable better load balancing for single source scenarios, while minimizing the cost of the tradeoff for bounding the end packet delivery latencies. Our evaluations demonstrate that by proposed methodology, the network lifetime can be significantly prolonged, when long queries are considered. This work addresses the problem of balancing the spatial distribution of the routing-load given sensor network and the tradeoff that can be achieved for density networks, distribute the traffic load throughout the network. However, as network density decreases, we observe merging leads to a reduction directed towards the border of the network merge into decrease significantly the onsequence, the lifetime of the network. In this article, we a novel mechanism to enable better load balancing for single-source and the cost of the tradeoff for bounding the tencies. Our evaluations demonstrate that by using the proposed methodology, the network lifetime can be significantly prolonged, when long-Abstract This work addresses the problem of balancing the spatial distribution of the routing-load among the nodes in a …

Weitere Links

Deutsches Forschungszentrum für Künstliche Intelligenz
German Research Center for Artificial Intelligence