DocumentCode
3376428
Title
Performance Improvement of Flooding Algorithm in Highly Mobile Networks
Author
Park, Young C. ; Chae, Gyoo S. ; Lim, Joong S.
Author_Institution
Grad. Sch. of Info. & Tech., Cheonan Univ., Cheonan
fYear
2005
fDate
21-24 Nov. 2005
Firstpage
1
Lastpage
6
Abstract
In this paper we propose a modified flooding algorithm for highly mobile networks. This scheme minimizes the call set-up time and does not have to maintain routing tables. Because of its significant drawbacks with respect to the network efficiency, it has not found widespread applications. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched grid network without increasing the call set-up time and processor loading of the algorithm.
Keywords
mobile communication; switching networks; telecommunication network routing; blocking probability performance; call set-up time; circuit-switched grid network; highly mobile networks; minimum first-derivative length path; modified flooding algorithm; network efficiency; Broadcasting; Circuits; Floods; Mobile communication; Multicast protocols; Network topology; Packet switching; Routing protocols; Stress; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2005 2005 IEEE Region 10
Conference_Location
Melbourne, Qld.
Print_ISBN
0-7803-9311-2
Electronic_ISBN
0-7803-9312-0
Type
conf
DOI
10.1109/TENCON.2005.300901
Filename
4084896
Link To Document