SAURP: Multi-Copy Routing Protocol for DTNs

0
(0)
0 55
In Stock
JAVA_5
Request a Quote

SAURP: Multi-Copy Routing Protocol for DTNs



Problem Definition

Problem Description: One of the main challenges in intermittently connected mobile networks is the efficient routing of messages in a delay-tolerant manner. Traditional routing protocols may not be suitable for such networks due to their intermittent connectivity and varying environmental conditions. Therefore, there is a need for a routing protocol that can adapt to these changing conditions and optimize message delivery. Traditional routing protocols may not take into account factors such as wireless channel condition, nodal buffer occupancy, and encounter statistics, which can greatly impact the performance of the network. As a result, messages may experience high delay, loss, and inefficient routing paths.

To address this problem, the Self Adaptive Utility-based Routing Protocol (SAURP) is proposed in this project. SAURP is designed to dynamically adapt to the network conditions and reroute messages around nodes experiencing high buffer occupancy or wireless interference. By utilizing a novel utility function based mechanism, SAURP can identify potential opportunities for forwarding messages to their destination in an efficient manner. With the implementation of SAURP, it is expected that the delivery ratio, delivery delay, and the number of transmissions required for each message delivery will be significantly improved compared to traditional multi-copy encounter-based routing protocols. This will lead to more reliable and efficient communication in intermittently connected mobile networks.

Proposed Work

The proposed work titled "Self Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks" focuses on addressing the challenges of delay tolerant networks (DTNs) with a large number of devices such as smartphones. In this project, a new multi-copy routing protocol known as Self Adaptive Utility-based Routing Protocol (SAURP) is introduced. SAURP utilizes a novel utility function based mechanism to identify potential forwarding opportunities for messages to reach their destination. Environment parameters such as wireless channel conditions, nodal buffer occupancy, and encounter statistics are taken into account in the routing decision process. By rerouting messages around nodes experiencing high buffer occupancy or wireless interference, SAURP achieves optimal performance as demonstrated by stochastic modeling analysis.

Simulation results show that SAURP outperforms existing multi-copy encounter-based routing protocols in terms of delivery ratio, delivery delay, and the number of transmissions required for successful message delivery. This project falls under the categories of JAVA Based Projects and Wireless Research Based Projects, with a focus on the subcategory of Routing Protocols Based Projects in Parallel and Distributed Systems. The software used for this project includes Java programming language for implementation and simulation purposes.

Application Area for Industry

The proposed project, Self Adaptive Utility-based Routing Protocol (SAURP), can be utilized in various industrial sectors where intermittently connected mobile networks are prevalent, such as logistics and transportation, emergency response services, and rural communication networks. These sectors often face challenges in efficient message routing due to intermittent connectivity and varying environmental conditions. By implementing SAURP, these industries can benefit from improved delivery ratio, reduced delivery delay, and lower number of transmissions required for successful message delivery. SAURP's ability to dynamically adapt to network conditions and reroute messages around congested nodes or wireless interference provides a solution to the inefficiencies and delays experienced in traditional routing protocols. Overall, the application of SAURP in these industrial sectors will lead to more reliable and efficient communication in intermittently connected networks, ultimately improving operational efficiency and service delivery.

Moreover, the proposed solutions offered by SAURP can be applied within different industrial domains to address specific challenges. For instance, in the logistics and transportation sector, where real-time tracking of goods and vehicles is crucial, SAURP can ensure timely and accurate exchange of information between different points in the supply chain. Similarly, in emergency response services, SAURP can facilitate seamless communication between first responders in remote or disaster-struck areas where traditional networks may be unreliable. In rural communication networks, SAURP can improve connectivity and enable better access to essential services such as healthcare and education. By overcoming the limitations of traditional routing protocols and optimizing message delivery under varying network conditions, SAURP offers tangible benefits to industries dependent on intermittently connected mobile networks.

Application Area for Academics

The proposed project, "Self Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks," presents a significant opportunity for MTech and PHD students to engage in cutting-edge research within the domain of parallel and distributed systems. The project addresses the pressing challenge of efficient routing in delay-tolerant networks, a topic that is highly relevant in the context of today's interconnected and dynamic mobile networks. By implementing the Self Adaptive Utility-based Routing Protocol (SAURP), researchers can explore innovative approaches to optimizing message delivery in intermittently connected environments. The project's focus on factors such as wireless channel conditions, nodal buffer occupancy, and encounter statistics provides a fertile ground for exploring new methodologies and simulation techniques in data analysis. MTech students and PHD scholars can leverage the code and literature of this project to conduct in-depth research, develop new algorithms, and analyze performance metrics in their dissertation, thesis, or research papers.

The potential applications of this project extend beyond academia, with implications for industries where efficient communication in mobile networks is crucial. As future scope, the project could be extended to explore the integration of artificial intelligence and machine learning techniques to further enhance the adaptability and performance of routing protocols in intermittently connected mobile networks. Through active engagement with this project, researchers can contribute to the advancement of knowledge in the field of wireless communication and pave the way for future innovations in mobile networking technologies.

Keywords

Intermittently connected mobile networks, delay-tolerant routing, efficient message delivery, routing protocol adaptation, intermittent connectivity, environmental conditions, wireless channel condition, nodal buffer occupancy, encounter statistics, message routing optimization, Self Adaptive Utility-based Routing Protocol (SAURP), dynamic adaptation, wireless interference, utility function mechanism, delivery ratio improvement, delivery delay reduction, transmission optimization, multi-copy routing protocol, contention aware routing, smartphones, environment parameters, stochastic modeling analysis, simulation results, JAVA programming, wireless research, routing protocols, parallel and distributed systems, Netbeans, Eclipse, J2SE, J2EE, ORACLE, JDBC, Swings, JSP, Servlets, WSN, Manet, Wimax, protocols, WRP, DSR, DSDV, AODV.

Shipping Cost

No reviews found!

No comments found for this product. Be the first to comment!

Are You Eager to Develop an
Innovative Project?

Your one-stop solution for turning innovative engineering ideas into reality.


Welcome to Techpacs! We're here to empower engineers and innovators like you to bring your projects to life. Discover a world of project ideas, essential components, and expert guidance to fuel your creativity and achieve your goals.

Facebook Logo

Check out our Facebook reviews

Facebook Logo

Check out our Google reviews