Evaluación de algoritmos de propagación de mensajes en redes oportunistas

Abstract

Development of Mobile Ad-hoc NETworks (MANETs) has motivated because the introduction of small intelligent devices with highest process and connectivity possibilities. Moreover, nodes have more mobility and versatility that increase the uncertainty of MANET, so Opportunistic Networks becomes a study case. In an Opportunistic Network the end-to-end links are unstable because network contacts are intermittent and link performance is highly variable or extreme, therefore networks latency can be too high. OppNet it can be consider as a sub-class of Delay Tolerant Networks (DTN). Given the above context, the traditional end-to-end routing protocols are not suitable for this kind of scenarios. Mobility, density, disruptions and limitations behind nodes are issues to consider. Different proposals routing algorithms has been proposed that attempt to maximize efficiency. These approaches are based on the principle of Store-Carry-Forward (SCF) taking advantage of mobility and the ability to process in intermediate nodes, that strategy has consequent consumption of resources (energy, processing, storage, etc.). Different propagation strategies at the application level have been proposed, such as Epidemic and Spray and Wait. This paper shows the study of resource consumption in intermediate nodes (energy and storage) and efficiency (message delivery Ratio and delay) for different propagation algorithms. In order to archive our goals we use an NS-3 simulator and synthetic scenarios. Key-words: Opportunistic Networks, Delay To