View
475
Download
3
Embed Size (px)
Citation preview
Dr.A.Kathirvel Professor
Kalasalingam University
Krishnankoil
FDP on Advanced Networking and Cloud
Computing
Simulation of Advanced Networking using
GloMoSim Simulator
Dr.A.Kathirvel
Professor & HOD Department of Information Technology
09.12.2014 and 10.12.2014
Ad Hoc Networks (Session – I)
4
Outline
Introduction Ad Hoc Wireless Networks Research Issues in MANET Ad Hoc Wireless Internet
Conclusion
Advent of Ad hoc Wireless Networks
The principle behind ad hoc networking is multi-hop relaying in which messages are sent from the source to the destination by relaying through the intermediate hops (nodes).
In multi-hop wireless networks, communication between two end nodes is carried out through a number of intermediate nodes whose function is to relay information from one point to another. A static string topology is an example of such network:
0 1 2 3 4 5 6 7
In the last few years, efforts have been focused on multi-hop "ad hoc" networks, in which relaying nodes are in general mobile, and communication needs are primarily between nodes within the same network.
6
Ad hoc Wireless Networks
An examples of such developments is the Bluetooth standard that
is one of the first commercial realizations of ad hoc wireless networking developed by Bluetooth Special Interest Group (SIG):
A piconet formed by a group of nodes establishes a single-hop (master node) point-to-point wireless link.
A scatternet formed by multiple piconets (master nodes) can establish a multi-hop wireless network.
Though the IEEE 802.11 protocols have developed for the wireless networks, they don’t function well in multi-hop networks.
Realizing the necessity of open standards in this emerging area of computer communication, the mobile ad hoc networks (MANET) standards are being developed by the Internet Working Tasking Force (IETF) MANET working group.
7
Ad hoc Wireless Networks
Even though ad hoc wireless networks are expected to work in the absence of any fixed infrastructure, recent advances in wireless network architectures enable the mobile ad hoc nodes to function in the presence of infrastructure
Multi-hop cellular networks (MCNs), self-organizing packet radio ad hoc networks with overlay (SOPRANO), and mesh networks are examples of such types of networks.
Mesh networks serve as access networks that employ multi-hop wireless forwarding by non-mobile nodes to relay traffic to and from the wired Internet. In such an environment, hybrid technologies and/or hierarchical network organization can be used for ad hoc and infrastructure wireless links.
8
Cellular and Ad Hoc Wireless Networks
The following figure represents different wireless networks.
Infrastructure: cellular wireless networks
Ad hoc: wireless sensor networks
Hybrid: mesh networks
Cellular Wireless Networks
Hybrid Wireless Networks
Wireless Mesh Networks
Wireless Sensor Networks
Cellular Vs Ad Hoc Networks
Cellular Networks Ad Hoc Wireless Networks
Fixed infrastructure-based Infrastructureless
Guaranteed bandwidth (designed for
voice traffic)
Shared radio channel (more suitable for
best-effort data traffic)
Centralized routing Distributed routing
Circuit-switched (evolving toward
packet switching)
Packet-switched (evolving toward
emulation of circuit switching)
Seamless connectivity (low call drops
during handoffs)
Frequent path breaks due to mobility
High cost and time of deployment Quick and cost-effective deployment
Reuse of frequency spectrum through
geographical channel reuse
Dynamic frequency reuse based on
carrier sense mechanism
Easier to employ bandwidth reservation Bandwidth reservation requires complex
medium access control protocols
10
Cellular Vs Ad Hoc Networks
Cellular Networks Ad Hoc Wireless Networks
Application domains include mainly
civilian and commercial sectors
Application domains include battlefields,
emergency search and rescue operations,
and collaborative computing
High cost of network maintenance
(backup power source, staffing, etc.)
Self-organization and maintenance
properties are built into the network
Mobile hosts are of relatively low
complexity
Mobile hosts require more intelligence
(should have a transceiver as well as
routing/switching capability)
Major goals of routing and call
admission are to maximize the call
acceptance ratio and minimize the
call drop ratio
Main aim of routing is to find paths with
minimum overhead and also quick
reconfiguration of broken paths
Widely deployed and currently in the
third generation of evolution
Several issues are to be addressed for
successful commercial deployment even
though widespread use exists in defense
11
Applications of Ad hoc Wireless Networks
Military applications
Ad hoc wireless networks is useful in establishing communication in a battle field.
Collaborative and Distributed Computing
A group of people in a conference can share data in ad hoc networks.
Streaming of multimedia objects among the participating nodes.
Emergency Operations
Ad hoc wireless networks are useful in emergency operations such as search and rescue, and crowd control.
A Wireless Mesh Network is a mesh network that is built upon wireless communications and allows for continuous connections and reconfiguration around blocked paths by "hopping" from node to node until a connection can be established.
12
Wireless Mesh Networks
In a wireless mesh network, multiple nodes cooperate to relay a message to its destination. The mesh topology enhances the overall reliability of the network, which is particularly important when operating in harsh industrial environments.
13
Wireless Mesh Networks
The investment required in wireless mesh networks is much less
than in the cellular network counterparts.
Such networks are formed by placing wireless replaying equipment spread across the area to be covered by the network.
The possible deployment scenarios include:
Residential zones (where broadband Internet
connectivity is required)
Highways (where a communication facility for
moving automobiles is required)
Business zones (where an alternate communication system to cellular networks is required)
Important civilian regions (where a high degree of service availability is required)
University campuses (where inexpensive campus-wide network coverage can be provided)
14
Wireless Mesh Networks
Wireless mesh networks should be capable of self-organization
and maintenance.
Advantages
High data rate
Quick and low cost of deployment
Enhanced services
High scalability
Easy extendability
High availability
Low cost per bit
High availability
Low cost per bit
It operates at 2.4 GHz or 5 GHz
Data rates of 2 Mbps to 60 Mbps can be supported.
15
Wireless Sensor Networks
Wireless Sensor Networks are a special category of ad hoc networks that are used to provide a wireless communication infrastructure among the sensors deployed in a specific application domain.
A sensor network is a collection of a large number of sensor nodes that are deployed in a particular region.
Distinct properties of wireless sensor networks:
Mobility of nodes are not needed in all cases in wireless sensor networks.
The size of the network is much larger than that in a typical ad hoc wireless network.
The density of nodes in a sensor network varies with the domain of application.
The power constraints in sensor networks are much more stringent than those in ad hoc wireless networks.
Wireless Sensor Networks
Distinct properties of wireless sensor networks:
The power source can be classified into three categories:
Replenishable power resource
Non- Replenishable power source
Regenerative power source
Data/information fusion aims at processing the sensed data at the intermediate nodes and relaying the outcome to the monitor node.
The communication traffic pattern varies with the domain of applications.
17
Hybrid Wireless Networks
Hybrid Wireless Networks
Multi-hop cellular networks (MCNs) allows the transmission through the base stations or multi-hop of mobile nodes.
Integrated cellular ad hoc relay (iCAR) is a system that combines conventional cellular technology with Ad hoc Relay Station (ARS) technology. In this system cellular stations will relay or reroute calls from the congested cell to an adjacent one that is not congested.
Advantages
Higher capacity than cellular networks
Increased flexibility and reliability in routing
Better coverage and connectivity
18
Issues in Ad hoc Wireless Networks
Medium access scheme
Distributed operation is required.
Throughput needs to be maximized.
Access delay should be minimized.
Synchronization is required in TDMA-based systems.
Hidden terminals are nodes hidden from a sender.
Exposed terminals are exposed nodes preventing a sender from sending.
Fairness refers to provide an equal share to all competing nodes.
Real-time traffic support is required for voice, video, and real-time data.
Resource reservation is required for QoS.
Ability to measure resource availability handles the resources.
Capability for power control reduces the energy consumption.
Adaptive rate control refers to the variation in the data bit rate.
Use of directional antennas has advantages including increased spectrum reuse, reduced interference, and reduced power consumption.
Issues in Ad hoc Wireless Networks
Routing
Mobility
Bandwidth constraint
Minimum route acquisition delay
Quick route reconfiguration
Loop-free routing
Error-prone and shared channel: wireless channel (10-5 to 10-3), wired channel (10-12 to 10-9)
Location-dependent contention depends on the number of nodes.
Other resource constraints such as computing power, battery power
Distributed routing approach
Minimum control overhead
Scalability
Provisioning of QoS
Support for time-sensitive traffic: hard real-time and soft real-time traffic
Security and privacy
20
Issues in Ad hoc Wireless Networks
Provisioning of multiple links among the nodes in an ad hoc network results in a mesh-shaped structure. The mesh-shaped multicast routing structure work well in a high-mobility environment.
The issues in multicast routing protocols are:
Robustness: It must be able to recover and reconfigure quickly.
Efficiency: It should make a minimum number of transmissions to deliver a packet.
Control overhead: It demands minimal control overhead.
Quality of service: QoS support is essential.
Efficient group management needs to be performed with minimal exchange of control messages.
Scalability: It should be able to scale for a large network.
Security is important.
21
Issues in Ad hoc Wireless Networks
The objectives of the transport layer protocols include:
Setting up and maintaining end-to-end connections
Reliable end-to-end delivery of data packets
Flow control
Congestion control
Connectionless transport layer protocol (UDP), unaware of high contention, increases the load in the network.
Pricing Schemes need to incorporate service compensation.
Quality of Service Provisioning
QoS parameters based on different applications
QoS-aware routing uses QoS parameters to find a path.
QoS framework is a complete system that aims at providing the promised services to each users.
22
Issues in Ad hoc Wireless Networks
Self-Organization is required in ad hoc wireless networks:
Neighbor discovery
Topology organization
Topology reorganization
Security
Denial of service
Resource consumption
Energy depletion: deplete the battery power of critical nodes
Buffer overflow: flooding the routing table or consuming the data packet buffer space
Host impersonation: A compromised node can act as another node.
Information disclosure: a compromised node can act as an informer.
Interference: jam wireless communication by creating a wide-spectrum noise.
23
Issues in Ad hoc Wireless Networks
Addressing and Service Discovery is essential because of absence of a centralized coordinator.
Energy Management
Transmission power management: The radio frequency (RF) hardware design should ensure minimum power consumption.
Battery energy management is aimed at extending the battery life.
Processor power management: The CPU can be put into different power saving modes.
Devices power management: Intelligent device management can reduce power consumption of a mobile node.
Scalability is expected in ad hoc wireless networks.
24
Issues in Ad hoc Wireless Networks
Deployment considerations
Low cost of deployment
Incremental deployment
Short deployment time
Reconfigurability
Scenario of deployment
Military deployment
Emergency operations deployment
Commercial wide-area deployment
Home network deployment
Required longevity of network
Area of coverage
Service availability
Operational integration with other infrastructure
Choice of protocols at different layers should be taken into consideration.
25
Issues of Ad hoc Wireless Internet
Gateways
Gateway nodes are the entry points to the wired Internet and generally owned and operated by a service provider.
Perform the following tasks: keeping track of the end users, band-width fairness, address, and location discovery.
Address mobility
Solutions such as Mobile IP can be used.
Routing
Specific routing protocols for ad hoc networks are required.
Transport layer protocol
Split approaches that use traditional wired TCP for the wired part and a specialized transport layer protocol for the ad hoc wireless network part.
Load balancing
Load balancing techniques are essential to distribute the load so as to avoid the situation where the gateway nodes become bottleneck nodes.
26
Issues of Ad hoc Wireless Internet
Pricing/billing
It is important to introduce pricing/billing strategies for the ad hoc wireless internet.
Provisioning of security
It is essential to include security mechanisms
QoS support
Voice over IP (VoIP) and multimedia applications require the QoS support.
Service, address, and location discovery
Service discovery refers to the activity of discovering or identifying the party which provides a particular service or resource.
Address discovery refers to the services such as address resolution protocol (ARP) or domain name service (DNS).
Location discovery refers to different activities such as detecting the location of a particular mobile node.
Simulator (Session – II)
Outline
Introduction to Simulation
Discrete Event Simulation
Simulator
NS - 2
GloMoSim
QualNet 5.0
Conclusion
Introduction to Simulation
What is simulation?
A simulation is the imitation of the operation of a real-world process or system over time.
Introduction to Simulation
System and System Environment
To model a system, it is necessary to understand the concept of a system and the system boundary.
A system is defined as a group of objects that are joined together in some regular interaction or interdependence toward the accomplishment of some purpose.
A system is often affected by changes occurring outside the system. Such changes are said to occur in the system environment.
In modeling a system, it is necessary to decide on the boundary between the system and its environment.
Introduction to Simulation
Components of a System
An entity is an object of interest in the system.
An attribute is a property of an entity.
An activity represents a time period of specified length.
The state of a system is defined to be that collection of variables necessary to describe the system at any time.
An event is defined as an instantaneous occurrence that may change the state of the system.
Discrete System
A discrete system is one in which the state variables change only at a discrete set of points in time.
Introduction to Simulation
Model of a System
A model is a representation of a system for the purpose of studying the system.
For most studies, it is enough to consider only those aspects of the system that affects the problem under investigation.
Therefore, in most cases, a model is a simplification of the system.
On the other hand, the model should be sufficiently detailed to permit valid conclusions to be drawn about the real system.
Introduction to Simulation
Types of Models
Static/Dynamic
A static simulation model, sometimes called a Monte Carlo simulation, represent a system at a particular point in time.
A dynamic simulation model represents a system as it changes over time.
Deterministic/Stochastic
Simulation models that contain no random variables are classified as deterministic
Deterministic models have a known set of inputs that will result in a unique set of outputs.
On the other hand, a stochastic simulation model has one or more random variables as inputs. (e.g., random backoff timers)
Introduction to Simulation
Discrete/Continuous
Like the definitions for discrete and continuous systems, discrete and continuous models are defined similarly.
However, a discrete simulation model is not always used to model a discrete system, nor is a continuous model always used to model a continuous system.
Discrete-Event System Simulation
Discrete-event system simulation is widely used and is the focus of this course.
Discrete-event system simulation is the modeling of the systems in which the state variables change only at a discrete set of points in time.
Discrete Event Simulation
Strategies of discrete event simulation
Activity-oriented simulation
Event-oriented simulation
Process-oriented simulation
Discrete Event Simulation
Activity-oriented simulation
The programmer defines activities which are started when certain conditions are satisfied.
In many cases, this type of simulation uses a simulated clock which advance in constant increments of time.
With each advance, a list of activities is scanned, and those which have become eligible are started.
This type of model is used more often with simulating physical devices.
Simulate Network System
Going to be very slow to execute
Most time increments will produce no change to the system at all
Discrete Event Simulation
Discrete Event Simulation
Event-oriented simulation
The simulation programmer defines events and then writes routines which are invoked as each kind of event occurs
Simulated time may pass between the events
Usually, a priority queue will be used
Discrete Event Simulation
Discrete Event Simulation
Process-oriented simulation
The programmer defines the processes (entities, transactions, etc.) and the model in terms of interacting processes.
A process is an independent program or procedure which can execute in parallel with other processes.
The notion of in parallel is used with some liberty
The processes will use the resources of the system.
Resource-oriented
Transaction-oriented
Time Advance
Hold
Send a message to itself in the future
Discrete Event Simulation
Simulator
UCLA Parallel Computing Laboratory http://pcl.cs.ucla.edu/
GloMoSim (Global Mobile system Simulator) is a library-based simulator for wireless networks.
It is designed as a set of library modules, each of which simulates a specific wireless communication protocol in the protocol stack.
The communication protocol stack for wireless networks is divided into a set of layers, each with its own API.
The library has been developed using PARSEC, a C-based parallel simulation language
New protocols and modules can be programmed and added to the library using PARSEC.
Simulators
An object-oriented, discrete event network simulator developed at UC Berkely ( NS-2)
Mainly used for simulating local and wide area networks
It is written in C++ and OTcl (Object-oriented Tcl) and primarily uses OTcl as command and configuration language.
OTcl: Network Topology
C++: Network Component
Simulators
Rapid prototyping of protocols
Comparative performance evaluation of alternative protocols at each layer
Built-in measurements on each layer
Modular, layered stack design
Standard API for composition of protocols across
different layers
Scalability via support for parallel execution
GUI Tools for system/protocol modeling
GloMoSim – 2.03 (Session – III)
Outline
Introduction to GloMoSim
Layers in GloMoSim
GloMoSim Library
Installation
Creating Scenario in GloMoSim-2.03
Introduction to GloMoSim
Global Mobile Information System Simulator (GloMoSim)
Scalable simulation environment for large wireless and
wired communication networks
Parallel discrete-event simulation capability provided by
Parsec
Design and development of GloMoSim framework with
rich protocol stack
Demonstrated scalability of GloMoSim using very high
fidelity models
Introduction to GloMoSim
Demonstated feasibility of real-time simulation of networks
Direct comparison of alternative unicast and multicast
wireless protocols for GloMosim scenarios
GloMoSim simulates networks with up to thousand nodes
linked by a heterogeneous communications capability that
includes multicast, asymmetric communications using
direct satellite broadcasts, multi-hop wireless
communications using ad-hoc networking, and traditional
Internet protocols.
Layers in GloMoSim
The layers in GloMoSim are
Radio (Physical)
MAC (Data Link Layer)
Network
Transport
Application
GloMoSim Library
Modular, extensible library for network models
Model each layer using abstract or detailed model
Built-in statistics collection at each layer
Large and growing model library
Customizable GUI
Open source
GloMoSim Library
GloMoSim Library
Layers Protocols
Mobility Random waypoint, Random drunken, Trace
based
Radio Propagation
(Physical) Two ray and Free space
Radio Model Noise Accumulating
Packet Reception
Models
SNR bounded, BER based with
BPSK/QPSK modulation
Data Link (MAC) CSMA, IEEE 802.11, TSMA and MACA
Network (Routing) IP with AODV, Bellman-Ford, DSR,
Fisheye, LAR scheme 1, ODMRP
Transport TCP and UDP
Application CBR, FTP, HTTP and Telnet
Installations
It support heterogeneous environment
Software works on different OS such as AIX, FreeBSD, IRIS, Redhat, Federo Linux, Sun Solaris, Windows 2000, Windows XP, Windows 95, latest version ..
Installation on Window
Installation in Windows
Step 1 : Pre-requisition for GloMoSim
Java 2 (later version)
Visual C++ ( Visual Studio 6 )
Step 2 : Setting up Environment variables
Step 3 : Extracting GloMoSim software in c directory
Step 4 : Run makent.exe file
Setting Environment Variables
My Computer Properties Advanced
Environment Variables
Environment variables
path , lib , include , PCC_DIRECTORY
Path =C:\glomosim-2.03\parsec\include;
C:\glomosim-2.03\parsec\bin;
C:\glomosim-2.03\glomosim\bin;
Setting Environment Variables
Lib = c:\glomosim-2.03\parsec\lib
INCLUDE = c:\glomosim-2.03\parsec\include
C:\glomosim-2.03\glomosim\include
PCC_DIRECTORY = C:\glomosim-2.03\parsec
Execution
Installation on Unix/Linux
Installation in Unix
Step 1 : Pre-requisition for GloMoSim
Linux version of Java 2 (later version)
GCC version 4.1.2 or later
Step 2 : Customise the Environment variables
Step 3 : Extracting GloMoSim software in root
directory
Step 4 : Run make file
User Specific Environment
SU mode
.bash_profile
path , PCC_DIRECTORY
PATH=PATH:HOME/bin:/glomosim-
2.03/glomosim/main:/glomosim-
2.03/glomosim/include:/glomosim-
2.03/glomosim/bin:/glomosim-
2.03/parsec/bin:/glomosim-2.03/parsec/include
User Specific Environment
PCC_DIRECTORY=/glomosim-2.03/parsec
export PATH PCC_DIRECTORY
Extracting the software
To ucompress the GloMoSim software archive
# tar xvfz glomosim-2.03.tar.gz
Installation
If you are run this tool in fedora Linux, copy all files inside the redhat-7.2 directory, paste it in /parsec directory.
# cd /glomosim-2.03/glomosim/main
Make clean
Make
Creating Scenario in GloMoSim-2.03 (Session – IV)
Outline
Introduction
Input/Output files
Understanding Files/Directories
Design a wired Network
Design a wireless Network
Understanding Transmission range
Discussion
Introduction to scenarios
In GloMoSim, a specific network topology is referred to as a scenario.
scenario allows the user to specify all the network components and conditions under which the network will operate.
Terrain details, channel propagation effects including path loss, wired and wireless subnets, network devices, the entire protocol stack of a variety of standard, and applications running on the network.
Input Files
3 input files
Scenario Configuration file
This is the primary input file for GloMoSim and specifies the network scenario andparameters for the simulation. This file usually the extension “.in”.
Node placement file
This file is referenced by the scenario configuration file and specifies the initial position of nodes in the scenario. This file usually has the extension “.input”.
Application configuration file
This file is referenced by the scenario configuration file and specifies the applications running on the nodes in the scenario. This file usually has the extension “.conf”.
Output File
GloMoSim Statistics file
The primary output file generated by a GloMo simulation run is a statistics file, which has the extension “.stat”. This file contains the statistics collected during the simulation run. Other output files that may be generated by GloMoSim include the trace file (which has the extension “.trace”) which records packet traces.
Configuration files located in bin/ directory :
-IN : app.conf : Application execution options -IN : config.in : Simulation configuration options -OUT : glomo.stat : Simulation results
GloMoSim Sub-Directories
Main, Include, Bin, Doc, TCPLib, Java_gui
Application
Transport
Network
Mac
Radio
Scenarios
GloMoSim Files
File Extensions:
.pc – C source code
.h - C header files
.pi – Message file created and maintained internally by Parsec (don’t edit)
Design a Network using GloMoSim
Wired Networks
Wired Networks In this exercise, you will build and configure a simple
wired network of four nodes connected with point-to-point links shown in the following figure.
By reducing the transmission rate of a link to create a "bottleneck", you will find how applications overwhelm the link and cause significant packet loss.
Normal situation ( PDR = 100 % )
Solution
Step 1: Node placement
Step 2: Wired link definition
Step 3: Creation of routing table
Step 4: Application selection
Step 5: Configuration
Step 6: Execution & Analysis the Results
Scenario Topology
The topology of a network is defined by the number and location of network devices and the physical and logical connections between them.
NODE-PLACEMENT-FILE
Format:
nodeAddr 0 (x, y, z)
The second parameter is for the consistency with the mobility trace format.
0 0 (250, 250, 0)
1 0 (500, 250, 0)
2 0 (375, 500, 0)
3 0 (375, 750, 0)
wired link definition
Each link is bidirectional, and the bandwidth is specified in bits per second.
Format:
nodeAddr1 nodeAddr2 bandwidth1 propDelay1
0-----|
|______
|2 3
1-----|
0 2 10000000 1MS
1 2 10000000 1MS
2 3 10000000 1MS
Routing Table (static)
Format: sourceAddr destAddr nextHop
0-----|
|______
|2 3
1-----|
0 1 2 0 2 2 0 3 2
1 0 2 1 2 2 1 3 2
2 0 0 2 1 1 2 2 0
2 3 3 3 0 2 3 1 2
3 2 2
Application Layer
The traffic generators currently available are FTP, FTP/GENERIC, TELNET, CBR, and HTTP.
FTP <src> <dest> <items to send> <start time>
FTP/GENERIC <src> <dest> <items to send> <item size> <start time> <end time>
TELNET <src> dest> <session duration> <start time>
CBR <src> <dest> <items to send> <item size> <interval> <start time> <end time>
Client: HTTP <address> <num_of_server> <server_1> ... <server_n> <start> <thresh>
Server: HTTPD <address>
CBR 0 3 75 512 1MS 0S 30S
CBR 1 3 75 512 1MS 0S 30S
Configure the wired Network
SIMULATION-TIME 100S
SEED 2
TERRAIN-DIMENSIONS (1000, 1000)
NUMBER-OF-NODES 4
NODE-PLACEMENT FILE
NODE-PLACEMENT-FILE ./wired_nodes.input
MOBILITY NONE
PROPAGATION-LIMIT -111.0
PROPAGATION-PATHLOSS FREE-SPACE
RADIO-TYPE RADIO-NONOISE
RADIO-BANDWIDTH 2000000
MAC-PROTOCOL WIRED
WIRED-LINK-FILE wired.conf
Configure the wired Network
NETWORK-PROTOCOL IP
NETWORK-OUTPUT-QUEUE-SIZE-PER-PRIORITY 100
ROUTING-PROTOCOL STATIC
STATIC-ROUTE-FILE wired_route.in
APP-CONFIG-FILE ./wired_app.conf
APPLICATION-STATISTICS YES
TCP-STATISTICS NO
UDP-STATISTICS NO
ROUTING-STATISTICS NO
NETWORK-LAYER-STATISTICS NO
MAC-LAYER-STATISTICS NO
RADIO-LAYER-STATISTICS NO
CHANNEL-LAYER-STATISTICS NO
MOBILITY-STATISTICS NO
Output
Node: 0, Layer: AppCbrClient, (0) Server address: 3
Node: 0, Layer: AppCbrClient, (0) Session status: Closed
Node: 0, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 1, Layer: AppCbrClient, (0) Server address: 3
Node: 1, Layer: AppCbrClient, (0) Session status: Closed
Node: 1, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 3, Layer: AppCbrServer, (0) Client address: 1
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.003365200
Node: 3, Layer: AppCbrServer, (0) Session status: Closed
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 75
Node: 3, Layer: AppCbrServer, (0) Client address: 0
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.002910800
Node: 3, Layer: AppCbrServer, (0) Session status: Closed
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 75
Data Packet Dropping Situations
wired link definition
Each link is bidirectional, and the bandwidth is specified in bits per second.
Format:
nodeAddr1 nodeAddr2 bandwidth1 propDelay1
0-----|
|______
|2 3
1-----|
0 2 10000000 1MS
1 2 10000000 1MS
2 3 1000000 1MS
Output
Node: 0, Layer: AppCbrClient, (0) Server address: 3
Node: 0, Layer: AppCbrClient, (0) Session status: Closed
Node: 0, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 1, Layer: AppCbrClient, (0) Server address: 3
Node: 1, Layer: AppCbrClient, (0) Session status: Closed
Node: 1, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 3, Layer: AppCbrServer, (0) Client address: 1
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.233964400
Node: 3, Layer: AppCbrServer, (0) Session status: Not closed
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 56
Node: 3, Layer: AppCbrServer, (0) Client address: 0
Node: 3, Layer: AppCbrServer, (0) Session status: Not closed
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 61
Wireless Networks
Normal situation ( PDR = 100 % )
Solution
Step 1: Node placement
Step 2: Application selection
Step 3: Configuration
Step 4: Execution & Analysis the Results
Scenario Topology
The topology of a network is defined by the number and location of network devices and the physical and logical connections between them.
NODE-PLACEMENT-FILE
Format:
nodeAddr 0 (x, y, z)
The second parameter is for the consistency with the mobility trace format.
0 0 (250, 250, 0)
1 0 (500, 250, 0)
2 0 (375, 500, 0)
3 0 (375, 750, 0)
Application Layer
CBR 0 3 75 512 1NS 10S 30S
CBR 1 3 75 512 1NS 40S 60S
Configure the wireless Network
SIMULATION-TIME 100S
SEED 1
TERRAIN-DIMENSIONS (1000, 1000)
NUMBER-OF-NODES 4
NODE-PLACEMENT FILE
NODE-PLACEMENT-FILE ./wireless_nodes.input
MOBILITY NONE
PROPAGATION-LIMIT -111.0
PROPAGATION-PATHLOSS TWO-RAY
NOISE-FIGURE 10.0
TEMPARATURE 290.0
Configure the wireless Network
RADIO-TYPE RADIO-ACCNOISE
RADIO-FREQUENCY 2.4e9
RADIO-BANDWIDTH 2000000
RADIO-TX-POWER 15.0
RADIO-ANTENNA-GAIN 0.0
RADIO-RX-SENSITIVITY -91.0
RADIO-RX-THRESHOLD -81.0
MAC-PROTOCOL 802.11
ROUTING-PROTOCOL BELLMANFORD
Configure the wireless Network
NETWORK-PROTOCOL IP
NETWORK-OUTPUT-QUEUE-SIZE-PER-PRIORITY 100
APP-CONFIG-FILE ./wireless_app.conf
APPLICATION-STATISTICS YES
TCP-STATISTICS NO
UDP-STATISTICS NO
ROUTING-STATISTICS NO
NETWORK-LAYER-STATISTICS NO
MAC-LAYER-STATISTICS NO
RADIO-LAYER-STATISTICS NO
CHANNEL-LAYER-STATISTICS NO
MOBILITY-STATISTICS NO
Output
Node: 0, Layer: AppCbrClient, (0) Server address: 3
Node: 0, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 1, Layer: AppCbrClient, (0) Server address: 3
Node: 1, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 3, Layer: AppCbrServer, (0) Client address: 1
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.276741535
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 75
Node: 3, Layer: AppCbrServer, (0) Client address: 0
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.280470646
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 75
Data Packet Dropping Situations
Application Layer
CBR 0 3 75 512 1MS 0S 0S CBR 1 3 75 512 1MS 0S 0S
Output
Node: 0, Layer: AppCbrClient, (0) Server address: 3
Node: 0, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 1, Layer: AppCbrClient, (0) Server address: 3
Node: 1, Layer: AppCbrClient, (0) Total number of packets sent: 75
Node: 3, Layer: AppCbrServer, (0) Client address: 1
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.410570911
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 47
Node: 3, Layer: AppCbrServer, (0) Client address: 0
Node: 3, Layer: AppCbrServer, (0) Average end-to-end delay [s]: 0.381539628
Node: 3, Layer: AppCbrServer, (0) Total number of packets received: 47
Advanced Network Simulation using GloMoSim-2.03 (Session – V)
Outline
Manet routing protocols
Multicast routing protocols
Experimental setup for MANET
Discussion
Dynamic Source Routing
This protocol uses the route cache that stores all possible info. Extracted from source route contained in data packet
if an intermediate node receiving a RREQ has a route to the destination in its route cache it sends RREP with a complete route from S to D
Optimizations:
1. Route Cache
This cache information is used by intermediate nodes to reply to the S node when they receive a RREQ and if they have a route to the corresponding D
2. Promiscuous mode
By operating in this mode, an intermediate node learns abt the path breaks. Info. Gained is used to update the route cache so that the active routes maintained in route cache don’t use such links
3. During networks partition
The affected nodes initiate RREQ packets an exponential backoff algo. Is used to avoid frequent RREQ flooding in the network when the D is in another dispoint set.
DSR Route maintenance
when an intermediate node moves away causing a wireless link to break. For ex. If the link between node 5 & 7 fails, a route error msg is generated by a node adjacent to path break to inform the source node. The source node reinitiates the route establishment procedure. The cached entries at the intermediate node and S node are removed when the route error packet is received.
Advantages
it eliminates periodical table update msg
intermediate nodes utilize the route cache info efficiently to reduce the ctrl overhead
Disadvantages
route setup delay is more
route maintenance mech doesn’t efficiently repair the path break efficiently
the performance of this protocol degrades rapidly with increasing mobility
Adhoc Ondemand Distance Vector RP
AODV uses ondemand approach, ie a route is established only when it is required by a S node for transmitting data packet
it differs from DSR from the fact that DSR uses source routing in which a data packet carries complete path to the D
in AODV, the S node and intermediate nodes stores the next hop info corresponding to each flow for packet txn
uses dest. Seqno to determine an up-to-date path to the D
a node updates its path info only if the destseqno of the current packet received is greater than the last destseqnum stored at the node
a RREQ carries SID,DID,S-seqno,D-seqno,BcastID and TTL
source 1 initiates the RREQ to be flooded in the nxw for D 15
Assuming that the Dseqno as 3 and Sseqno as 1. When the nodes 2,5 & 6 receive the RREQ, they check their route to the D. In case a route to the D is not avail they fwd it to their neighbors. Here nodes 3, 4 and 10 are neighbors of nodes 2,5 and 6. This is with the assumption that the nodes 3 & 10 have routes to the D node 15 that is thro paths 10-14-15 & 3-7-9-13-15 resp.
AODV
If the Dseqno at node 10 is 4 and is 1 at intermediate node 3 then only node 10 is allowed to reply along the cached route to S. when a path breaks for ex bet nodes 4 and 5, both nodes initiates RERR msg to inform their end nodes abt the link breaks
the end nodes deletes the corresponding entries from their tables. The source node reinitiates the path finding process with the new BcastID and the previous Dseqno
Advantages
routes are estab. On demand and Dseqno are used to identify the latest path
route set up delay is less
disadvantages
Multiple RREP in response to a RREQ packet can lead to a heavy ctrl overhead
periodic beaconing leads to unnecessary BW consumption
Zone Routing Protocol Hybird rp which effectively combines the adv of both proactive and reactive
proactive - Intra zone RP(IARP)- for nodes within a particular zone
Reactive - Inter zone RP(IERP) - for nodes beyond this zone
the routing zone of a given node is a subset of the n/w within which all nodes are reachable within less than or equal to zone radius hops
within routing zone each node maintains the info abt the routes to all nodes by exchanging periodic route update packets
IERP is responsible for finding paths to nodes which are not within the routing zone
when a node S(8) has packet to be sent to node D(16) it checks whether D is within its zone. If the dest. Belongs its own zone then it delivers the pack directly. Otherwise node S bordercast(uses unicast routing to deliver pack directly to the border nodes) the RREQ to its peripheral nodes(2,3,5,19,14,15). If any peripheral finds a path to node D then it sends RREP otherwise it rebordercast the RREQ. This process continues until D is located. Nodes 10 and 14 find the info abt 16 therefore they send RREP pack back to node 8. When an intermediate node in an active path detects a broken link in the path it performs a local path reconfig. In which broken link is bypassed by means of a shorter alternate path
ZRP
Advantages
reduces ctrl overhead compared to the RREQ flooding mechanism employed in on-demand approaches and the periodic flooding of routing info in table driven approaches
disadvantages
the decisions on the zone radius has a significant impact on the performance of the protocol
On-Demand Multicast RP (ODMRP)
In ODMRP a mesh is format by a set of nodes called forwarding nodes which are responsible for forwarding data packets between a some-receiver pair. These forwarding nodes maintain the message cache which is used to detect duplicate data packets and duplicate join Req control packets
Mesh initialization phase
To create a mesh each same in the multicast group floods the joinReq control packets periodically. Upon reception of the joinReq control packet from a source potential receivers can send joinReply through the reverse shortest path. The route between a source and receiver is established after the source receives the joinReply packet. The join Reply packet contains the same ID and the corresponding next node ID.
Mesh maintenance phase
In this phase attempts are made to maintain the multicast mesh topology formed with sources forwarding nodes and receivers. For example due to movement of the receiver R3 (from A to B) when the route S2-I9-I10-R3 breaks R3 can still receive data packets through route S2-I6-I4-I7-I8-R3. When receiver R3 receives new joinReq control packet from node I11, it sends a join Reply on this new shortest path R3-I11-I10-I9-S2 there by maintaining the much structure.
Advantages : Robust
Disadvantages: 1. High control overhead
2. Multicast efficiency is reduced
Wireless Mobile Ad Hoc Networks
Default Parameter setting
Discussion
Questions ?