Routing Optimization for Delay Tolerant Networks in Rural Applications Using a Distributed Algorithm

Internet access can improve people’s life quality by helping them to reduce and overcome the poverty and educational gaps. However, most rural communities in the world, specially in underdeveloped countries, do not have access to the Internet. Delay/Disruption Tolerant Networking (DTN) is a recent l...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computers, communications & control Vol. 10; no. 1; p. 100
Main Authors Velásquez-Villada, Carlos, Solano, Fernando, Donoso, Yezid
Format Journal Article
LanguageEnglish
Published Oradea Agora University of Oradea 01.02.2015
Subjects
Algorithms
Availability
Developing countries
Internet
Internet access
LDCs
Nodes
Optimization
Poverty
Quality of life
Routing
Rural areas
Rural communities
Technology
Transportation engineering
Ultrasonic testing
Online AccessGet full text

Cover

More Information
Summary:Internet access can improve people’s life quality by helping them to reduce and overcome the poverty and educational gaps. However, most rural communities in the world, specially in underdeveloped countries, do not have access to the Internet. Delay/Disruption Tolerant Networking (DTN) is a recent low-cost technology now being used to provide connectivity to rural towns were some transportation means periodically arrive. DTNs can be implemented to connect communities to Internet, since this technology takes advantage of the existing people’s transportation infrastructure using it to move packets and messages to and from Internet. This paper proposes a DTN mathematical optimization model that maximizes the availability probabilities of the paths from sources to destinations. We also present an opportunistic forwarding algorithm that takes into account the availability probability of a node’s neighbors to decide if a node should forward a message or store the message until a node with a higher availability probability contacts it. This algorithm was tested in five different scenarios and in all of them it found a path to the destination.
ISSN:1841-9836
1841-9844
DOI:10.15837/ijccc.2015.1.1569