1359 search results - page 176 / 272 » Equational Reasoning on Mobile Ad Hoc Networks |
INFOCOM
2010
IEEE
14 years 9 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...
141
click to vote
WIOPT
2011
IEEE
14 years 2 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
91
Voted
ADHOC
2006
14 years 11 months ago
2006
Routing in ad-hoc networks is a complicated task because of many reasons. The nodes are low-memory, lowpowered, and they cannot maintain routing tables large enough for well-known ...
ACSAC
2004
IEEE
15 years 2 months 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
15 years 3 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...