Simulation of ADIAN (A Distributed Intelligent Ad-hoc Network)

Enrollment No. - 9911103496

Enrollment No. - 9911103547

Name of Student - Nitin Parashar

Name of Student - Shalabh Mittal

Name of supervisor(s) - Dr. Krishna Asawa

June – 2015

Submitted in partial fulfillment of the Degree of

Bachelor of Technology

In

Computer Science Engineering

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING & INFORMATION

TECHNOLOGY

JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY, NOIDA

TABLE OF CONTENTS

Chapter No. Topics Page No.

I Declaration i

II Certificate ii

III Acknowledgement iii

IV Summary iv

V List of Tables v

VI List of Figures v

VII List of Symbols and Acronyms Vi

Chapter-1 Introduction

1.1 General Introduction 1

1.2 Problem Statement 2

1.3 Work Division 2

1.4 Tabular Comparison of Existing Approaches 3

Chapter-2 Background Study

2.1 List of all sources

2.2 Some Relevant Research Papers

2.3 Integrated Summary of the literature studied

2.4 Empirical Study

4

4-6

7

8-9

Chapter-3 Implementation and Testing

3.1 Requirements Specification 10

3.2 Functional and Non-Functional Requirements 10

3.3 Overall architecture with component description and

dependency details

11

3.4 Data Structures and Algorithms / Protocols 13

3.5 Testing 15

3.6 Risk Analysis and Mitigation Plan 17

Chapter-4 Conclusion and Future Work

4.1 Conclusion 19

4.2 Future Work 19

Appendix A. Gantt Chart B. References

20

21

(I)

DECLARATION

We hereby declare that this submission is our own work and that, to the best of our knowledge

and belief, it contains no material previously published or written by another person nor material

which has been accepted for the award of any other degree or diploma of the university or other

institute of higher learning, except where due acknowledgment has been made in the text.

Place: JIIT-128, Noida Signature:

Date: 03/06/2015 Name: Nitin Parashar

Enrollment No: 9911103496

Signature:

Name: Shalabh Mittal

Enrollment No: 9911103547

(II)

CERTIFICATE

This is to certify that the work titled “Simulation of ADIAN (A Distributed Intelligent Ad-hoc

Network)” submitted by “Nitin Parashar and Shalabh Mittal” in partial fulfillment for the

award of degree of B. Tech of Jaypee Institute of Information Technology University, Noida has

been carried out under my supervision. This work has not been submitted partially or wholly to

any other University or Institute for the award of this or any other degree or diploma.

Signature of Supervisor: …………………….

Name of Supervisor: Dr. Krishna Asawa

Designation: Assoc ia te Professor, Department CSE/IT, Noida

Date: 03/06/2015

(III)

ACKNOWLEDGEMENT

The completion of any project work depends upon the cooperation, coordination and combined

effects of several resources of knowledge, energy and time. Therefore we approach this important

matter of acknowledgement through these lines trying our best to give full credits where it deserves.

We are extremely grateful to our supervisor Dr. Krishna Asawa for her expert guidance, constant

encouragement, valuable suggestions, constructive criticism and sustained interest in the project that

tremendously enhanced our perseverance towards our major project work.

Name of Student : Nitin Parashar, Shalabh Mittal

Enrollment Number : 9911103496, 9911103547

Date : 03 June 2015

(IV)

Summary

Wireless networks provide connection flexibility between users in different places. Moreover,

the network can be extended to any place or building without the need for a wired

connection. In this project, we are implementing an ad-hoc network protocol named ADIAN (A

distributed intelligent ad-hoc network). This protocol is different from present widely used ad-

hoc network protocols. It takes into account more information about the neighbor nodes which

saves more power and energy and also provides effective transmission. The protocol is being

simulated on Network Simulator 2 (NS2).

(V)

List of Tables

Table Number Description Page Number

Table 1

Comparison of existing approaches

3

Table 2

Comparison of different versions of 802.11

9

Table 3

Belief Table

14

Table 4 Testing 15

Table 5

Testing Components

16

Table 6

Test Cases

16

Table 7

Risk Analysis

17

Table 8

Impact

17

Table 9

Mitigation Plan

18

(VI)

List of Figures

Figure No. Description Page no.

Fig1 Existing protocols of ad-hoc networks 7

Fig2 Sequence Diagram 12

Fig3 Control Flow Diagram 13

8

(VII)

List of Symbols and Acronyms

Acronym Meaning

AODV Ad hoc On-Demand Distance Vector

DSDV Destination-Sequenced Distance-Vector Routing

OLSR Optimized Link State Routing Protocol

DSR Dynamic Source Routing

NS2 Network Simulator 2

MANET Mobile Ad-hoc network

ADIAN A Distributed Intelligent Ad-hoc Network

DAI Distributed Artificial Intelligent

9

1 Introduction

1.1 General Introduction

The wireless communication revolution is bringing fundamental changes to data networking,

telecommunication, and is making integrated networks a reality. By freeing the user from the

cord, personal communications networks, wireless LAN's, mobile radio networks and cellular

systems, harbor the promise of fully distributed mobile computing and communications, anytime,

anywhere.

Focusing on the networking and user aspects of the field, Wireless Networks provides a global

forum for archival value contributions documenting these fast growing areas of interest. Wireless

ad hoc network is a decentralized type of wireless network. The network is ad hoc because it does

not rely on a pre-existing infrastructure, such as routers in wired networks or access points in

managed (infrastructure) wireless networks. Instead, each node participates in routing by

forwarding data for other nodes, so the determination of which nodes forward data is made

dynamically on the basis of network connectivity. In addition to the classic routing, ad hoc

networks can use flooding for forwarding data.

Wireless mobile ad hoc networks are self-configuring, dynamic networks in which nodes are free

to move. Wireless networks eliminate the complexities of infrastructure setup and administration,

enabling devices to create and join networks "on the fly"-anywhere, anytime, for virtually any

application.

Wireless networks provide connection flexibility between users in different places. Moreover, the

network can be extended to any place or building without the need for a wired connection. In this

project, we simulate the wireless ad-hoc network protocol ADIAN using Network Simulator 2.

10

1.2 Problem Statement

Many different routing protocols have been proposed in the past decade based on different

assumptions and intuitions. Since the routing protocol is one of the determinant factors of the

performance of ad hoc networks, the research that compares different protocols in a realistic setting

is necessary and valuable.

For that we study the existing widely protocols and then we implement ADIAN. After comparison

between existing protocols, we try to implement a new protocol for ad-hoc networks based on

distributed intelligence.

1.3 Work Division

This project is being made by Shalabh Mittal and Nitin Parashar. The division of work is as

follows:

1. Nitin Parashar - DSDV protocol and creating the installation files of the protocol i.e. the C++

and header files to implement ADIAN

2. Shalabh Mittal – AODV, DSR protocol and creation of tcl script files to link it with the protocol

(ADIAN).

11

1.4 Tabular comparison of existing approaches

Table1: Comparison of Existing Approaches

12

2 Background Study

2.1 List of all sources

Wikipedia

IEEE Xplore Digital Library

Acm Digital Library

Springer Journals etc

2.2 Some Relevant Research Papers

Paper1

Title of paper A Performance Comparison of the Ad hoc

network protocols

Authors Qian Feng, Zhongmin Cai, Jin Yang, Xunchao Hu

Year of Publication 2009

Publishing details 2009 Second International Workshop on Computer Science and

Engineering

Summary In this paper, the performance of the four different ad hoc routing

protocols is compared and analyzed in NS2. The result concluded

that the average throughputs of AODV and DSR are higher,

compared with OLSR and DSDV. On the other hand, the average

delay times of the table- driven protocols are lower and the

average jitters of DSDV and OLSR are smaller and more stable.

As the scale of the network grows, the number of packets

generated in the network becomes much greater for OLSR and

DSDV, which leads to a reduction of throughput and stability.

Taking into account of all the factors, it could be concluded that in

the relatively small and stable wireless network or in the situation

where there are strict requirements on the time, DSDV and OLSR

are more appropriate.

Web link http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&a

rnumber=5403292

13

Paper2

Title of paper Multicast routing with AODV Routing

protocol

Authors Aki Anttila

Year of Publication 2006

Publishing details IEEE Journal 2006

Summary This paper discusses about multicast AODV (MAODV). MAODV is

developed to be used in networks that contains number of mobile

nodes that move around and therefore network topology changes

continuously. It is based on bi-directional shared trees that are created

and terminated as the multicast receivers join and leave the multicast

groups. MAODV contains routing tables for multicast routes and two

messages (MACT, GRPH) in addition to AODV’s, RREQ and RREP.

This paper also discusses about multicast tree creation and passing of

messages in MAODV. Also discusses about other approaches for

multicast routing in Ad-hoc networks.

Web link http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&a

rnumber=05711719

Paper3

Title of paper ADIAN: A Distributed Intelligent Ad-Hoc Network

Authors Saeed Shahbazi, Gholamreza Ghassem-Sani,

Mohammad Ghanbari and Mehdi Dehghan

Year of Publication 2006

Publishing details ICDCN 2006, LNSC4308, pp. 27-39, 2006

Summary In this paper, a new routing protocol for mobile ad-hoc networks

(ADIAN) which is based on the concepts of Distributed Artificial

Intelligence (DAI). In this protocol, each node as an independent

and autonomous agent that collaborates the other agents of the

system. There are some other protocols also that implement DAI for

example ARAMA and ANT-AODV.

ADIAN implements four tables: State, Routing, Neighborhood and

Belief table. Each agent in ADIAN learns the status of other agents

through communications. Whenever a new agent enters into the

system it will construct its own tables and other agents tables are

also updated.

Web link http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&a

rnumber=06884319

14

Paper4

Title of paper Research on Routing Protocols in Ad Hoc Networks

Authors Dou Niu, Yan Zhang, Yanjuan Zhao, Mei

Yang

Year of Publication 2009

Publishing details International Symposium on Computer Science and

Computational Technology

Summary Wireless Ad Hoc network is a special structure of the wireless

communication network, whose communication relies on their

cooperation among the nodes and achieve it in the manner of

wireless multi-hop. Therefore, this kind of network does not rely on

any fixed infrastructure, and has the properties of self organizing

and self-managing. This special network mode makes ad hoc

network not only apply to military communications, but also

apply to civilian communication such as environmental

monitoring, disaster-site temporary communications and so on.

At the same time, Ad Hoc network has properties of mobile

communications and computer networks so it can be seen as a

special type of mobile computer communications networks. In this

paper, first, some basic knowledge about the Ad Hoc networks was

given, including the concept of Ad Hoc networks, characteristics,

and then research a number of classic routing protocols of Ad Hoc

Network.

Web link http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&a

rnumber=1105382

15

2.3 Integrated Summary of Literature Studied:

At, first we study the existing protocols of ad-hoc networks. Some of them are:

Figure: 1 Existing protocols of ad-hoc networks

DSDV (Destination-Sequenced Distance-Vector Routing)

OLSR (Optimized Link State Routing Protocol)

DSR (Dynamic Source Routing)

AODV (Ad hoc On-Demand Distance Vector)

Taking into account of routing protocol performance issues in practical we will use three

metrics to measure the performance of routing protocols.

End-to-end data throughput analyzes the total number of bytes of the packets delivered

successfully per unit time, which can be formulated as

tpi(t)= ϕ.n(t)

t

in which tpi(t) is the data throughput at node I during the time t, ϕ is the average size of a

package and ni(t) is total number of packets that the node I sent and received during a period of

t seconds.

End-to-end time delay measures the time required to deliver a package x from node i to the

destination, which is computed from

Di(x)= Tdr(x)-Ti

s(x)

16

Tdr(x) is the time when the destination receives packet x from node i, Ti

s(x) is the time when

node i sends the packet x, and Di(x) is end-to-end time delay of packet x. End-to-end time

delay is to evaluate the efficiency of transferring a packet. The less it is, the higher the

efficiency of this protocol is.

PDV (Packet Delay Variation), also known as jitter, is the difference in end-to-end delay

between selected packets in a flow with the lost packets being ignored. PDV is known as one

of important service factors in assessment of ad hoc network performance. The jitter vi(t) of

node i at time t can be computed as

vi(t)= Di(xj)- Di(xk)

seqn(xj)-seqn(xk)

in which seqn(xk) is the sequence number of packet k. PDV is used to measure the variability

of the packet latency across a network over time. If the value of this metric is small, then the

performance of the network is stable.

Then we study about their performance and see what things we can do in our implementation.

Unicasting, Multicasting and Broadcasting concept are studied in detail along with their use in

different protocols. Multicast routing in AODV which implements tree concepts for transferring

of data packets. It uses group multicasting.

ADIAN is the protocol we are implementing it takes into account some tables for routing i.e.

belief table, neighbour table, routing table and state table and routing is done on this information

after which data packet transfer takes place.

17

2.4 Empirical Study

2.4.1 Summary of Field Survey

802.11 Family

It is set of Media Access Control (MAC) and Physical Layer (PHY) specifications for

implementing Wireless local area network (WLAN) computer communication in various

frequency bands.

Protocols of 802.11 Family

802.11-1997 (802.11 legacy)

802.11a

802.11b

802.11g

802.11-2007

802.11n

802.11-2012

802.11ac

802.11ad

802.11af

802.11ah

802.11ai

802.11aj

802.11aq

802.11ax

Table2: Comparison of different versions of 802.11

18

2.4.2 Tool Survey

Network Simulator 2(NS2)

• Developed by UC Berkeley

• Popular simulator in scientific environment

• Other popular network simulators

Glomosim: UCLA, CMU; ParseC, Mobile Simulation mostly

OPNET: commercial software, graphical interface, not free;

Others: commercial ones, not free, e.g. IBM TPNS.

NS2 Goals

• To support networking research and education

Protocol design, traffic studies, etc.

Protocol comparison;

New architecture designs are also supported.

• To provide collaborative environment

Freely distributed, open source;

Increase confidence in result

Protocols/Models supported by NS2

• Wired Networking

Routing: Unicast, Multicast, and Hierarchical Routing, etc.

Transportation: TCP, UDP, others;

Traffic sources: web, ftp, telnet, cbr, etc.

Queuing disciplines: drop-tail, RED, etc.

QoS: IntServ and Diffserv Wireless Networking

Two Languages: C++, OTcl

OTcl: short for MIT Object Tcl,

an extension to Tcl/Tk for object-oriented programming.

Used to build the network structure and topology

Easily to configure your network parameters;

Not enough for research schemes and protocol architecture adaption.

19

3. Implementation and Testing

3.1 Requirements Specifications

Hardware Requirements

Hard disk: 10 GB minimum

Ram: 1GB minimum

Software Requirements

System Type: 64-bit operating system,x-64 based processor

OS Installed: Red Hat Enterprise Linux 6 or Ubuntu

Network Simulator 2 (NS2) installed

3.2 Functional Requirements and Non Functional Requirements

Functional Requirements

• It should simulate the wireless routing protocols using ns2.

• It should calculate the packet delivery ratio of corresponding nodes.

• It should calculate end to end delay of every node.

• It should select that particular node for transmission which is maximum efficient.

Non-Functional Requirements

• Portability: Since OS is installed in pen drive. So it can run on any system.

• Security: The packet is transmitted to the designated node only. Thus preventing data leak

• Reliability: The system is highly reliable.

• Accessibility: It can be easily accessible i.e. click & run.

• Efficiency: Resource consumption for given load is quite low.

• Fault tolerance: Our system is not fault tolerant due to insufficient hardware.

• Robustness: Our system is not capable to cope with errors during execution.

• Scalability: Our project is scalable i.e. we can add more resources to our project

without disturbing the current scenario.

20

3.3 Overall Architecture with Component Description and Dependency Details

3.3.1 Sequence Diagram

Fig: 2 Sequence Diagram

The above diagram describes about how we run different protocols on our system and compare

different protocols on the basis of parameters.

21

3.3.2 Control Flow Diagram

Fig: 3 Control Flow Diagram

The above diagram describes our project from the very initial stage:

First step is to install NS2 on Linux.

Second is to implement the different routing protocols, on smaller number of nodes,

which are to be compared on the basis of different parameters.

Now, we run the different protocols for more number of nodes than previous simulation

and compare them again. This step will be repeated one more time. Each time comparing

the results on the basis of performance parameters.

22

3.4 Algorithms / Protocols and Implementation Details

A Distributed Intelligent ad-hoc network (ADIAN)

Each node maintains state, routing, neighborhood and belief tables. “State Table” will contain

latest information about the agent. “Routing Table” maintains destination agents and

appropriate neighbor to reach the packet to desire destination. “Neighborhood Table” contains

list of neighbor. “Belief Table” contains information about every node’s belief degree

(accuracy of information).

Belief Table

Next_hop Destination_add No_of_nodes Total Success Belief

Agent X Agent A N 10 7 70%

Table 3: Belief Table

Belief = (Success/ Total) * 100

Route Discovery

Agents are responsible of delivery of packets from source to destination by finding optimal

root. A node that wants to send / forward data packet will check its neighborhood tables and

belief table to choose the best neighbor to forward the packet. By using the belief factor from

belief table the node will be chosen the one having the better belief factor.

Route Maintenance

Route maintenance is responsible for maintaining routes during transmission. In ADIAN there

is no need to send additional control packet to maintain routes. Data packets in their journey

are used to update the knowledge of visited agents, therefore agents receive up-to-date

information about each other.

Another problem is to prevent routing loops. ADIAN prevents routing loops using a list of

illegal neighbors. If a data packet passes through a node, then it adds the previously visited

nodes to its lists. Agents are not allowed to use the nodes in their illegal list for routing.

23

3.5 Testing

3.5.1 Testing Plan

Type of Test Will it be

Performed?

Explanations Software Component

Requirement

Yes Requirement testing is testing the

requirements whether they are

feasible or not. Because a project

depends on a number of factors

like time, resources, budget etc.

Before we start working on a

project it is important to test these

requirements.

Manual work, need

to plan out all the

software

requirements, time

needed to develop,

technology to be

used etc.

Unit Yes Testing by which individual units

of source code are tested to

determine if they are fit for use.

Manual check is

required

Integration Yes Testing wherein individual

components are combined and

tested as a group.

Compiling full part of

the code and testing

it together.

Performance

Yes

Testing to evaluate the input

where the best and most

optimal output is Yielded by

the system.

Protocols used

insure this.

Stress Yes Simulating beyond normal

Operational capacity.

Heavy data files.

Compliance Yes It determines, whether we are

implementing and meeting the

defined standards.

Need in testing the

performance metric

Volume

Yes

It will be able to simulate the

nodes up to a limit.

The protocol ensures

this.

Security

Yes

The packet is transmitted to the

designated node only.

prevents data

leakage

Table 4: Testing

24

3.5.2 Component decomposition and type of testing required

S.No. Various components

that require testing

Type of testing

required

Technique for

writing Test cases

1 Protocols

Implemented

Unit, Performance,

Volume, Security

White box

2 Performance Metric

and results

Unit, Performance,

Stress

Black box

3 NS2 tool and results Unit, Performance,

Integration

White box

Table 5: Testing Components

3.5.3 List all test cases

S.No. Input Output Status

1 Activate the NS2 software

and execute the code for

routing protocols.

NS2 works code

executes without

error

Pass

2 Execute routing protocols Desired outputs

accordingly

Pass

3 Comparison Metric Protocols

comparison on

given metric

Fail

Table 6: Test Cases

3.5.4 Limitations

There might be a better approach than this protocol.

The networks are simulated for based on certain assumptions and fixed

parameters. The variety of parameters is something that can be looked into.

25

3.6 Risk Analysis and Mitigation Plan

3.6.1 Risk Analysis

Risk

id

Classification Description of risk Risk area Probability

(P)

Impact(I) Re(P

*I)

1 Hardware Incapability of hardware

like RAM, Processor,

Memory etc

Performance,

hardware,

Time

High High 8.1

2 Multitenancy

(Shared

access)

All the users are using

the same physical

architecture

Security Low Low 0.1

3 Security Critical Data at risk Security High Medium 8.1

4 Security Authentication,

authorization, and access

control

User, Project

Scope, Time

High High 8.1

5 Hardware Processor can direct boot

from pen drive

Performance,

Time

Low High 0.9

6 Ownership User the owner of data Security High Low 0.9

7 Environment Ubuntu and ns2 is

necessary for simulation

Performance,

Time

High Medium 8.1

8 Personnel

Related

Incompetent Skills Time High High 8.1

9 Personnel

Related

Irregularity Time Medium High 2.7

Table 7 : Risk Analysis

RATING IMPACT PROBABILITY

HIGH 9 0.9

MEDIUM 3 0.3

LOW 1 0.1

Table 8 : Impact

26

3.6.2 Mitigation Plan

Risk Mitigation Plan

Hardware Hardware related issues can be resolved by

using powerful processors support, Faster

RAMs and Bigger Storage device. Security Secure connection must be established between

the nodes.

Personnel Related Placements Activities are unavoidable.

Projects related skills need time because no one

hasn’t explored it yet completely. We will try

to avoid irregularity.

Environments Ns2 must be installed on Ubuntu

Table 9 : Mitigation Plan

27

4. Conclusion and Future Work

4.1 Conclusion

Ad-hoc networks are flexible networks and do not have in preinstalled infrastructure. There have

been certain developments in this field till now but due to mobility of nodes routing in ad-hoc

networks is still a challenging issue.

In this project we have implemented ADIAN, routing is performed by DAI methods. This

protocol is robust and has less routing overhead. It is power and energy efficient. Routing is

accurate and cost efficient.

4.2 Future Work

The following features can be incorporated in the future work for the development

of project :

Try to implement this using multicast technique using tree or graph approach.

Implement for large number of nodes and analyze their results through simulation.

Try to implement these techniques using different simulating tools.

28

Appendix

A. Gantt chart

TASK 11-02-

2015

23-03-

2015

24-03-

2015

28-03-

2015

07-04-

2015

10-04-

2015

02-05-

2015

03-05-

2015

Topic

Discussion

with mentor

Topic

Finalization

and

requirement

discussion

Initial proposal

collection of

Data-Set

Progress

reported to

mentor of till

date work

Mid Term

Evaluation

Work on

management

and final

implementation

Final

Evaluation

29

B. References

1. http://en.wikipedia.org/wiki/List_of_ad_hoc_routing_protocols

2. http://en.wikipedia.org/wiki/IEEE_802.11

3. http://en.wikipedia.org/wiki/IEEE_802.11#802.11ac

4. http://en.wikipedia.org/wiki/ZigBee

5. http://en.wikipedia.org/wiki/LTE_(telecommunication)

6. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5403292

7. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=05711719

8. http://en.wikipedia.org/wiki/Ad_hoc_Ondemand_Distance_Vector_Routing

9. http://en.wikipedia.org/wiki/DestinationSequenced_Distance_Vector_routing C Perkins, E

Belding-Royer, S Das, “Ad hoc On-Demand

10. http://link.springer.com/chapter/10.1007%2F11947950_3#page-1

11. http://dl.acm.org/citation.cfm?id=272250

12. https://scholar.google.co.in/scholar?q=dsr+routing+protocol&hl=en&as_sdt=0&as_vis=1&

oi=scholart&sa=X&ei=G0NwVcg4hrG4BKC0gMAM&ved=0CBoQgQMwAA

13. http://en.wikipedia.org/wiki/Dynamic_Source_Routing

14. https://tools.ietf.org/html/rfc4728