Information dissemination is extremely difficult in tactical edge networks, which provide one of the most challenging environments for communication. The extremely dynamic nature of the tactical environment makes dissemination algorithms based on overlay networks or epidemic routing ineffective, and calls for ad hoc approaches that can dynamically reconfigure the dissemination process, adapting it to the current network conditions. This paper presents the algorithms for opportunistic information dissemination adopted in the DisService project. In particular, the paper investigates what kind of knowledge can be inferred about the interaction between nodes in a tactical network and how to use that knowledge to improve data dissemination algorithms. The algorithms are tested in a NS3 simulated environment and the results demonstrate the effectiveness of the DisService approach.
DisService: Network State Monitoring and Prediction for Opportunistic Information Dissemination in Tactical Networks
STEFANELLI, Cesare;TORTONESI, Mauro;
2010
Abstract
Information dissemination is extremely difficult in tactical edge networks, which provide one of the most challenging environments for communication. The extremely dynamic nature of the tactical environment makes dissemination algorithms based on overlay networks or epidemic routing ineffective, and calls for ad hoc approaches that can dynamically reconfigure the dissemination process, adapting it to the current network conditions. This paper presents the algorithms for opportunistic information dissemination adopted in the DisService project. In particular, the paper investigates what kind of knowledge can be inferred about the interaction between nodes in a tactical network and how to use that knowledge to improve data dissemination algorithms. The algorithms are tested in a NS3 simulated environment and the results demonstrate the effectiveness of the DisService approach.I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.