Sciweavers

497 search results - page 57 / 100
» Curve-Based Greedy Routing Algorithm for Sensor Networks
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
ESAS
2005
Springer
14 years 2 months ago
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...
Gergely Ács, Levente Buttyán, Istv&a...
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
14 years 9 months ago
System design issues in sensor databases
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
Qiong Luo, Hejun Wu
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
CJ
2008
108views more  CJ 2008»
13 years 9 months ago
Computing with Time: From Neural Networks to Sensor Networks
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...
Boleslaw K. Szymanski, Gilbert Chen