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 of a sensor net work (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. This paper presents a self-adapting maxflow routing algorithm which is able to route any sustainable workload while automatically adapting to time-varying operating conditions. The algorithm has been implemented on top of OMNeT++ [1] in order to address practical issues and to enable simulation-based assessment and design exploration Simulation results demonstrate the effectiveness and the applicability of the proposed approach
Self-Adapting Maxflow Routing Algorithms: Practical Issues and Simulation-Based Assessment
SERAGHITI, ANDREA;DELPRIORI, SAVERIO;LATTANZI, EMANUELE;BOGLIOLO, ALESSANDRO
2008
Abstract
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 of a sensor net work (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. This paper presents a self-adapting maxflow routing algorithm which is able to route any sustainable workload while automatically adapting to time-varying operating conditions. The algorithm has been implemented on top of OMNeT++ [1] in order to address practical issues and to enable simulation-based assessment and design exploration Simulation results demonstrate the effectiveness and the applicability of the proposed approachI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
