Sciweavers

2282 search results - page 347 / 457
» Detecting Compromised Nodes in Wireless Sensor Networks
Sort
View
ICDCS
2006
IEEE
15 years 10 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CCS
2006
ACM
15 years 8 months ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
ICNP
2007
IEEE
15 years 10 months ago
Multicast Algorithms for Multi-Channel Wireless Mesh Networks
— Multicast is a key technology that provides efficient data communication among a set of nodes for wireless multi-hop networks. In sensor networks and MANETs, multicast algorit...
Guo-Kai Zeng, Bo Wang 0001, Yong Ding, Li Xiao, Ma...
IPCCC
2007
IEEE
15 years 10 months ago
ACM: A Transmission Mechanism for Urgent Sensor Information
The wireless sensor network (WSN) is one of the most promising technologies which helps making our society safe, secure, and comfortable. A WSN as a social infrastructure must tra...
Tetsuya Kawai, Naoki Wakamiya, Masayuki Murata
116
Voted
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 4 months ago
Decentralized sequential change detection using physical layer fusion
— We study the problem of decentralized sequential change detection with conditionally independent observations. The sensors form a star topology with a central node called fusio...
Leena Zacharias, Rajesh Sundaresan