Development of a Privacy Aided Trust Routing Algorithm Based on Social Similarity in Opportunistic Network

Development of a Privacy Aided Trust Routing Algorithm Based on Social Similarity in Opportunistic Network.

ABSTRACT

This research work presents the development of a privacy-aided trust routing model using social similarity in an Opportunistic Network (OppNet). OppNet is a delay tolerant network where the link is highly unpredictable.

It is an ideal solution in situations where the deployment of wired and conventional wireless networks is difficult or practically impossible. However, OppNet is faced with several challenges.

Most of these challenges are related to routing, buffer management, or security. The most promising amongst the several approaches by researchers at addressing these challenges are the ones that explored the social behavior of human beings.

The mobile nature of OppNets however brought to the fore the need for a more efficient and effective security model. This work, therefore, intends to further strengthen privacy in an OppNet.

This is done by developing a community-based privacy preservation scheme using an asymmetric cryptographic model, based on a differential equation of a curvi-circular function by applying Galois theory.

The key distribution is made possible by partial application of the onion routing scheme. The developed privacy scheme is incorporated into trust routing based on social similarity (TRSS) to become Privacy Aided TRSS (PATRSS).

This approach improves the security in terms of the preservation of the privacy of messages and that of the relay nodes without compromising other network performance indicators.

Using metrics, such as delivery ratio, delivery cost, and average trust performance, PATRSS is simulated on the Opportunistic Network Environment (ONE) simulator.

PATRSS outperformed TRSS by 7.8%, 30.7%, and 9.4% in terms of delivery ratio, delivery cost, and average trust value respectively.

Finally, the TRSS and PATRSS which are originally routed on spray and wait for routing algorithms are implemented on Epidemic, PRoPHET, and MaxPreps.

Using numbers of messages duplicated, those aborted, and those delivered as metrics, the results are presented to clearly show the network performance, the improvements, and the costs. These demonstrate the effectiveness and efficiency of PATRSS.

TABLE OF CONTENTS

DECLARATION ………… i
CERTIFICATION ……………. ii
DEDICATION ………………. iii
ACKNOWLEDGEMENT ……… iv
ABSTRACT ……………….. v
LIST OF FIGURES ……………….. ix
LIST OF TABLES ………….. x
LIST OF ABBREVIATIONS ………. xi
CHAPTER ONE ……………………… 1
INTRODUCTION ……….. 1
1.1 Background to Study ……. 1
1.2 Significance of Research …………… 3
1.3 Problem Statement …………. 4
1.4 Aim and Objectives …. 5
1.5 Motivation …………. 6
1.6 Thesis Organization…… 6
CHAPTER TWO ………………… 7
LITERATURE REVIEW ……………. 7
2.1 Introduction ……………………. 7
2.2 Review of Fundamental Concepts……….. 7
2.2.1 Opportunistic Network …………… 7
2.2.2 Classification of opportunist network routing protocols … 16
2.3 Opportunistic Network Environment Simulator .. 22
2.4 Network Security and Privacy……… 24
2.4.1 Onion Routing ………………… 27
2.5 Fundamentals of Galois Theorem ……… 28
2.5.1 Groups and group theory …….. 28
2.5.2 Symmetric groups ………… 29
2.5.3 Rings and polynomials …… 31
2.5.4 The Galois theorem ……. 31

2.6 Review of Similar Works ………. 32
CHAPTER THREE …………………….. 42
METHODS AND MATERIALS ……………… 42
3.1 Introduction ……………… 42
3.2 Methodology ………………. 42
3.3 Datasets and Trust Model ……… 44
3.4 Trust Routing………………………………………… 45
3.5 Development of Privacy Preservation …………… 46
3.5.1 Development of message privacy ………….. 46
3.5.2 Development of relay node’s privacy ……. 50
3.6 Incorporation of Privacy into trust routing ……… 51
3.7 Modelling The Datasets ……………………… 54
3.8 Model Test Case ……………………. 54
3.8.1 Simulations ………………………… 55
3.8.2 Validating of PATRSS in epidemic PRoPHET and MaxProp ……… 57
CHAPTER FOUR …………………… 58
RESULTS AND DISCUSSION …………….. 58
4.1 Introduction …………………….. 58
4.2 Dataset Modelling ……………… 58
4.3 Performance of PATRSS in Terms of Delivery Ratio …… 59
4.4 Performance of PATRSS in Terms of Delivery Cost ………. 60
4.5 Performance of PATRSS in Terms of Average Trust Value …. 62
4.7 Validation of PATRSS with Common Routing Protocols ………. 64
CHAPTER FIVE ………………………….. 68
CONCLUSION AND RECOMMENDATIONS …………… 68
5.1 Introduction ……….. 68
5.2 Summary ………… 68
5.3 Conclusion …………………. 68
5.4 Contribution to Knowledge ………………. 68
5.5 Recommendations for Further Work……………….. 69
REFERENCE …………….. 70
Appendix …………………. 82

INTRODUCTION

1.1 Background to the Study

An opportunistic Network (OppNet) is a type of Delay Tolerant Network (DTN) and an evolution of Mobile Ad-hoc Network (MANET) in which a message can be transferred from source to destination even if a continuous connection from the source to destination does not exist at any instance of time.

Therefore, it utilizes and relies upon the opportunistic pair-wise contact between nodes in the network.

Thus, messages are routed (or forwarded) from one node to another at any point in time they are close enough within the very limited wireless range of each other.

This may happen repeatedly so that eventually, the message gets to the destination. Thus, it uses a store-carry-forward networking paradigm (C’amara et al., 2011; Musolesi & Mascolo, 2008).

REFERENCE

Abdelkader T., Naik K., Nayak A., Goel N. and Srivastava V. (2013). SGBR: A routing protocol for delay tolerant networks using social grouping, IEEE Transactions on Parallel and Distributed Systems, 24(12): 2472–2481.
Ahmad A., Alajeely M. and Doss R. (2016). Establishing trust relationships in opportunistic networks using Merkle trees. 2016 8th International Conference on Communication Systems and Networks (COMSNETS). 978-1-4673-9622-6/16.
Albuquerque J. C. D., Lucena S. C. D. and Campos C. A. V. (2016). Evaluating data communications in natural disaster scenarios using opportunistic networks with unmanned aerial vehicles. 19th International Conference on Intelligent Transportation Systems (ITSC) 2016. Windsor Oceanico Hotel, Rio de Janeiro, Brazil, November 1-4.
Arafath M. S., Khan K. U. R. and Sunitha K. V. N. (2017). Opportunistic sensor networks: A survey on privacy and secure routing. Retrieved from: https://www.researchgate.net/publication/317184962
Arastouie N. and Sabaei M. (2016). Data forwarding scheme to minimize end-to-end delay in opportunistic networks. 8th International Symposium on Telecommunications (IST’2016). DOI: 978-1-5090-3435-2/16
Atul K. (2013). Cryptography and network security. Third edition. Mc Grewhill (India) Private Limited New Delhi. ISBN 13: 978-1-25-902988-2