Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2

MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the sh...

Full description

Saved in:
Bibliographic Details
Published in:2010 8th Annual Communication Networks and Services Research Conference pp. 376 - 380
Main Author: Herberg, Ulrich
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2010
Subjects:
Algorithm design and analysis
Communication networks
Communication system traffic control
Digital signal processing
Dijkstra
DSP
dynamic
Heuristic algorithms
incremental
MANET
Mobile ad hoc networks
Network topology
OLSRv2
routing
Routing protocols
Scalability
Shortest path problem
ISBN:9781424462483, 1424462487
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this paper, we investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a dynamic shortest path (DSP) algorithm for this routing protocol. A DSP algorithm is an algorithm that adds or removes edges in the routing tree incrementally and calculates shortest paths, also incrementally. The performance in OLSRv2 with classic Dijkstra vs. DSP is evaluated, by comparing the CPU time for calculating paths in a large emulated network. Additionally, it is demonstrated that frequent topology changes due to mobility in MANETs lead to frequent routing table recalculations with only few routes updated each time. This property of MANETs makes the use of a DSP in OLSRv2 appropriate.
AbstractList MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constrained low-power devices. One of the bottlenecks of scalability in link-state routing protocols is the performance of the shortest path algorithm (e.g. Dijkstra). In this paper, we investigate the in-node performance of OLSRv2 and, in particular, study the benefits of using a dynamic shortest path (DSP) algorithm for this routing protocol. A DSP algorithm is an algorithm that adds or removes edges in the routing tree incrementally and calculates shortest paths, also incrementally. The performance in OLSRv2 with classic Dijkstra vs. DSP is evaluated, by comparing the CPU time for calculating paths in a large emulated network. Additionally, it is demonstrated that frequent topology changes due to mobility in MANETs lead to frequent routing table recalculations with only few routes updated each time. This property of MANETs makes the use of a DSP in OLSRv2 appropriate.
Author Herberg, Ulrich
Author_xml – sequence: 1
  givenname: Ulrich
  surname: Herberg
  fullname: Herberg, Ulrich
  email: ulrich@herberg.name
  organization: Ecole Polytech., Palaiseau, France
BookMark eNpVjLFOwzAURY0ACSjZ2Fj8Ay2O7ST2WIUWEBGtmjJXL85zY5Q4yAmV-vcUwcJZrs4dzg258L1HQu5iNotjph_yt3Iz4-xH-RmJdKZiyaVMudTs_J8rcUWiYfhgJ2Ry-pJr8rrGYPvQgTdIFwdov2B0vae9pe-D83sK9PHooXOGlk0fRhxGuoaxofN23wc3Nh11nq6KcnPgt-TSQjtg9LcTsl0utvnztFg9veTzYuo0G6fWqIzpStVgaqwtT0WaGW4ESyBFIwTTUGsFRlnJVSUNoBZplVWVxMrWiGJC7n-zDhF3n8F1EI67RCot40x8A6K3UFM
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CNSR.2010.12
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781424462490
1424462495
9780769540412
0769540414
EndPage 380
ExternalDocumentID 5489417
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-fc8709b8dacdedf26367c2c305a6ec3309ad98ac8f428b4cae936b7bb4ebfdee3
IEDL.DBID RIE
ISBN 9781424462483
1424462487
IngestDate Wed Aug 27 02:37:11 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-fc8709b8dacdedf26367c2c305a6ec3309ad98ac8f428b4cae936b7bb4ebfdee3
PageCount 5
ParticipantIDs ieee_primary_5489417
PublicationCentury 2000
PublicationDate 2010-May
PublicationDateYYYYMMDD 2010-05-01
PublicationDate_xml – month: 05
  year: 2010
  text: 2010-May
PublicationDecade 2010
PublicationTitle 2010 8th Annual Communication Networks and Services Research Conference
PublicationTitleAbbrev CNSR
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000452445
ssib026765787
Score 1.4671922
Snippet MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should...
SourceID ieee
SourceType Publisher
StartPage 376
SubjectTerms Algorithm design and analysis
Communication networks
Communication system traffic control
Digital signal processing
Dijkstra
DSP
dynamic
Heuristic algorithms
incremental
MANET
Mobile ad hoc networks
Network topology
OLSRv2
routing
Routing protocols
Scalability
Shortest path problem
Title Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2
URI https://ieeexplore.ieee.org/document/5489417
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8IwGG6AePCkBozf6cGjE1hLux4NQkw0uAAHbqTt3soS3QwMfr9tx4YHL97anpZ23ft0fT4QuifAGHXkVluKIKDSiECGhAVM2CXRxvkhSx82wSeTaLEQcQM91FoYAPDkM3h0TX-Xn-R6636VdS26FrTPm6jJOSu1WtW7EzLOBpXPjP8K04GtXINKy8VCi8wri6d9n9REeNEdTmbTkujlsil_Ba34OjM--d8TnqLOQbCH47oUnaEGZG30Gh9EAXhUu3rj3GBPFMASP5d59Hi2cpzbTYFjCwjx0-dHvk6L1RdOM_z-Npvuwg6aj0fz4Uuwz04IUtErAqPtPhQqSqROIDEhI4zrUNvNLRloQnpCJiKSOjL2-KGoliAIU1wpCsokAOQctbI8gwvHfYqc8lkQzYA6fzIpOAiTMIv9lIUTl6jt5mH5XbpjLPdTcPX38DU6ru7fe_0b1CrWW7hFR3pXpJv1nV_SH-cUnJM
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8IwGG4QTfSkBozf9uDRCaylW48GMRhwLsCBG-nat7JENwOD3287tuHBi7e2p6Vd9z5dnw-E7gkwRi251ZQicKjQ3BEuYQ7jZkmktn7IIg-b8ILAn814WEMPlRYGAHLyGTzaZn6Xr1K5tr_KWgZdc9rx9tC-Tc4q1Frl2-Myj3VLp5n8O0y7pnZ1SzUXcw02L02eij6pqPC81Qsm4y3Vy6ZT_opaySvNy_H_nvEENXeSPRxWxegU1SBpoGG4kwXgfuXrjVONc6oAFvh5m0iPJwvLul1lODSQED99fqTLOFt84TjB76PJeOM20fSlP-0NnCI9wYl5O3O0NDuRR74SUoHSLiPMk64021swkIS0uVDcF9LX5gASUSmAExZ5UUQh0gqAnKF6kiZwbtlPvtU-cyIZUOtQJrgHXCtm0F9kAMUFath5mH9v_THmxRRc_j18hw4H07fRfPQaDK_QUXkb3-5co3q2XMMNOpCbLF4tb_Pl_QFFAZ_c
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+8th+Annual+Communication+Networks+and+Services+Research+Conference&rft.atitle=Performance+Evaluation+of+Using+a+Dynamic+Shortest+Path+Algorithm+in+OLSRv2&rft.au=Herberg%2C+Ulrich&rft.date=2010-05-01&rft.pub=IEEE&rft.isbn=9781424462483&rft.spage=376&rft.epage=380&rft_id=info:doi/10.1109%2FCNSR.2010.12&rft.externalDocID=5489417
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424462483/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424462483/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424462483/sc.gif&client=summon&freeimage=true