Sciweavers

511 search results - page 66 / 103
» Anomaly-Based Intrusion Detection Algorithms for Wireless Ne...
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
MOBIHOC
2003
ACM
14 years 7 months ago
ESRT: event-to-sink reliable transport in wireless sensor networks
Wireless sensor networks (WSN) are event based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective...
Yogesh Sankarasubramaniam, Özgür B. Akan...
GI
2008
Springer
13 years 8 months ago
A Self-Organized Localization-Free Clustering Approach for Redundancy Exploitation in Large Wireless Sensor Networks
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
Jakob Salzmann
EWSN
2010
Springer
14 years 4 months ago
Selective Reprogramming of Mobile Sensor Networks through Social Community Detection
Abstract. We target application domains where the behavior of animals or humans is monitored using wireless sensor network (WSN) devices. The code on these devices is updated frequ...
Bence Pásztor, Luca Mottola, Cecilia Mascol...
SENSYS
2004
ACM
14 years 1 months ago
Practical and robust geographic routing in wireless networks
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...