Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

Self Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

Platform : java

IEEE Projects Years : 2012 - 13

Self Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

Abstract

            This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

 

Existing System

            The previously reported multi-copy schemes are subject to the following problems and implementation difficulties. First, these schemes inevitably take a large number of transmissions, energy consumption, and a vast amount of transmission bandwidth and nodal memory space, which could easily exhaust the network resource. Second, they suffer from contention in case of high traffic loads, when packet drops could result in a significant degradation of performance and scalability. Note that the future DTNs are expected to operate in an environment with a large number of miniature hand-held devices such as smart phones, tablet computers, personal digital assistants (PDAs), and mobile sensors. In such a scenario, it may no longer be the case that nodal contact frequency serves as the only dominant factor for the message delivery performance as that assumed by most existing DTN literature. Therefore, limitations on power consumption, buffer spaces, and user preferences should be jointly considered in the message forwarding process.

 

Proposed System

            The main feature of SAURP is the strong capability in adaptation to the fluctuation of network status, traffic patterns/characteristics, user encounter behaviors, and user resource availability, so as to improve network performance in terms of message delivery ratio, message delivery delay, and number of transmissions. The contributions of the paper are as following

  • We develop a novel DTN routing scheme which incorporates with some parameters that have not been jointly considered in the literature. The parameters include link quality/availability and buffer occupancy statistics, which are obtained by sampling the channels and buffer space during each contact with another node.
  • We introduce a novel transitivity update rule, which can perfectly match with the proposed routing model and the required design premises.
  • We introduce a novel adaptive time-window update strategy for maintaining the quality metric function at each node, aiming at an efficient and optimal decision making process for each active data message.
  • An analytical model is developed for the proposed SAURP, and its correctness is further verified. We show via extensive simulations that the proposed SAURP can achieve significant performance gain over the previously reported counterparts under the considered scenarios.

 

Software Requirement Specification

Software Specification

Operating System       :           Windows XP

Technology                 :           JAVA

Database                     :           Microsoft SQL Server 2005

 

Hardware Specification

Processor                     :           Pentium IV

RAM                           :           512 MB

Hard Disk                   :           80GB

 

Module Description

  • Partitioned Network Construction

This Module is used to construct the partitioned Network it means we construct the two networks by entering the how many number of hosts are register in the network. After that register the host’s details for that user must enter the hostname, port no, IPaddress of the host. After enter that details it checks into the database that host details are already exist or not. If that details are exist in the database it display message “hostname must be unique” .if that host details are not exist  that host details are stored into database. Using that hostname details we can construct two networks. For that using unidirectional and bidirectional connections between hosts. Suppose we are choosing unidirectional connection it will connect the first host to second host.and randomly allocates the weight for that connection. Suppose we are choosing bidirectional connection it will connect the first host to second host and also connect the second host to first host and also randomly allocate the weight for those connections.

  • Synchronous Delivery Message

After construct the partitioned network login the hosts in the two networks. Select the destination hostname from source hostname. And select which message wants to send the message from source to destination. It will check that destination is available in the same network or Not. Suppose destination is available in the same network and path is exists between the source and destination it’s a synchronous delivery. That find the possible path from source to destination. Select the best path from possible path from source to destination. Using that best path we can transfer the message to destination ,after sending the message to destination it will display one dialog box message sent .message received in that destination host name.

  • Asynchronous Delivery Message

After construct the partitioned network login the hosts in the two networks. Select the destination hostname from source hostname. And select which message wants to send the message from source to destination. It will check that destination is available in the same network or Not. Suppose destination is not available in the same network send the request to another server that destination is available in that network or not. That destination is not available that server send the response to requested server the destination is not available. That destination is available in that network that server send the response to requested server the destination is available. That delivery message to destination is asynchronous delivery. Then choose the best carrier host for send the message to destination.

  • Select Best Carrier Host 

In this Module select the best carrier host for asynchronous delivery message. For hat calculate the delivery probability in the between networks using utility function. Based on highest delivery probability selects the best carrier host from between networks. Selecting best carrier host that message is sent from source to best carrier host and that message stored in that buffer of best carrier host. And select the best carrier host from another network. That disconnects the best carrier host in that network. And connect that host in another network based on highest delivery probability. And find the possible path between best carrier hosts to destination. In that possible path choose the best path from source to destination. In that best path deliver the message to destination.



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1