Data networks
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
DSPs for Energy Harvesting Sensors: Applications and Architectures
IEEE Pervasive Computing
Design considerations for solar energy harvesting wireless embedded systems
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Energetic sustainability of environmentally powered wireless sensor networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Power management in energy harvesting sensor networks
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Energetic sustainability of routing algorithms for energy-harvesting wireless sensor networks
Computer Communications
Guest Editorial: Network coverage and routing schemes for wireless sensor networks
Computer Communications
The emergence of a networking primitive in wireless sensor networks
Communications of the ACM - Web science
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A study of self-organization mechanisms in ad hoc and sensor networks
Computer Communications
On hierarchical routing in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Low-latency routing for energy-harvesting sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Device characterization and cross-layer protocol design for RF energy harvesting sensors
Pervasive and Mobile Computing
| Hi-index | 0.00 |
Autonomous wireless sensor networks are subject to power, bandwidth, and resource limitations that can be represented as capacity constraints imposed to their equivalent flow networks. The maximum sustainable workload (i.e., the maximum data flow from the sensor nodes to the collection point which is compatible with the capacity constraints) is the maxflow of the flow network. Although a large number of energy-aware routing algorithms for ad-hoc networks have been proposed, they usually aim at maximizing the lifetime of the network rather than the steady-state sustainability of the workload. Energy harvesting techniques, providing renewable supply to sensor nodes, prompt for a paradigm shift from energy-constrained lifetime optimization to power-constrained workload optimization.This paper presents a self-adapting maximum flow (SAMF) routing strategy which is able to route any sustainable workload while automatically adapting to time-varying operating conditions. The theoretical properties of SAMF routing are formally proved and a simulation model is developed on top of OMNeT++ ( http://www.omnetpp.org/ ) in order to enable simulation-based assessment and design exploration. Simulation results are reported which demonstrate the applicability of the proposed approach.