Um estudo sobre algoritmos de roteamento para DTNs na Universidade Federal de Sergipe : campus de Itabaiana

Abstract

The Internet got a huge success, because to the good functioning of TCP/IP protocols in the last decades. However, the TCP/IP architecture is based on the existence of connectivity end-to-end, low error rateand small delays in communication. In scenarios with long delays and frequent disconnections, TCP/IP does not work properly. Then came a new protocol as an alternative, the Delay -Tolerant Networking (DTN), which enables the transmission of messages between machines in environments that are not able to establish and maintain a communication session end -to-end with little loss and low latency. For this, DTNs use a mechanism called store -and-forward, in which the intermediary devices store data until it can be delivered to the final recipient. The university campus is an example where the protocole DTNs could be applied. Considering the constant increase in the number of mobile users, and the lack of interest of universities to spend resources to increase the network coverage in every area of their campus, students devices could be used to provide communication independent of local infrastructure. This work aims to analyze the efficiency of the algorithms DTN Epidemic, PRoPHET and the First Contact, in school, from the Federal University of Sergipe, located in Itabaiana city. The efficiency of these algorithms was measured using metrics already established through various work area. It can be seen that the performance of First Contact protocol was superior to the others with a higher probability of message delivery, lower overhead, and a small amount of discarded messages, but had a high latency delivery of messages.