PERFORMANCE AND SECURITY ANALYSES OF ROUTING FOR DELAY TOLERANT NETWORKS

(1)

SPECIAL ISSUE - 5 Inter National Level Conference - “MEEMIC – 2019”

IJIRIS: Mendeley (Elsevier Indexed) CiteFactor Journal Citations Impact Factor 1.23

Impact Factor Value – SJIF: Innospace, Morocco (2016): 4.651| Indexcopernicus: (ICV 2016): 88.20

PERFORMANCE AND SECURITY ANALYSES OF ROUTING FOR DELAY TOLERANT NETWORKS

Manojkumar P, Vengatesh M, Praveen M, Guided by

Dr.Saravanan.G, Assistant Professor Department of Information Technology,

Sengunthar College of Engineering, Tiruchengode, Tamilnadu, India.

Manuscript History

Number: IJIRIS/RS/Vol.06/Issue03/MRBIS10084 DOI: 10.26562/IJIRAE.2019.MRIS10084

Received: 03, March 2019 Final Correction: 11, March 2019 Final Accepted: 18 Marcy 2019 Published: March 2019

Editor: Dr.A.Arul L.S, Chief Editor, IJIRIS, AM Publications, India

Copyright: ©2019 This is an open access article distributed under the terms of the Creative Commons Attribution License, Which Permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited

Abstract – These works proposes anonymous routing protocols for DTNs and augment the existing solution with multi-copy message forwarding. Then, we construct simplified mathematical models, which can be used to understand the fundamental performance and security guarantees of onion-based anonymous routing in DTNs. To be specific, the delivery rate, message forwarding cost, traceable rate, and path and node anonymity are defined and analyzed. The numerical and simulation results using randomly generated contact graphs and the real traces demonstrate that our models provide very close approximations to the performance of the anonymous DTN routing protocol.

I. INTRODUCTION I.I GENERAL

This is more security the transaction among the users. We have mentioned two characteristics between the users.

We use two user’s hidden characteristics, named and encrypted data to store in public server. Present a new proactive resource allocation approach with aim of decreasing impact of unauthorized users.

OBJECTIVE:

To address the challenge, in this paper, we develop a solution framework, namely Ameba, for timely delivery. In detail, we first leverage content properties to derive an optimal routing hop count of each content to maximize the number of needed nodes. Next, we develop node utilities to capture interests, capacity and locations of mobile devices. Finally, the distributed forwarding scheme leverages the optimal routing hop count and node utilities to deliver content towards the needed nodes in a timely manner. Illustrative results verify that Ameba achieves comparable delivery ratio as Epidemic but with much lower overhead.

Literature Survey:

Title : DTN Routing as a Resource Allocation Problem Author : Brian Neil Levine

Year : 2007

Description: Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, and so these approaches have only an incidental effect on routing such metrics as maximum or average delivery delay. In this paper, we present rapid, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline.

(2)

© 2014- 19, IJIRIS- All Rights Reserved Page -216 The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per- packet utilities which determine how packets should be replicated in the system. We evaluate rapid rigorously through a prototype deployed over a vehicular DTN test bed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real DTN at this scale. Our results suggest that rapid significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads RAPID is within 10% of the optimal performance.

Title : An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks Author : Cong Liu and Jie Wu

Year : 2009

Description: Due to uncertainty in nodal mobility, DTN routing usually employs multi-copy forwarding schemes. To avoid the cost associated with coding, much export has been focused on probabilistic forwarding, which aims to reduce the cost of forwarding while retaining a high performance rate by forwarding messages only to nodes that have high delivery probabilities. This paper aims to provide an optimal forwarding protocol which maximizes the expected delivery rate while satisfying a certain constant on the number of forwarding’s per message. In our proposed optimal probabilistic forwarding (OPF) protocol, we use an optimal probabilistic forwarding metric derived by modeling each forwarding as an optimal stopping rule problem. We also present several extensions to allow OPF to use only partial routing information and work with other probabilistic forwarding schemes such as ticket-based forwarding. We implement OPF and several other protocols and perform trace-driven simulations.

Simulation results show that the delivery rate of OPF is only 5% lower than epidemic, and 20% greater than the state-of-the-art delegation forwarding while generating 5% more copies and 5% longer delay.

Title : Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Author : Wei Gao

Year : 2014

Description: Opportunistic mobile networks consist of mobile devices which are intermittently connected via short- range radios. Forwarding in such networks relies on selecting relays to carry and deliver data to destinations upon opportunistic contacts. Due to the intermittent network connectivity, relays in current forwarding schemes are selected separately in a distributed manner. The contact capabilities of relays hence may overlap when they contact the same nodes and because forwarding redundancy. This redundancy reduces the efficiency of resource utilization in the network, and may impair the forwarding performance if being ignored. In this paper, based on experimental investigations on the characteristics of forwarding redundancy in realistic mobile networks, we propose methods to eliminate unnecessary forwarding redundancy and ensure efficient utilization of network resources. We just develop techniques to eliminate forwarding redundancy with global network information, and then improve these techniques to be operable in a fully distributed manner with limited network information.

Title : Efficient and Privacy-Aware Data Aggregation in Mobile Sensing Author Qinghua Li, Guohong Cao

Year : 2013

Description: The proliferation and ever-increasing capabilities of mobile devices such as smart phones give rise to a variety of mobile sensing applications. This paper studies how an untrusted aggregator in mobile sensing can periodically obtain desired statistics over the data contributed by multiple mobile users, without compromising the privacy of each user. Although there are some existing works in this area, they either require bidirectional communications between the aggregator and mobile users in every aggregation period, or have high computation overhead and cannot support large plaintext spaces. Also, they do not consider the Min aggregate which is quite useful in mobile sensing. To address these problems, we propose an efficient protocol to obtain the Sum aggregate, which employs an additive holomorphic encryption and a novel key management technique to support large plaintext space. We also extend the sum aggregation protocol to obtain the Min aggregate of time-series data. To deal with dynamic joins and leaves of mobile users, we propose a scheme which utilizes the redundancy in security to reduce the communication cost for each join and leave. Evaluations show that our protocols are orders of magnitude faster than existing solutions, and it has much lower communication overhead.

Title : Routing in a Delay Tolerant Network Author :Sushant Jain

Year : 2004

Description: We formulate the delay-tolerant networking routing problem, where messages are to be moved end- to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of nitebuers at each node and the general property that no con- temporaneous end-to-end path may ever exist.

(3)

© 2014- 19, IJIRIS- All Rights Reserved Page -217 This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to and an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also end that with limited additional knowledge, far less than complete global knowledge, ancient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the rest such investigation of routing issues in DTNs.

Title : Study of a Bus-based Disruption-Tolerant Network: Mobility Modelling and Impact on Routing Author : Xiaolan Zhang

Year : 2007

Description: We study traces taken from UMass Diesel Net, a Disruption-Tolerant Network consisting of Wi-Fi nodes attached to buses. As buses travel their routes, they encounter other buses and in some cases are able to establish pair-wise connections and transfer data between them. We analyse the bus-to-bus contact traces to characterize the contact process between buses and its impact on DTN routing performance. We find that the all- bus-pairs aggregated intercontact times show no discernible pattern. However, the intercontact times aggregated at a route level exhibit periodic behaviour. Based on analysis of the deterministic inter-meeting times for bus pairs running on route pairs, and consideration of the variability in bus movement and the random failures to establish connections, we construct generative route-level models that capture the above behaviour. Through trace-driven simulations of epidemic routing, we find that the epidemic performance predicted by traces generated with this finer-grained route-level model is much closer to the actual performance that would be realized in the operational system than traces generated using the coarse-grained all-bus-pairs aggregated model. This suggests the importance in choosing the right level of model granularity when modelling mobility-related measures such as inter-contact times in DTNs.

Title : Computer Communications Author : Jian Ren

Year : 2009

Description: The rapid growth of Internet applications has made communication privacy an increasingly important security requirement. While end-to-end encryption can protect the data content of communications from adversarial access, it does not conceal all the relevant information that two users are communicating. Adversaries can still learn significant information about the traffic carried on the network and the physical world entities, such as the network of the sender and receiver or the network addresses of its end-toend source and destination. The exposure of network addresses may result in a number of severe consequences. Adversaries can easily overhear all the messages and perform traffic analysis. Even if communication content is encrypted, routing information is still sent in the clear because routers need to know packets’ destinations in order to route them in the right direction. Traffic analysis can also be done by watching particular data moving through a network, by matching the amount of data, or by examining coincidences, such as connections opening and closing at about the same time. In a tactical military communication network, an abrupt change in the traffic pattern may indicate some forthcoming activities. This can be extremely dangerous in that adversaries can easily identify critical network nodes and then launch targeted attacks on them. This makes source privacy an essential security requirement for government and military communications.

Title : RAC: a Free rider-resilient, Scalable, Anonymous Communication Protocol Author : Sonia Ben Mokhtar

Year : 2013

Description: Enabling anonymous communication over the Internet is crucial. The first protocols that have been devised for anonymous communication are subject to freeriding. Recent protocols have thus been proposed to deal with this issue. However, these protocols do not scale to large systems, and some of them further assume the existence of trusted servers. In this paper, we present RAC, the first anonymous communication protocol that tolerates freeriders and that scales to large systems. Scalability comes from the fact that the complexity of RAC in terms of the number of message exchanges is independent from the number of nodes in the system. Another important aspect of RAC is that it does not rely on any trusted third party. We theoretically prove, using game theory, that our protocol is a Nash equilibrium, i.e., that free riders have no interest in deviating from the protocol.

Further, we experimentally evaluate RAC using simulations. Our evaluation shows that, whatever the size of the system (up to 100.000 nodes), the nodes participating in the system observe the same throughput. nodes while minimizing message delay and communication cost under resource-constrained. Using DTN routing Protocol between Maximizing quality-of-service (QoS) by minimizing message delivery delay and maximizing correct message delivery ratio.

(4)

Following modules involves Modules:

 User Interface Design

 Data manipulation

 Delay tolerant networks

 Multi packet reception

 Traffic Node Modules Description:

 User Interface Design

In this module we design the windows for the project. These windows are used to send a message from one peer to another. We use the Swing package available in Java to design the User Interface. Swing is a widget toolkit for Java. It is part of Sun Microsystems' Java Foundation Classes an API for providing a graphical user interface for Java programs. In this module mainly we are focusing the login design page with the Partial knowledge information.

Application Users need to view the application they need to login through the User Interface GUI is the media to connect User and Media Database and login screen where user can input his/her user name, password and password will check in database, if that will be a valid username and password then he/she can access the database.

Data manipulation

Data manipulation is the process of changing data in an effort to make it easier to read or more organized. For example, a log of data could be organized in alphabetical order, making individual entries easier to locate. Data manipulation is often used on web server logs to allow a website owner to view their most popular pages as well as their traffic sources.

 Node;

 Interface;

 Application;

 Cluster.

 Delay tolerant networks

A delay-tolerant network is a network designed to operate effectively over extreme distances such as those encountered in space communications or on an interplanetary scale. In such an environment, long latency -- sometimes measured in hours or days -- is inevitable. However, similar problems can also occur over more modest distances when interference is extreme or network resources are severely overburdened. Node Manager is program that is used to control Web Logic Server instances. A single Node Manager instance is used to control all of the server instances running on the same physical machine.

 Multi packet reception

Multi packet reception techniques, it is possible for a receiver to receive multiple packets transmitted concurrently.

The optimal transmission probability in the CSMA protocol with MPR with the assumption that the number N of active nodes is known a priori. The slotted-Aloha protocol using splitting the packet and multiple packet reception is receiving the all packets at time in random process to receiver side. Multi packet reception process in receiver side.

Module Diagrams:

User Interface Design Data manipulation

User

User Regis

Data Base Interaction

User Window

(5)

A server cluster is a collection of servers, called nodes that communicate with each other to make a set of services highly available to clients. Server clusters are based on one of the two clustering technologies in the Microsoft Windows Server 2003 operating systems. The most widely used cluster type is the single quorum device cluster, also called the standard quorum cluster. In this type of cluster there are multiple nodes with one or more cluster disk arrays, also called the cluster storage, and a connection device.

TRAFFIC NODE

.

SECURITY TESTING

It is a type of non-functional testing. Security testing is basically a type of that’s done to check whether the application or the product is secured or not. It checks to see if the application is vulnerable to attacks, if anyone hack the system or login to the application without any authorization. It is a process to determine that an information system protects data and maintains functionality as intended. The security testing is performed to check whether there is any information leakage in the sense by encrypting the application or using wide range of software’s and hardware’s and firewall etc. Software security is about making software behave in the presence of a malicious attack.

CONCLUSION

In this paper, we first design an abstract onion-based anonymous routing protocol and then extend the existing protocol with group onions into multi-copy forwarding. The main contributions of this paper are performance and security analyses of onion-based anonymous routing for DTNs. The delivery rate is mathematically modelled by incorporating the consideration of any cast-like message forwarding by group onions. The traceable rate of an anonymous routing path is analysed by reducing the problem to computing the run length of the bit string that represents a routing path. In addition, the path anonymity as well as the node anonymity, both of which are application-dependent entropy-based metrics, are defined and formulated. Furthermore, we demonstrate that the numerical and simulation results are very close to each other, or share the same trend. Finally, the proposed analyses present close approximation to the simulation results with one of the well-known real traces, CRAWDAD dataset Cambridge/haggle, as long as enough contact events are fed and the graph representation of a trace is dense.

We believe that our theoretical work supports the fundamental understanding of the performance and security issues related to onion-based anonymous routing for DTNs.

REFERENCES:

1. A. Vahdat and D. Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks,” Tech. Rep., 2000, CS- 200006, Duke University. IEEE TRANSACTION ON NETWORKING 2017 JUNE, 7 2017 1536-1233 (c) 2016 IEEE.

Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information. This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TMC.2017.2690634, IEEE Transactions on Mobile Computing JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 14

Database User

login

User window

Error page

Message Splitting

packets

Transfer

files

Control traffic

(6)

Intermittently Connected Mobile Networks,” in SIGCOMM Workshop on Delay-Tolerant Networking, 2005, pp.

252–259.

3. A. Balasubramanian, B. Levine, and A. Venkataramani, “DTN Routing As a Resource Allocation Problem,” in SIGCOMM, 2007, pp. 373–384.

4. C. Liu and J. Wu, “An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks,” in Mobihoc, 2009, pp. 105–114.

5. W. Gao, Q. Li, and G. Cao, “Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination,” in Infocom, 2014, pp. 2301–2309.

6. Q. Li, G. Cao, and T. F. L. Porta, “Efficient and privacy-aware data aggregation in mobile sensing,” IEEE Trans.

Dependable SecureComputer, vol. 11, no. 2, pp. 115–129, 2014.

7. S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” in SIGCOMM, 2004, pp. 145–158.

8. X. Zhang, J. Kurose, B. N. Levine, D. Towsley, and H. Zhang, “Study of a Bus-based Disruption-Tolerant Network:

Mobility Modeling and Impact on Routing,” in Mobicom, 2007, pp. 195–206.

9. M. Motani, V. Srinivasan, and P. S. Nuggehalli, “People Net: Engineering a Wireless Virtual Social Network,” in Mobicom, 2005, pp. 243–257.