TY - GEN
T1 - Multihop ACK-based greedy forwarding using expected transmission cost in wireless sensor networks
AU - Bae, Dongju
AU - Choi, Wook
AU - Choo, Hyunseung
N1 - Publisher Copyright:
© 2011 Association for Computing Machinery. All rights reserved.
PY - 2011/2/21
Y1 - 2011/2/21
N2 - 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 PRR×Distance greedy forwarding (GF).
AB - 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 PRR×Distance greedy forwarding (GF).
KW - Asymmetry
KW - Energy-efficiency
KW - Multihop
KW - Reliability
UR - https://www.scopus.com/pages/publications/79956024959
U2 - 10.1145/1968613.1968752
DO - 10.1145/1968613.1968752
M3 - Conference contribution
AN - SCOPUS:85185554452
T3 - ACM International Conference Proceeding Series
BT - Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011
PB - Association for Computing Machinery
T2 - 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011
Y2 - 21 February 2011 through 23 February 2011
ER -
