Sciweavers

5911 search results - page 450 / 1183
» Annealing Sensor Networks
Sort
View
176
Voted
MOBIDE
2010
ACM
15 years 7 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
186
Voted
MOBIHOC
2008
ACM
16 years 6 months ago
Efficient configuration and control of sanets using facts
ization of domain-specific programming abstractions for wireless sensor actor networks can greatly ease application development. A high level of abstraction from underlying system...
Kirsten Terfloth, Jochen H. Schiller
204
Voted
NTMS
2009
IEEE
16 years 1 months ago
Minimizing Cost of Scalable Distributed Least Squares Localization
—Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. As a good s...
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
190
Voted
RTSS
2007
IEEE
16 years 1 months ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang
191
Voted
ADHOCNOW
2005
Springer
16 years 12 days ago
Probability Distributions for Channel Utilisation
Sensor nets have many undisputed fields of application. A paradigm of communication is the use of one control channel in the MAC layer. We challenge this paradigm for nodes with v...
Christian Schindelhauer, Kerstin Voß