Sciweavers

Share
GLOBECOM
2006
IEEE

Progressive Accumulative Routing in Wireless Networks

10 years 5 months ago
Progressive Accumulative Routing in Wireless Networks
This paper considers a sensor network where relay nodes cooperate in order to minimize the total energy consumption for the unicast transmission of a message from a single source to a single destination. We assume Destination Energy Accumulation, i.e., the destination can accumulate the energy of multiple copies of the message, each of which is too weak to be reliably decoded by itself, while the relay nodes use a decode-and-forward approach. We propose the Progressive Accumulative Routing (PAR) algorithm, which performs relay discovery, relay ordering and power allocation in a distributed manner so that each relay node only needs information about its neighboring nodes. Simulations verify that the algorithm considerably reduces the total energy consumption, and can be implemented efficently. Furthermore, it performs close to the optimal DEA route with high probability. IEEE Global Telecommunications Conference (GLOBECOM) This work may not be copied or reproduced in whole or in part ...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where GLOBECOM
Authors Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch, Jinyun Zhang
Comments (0)
books