Progressive Accumulative Routing in WIreless Networks

    •  Yim, R.; Mehta, N.; Molisch, A.F.; Zhang, J., "Progressive Accumulative Routing in Wireless Networks", IEEE Global Telecommunications Conference (GLOBECOM), November 2006.
      BibTeX Download PDF
      • @inproceedings{Yim2006nov,
      • author = {Yim, R. and Mehta, N. and Molisch, A.F. and Zhang, J.},
      • title = {Progressive Accumulative Routing in Wireless Networks},
      • booktitle = {IEEE Global Telecommunications Conference (GLOBECOM)},
      • year = 2006,
      • month = nov,
      • url = {}
      • }
  • MERL Contact:
  • Research Area:


TR Image
Overview of the PAR protocol. The top of the figure shows the overhead sent in the data packet transmitted by relay u. The bottom of the figure shows the Ready-to-cooperate (RTC) message from a potential relay w.

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.