WSIT 2007, Winter School on Coding and Information Theory, March 12-16, 2007, La Colle sur Loup, France
We consider a wireless sensor network in which the sensor nodes are sources of delay insensitive traffic that needs to be transferred in a multi-hop fashion to a common processing center. We address the problem of optimal routing that aims at minimizing the end-to-end delays. Since we allow for traffic splitting at source nodes, we propose an algorithm that seeks the Wardrop equilibrium instead of a single least delay path. The algorithm is implemented in TinyOS.
Type:
Conference
City:
La Colle sur Loup
Date:
2007-03-12
Department:
Communication systems
Eurecom Ref:
2221
Copyright:
© EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in WSIT 2007, Winter School on Coding and Information Theory, March 12-16, 2007, La Colle sur Loup, France and is available at :
See also:
