Development of an Improved Integrated Routing Protocol For Opportunistic Network with Congestion Control Using Pre-Emptive Data Eviction

Development of an Improved Integrated Routing Protocol For Opportunistic Network with Congestion Control Using Pre-Emptive Data Eviction.

Abstract

The opportunistic network is one of the interesting of mobile ad-hoc networks (manet).

In an opportunistic , information about the in which users communicate is not available as there is no dedicated complete path from a source to a .

This makes the design of an efficient routing protocol for an opportunistic network difficult.

The research is aimed at the development of an improved integrated routing protocol in opportunistic networks. The simulation was carried out using the opportunistic network environment (one) simulator.

This report presents the modeled opportunistic network using the epidemic, the prophet, and the integrated routing protocol.

Four pre-emptive congestion control strategies (use of acknowledgment, buffer size advertisement, data-centric method, and the avoidance of duplication) were developed and incorporated into the integrated routing protocol.

The integrated routing protocol outperformed the epidemic and the prophet routing protocols by 5.4% and 4.3%, respectively with respect to the delivery probability.

Results showed that the duplication avoidance improved the integrated routing protocol because it reduced the packet loss and improved the delivery probability when tested on a 10-node test model and on the benchmark Helsinki simulation area.

Duplication avoidance reduced the packet loss by 58% and improved the delivery probability by 4% at the end of the simulation time of 43200 seconds when compared with the delivery probability and packet loss of the original integrated routing protocol on Helsinki which is 0.1048 and 670, respectively.

The use of acknowledgment, buffer size advertisement, data-centric methods reduced the packet loss by 2.5%, 57%, and 57%, respectively but did not improve the delivery probability significantly.

The final delivery probabilities of the use of acknowledgment, buffer size advertisement, the data-centric method is 0.105, 0.103, and 0.105, respectively.

These results showed that duplication avoidance is the preferred congestion control strategy for the integrated routing considered in this research.

Table of Contents

DECLARATION iv

CERTIFICATION iv

DEDICATION v

ACKNOWLEDGEMENT vi

ABSTRACT vii

LIST OF FIGURES xi

LIST OF TABLES xiii

LIST OF ABBREVIATIONS xiv

CHAPTER ONE: INTRODUCTION

• Background 1
• Problem Statement 3
• Aim and Objectives 3
• Methodology 4
• Significant Contribution 5
• Thesis Organization 5

CHAPTER TWO: LITERATURE REVIEW

• Introduction 6
• Review of Fundamental Concepts 6
  • Opportunistic networks 6
  • Opportunistic network node definition 9
  • Opportunistic networks and mobile Ad-hoc network 10
  • Routing in opportunistic networks 12
• Dissemination-based Routing 13
• Context-based Routing 13
• Routing Based on Fixed Infrastructure 14
• Routing Based on Mobile Infrastructure 14
  • The Epidemic Routing protocol 14
  • The Prophet Routing Protocol 15
  • Integrated Routing Protocol 16
  • Integrated routing protocol probabilities 17
  • Routing strategies of the integrated routing 18
• Congestion in opportunistic networks 19
• Buffer management 20
• Pre-emptive data eviction 21
• Evaluating the Performance of DTN Routing Protocols 23
• The ONE Simulator 24

• Review of Similar Works 26

CHAPTER THREE: MATERIALS AND METHODS

• Introduction 35
• Model Test Case 35
• Installation and Configuration 36
• Simulation 36
• Visualization 47
• Simulation of the Improved Integrated Routing Protocol with Congestion Control 47
  • Buffer eviction using acknowledgment 47
• 2 Buffer size advertisement 48
  • Data-centric node congestion avoidance 49
  • Duplication avoidance 50
• Validation of the congestion control strategies 51

CHAPTER FOUR: RESULTS AND DISCUSSION

4.1 Introduction 57

4.1 The Performance Evaluation of the Congestion Control Strategies 57

4.3 General Discussion 66

CHAPTER FIVE: CONCLUSION AND RECOMMENDATIONS

• Introduction 68
• Conclusions 68
• Limitations  69
• Recommendations for Further Work 69

REFERENCES  70

Introduction

Background

Traditionally, communication between two or more devices in a network uses infrastructure-based wired networks.

In some instances, however, such communication is limited as it becomes difficult to expand the network due to cost, environment, etc.

This, coupled with the need for mobility and independence of network infrastructure, brought the need for wireless networks (Dinakar et al., 2013).

A wireless network uses access points and base stations (for mobility) to ensure communication among users and between users and the network.

Each base station and access point usually has a maximum number of defined users it can ideally handle.

These traditional wireless networks, however, have the following constraints (Dinakar et al., 2013) :

• Centralized administration is usually
• Power requirements to serve all the base stations and access
• Usually, capital intensive to deploy and scale
• Difficult to

The opportunistic network is an autonomous connection of users that communicate over a relatively bandwidth-constrained wireless network.

References

Amin, R., Wang, K.-C., & Ramanathan, P. (2007). An integrated routing and schedulingapproach for persistent vehicle communication in mobile wimax mesh networks.Paperpresented at the Military Communications Conference, 2007. MILCOM 2007. IEEE.
Asgari, C., Zareie, A., & Torkashvand, R. R. (2013). Intelligent Routing for Opportunistic Networks Based on Distributed Learning Automata. Journal of Basic and Applied Science Research, 3(7) 117-126.
Basalamah, A., Kim, S. M., Guo, S., He, T., & Tobe, Y. (2012). Link correlation aware opportunistic routing.Paper presented at the INFOCOM, 2012 Proceedings IEEE.
Bjurefors, F. (2014). Opportunistic networking: Congestion, Transfer Ordering and Resilience.http://uu.diva-portal.org/smash/get/diva2:713179/FULLTEXT01.pdf
Benamar, N., Singh, K.-D., Benamar, M., Ouadghiri, & D., Bonnin, J. Routing protocols in Vehicular Delay Tolerant Networks:A comprehensive survey, Computer Communications, Elsevier. 48 (2014) 141–158.
Chen, L.-J., Yu, C.-H., Sun, T., Chen, Y.-C., & Chu, H.-h. (2006).A hybrid routing approach for opportunistic networks.Paper presented at the Proceedings of the 2006 SIGCOMM workshop on Challenged networks, pp 213-220.