Sciweavers

6506 search results - page 457 / 1302
» Algorithmic models for sensor networks
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
Attack Detection in Wireless Localization
— Accurately positioning nodes in wireless and sensor networks is important because the location of sensors is a critical input to many higher-level networking tasks. However, th...
Yingying Chen, Wade Trappe, Richard P. Martin
JSS
2008
122views more  JSS 2008»
15 years 5 months ago
Traffic-aware stress testing of distributed real-time systems based on UML models using genetic algorithms
This report presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in Distributed Real-Time Systems (DRTS). T...
Vahid Garousi, Lionel C. Briand, Yvan Labiche
DEBS
2008
ACM
15 years 8 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
ICASSP
2008
IEEE
16 years 1 months ago
Compressive wireless arrays for bearing estimation
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
Volkan Cevher, Ali Cafer Gurbuz, James H. McClella...
JCO
2008
134views more  JCO 2008»
15 years 6 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...