Studying Route Optimality in Multi-Hop Wireless Mesh Networks 


Vol. 34,  No. 1, pp. 16-23, Jan.  2009


PDF Full-Text
  Abstract

This paper investigates how many optimal routes can be established in terms of a given wireless mesh routing metric. Although many of routing metrics have been devised to precisely derive the wireless link quality in mesh, most (if not all) metrics have not been evaluated their optimality along with routing protocols. We consider stateof-the-art routing metrics and a widely accepted routing protocol in order to observe the optimality of established routes varying the number of source nodes. Also, we propose a unidirectional routing to deal with possible link asymmetry feature in wireless links. Through comparative simulation evaluations, we show that the portion of optimally established routes becomes less as the network traffic load increases, regardless of employed metrics, network topologies, and routing protocols.

  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]

S. Kim, O. Lee, S. Lee, S. Choi, "Studying Route Optimality in Multi-Hop Wireless Mesh Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 1, pp. 16-23, 2009. DOI: .

[ACM Style]

Seongkwan Kim, Okhwan Lee, Sung-Ju Lee, and Sunghyun Choi. 2009. Studying Route Optimality in Multi-Hop Wireless Mesh Networks. The Journal of Korean Institute of Communications and Information Sciences, 34, 1, (2009), 16-23. DOI: .

[KICS Style]

Seongkwan Kim, Okhwan Lee, Sung-Ju Lee, Sunghyun Choi, "Studying Route Optimality in Multi-Hop Wireless Mesh Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 1, pp. 16-23, 1. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880