Sciweavers

674 search results - page 22 / 135
» Finding Stable Routes in Mobile Ad Hoc Networks
Sort
View
103
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
CSREASAM
2006
15 years 3 months ago
Increasing Security in Mobile Ad Hoc Networks by Incentives to Cooperate and Secure Routing
A mobile ad hoc network is a self-organizing network that relies on the cooperation of participating nodes in order to function properly. In this network, mobile users arrive withi...
Ebrahim Khosravi, Brandy Tyson
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 6 days ago
Efficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing ...
K. Prasanth, K. Duraiswamy, K. Jayasudha, C. Chand...
MSWIM
2004
ACM
15 years 7 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
MOBIHOC
2002
ACM
16 years 1 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder