Development of an Improved Security Aided and Group Encounter Prophet Routing Protocol of an Opportunistic Network

Development of an Improved Security Aided and Group Encounter Prophet Routing Protocol of an Opportunistic Network.

ABSTRACT

One of the requirements for enabling two nodes to communicate through a network is the existence of a fully connected path between them. However, there are scenarios in wireless networks where this is not the case and yet nodes still need to communicate freely.

Despite concerted efforts to resolve this problem of unconnected wireless nodes trying to relay crucial information, network users still experience significant communication challenges owing to failures or the non-existence of critical infrastructural links between nodes and their security challenges.

This research work is aimed at enhancing the security component of the PRoPHET routing protocol by incorporating internodes cooperation. The simulation was carried out using the opportunistic network environment (ONE). This report presents the modeled opportunistic network using the security-aided and group encounter for the prophet routing protocol.

Node cooperation technique was developed and incorporated into the security aided and groups encounter PRoPHET routing protocol in order to improve its security.

For the 20-node test scenario considered, the improved security aided and group encounter PRoPHET routing protocol outperformed the method proposed in the security aided and group encounter PRoPHET routing protocol of Basu et al., (2015) by 19.6%, 7.9%, 34.7% for delivery probability, hop count and buffer time and for the benchmark Helsinki simulation area considered.

It outperformed the method implemented in the work of Basu et al., (2015) by 25.7%, 62.9%, 55.5% with respect to delivery probability, hop count, and buffer time respectively.

Results showed that node cooperation technique improved the security aided and groups encounter PRoPHET routing protocol because it increased the delivery probability, reduced the latency, reduced the hop count, and increased the buffer time when tested on a 20-node test program and on the benchmark Helsinki simulation area at the end of the simulation time of 44000 seconds.

TABLE OF CONTENTS

DECLARATION i
CERTIFICATION ii
DEDICATION iii
ACKNOWLEDGEMENT iv
ABSTRACT v
TABLE OF CONTENT vi
LIST OF FIGURES x
LIST OF ABBREVIATIONS xi
CHAPTER ONE: INTRODUCTION
1.1 Background 1
1.2 Significance of Research 4
1.3 Problem Statement 4
1.4 Research Aim and Objectives 5
CHAPTER TWO: LITERATURE REVIEW
2.1 Introduction 6
2.2 Review of Fundamental Concepts 6
2.2.1 Opportunistic networks 6
2.2.2 Routing in an Opportunistic Network 7
2.2.3 Other Candidate Routing Protocols for Context-Based Opportunistic Network 9 2.2.3.1 Context-Aware Routing 9
2.2.3.2 Mobility Space Routing (MobySpace Routing) 9
2.2.3.3 Bubble-Rap 9
2.2.3.4 PRoPHET + (Probability Routing using History of Encounter and Transitivity plus) 10
2.2.3.5 PRoPHET (Probability Routing using History of Encounter and Transitivity) 10
2.2.4 PRoPHET Routing Protocol 10
2.2.5 Security Threats and Requirements 12
2.2.6 Disaster Response and Infrastructure 12
2.2.7 Post Disaster Relief Operation 14
2.2.8 PRoPHET for Group Encounter Routing 14
2.2.9 Pin Distributions at the Setup Phase 15
2.2.10 Modifying PRoPHET for Group Encounter Routing 16
2.2.11 Group Encounter Based and Security 17
2.2.11.1 Shelter-Node’s Generation and Encryption of Message 18
2.2.11.2 Signing Message at Shelter-Node to Avoid Bundle Store Overflow Attack 18
2.2.11.3 Handling Identity Spoofing Attack Using Group-Based Authentication 19
2.2.11.4 Challenge-Response Technique 19
2.2.11.5 Key Encryption Technique 20
2.2.11.6 Verification of Message at Forwarder-node 21
2.2.11.7 Preventing Blackhole attacks Using Encounter Tokens 21
2.2.11.8 Encounter Token Verification at Forwarder-Node 22
2.2.12 Node Cooperation in Opportunistic Network 24
2.2.13 Helsinki simulation area 24
2.3 Review of similar works 25
CHAPTER THREE: MATERIALS AND METHODS
3.1 Introduction 33
3.2 Modelling the Java Platform 34
3.2.1 Java Development Kit 34
3.2.2 Configuring of Environment Variables 34
3.3 Setting up the Java Development Environment 35
3.4 Setting up the ONE Simulator 37
3.4.1 Download the ONE 1.5.1-RC2 37
3.5 Interfacing the IDE with ONE-RC 37
3.6 Setting up the Routing Protocol 37
3.6.1 Modelling PRoPHET Routing Protocol on Test Case 38
3.6.2 Modelling Post Disaster based Scenario for PRoPHET Routing in Helsinki 40
3.6.3 PRoPHET based Node Cooperation 43
CHAPTER FOUR: RESULTS AND DISCUSSIONS
4.1 Introduction 47
4.2 Performance Evaluation for Test Node 47
4.3 Performance Evaluation for Helsinki 50
CHAPTER FIVE: CONCLUSION AND RECOMMENDATIONS
5.1 Introduction 54
5.2 Summary of Findings 54
5.3 Conclusions 54
5.4 Significant Contributions 55
5.4.1 Limitations 55
5.5 Recommendations 56
REFERENCE: 57

Appendix A1 61

INTRODUCTION

1.1 Background

Mobile Ad-hoc Network (MANET) is defined as a collection of communication devices or nodes that communicate without any fixed infrastructure and pre-determined organization of available links (Dinakar et al.,, 2012).

The Opportunistic Network (OppNet), also called any path routing, is characterized as a necessary evolution of traditional MANET with providing wireless network properties.

OppNet consists of both fixed and human-carried mobile devices (nodes) that communicate with each other with or without any infrastructure (a central command station that monitors and controls the activities of the network)(Papaj et al.,, 2012).

OppNets are formed by individual nodes. All nodes can be disconnected for some time intervals and each opportunistically exploits any contact with other nodes to forward its messages (Papaj et al., 2012). Each node computes the best paths based on its knowledge of the routes.

REFERENCE

Asplund, M., Nadjm-Tehrani, S., & Sigholm, J. (2008). Emerging information infrastructures: Cooperation in disasters. Paper presented at the International Workshop on Critical Information Infrastructures Security. 258-270
Basu, S., Bhattacharjee, S., Roy, S., & Bandyopadhyay, S. (2015). SAGE-PRoPHET: A Security Aided and Group Encounter based PRoPHET Routing Protocol for Dissemination of Post Disaster Situational Data. Paper presented at the Proceedings of the 2015 International Conference on Distributed Computing and Networking. 10-20
Chang, M., Chen, R., Bao, F., & Cho, J.-H. (2011). Trust-Threshold Based Routing in Delay Tolerant Netwo
rks. Paper presented at the IFIP International Conference on Trust Management. 265-276
Chen, R., Bao, F., Chang, M., & Cho, J.-H. (2012). Integrated social and QoS trust-based routing in delay tolerant networks. Wireless Personal Communications, 66(2), 443-459.