Delay tolerant networks are characterised by the sporadic connectivity between their nodes and so the shortage of stable end-to-finish paths from supply to destination. Since the longer term node connections are mostly unknown in these networks, opportunistic forwarding is employed to deliver messages. However, creating effective forwarding decisions using solely the network characteristics (i.e. average intermeeting time between nodes) extracted from contact history may be a challenging downside. Based mostly on the observations about human mobility traces and also the findings of previous work, we have a tendency to introduce a replacement metric called conditional intermeeting time, that computes the typical intermeeting time between two nodes relative to a meeting with a 3rd node using solely the local knowledge of the past contacts. We tend to then observe the results of the proposed metric on the shortest path primarily based routing designed for delay tolerant networks. We tend to propose Conditional Shortest Path Routing (CSPR) protocol that routes the messages over conditional shortest ways in which the cost of links between nodes is defined by conditional intermeeting times instead of the standard intermeeting times. Through trace-driven simulations, we tend to demonstrate that CSPR achieves higher delivery rate and lower finish-to-end delay compared to the shortest path based routing protocols that use the conventional intermeeting time as the link metric.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Using Improved Conditional Generative Adversarial Networks to Detect Social Bots on Twitter ABSTRACT: The detection and elimination of dangerous social bots in social media has piqued commercial and academic interest.
PROJECT TITLE : Improved ArtGAN for Conditional Synthesis of Natural Image and Artwork ABSTRACT: This research offers a number of innovative ways to improve the generative adversarial network (GAN) for conditional picture synthesis,
PROJECT TITLE :Conditional Diagnosability of (n,k) -Star Graphs Under the PMC Model - 2018ABSTRACT:Fault diagnosis has played a major role in measuring the reliability of multiprocessor systems. The diagnosability of many well-known
PROJECT TITLE :The g -Good-Neighbor Conditional Diagnosability of Arrangement Graphs - 2018ABSTRACT:A network's diagnosability is the utmost range of faulty vertices the network can discriminate solely by performing mutual tests
PROJECT TITLE :A Low Error Energy-Efficient Fixed-Width Booth Multiplier with Sign-Digit-Based Conditional Probability Estimation - 2018ABSTRACT:Fixed-width multipliers are intensively used in many DSP applications whose accuracy

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry