Sciweavers

651 search results - page 10 / 131
» Cartesian Ad Hoc Routing Protocols
Sort
View
INFOCOM
2000
IEEE
13 years 11 months ago
Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the perf...
Samir Ranjan Das, Charles E. Perkins, Elizabeth M....
ICWN
2004
13 years 8 months ago
Sustaining Performance Under Traffic Overload
In this paper, we investigate the performance of wireless ad hoc networks with traffic loads beyond saturation. While it is desirable to operate a network below saturation, an ad h...
Saman Desilva, Rajendra V. Boppana
INFOCOM
2006
IEEE
14 years 1 months ago
A Brownian Motion Model for Last Encounter Routing
— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
Stratis Ioannidis, Peter Marbach
WOWMOM
2005
ACM
138views Multimedia» more  WOWMOM 2005»
14 years 27 days ago
A Scenario-Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks
Current ad hoc multicast routing protocols have been designed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in or...
Manoj Pandey, Daniel Zappala
GLOBECOM
2007
IEEE
14 years 1 months ago
Macro-Level and Micro-Level Routing (MMR) for Urban Vehicular Ad Hoc Networks
— Finding a reliable and efficient routing path in vehicular ad hoc networks (VANETs) is a challenging issue due to high mobility of vehicles and frequent link breakage. Motivat...
Youndo Lee, Hojin Lee, Nakjung Choi, Yanghee Choi,...