Sciweavers

436 search results - page 48 / 88
» A distributed algorithmic framework for coverage problems in...
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 2 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
TWC
2008
135views more  TWC 2008»
13 years 7 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
EWSN
2009
Springer
14 years 8 months ago
Cooperative Intrusion Detection in Wireless Sensor Networks
We consider the problem of cooperative intrusion detection in wireless sensor networks where the nodes are equipped with local detector modules and have to identify the intruder in...
Ioannis Krontiris, Zinaida Benenson, Thanassis Gia...
SASO
2008
IEEE
14 years 2 months ago
Self-Adaptive Dissemination of Data in Dynamic Sensor Networks
The distribution of data in large dynamic wireless sensor networks presents a difficult problem due to node mobility, link failures, and traffic congestion. In this paper, we pr...
David Dorsey, Bjorn Jay Carandang, Moshe Kam, Chri...