Multihop ACK-based greedy forwarding using expected transmission cost in wireless sensor networks

  • Authors:
  • Dongju Bae;Wook Choi;Hyunseung Choo

  • Affiliations:
  • Sungkyunkwan University, Korea;SW Solution Development Team, S. LSI Division, Samsung Electronics, Korea;Sungkyunkwan University, Korea

  • Venue:
  • Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a multihop ACK-based greedy forwarding (MAGF) scheme that considers the asymmetrical reliability of wireless links in order to improve the reliability and efficiency of packet transmissions. Existing greedy forwarding schemes forward packets only considering the distance to a destination. In real wireless communication, however, signal strength is exponentially reduced in accordance with the distance, which results in a waste of the limited battery resource due to a large number of packet retransmissions. To solve such an inefficient packet transmission problem, many schemes have been proposed. However, they are either unrealistic due to a huge overhead of using the entire network information or inefficiency as they do not consider the asymmetric link characteristics. Our proposed MAGF uses a routing path with a minimum expected transmission cost (ETC) by considering the balance between the number of transmissions and the hop count for enhancing packet delivery rate and energy efficiency. Simulation results show that MAGF improves packet delivery rate by about 13% and energy efficiency by about 16% compared with PRRxDistance greedy forwarding (GF).