WLC02-6: Progressive Accumulative Routing in Wireless Networks
(2006) IEEE Global Telecommunications Conference, 2006- 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:
https://lup.lub.lu.se/record/600901
- author
- Yim, R ; Mehta, N B ; Molisch, A and Zhang, Jianming LU
- organization
- publishing date
- 2006
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- conference name
- IEEE Global Telecommunications Conference, 2006
- conference location
- San Francisco, CA, United States
- conference dates
- 2006-11-27 - 2006-12-01
- external identifiers
-
- scopus:50949126863
- ISSN
- 1930-529X
- ISBN
- 1-4244-0356-1
- DOI
- 10.1109/GLOCOM.2006.626
- language
- English
- LU publication?
- yes
- additional info
- The information about affiliations in this record was updated in December 2015. The record was previously connected to the following departments: Department of Electroscience (011041000), Physical Chemistry 1 (S) (011001006)
- id
- b2787d42-ae68-42c8-8208-3533c0aadef9 (old id 600901)
- date added to LUP
- 2016-04-04 09:06:26
- date last changed
- 2022-01-29 08:17:26
@inproceedings{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}},
booktitle = {{[Host publication title missing]}},
isbn = {{1-4244-0356-1}},
issn = {{1930-529X}},
language = {{eng}},
title = {{WLC02-6: Progressive Accumulative Routing in Wireless Networks}},
url = {{http://dx.doi.org/10.1109/GLOCOM.2006.626}},
doi = {{10.1109/GLOCOM.2006.626}},
year = {{2006}},
}