Sciweavers

5911 search results - page 733 / 1183
» Annealing Sensor Networks
Sort
View
IWNAS
2006
IEEE
16 years 27 days ago
Comparisons of Three Kalman Filter Tracking Algorithms in Sensor Network
This paper compares extended Kalman filters with the P, PV and PVA dynamics models for object tracking in wireless network. Experiments shows that PVA achieves the best and P per...
Yifeng Zhu, Ali Shareef
TSP
2008
76views more  TSP 2008»
15 years 6 months ago
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks
We consider the problem of decentralized detection in failure-prone tree networks with bounded height. Specifically, we study and contrast the impact on the detection performance o...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
AINA
2009
IEEE
16 years 1 months ago
Medium Access Control in Large Scale Clusters for Wireless Sensor Networks
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...
IWCMC
2006
ACM
16 years 25 days ago
Priority-based receiver-side relay election in wireless ad hoc sensor networks
Receiver-side relay election has been recently proposed as an alternative to transmitter-side relay selection in wireless ad hoc networks. In this paper we study different priori...
Komlan Egoh, Swades De
BROADNETS
2004
IEEE
15 years 10 months ago
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
Murat Demirbas, Anish Arora, Vineet Mittal, Vinod ...