Sciweavers

916 search results - page 181 / 184
» The More Relay Nodes, the More Energy Efficient
Sort
View
AIPS
2009
13 years 9 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
CN
1998
64views more  CN 1998»
13 years 8 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
TWC
2010
13 years 3 months ago
Mitigating selective forwarding attacks with a channel-aware approach in WMNs
In this paper, we consider a special case of denial of service (DoS) attack in wireless mesh networks (WMNs) known as selective forwarding attack (a.k.a gray hole attacks). With su...
Devu Manikantan Shila, Yu Cheng, Tricha Anjali
TMC
2012
11 years 10 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
GIS
2005
ACM
14 years 9 months ago
Monitoring dynamic spatial fields using responsive geosensor networks
Information about dynamic spatial fields, such as temperature, windspeed, or the concentration of gas pollutant in the air, is important for many environmental applications. At th...
Matt Duckham, Silvia Nittel, Michael F. Worboys