Loading...

Analysis and Improvement of Energy-Efficient Routing Algorithms for Delay Tolerant Networks

Ashoori, Mehri | 2017

2284 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 50736 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Pakravan, Mohammad Reza
  7. Abstract:
  8. Delay Tolerant Networks (DTNs) are sparse networks in which intermittent connectivity happens due to energy shortage or high mobility and long latency is unavoidable.These networks have a wide range of applications in our daily life such as internet of moving things. In delay tolerant networks, finding an end to end path between source and destination is almost impossible. Therefore, routing can’t be done based on finding an end to end path but it has to be done based on hop by hop sessions. In this thesis, we aim to represent an efficient routing algorithm for delay tolerant networks that can improve delivery probability, delivery cost and delivery latency.Our proposed routing algorithm is an informed routing algorithm. We exploit assumptions and observations of small world problem to impose some constraints on our proposed routing algorithm. The proposed routing algorithm is composed of three phases. In the first phase, required information is updated. In each encounter, the probability of encounter is recorded and updated by utilizing equations of MaxProp and PROPHET in the routing table of each node. Additionally, in each encounter nodes record geographic information of each other. In the second phase,we use recorded information for smart selection of relay node. This phase is done in two parts. In the first part, a utility function is derived based on the probability of encounters. In the second part, a relay node is selected according to recorded geographical information. In the end, in the third part, some mechanisms for message management are provided.Evaluation of the proposed routing algorithm is done by exploiting ONE simulator.The proposed routing algorithm is compared with PROPHET, MaxProp and GSaR under three scenarios. Results show that the proposed routing algorithm has an improved performance despite its simplicity
  9. Keywords:
  10. Delay Tolerant Networks (DTN) ; Utility Function ; Routing Algorithm ; Energy Efficient Routing ; Hybrid Routing ; Routing Based on History of Encounters ; Geographic Based Routing

 Digital Object List

 Bookmark

...see more