7.towords reliable datadelivery doc

7/27/2019 7.Towords Reliable Datadelivery Doc

http://slidepdf.com/reader/full/7towords-reliable-datadelivery-doc 1/14

Towards Reliable Data Delivery for Highly

Dynamic Mobile Ad Hoc Networks

Abstract:

This paper addresses the problem of delivering data packets

for highly dynamic mobile ad hoc networks in a reliable and

timely manner. Most existing ad hoc routing protocols are

susceptible to node mobility, especially for large-scale networks.

Driven by this issue, we propose an efficient Position based

Opportunistic Routing protocol (POR) which takes advantage of

the stateless property of geographic routing and the broadcast

nature of wireless medium. When a data packet is sent out, some

of the neighbor nodes that have overheard the transmission will

serve as forwarding candidates, and take turn to forward the

packet if it is not relayed by the specific best forwarder within a

certain period of time. By utilizing such in-the-air backup,

communication is maintained without being interrupted. The

additional latency incurred by local route recovery is greatly



reduced and the duplicate relaying caused by packet reroute is

also decreased. In case of communication hole, a Virtual

Destination based Void Handling (VDVH) scheme is further proposed to work together with POR. Both theoretical analysis

and simulation results show that POR achieves excellent

performance even under high node mobility with acceptable

overhead and the new void handling scheme also works well.

Modules:

1)Topology Creation:In this module, nodes are added to Topology.

2)Node Details: In this module we have to give the node name

and distance.

3)File Transferring: This module makes possible to transfer the

file from Source Node to particular destination node.

4)Packet Forward Details:This module give the all the details of the transferred file like source and destination and file details.

REQUIREMENT ANALYSIS:



FEASIBILITY STUDY:

The next step in analysis is to verify the feasibility of the

proposed system. “All projects are feasible given unlimited

resources and infinite time“. But in reality both resources and

time are scarce. Project should confirm to time bounce and

should be optimal in there consumption of resources. This place

a constant is approval of any project.

Feasibility has applied to Digital Tune pertains to the following

areas:

• Technical feasibility

• Operational feasibility

• Economical feasibility

TECHNICAL FEASIBILITY:

To determine whether the proposed system is technically

feasible, we should take into consideration the technical issues

involved behind the system.



OPERATIONAL FEASIBILITY:

To determine the operational feasibility of the system we

should take into consideration the awareness level of the users.

This system is operational feasible since the users are familiar

with the technologies and hence there is no need to gear up the

personnel to use system. Also the system is very friendly and to

use.

ECONOMIC FEASIBILITY

To decide whether a project is economically feasible, we have to

consider various factors as:

• Cost benefit analysis

• Long-term returns

• Maintenance costs



Reliability Study:

In the existing system ad hoc routing protocols are

susceptible(influence) to node mobility, especially for large-

scale networks. One of the main reasons is due to the pre-

determination of an end-to-end route before data transmission.

Owing to the constantly and even fast changing network

topology, it is very difficult to maintain a deterministic route.

The discovery and recovery procedures are also time and energy

consuming. Once the path breaks, data packets will get lost or be

delayed for a long time until the reconstruction of the route,

causing transmission interruption.

Efficiency Study:

A novel Position based OpportunisticRouting protocol

(POR) is proposed, in which several forwarding candidatescache the packet that has been received using MAC interception.



If the best forwarder does not forward the packet in certain time

slots, suboptimal candidates will take turn to forward the packet

according to a locally formed order. In this way, as long as oneof the candidates succeeds in receiving and forwarding the

packet, the data transmission will not be interrupted. Potential

multi-paths are exploited on the- fly on a per-packet basis,

leading to POR’s excellent robustness.

SOFTWARE REQUIREMENT SPECIFICATION

What is SRS?

Software Requirement Specification (SRS) is the starting

point of the software developing activity. As system grew more

complex it became evident that the goal of the entire system

cannot be easily comprehended. Hence the need for the

requirement phase arose. The software project is initiated by the

client needs. The SRS is the means of translating the ideas of

the minds of clients (the input) into a formal document (the

output of the requirement phase.)

The SRS phase consists of two basic activities:



1) Problem/Requirement Analysis:

The process is order and more nebulous of the two,

deals with understand the problem, the goal and constraints.

2) Requirement Specification:

Here, the focus is on specifying what has been found giving

analysis such as representation, specification languages and tools,

and checking the specifications are addressed during this activity.

The Requirement phase terminates with the production of the

validate SRS document. Producing the SRS document is the

basic goal of this phase.

ROLE OF SRS

The purpose of the Software Requirement Specification is

to reduce the communication gap between the clients and the



developers. Software Requirement Specification is the medium

though which the client and user needs are accurately specified.

It forms the basis of software development. A good SRS shouldsatisfy all the parties involved in the system.

SCOPE

This document is the only one that describes the

requirements of the system. It is meant for the use by the

developers, and will also be the basis for validating the final

delivered system. Any changes made to the requirements in the

future will have to go through a formal change approval process.

The developer is responsible for asking for clarifications, where

necessary, and will not make any alterations without the

permission of the client.

Hardware and software Requirements:

Software Requirements

Microsoft Windows XP Professional

JDK 6.0



Java Swings and awt.

Database: MYSQL

Hardware Requirements

Pentium 4 processor

1 GB RAM

80 GB Hard Disk Space

UML Diagrams:

Usecase diagram:

node name

node information

distance

Class Diagram:



packet fwd

Jlable1

Jlable2

JCombobox

action performed()

Main

Jbutton1

Jbutton2

main()

Input Node

show input dialogue

getnodes()

candidate details

JFrame

JLable1

JLable2

netview()

Sequence Diagram:



node detailsmain source browse file destination

enter node details

select source node

select file to browse

select destination

Collaboration Diagram:

main node

details

source

browse

file

destinati

on

1: enter node details2: select source node

3: select file to browse4: select destination



References:

1) J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J.

Jetcheva, “A

performance comparison of multi-hop wireless ad hoc network

routing protocols,” in MobiCom ’98. ACM, 1998, pp. 85–97.

2) M. Mauve, A. Widmer, and H. Hartenstein, “A survey on

position-based routing in mobile ad hoc networks,” Network,

IEEE , vol. 15, no. 6, pp. 30–39, Nov/Dec 2001.

3) D. Chen and P. Varshney, “A survey of void handling

techniques

for geographic routing in wireless networks,” Communications

Surveys & Tutorials, IEEE , vol. 9, no. 1, pp. 50–67, Quarter

2007.

4) D. Son, A. Helmy, and B. Krishnamachari, “The effect of

mobilityinduced

location errors on geographic routing in mobile ad



hoc sensor networks: analysis and improvement using mobility

prediction,” Mobile Computing, IEEE Transactions on, vol. 3,

no. 3, pp. 233–245, July-Aug. 2004.

5) B. Karp and H. T. Kung, “Gpsr: greedy perimeter stateless

routing

for wireless networks,” in MobiCom ’00, 2000, pp. 243–254.

6) S. Biswas and R. Morris, “Exor: opportunistic multi-hop

routing

for wireless networks,” in SIGCOMM ’05, 2005, pp. 133–144.

7) S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading

structure for randomness in wireless opportunistic routing,” in

SIGCOMM ’07 , 2007, pp. 169–180.

8) E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, “Soar: Simple

opportunistic

adaptive routing protocol for wireless mesh networks,”



Mobile Computing, IEEE Transactions on, vol. 8, no. 12, pp.

1622

–1635, dec. 2009.

9) A. Balasubramanian, R. Mahajan, A. Venkataramani, B. N.

Levine,

and J. Zahorjan, “Interactive wifi connectivity for moving

vehicles,”in SIGCOMM ’08, 2008, pp. 427–438.

10) K. Zeng, Z. Yang, and W. Lou, “Location-aided

opportunistic forwarding

in multirate and multihop wireless networks,” Vehicular

Technology, IEEE Transactions on, vol. 58, no. 6, pp. 3032–

3040, July

2009.

7.towords reliable datadelivery doc

Documents