On Performance Analysis of Position Based Routing Algorithms in Wireless Networks 


Vol. 35,  No. 6, pp. 538-546, Jun.  2010


PDF
  Abstract

This paper presents an overview of position-based routing algorithms. We analyze performances of routing algorithms such as Hybrid Opportunistic Forwarding (HOF), Opportunistic multi-hop routing (ExOR), Location based Geocasting and Forwarding (LGF), and Greedy Forwarding in nearest with forward Progress (GFP) routing algorithms to find the best one in terms of packet error rate and throughput efficiency over effects of fading and noise variance in wireless networks. The analyses in closed form expressions are confirmed by the simulation results, which fully agree to analysis results. Additionally, the simulation results indicate significant differences among algorithms when varying the average SNR or the number of relays.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. T. Xuyen and H. Y. Kong, "On Performance Analysis of Position Based Routing Algorithms in Wireless Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 6, pp. 538-546, 2010. DOI: .

[ACM Style]

Tran Thi Xuyen and Hyung Yun Kong. 2010. On Performance Analysis of Position Based Routing Algorithms in Wireless Networks. The Journal of Korean Institute of Communications and Information Sciences, 35, 6, (2010), 538-546. DOI: .

[KICS Style]

Tran Thi Xuyen and Hyung Yun Kong, "On Performance Analysis of Position Based Routing Algorithms in Wireless Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 6, pp. 538-546, 6. 2010.