Sciweavers

30 search results - page 5 / 6
» Sharp thresholds for relative neighborhood graphs in wireles...
Sort
View
DCOSS
2006
Springer
13 years 9 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ICPP
2006
IEEE
13 years 12 months ago
Improving Spatial Reuse with Collision-Aware DCF in Mobile Ad Hoc Networks
—Carrier sensing is a medium access method widely adopted in wireless communication to protect data transfers from interference. For example, Distributed Coordination Function (D...
Lubo Song, Chansu Yu
IWCMC
2006
ACM
13 years 12 months ago
System approach to intrusion detection using hidden Markov model
In an era of cooperating ad hoc networks and pervasive wireless connectivity, we are becoming more vulnerable to malicious attacks. Many of these attacks are silent in nature and ...
Rahul Khanna, Huaping Liu
WIOPT
2006
IEEE
13 years 12 months ago
Color-based broadcasting for ad hoc networks
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
ALGOSENSORS
2004
Springer
13 years 11 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak