A Study on OSPF for Active Routing in Wireless Tactical Communication Network 


Vol. 35,  No. 12, pp. 1811-1818, Dec.  2010


PDF
  Abstract

OSPF is the optimized routing protocol in wired network and considered as a tactical routing protocol in wireless tactical communication network. However because it is designed basically based on wired environment, it runs inadequately in wireless tactical environment: noise and jamming signal. So, we proposed new OSPF cost function to develop active routing protocol in wireless tactical communication network. In redefined cost function, there are four parameters that are relative transmission speed, link weight, router utilization, link average BER(Bit Error Rate). These parameters reflect wireless tactical characters. Also, we remodel the option field in Hello packet. It can help user to periodically check the link state. From the simulation result, it is shown that proposed OSPF is better than OSPF in jamming situation and has accumulative delay gain with dispersion of traffic load in entire network.

  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. H. Lee, J. H. Lee, H. S. Lee, S. H. Rhee, "A Study on OSPF for Active Routing in Wireless Tactical Communication Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 12, pp. 1811-1818, 2010. DOI: .

[ACM Style]

Seung Hwan Lee, Jong Heon Lee, Hoon Seop Lee, and Seung Hyong Rhee. 2010. A Study on OSPF for Active Routing in Wireless Tactical Communication Network. The Journal of Korean Institute of Communications and Information Sciences, 35, 12, (2010), 1811-1818. DOI: .

[KICS Style]

Seung Hwan Lee, Jong Heon Lee, Hoon Seop Lee, Seung Hyong Rhee, "A Study on OSPF for Active Routing in Wireless Tactical Communication Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 12, pp. 1811-1818, 12. 2010.