Sciweavers

2705 search results - page 274 / 541
» Splitting the sensor node
Sort
View
AINA
2009
IEEE
15 years 11 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...
ICDCSW
2009
IEEE
15 years 11 months ago
EDLA Tradeoffs for Wireless Sensor Network Target Tracking
—The number of active nodes in a WSN deployment governs both the longevity of the network and the accuracy of applications using the network’s data. As node hibernation techniq...
Richard Tynan, Gregory M. P. O'Hare, Michael J. O'...
IWCMC
2006
ACM
15 years 10 months 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
MOBIHOC
2010
ACM
15 years 2 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 6 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...