An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks
In a multihop wireless network, such as a wireless sensor network (WSN), with nodes being aware of their locations, the geographic routing scheme is an effective way of delivering packets to their destinations because of its 1-hop beacon broadcasting based routing related information exchange operat...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-05-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2016/5949103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850214584728682496 |
|---|---|
| author | Hyun Yu Sanghyun Ahn |
| author_facet | Hyun Yu Sanghyun Ahn |
| author_sort | Hyun Yu |
| collection | DOAJ |
| description | In a multihop wireless network, such as a wireless sensor network (WSN), with nodes being aware of their locations, the geographic routing scheme is an effective way of delivering packets to their destinations because of its 1-hop beacon broadcasting based routing related information exchange operation. The routing information obtained via 1-hop beaconing is local in the sense that it is just 1-hop compared to the multihop end-to-end routing. Hence, at some point, packets may experience no more place to be forwarded to (i.e., dead-ends). In this paper, we propose a geographical routing mechanism adopting the concept of the azimuth to reduce the possibility of packets confronting dead-ends. In other words, the node with a packet to be forwarded to the final destination figures out the next-hop node by utilizing the azimuth of the destination as a routing metric. Besides, we propose additional routing metrics for stable next-hop node selection to provide reliable IP connectivity. In order to validate the performance of the proposed routing mechanism, we evaluate its performance through the NS-2 based simulations and show that our mechanism outperforms the other schemes in terms of the packet delivery success rate, the end-to-end delay, and the number of dead-end encounters. |
| format | Article |
| id | doaj-art-8094a7a28d0a41ce8d48d8863ddd6242 |
| institution | OA Journals |
| issn | 1550-1477 |
| language | English |
| publishDate | 2016-05-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-8094a7a28d0a41ce8d48d8863ddd62422025-08-20T02:08:50ZengWileyInternational Journal of Distributed Sensor Networks1550-14772016-05-011210.1155/2016/5949103An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless NetworksHyun Yu0Sanghyun Ahn1 Institute of Convergence Technology, Korea Telecom, 151 Taebong-ro, Seocho-gu, Seoul 06763, Republic of Korea School of Computer Science, University of Seoul, 163 Seoulsiripdae-ro, Dongdaemun-gu, Seoul 02504, Republic of KoreaIn a multihop wireless network, such as a wireless sensor network (WSN), with nodes being aware of their locations, the geographic routing scheme is an effective way of delivering packets to their destinations because of its 1-hop beacon broadcasting based routing related information exchange operation. The routing information obtained via 1-hop beaconing is local in the sense that it is just 1-hop compared to the multihop end-to-end routing. Hence, at some point, packets may experience no more place to be forwarded to (i.e., dead-ends). In this paper, we propose a geographical routing mechanism adopting the concept of the azimuth to reduce the possibility of packets confronting dead-ends. In other words, the node with a packet to be forwarded to the final destination figures out the next-hop node by utilizing the azimuth of the destination as a routing metric. Besides, we propose additional routing metrics for stable next-hop node selection to provide reliable IP connectivity. In order to validate the performance of the proposed routing mechanism, we evaluate its performance through the NS-2 based simulations and show that our mechanism outperforms the other schemes in terms of the packet delivery success rate, the end-to-end delay, and the number of dead-end encounters.https://doi.org/10.1155/2016/5949103 |
| spellingShingle | Hyun Yu Sanghyun Ahn An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks International Journal of Distributed Sensor Networks |
| title | An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks |
| title_full | An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks |
| title_fullStr | An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks |
| title_full_unstemmed | An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks |
| title_short | An Azimuth-Based Dead-End Avoiding Routing Mechanism for Providing Reliable IP Connectivity in Multihop Wireless Networks |
| title_sort | azimuth based dead end avoiding routing mechanism for providing reliable ip connectivity in multihop wireless networks |
| url | https://doi.org/10.1155/2016/5949103 |
| work_keys_str_mv | AT hyunyu anazimuthbaseddeadendavoidingroutingmechanismforprovidingreliableipconnectivityinmultihopwirelessnetworks AT sanghyunahn anazimuthbaseddeadendavoidingroutingmechanismforprovidingreliableipconnectivityinmultihopwirelessnetworks AT hyunyu azimuthbaseddeadendavoidingroutingmechanismforprovidingreliableipconnectivityinmultihopwirelessnetworks AT sanghyunahn azimuthbaseddeadendavoidingroutingmechanismforprovidingreliableipconnectivityinmultihopwirelessnetworks |