Sciweavers

1662 search results - page 133 / 333
» Soft Computing in Wireless Sensors Networks
Sort
View
ADHOCNOW
2008
Springer
15 years 8 months ago
An Energy-Efficient Query Aggregation Scheme for Wireless Sensor Networks
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
Jun-Zhao Sun
ADHOCNETS
2009
Springer
16 years 1 months ago
Optimal Cluster Sizes for Wireless Sensor Networks: An Experimental Analysis
Node clustering and data aggregation are popular techniques to reduce energy consumption in large WSNs and a large body of literature has emerged describing various clustering prot...
Anna Förster, Alexander Förster, Amy L. ...
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
15 years 7 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
KIVS
2011
Springer
14 years 9 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
198
Voted
MOBIHOC
2001
ACM
16 years 6 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...