DocumentCode
3196456
Title
Carpooling in Mobile Ad Hoc Networks: the Case of Multiple-Target Route Discovery
Author
Bai, Rendong ; Singhal, Mukesh
Author_Institution
Dept. of Comput. Sci., Univ. of Kentucky, Lexington, KY
fYear
2007
fDate
16-20 April 2007
Firstpage
1
Lastpage
9
Abstract
Carpooling is an efficient transportation option in real life because it reduces traffic and cost. We apply this idea to MANETs and propose multiple-target route discovery (MTRD) for on-demand routing protocols. MTRD aggregates multiple route requests into one RREQ message and discovers multiple targets simultaneously. When a node has to find a route to a destination, instead of immediately injecting a new RREQ message into the network, the node tries to discover a route by attaching its request to in-transit RREQ packets that it relays for other nodes. MTRD improves routing performance by reducing the number of regular route discoveries. The results of an extensive simulation study show that MTRD improves the routing performance significantly. Moreover, several important properties of MTRD are analyzed.
Keywords
ad hoc networks; routing protocols; MANET; RREQ message; carpooling; mobile ad hoc networks; multipletarget route discovery; on-demand routing protocols; Aggregates; Costs; Joining processes; Media Access Protocol; Mobile ad hoc networks; Mobile computing; Physical layer; Relays; Road transportation; Routing protocols; AODV; Mobile ad hoc networks; carpool; on-demand; route discovery; routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops, 2007. WiOpt 2007. 5th International Symposium on
Conference_Location
Limassol
Print_ISBN
978-1-4244-0960-0
Electronic_ISBN
978-1-4244-0961-7
Type
conf
DOI
10.1109/WIOPT.2007.4480025
Filename
4480025
Link To Document