A potential based routing protocol for mobile ad hoc networks

Dai Yong Kwon, Jae Hwa Chung, Taeweon Suh, Won Gyu Lee, Kyeong Hur

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In this paper, we propose a novel proactive routing protocol, referred to as potential management based proactive routing (PMPR), for mobile ad hoc networks. Unlike other proactive routing protocols, PMPR performs request based routing recovery for proactive route maintenance. When a node has lost the routing information, it attempts a local route recovery by broadcasting a request message to neighbor nodes within a limited hop range. If the local recovery succeeds, the routing information is reconstructed by the interaction between the requesting node and the neighbor nodes. In this paper, we introduce a concept of potential and propose an efficient management method of potential. Potential is a value assigned to each node for each destination. Routes are determined based on the potential of each node. When a node is requested to perform a route recovery and the recovery is feasible, the node modifies its potential to a lower value to provide the requestor a new route. A potential management method determines the success rate of the local route recovery and consequent route optimality. In our simulation with a moderate node density and high node mobility, over 95% of broken routes are recovered with 1 hop request. PMPR outperforms DSDV for all the simulated parameters. PMPR also outperforms AODV and DSR under a high node mobility and high traffic load condition. Under a low node mobility or low data rate condition, PMPR provides comparable performance to AODV and DSR.

Original languageEnglish
Title of host publication2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009
Pages273-280
Number of pages8
DOIs
Publication statusPublished - 2009 Nov 20
Event11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009 - Seoul, Korea, Republic of
Duration: 2009 Jun 252009 Jun 27

Other

Other11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009
CountryKorea, Republic of
CitySeoul
Period09/6/2509/6/27

Fingerprint

Mobile ad hoc networks
Routing protocols
Recovery
Broadcasting

Keywords

  • Local routing
  • MANET
  • Potential based routing protocol

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Kwon, D. Y., Chung, J. H., Suh, T., Lee, W. G., & Hur, K. (2009). A potential based routing protocol for mobile ad hoc networks. In 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009 (pp. 273-280). [5167004] https://doi.org/10.1109/HPCC.2009.83

A potential based routing protocol for mobile ad hoc networks. / Kwon, Dai Yong; Chung, Jae Hwa; Suh, Taeweon; Lee, Won Gyu; Hur, Kyeong.

2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009. 2009. p. 273-280 5167004.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kwon, DY, Chung, JH, Suh, T, Lee, WG & Hur, K 2009, A potential based routing protocol for mobile ad hoc networks. in 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009., 5167004, pp. 273-280, 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009, Seoul, Korea, Republic of, 09/6/25. https://doi.org/10.1109/HPCC.2009.83
Kwon DY, Chung JH, Suh T, Lee WG, Hur K. A potential based routing protocol for mobile ad hoc networks. In 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009. 2009. p. 273-280. 5167004 https://doi.org/10.1109/HPCC.2009.83
Kwon, Dai Yong ; Chung, Jae Hwa ; Suh, Taeweon ; Lee, Won Gyu ; Hur, Kyeong. / A potential based routing protocol for mobile ad hoc networks. 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009. 2009. pp. 273-280
@inproceedings{6cada1f308914beb94c1f8b246026712,
title = "A potential based routing protocol for mobile ad hoc networks",
abstract = "In this paper, we propose a novel proactive routing protocol, referred to as potential management based proactive routing (PMPR), for mobile ad hoc networks. Unlike other proactive routing protocols, PMPR performs request based routing recovery for proactive route maintenance. When a node has lost the routing information, it attempts a local route recovery by broadcasting a request message to neighbor nodes within a limited hop range. If the local recovery succeeds, the routing information is reconstructed by the interaction between the requesting node and the neighbor nodes. In this paper, we introduce a concept of potential and propose an efficient management method of potential. Potential is a value assigned to each node for each destination. Routes are determined based on the potential of each node. When a node is requested to perform a route recovery and the recovery is feasible, the node modifies its potential to a lower value to provide the requestor a new route. A potential management method determines the success rate of the local route recovery and consequent route optimality. In our simulation with a moderate node density and high node mobility, over 95{\%} of broken routes are recovered with 1 hop request. PMPR outperforms DSDV for all the simulated parameters. PMPR also outperforms AODV and DSR under a high node mobility and high traffic load condition. Under a low node mobility or low data rate condition, PMPR provides comparable performance to AODV and DSR.",
keywords = "Local routing, MANET, Potential based routing protocol",
author = "Kwon, {Dai Yong} and Chung, {Jae Hwa} and Taeweon Suh and Lee, {Won Gyu} and Kyeong Hur",
year = "2009",
month = "11",
day = "20",
doi = "10.1109/HPCC.2009.83",
language = "English",
isbn = "9780769537382",
pages = "273--280",
booktitle = "2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009",

}

TY - GEN

T1 - A potential based routing protocol for mobile ad hoc networks

AU - Kwon, Dai Yong

AU - Chung, Jae Hwa

AU - Suh, Taeweon

AU - Lee, Won Gyu

AU - Hur, Kyeong

PY - 2009/11/20

Y1 - 2009/11/20

N2 - In this paper, we propose a novel proactive routing protocol, referred to as potential management based proactive routing (PMPR), for mobile ad hoc networks. Unlike other proactive routing protocols, PMPR performs request based routing recovery for proactive route maintenance. When a node has lost the routing information, it attempts a local route recovery by broadcasting a request message to neighbor nodes within a limited hop range. If the local recovery succeeds, the routing information is reconstructed by the interaction between the requesting node and the neighbor nodes. In this paper, we introduce a concept of potential and propose an efficient management method of potential. Potential is a value assigned to each node for each destination. Routes are determined based on the potential of each node. When a node is requested to perform a route recovery and the recovery is feasible, the node modifies its potential to a lower value to provide the requestor a new route. A potential management method determines the success rate of the local route recovery and consequent route optimality. In our simulation with a moderate node density and high node mobility, over 95% of broken routes are recovered with 1 hop request. PMPR outperforms DSDV for all the simulated parameters. PMPR also outperforms AODV and DSR under a high node mobility and high traffic load condition. Under a low node mobility or low data rate condition, PMPR provides comparable performance to AODV and DSR.

AB - In this paper, we propose a novel proactive routing protocol, referred to as potential management based proactive routing (PMPR), for mobile ad hoc networks. Unlike other proactive routing protocols, PMPR performs request based routing recovery for proactive route maintenance. When a node has lost the routing information, it attempts a local route recovery by broadcasting a request message to neighbor nodes within a limited hop range. If the local recovery succeeds, the routing information is reconstructed by the interaction between the requesting node and the neighbor nodes. In this paper, we introduce a concept of potential and propose an efficient management method of potential. Potential is a value assigned to each node for each destination. Routes are determined based on the potential of each node. When a node is requested to perform a route recovery and the recovery is feasible, the node modifies its potential to a lower value to provide the requestor a new route. A potential management method determines the success rate of the local route recovery and consequent route optimality. In our simulation with a moderate node density and high node mobility, over 95% of broken routes are recovered with 1 hop request. PMPR outperforms DSDV for all the simulated parameters. PMPR also outperforms AODV and DSR under a high node mobility and high traffic load condition. Under a low node mobility or low data rate condition, PMPR provides comparable performance to AODV and DSR.

KW - Local routing

KW - MANET

KW - Potential based routing protocol

UR - http://www.scopus.com/inward/record.url?scp=70449578244&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449578244&partnerID=8YFLogxK

U2 - 10.1109/HPCC.2009.83

DO - 10.1109/HPCC.2009.83

M3 - Conference contribution

AN - SCOPUS:70449578244

SN - 9780769537382

SP - 273

EP - 280

BT - 2009 11th IEEE International Conference on High Performance Computing and Communications, HPCC 2009

ER -