Sciweavers

6506 search results - page 260 / 1302
» Algorithmic models for sensor networks
Sort
View
INTERSENSE
2006
ACM
15 years 10 months ago
Particle-based methodology for representing mobile ad-hoc networks
—We present a methodology based on physics laws and particles in order to represent, simulate, and architect advanced networking models. We introduce a mathematical formalism wit...
Carlos J. Martinez, Marisa López, Luis C. E...
WIOPT
2010
IEEE
15 years 2 months ago
Minimizing transmission energy in sensor networks via trajectory control
—Energy optimization is a significant component of Wireless Sensor Network (WSN) design. In this paper we consider transmission energy optimization in WSNs where messages are co...
Delia Ciullo, Guner D. Celik, Eytan Modiano
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 6 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
EWSN
2009
Springer
16 years 5 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
SENSYS
2003
ACM
15 years 9 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak