Advanced

WLC02-6: Progressive Accumulative Routing in Wireless Networks

Yim, R; Mehta, N B; Molisch, A and Zhang, Jianming LU (2006) IEEE Global Telecommunications Conference, 2006 In [Host publication title missing]
Abstract
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
[Host publication title missing]
conference name
IEEE Global Telecommunications Conference, 2006
external identifiers
  • Scopus:50949126863
ISSN
1930-529X
ISBN
1-4244-0356-1
DOI
10.1109/GLOCOM.2006.626
language
English
LU publication?
yes
id
b2787d42-ae68-42c8-8208-3533c0aadef9 (old id 600901)
date added to LUP
2007-12-10 14:16:45
date last changed
2016-10-13 04:24:01
@misc{b2787d42-ae68-42c8-8208-3533c0aadef9,
  abstract     = {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.},
  author       = {Yim, R and Mehta, N B and Molisch, A and Zhang, Jianming},
  isbn         = {1-4244-0356-1},
  issn         = {1930-529X},
  language     = {eng},
  series       = {[Host publication title missing]},
  title        = {WLC02-6: Progressive Accumulative Routing in Wireless Networks},
  url          = {http://dx.doi.org/10.1109/GLOCOM.2006.626},
  year         = {2006},
}