1464 search results - page 183 / 293 » Worst case mobility in ad hoc networks |
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
WCNC
2008
IEEE
14 years 3 months ago
2008
IEEE
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
ICISC
2009
13 years 6 months ago
2009
At CANS 2008, Mashatan and Stinson suggested a message recognition protocol for ad hoc pervasive networks. The protocol provides a procedure to resynchronize in case of a (possibly...
ACSAC
2004
IEEE
14 years 21 days ago
2004
IEEE
Mobile ad hoc network routing protocols are highly susceptible to subversion. Previous research in securing these protocols has typically used techniques based on encryption and r...
ICPP
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...