DocumentCode
3492777
Title
The Optimization of DSR Protocol of Ad Hoc Network with Constrained Dynamic Query Localization Technique
Author
Guo Zhong-hua ; Shi Hao-shan
Author_Institution
Sch. of Electron. & Inf., Northwestern Polytech. Univ., Xian
fYear
2007
fDate
21-25 Sept. 2007
Firstpage
1585
Lastpage
1588
Abstract
To resolve the routing overhead problem of the ad hoc network DSR protocol resulted from flooding, this paper puts forward the optimization of DSR protocol with constrained dynamic query localization technique called LDSR protocol. Based on original DSR protocol and constrained by two factors: (1) the maximum number of hops of query localization flooding determined by the small-world theory; (2) effective routing time determined by mobile critical transmitting range for connectivity in ad hoc network and the maximum mobile speed of node, the LDSR protocol uses dynamic choice mechanism to limit query to a small region and to complete flooding localization. Simulation results shown that the LDSR protocol can reduce routing overhead and average end-to-end delay notably, but packet delivery fraction decreased slightly compared with DSR protocol.
Keywords
ad hoc networks; optimisation; query processing; routing protocols; LDSR protocol; ad hoc network; constrained dynamic query localization; end-to-end delay; flooding localization; optimization; packet delivery fraction; routing overhead; small-world theory; Ad hoc networks; Constraint optimization; Constraint theory; Delay; Mobile ad hoc networks; Network topology; Routing protocols; Spread spectrum communication; Wireless communication; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-1311-9
Type
conf
DOI
10.1109/WICOM.2007.399
Filename
4340174
Link To Document