Sciweavers

545 search results - page 76 / 109
» Minimum energy accumulative routing in wireless networks
Sort
View
DMSN
2004
ACM
14 years 2 months ago
A framework for spatio-temporal query processing over wireless sensor networks
Wireless sensor networks consist of nodes with the ability to measure, store, and process data, as well as to communicate wirelessly with nodes located in their wireless range. Us...
Alexandru Coman, Mario A. Nascimento, Jörg Sa...
ISAAC
2005
Springer
117views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Basic Computations in Wireless Networks
Abstract. In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show tha...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
ADHOCNOW
2008
Springer
14 years 3 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
COMCOM
2007
136views more  COMCOM 2007»
13 years 8 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan
JUCS
2006
117views more  JUCS 2006»
13 years 8 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...