Query localization techniques for on-demand routing protocols in ad hoc networks

Query localization techniques for on-demand routing protocols in ad hoc networks (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Castañeda

Venue:	in 5th Annual International Conference on Mobile Computing and Networking (MobiCom
Citations:	70 - 2 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Query localization techniques for on-demand routing protocols in ad hoc networks	INFERENCE
AUTHOR NAME	Robert Castañeda	SVM HeaderParse 0.2
AUTHOR AFFIL	; Division of Computer Science, The University of Texas at San Antonio, San Antonio; SAMIR R. DAS and MAHESH K. MARINA; Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati	SVM HeaderParse 0.2
AUTHOR ADDR	; TX 78249-0667, USA; OH 45221-0030, USA	SVM HeaderParse 0.2
ABSTRACT	Abstract. Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our technique utilizes prior routing histories to localize the query flood to a limited region of the network. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.	SVM HeaderParse 0.2
YEAR	1999	INFERENCE
VENUE	in 5th Annual International Conference on Mobile Computing and Networking (MobiCom	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	23 found	ParsCit 1.0