Sciweavers

5068 search results - page 638 / 1014
» Basic Computations in Wireless Networks
Sort
View
QSHINE
2009
IEEE
16 years 1 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
ADHOCNOW
2004
Springer
16 years 6 days ago
Adaptive Probing and Communication in Sensor Networks
Sensor networks consist of multiple low-cost, autonomous, ad-hoc sensors, that periodically probe and react to the environment and communicate with other sensors or devices. A prim...
Iftach Ragoler, Yossi Matias, Nimrod Aviram
PERCOM
2008
ACM
16 years 6 months ago
A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks
Service placement deals with the problem of selecting which node in a network is most suitable for hosting a service that responds to queries from other nodes. Optimally placing s...
Georg Wittenburg, Jochen H. Schiller
EWSN
2008
Springer
16 years 6 months ago
Que: A Sensor Network Rapid Prototyping Tool with Application Experiences from a Data Center Deployment
Several considerable impediments stand in the way of sensor network prototype applications that wish to realize sustained deployments. These are: scale, longevity, data of interest...
David Chu, Feng Zhao, Jie Liu, Michel Goraczko
203
Voted
WIOPT
2006
IEEE
16 years 24 days ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi