35 search results - page 1 / 7 » Greedy Hop Distance Routing Using Tree Recovery on Wireless ... |
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
IJSNET
2007
13 years 4 months ago
2007
: Most wireless ad hoc sensor networks are susceptible to routing level attacks, in which an adversary masquerades as a legitimate node to convince neighbouring nodes that it is th...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In wireless ad-hoc sensor networks, an important issue often faced in geographic greedy forwarding routing is the “local minimum phenomenon” which is caused by deployment ho...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
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 ...
IJSNET
2006
13 years 4 months ago
2006
: In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless ...