Application Of Delay Tolerant Network Essay

In the Network Design Paper I will explain how the University has recently leased a building in Adelphi, Maryland. The measurements of the University is 240 feet long, 95 feet wide and 30 feet tall and broken down to two different floors. This University will be used for education purposes of course, the facility will be made of six instructional labs, seven offices, library, five classrooms, a student lobby and a computer lab. There will be a server room on each floor. The purpose of this paper is to explain the design of the networks in this building. The student accessed computers will be set up on a separate network than the network that they staff will be using.

In a figure all ways from S to D incorporate hosts that are outside the request zone. Accordingly, there is no surety that a way can be discovered comprising just of the hosts in a picked request zone. In this manner, if a route is not found inside of a suitable timeout period, our convention Wows S to start another route disclosure with an extended request zone – in our simulations, the extended zone incorporates the whole system space. in this case the inactivity in deciding the route to D be longer.

In the location-based routing, sensor nodes are distributed randomly in an interesting area. They are positioned mostly by utilizing of Global position system. The distance among the sensor nodes is evaluated by the signal strength obtained from those nodes and coordinates are computed by interchanging information among neighbouring nodes. Location-based routing networks are;

Our proposed algorithm implements the same method for estimating the energy in the network as in DEEC [-----]. Since the probabilities calculated depend on the average energy at round r in the network. This average energy estimated as:

b) The delay to send each packet will be transmission delay plus propagation delay. There is an additional propagation delay for acknowledgement packet to arrive at the sender, prior to which the next packet can be transmitted. The total delay is

All vehicles transmit a 200-byte safety message at 10Hz with data rate of 6 Mbps. All vehicles attempt to continuously route 64-byte packets at an application rate of 2.048 Kbps to one of 10 other vehicles, selected as sink vehicles. The antenna height AHk of each vehicle is 1.5m. Transmit power is set to 10 dBm and the transmission range for safety message packet delivery is 145 m. For each experiment PCAP trace file per node is enabled. The routing statistics are gathered and compared for each experiment, i-e, with NS2 mobility trace file and with PySNS3. The simulation parameters for performance evaluation of PySNS3 are shown in Table III. In order to calculate packet delivery ratio (PDR), we must count; i) the packets that are actually received, and ii) the transmitted packets that are expected to be received. Both are relative to a specified (circular) coverage area shown in Fig. 6. Let's assume that the transmission range of vehicle A, is in meters, such that TRA > dAB. Where, dAB is distance between A and B, and dBC is the distance between B and

DSDV is a proactive, hop-by-hop distance vector routing protocol where the routing table is maintained by each and every network node. The routing table consists of all the nodes required to reach destination also including the nodes to which packets are not sent. The routing table is kept updated at every time after each entry. In order to avoid the routing loops, DSDV uses the concept of sequence numbers to maintain the originality of route at all times. For the network in figure. 1 below, the routing table for node A can be seen in table. 1 which contains information about all possible paths reachable by node A, along with the next hop, number of hops and sequence number.

We have simulated another network having 30 numbers of nodes. The simulation is made using the same platform used for network 1. This simulation is done taking node 1 as a source and node 28 as destination. The optimal path obtained in this simulation is 1-23-13-28, in which data rate is 0.47 kbps. The second optimal path is 1-17-28, in which data rate is 0.35 kbps. The simulated results are summarized here in

In order to evaluate the performance of the proposed DCHS algorithm, we compare MILP with the energy consumption and delay constrained routing protocol.

In order to avoid this problem, a technique called probability distribution algorithm is introduced. In probability distribution algorithm, the random traffic between the primary network users are analyzed. The nearby nodes behaviors are learnt by the secondary node. The probability of the traffic in the neighboring nodes are studied by the node that tries to transmit data. When the traffic is free then the secondary node establishes the connection. If there is traffic then the secondary node searches for other nodes. Thus the data transmission occurs in this CR

Simulation environment consists of wired, wireless and wired cum wireless network. Network simulator NS 2.35 [6] is used for the simulation. NS is a discrete event simulator, where the advance of times depends on the timing of events which are maintained by simulator.

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

routing. In this chapter, we introduce some popular routing protocols in each of the three

During this paper several things will be explained or gone over. The first will be communication protocols and I will identify the network protocols and provide rationale for the decision. Next will be to define the full network architecture and explain the usefulness of the traffic analysis. The next thing will be to define the terms response time, latency, and jitter, and describe their effect on the main network performance and on the performance of the chosen organization 's network. Next the effect of data rates on each part of the network will also be explained. Describing strategies to ensure the availability of network access in switched and routed networks will be the last part of this paper.

In this thesis, based on the real time physical networks and networking models, it shows the different types