Sei sulla pagina 1di 65

1/32

Investigation of Some Fundamental Issues of


Connectivity and Topology Control Relevant to
Wireless Ad-Hoc Networks Including Network
Partition and Cross Layer Interaction and Design by
Connectivity Index
Rajan.M.A,
Research Scholar,
Department Of Computer Science,
Dravidian University, Kuppam
Under the Guidance
of
Dr. Lokanatha C. Reddy
and
Dr. Prakash S. Hiremath

2
Outline


Goal of the Research
Brief Introduction to Ad-Hoc networks (MANETS)
Key Fundamental Issues in MANET
Network Modeling
Concept Of Connectivity Index (CI) in MANET.
Mobility and Transmission Power Effect on Topology
K-Connected Networks
Network Partition Detection
CI based Cross Layer Design Methodology
Conclusion
Future Work
Discussion
3
Goal of the Research
Understand the Fundamental issues in
Wireless Adhoc Networks
Connectivity, Scalability, Topology control
and Routing.
Network modeling and simulation
Network Partition Detection
cross-layer design or cross layer
interaction
4
What is MANET?
5
MANET stands for Mobile Adhoc Network.
Each node in an ad-hoc network is equipped
with a radio transmitter and receiver, which
allow it to communicate with other nodes over
wireless channels.
A special kind of ad-hoc network is the sensor
network where the nodes forming the network
do not or rarely moves. Further, the nodes of
a sensor network are similar.
MANET
6
Characteristics
Self-organizing: without centralized control
Scarce resources: bandwidth and batteries
Dynamic network topology


7
Connected Adhoc Network
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
sink
X Axis in meters
Y

A
x
i
s

i
n

m
e
t
e
r
s
Connected Network with 200 nodes and 1324 links
8
Applications

Defense industry (battlefield)
Academic institutions (conference and
meeting)
Personal area networks and Bluetooth
Home networking
Embedding computing applications
Health facilities
Disaster recovery (search-and-rescue)

9
Fundamental Issues
Connectivity
Scalability
Routing
Topology Control




10
Connectivity
One of the fundamental and most important
issues of the MANETs.
The important factor, which affects the
connectivity, is the transmission range of the
nodes and the mobility of the nodes.
Some of the concepts of graph theory that
are extensively used to study the connectivity
issues are graph spanners, proximity graph
sparsifications and spectral graph theory.
11
Scalability
Scalability is the study of network stability, whenever
the number of nodes of the network undergoes
changes.
Addition of nodes to the network may cause the
network be disconnected to start with. This
necessitates topology control, an important issue.
Some of the fundamental questions that arise during
topology change are how the performance of the
network and routing will be affected
The graph theory concepts like graph clustering,
graph partitioning, and graph evolution.
12
Routing
The factors which can affect the routing are
Connectivity
mobility of the nodes.
Scalability of the network
Routing protocols in mobile ad-hoc networks
are more complex than in static networks.
Graph theory concepts like planarity, graph
colouring, graph spanners, clustering plays an
imporrtant role in designing the routing
algorithms.
13
Network Modeling
Graph Theory Concepts
Graph Based Models
Mobility Models

14
Introduction to Graph theory
A graph G is a triplet consists of Vertex set , Edge set and a
relation that associates with each edge, two vertices (end
points). That is a

Graph G is denoted by G(V,E). The two variants of the graph
are number of vertices and number of edges.

Two edges are said to be adjacent to each other if the
one of the end vertex of the edges are same

With respect to the network, a vertex is a node and an edge is a
link between two nodes
A graph G (N, n) with N vertices and n edges algebraically
represented as adjacency matrix, whose entries are given by
15
Introduction to Graph theory
contd..
A graph consists of number of vertices and edges, where an
edge is an association between two vertices.
Mathematically, a graph G is a triplet consists of Vertex Set V(G)
, Edge Set E(G) and a relation that associates with each edge,
two vertices.
An edge between two nodes i and j is represented as (i,j) and
using the usual notation can be written as


A Graph G is denoted as G(V,E)

Two vertices are said to be adjacent to each other, if there exist
an edge between them.
If each edge of a graph is associated with some specific value
(weight), graph is said to be weighted graph.
The number of edges associated with the vertex v is called
degree of a vertex denote by d(v).
( ) ( ) ( ) ( ) { } i j, j i, V j i, j i, G E = e _ and |
16
Introduction to Graph theory
contd..
The minimum degree of a graph is the least degree of a
vertex of a graph denoted by (G) and the maximum degree of
a graph is the maximum degree of any vertex of a graph
denoted by (G).

A graph G is regular if and only if (iff) (G)=(G)

A graph G is said to be connected, if for every pair of vertices
u, v belongs to G, there exist a path, otherwise Graph is
disconnected.

A dis-connected graph has number of components; each
component being a connected graph.
17

Random Graph Models applicable to
Ad-hoc Networks

A lot of research about ad-hoc networks is carried
out using the mathematical models and their
simulation rather than experimenting on real mobile
ad-hoc networks.
Several issues like node density, mobility of the
nodes, link formation between nodes and packet
routing between the nodes needs to be simulated.
To simulate MANETs concepts of graph theory
(particularly random graph theory) is utilized.
Needless to say it is necessary to know the different
models and decide upon the network model to be
simulated.
18
Random Graph Models applicable to
Ad-hoc Networks Contd..
Random graph is denoted by G(n,p).
G(n,p) = set of all random graphs with
parameters n and p
n nodes and each edge is included with
probability p. expected degree = p(n-1)



(1-p)
3

p
3

p(1-p)
2

p
2
(1-p)
19
Random Graph Models
Random static graph models.
the nodes are assumed to be almost stationary but located at arbitrary
positions.
model is more suited for ad-hoc sensor networks, where the nodes in the
network rarely moves.
Example: Erdos and Renyi Model, Binomial Model, Random Geometric
Graph Model and Poisson Cloning Model
Random mobility graph models.
the movement of the node details is taken into considerations.
model is more suitable for mobile ad-hoc networks, where the nodes are
moving.
Individual mobility Models
Group mobility models

Example: random walk mobility model, random waypoint mobility model,
random direction model, boundless simulation area mobility model and
Gauss-Markov mobility model.
20
RANDOM STATIC GRAPH
MODELS
Erdos and Renyi Model
Define a random graph as N labeled nodes connected by n
edges, which are chosen randomly from the (n*(n-1))/2 possible
edges

In total there are graphs with N nodes and n edges,
forming a probability space in which every realization is equi-
probable. The number of edges E
l
in the random graph is then a
random variable with the

expectation
The random graph of Erds and Rnyi is one of the best studied
models of a network because of its simplicity.
Model is not a realistic representation of a wireless ad-hoc network.
In ad-hoc networks, nodes at close range have a higher
probability of being connected than nodes at farther distances.
( )
|
|
.
|

\
|
n
1 N N
| |
( )
2
1 N N
p E E
l

=
21
Random Geometric Graph
Model
Graphs with distance-dependent links
between nodes and correlated links
well suited for modeling ad-hoc networks
as in nodes at close range have a higher
probability of being connected than nodes at
farther distances.
Link between any two nodes is possible ,if
their euclidean distance is atmost r
A variation of RGG is Unit Disc Graph(UDG)
is a RGG with r=1
22
Unit Disc Graph
A simple ad hoc wireless network of
five wireless mobile hosts.
23
RANDOM MOBILITY GRAPH
MODELS
Basically there are two types of mobility models
individual mobility models
group mobility models

individual mobility models
deals with the movement at the node level, where each node is
considered independently from others.
Example:
Random Walk mobility model
Random Waypoint mobility model
Random Direction mobility model
Boundless Simulation Area mobility model
Gauss-Markov mobility model

24
Group mobility models

the mobility of a node is computed relatively
to the mobility of a reference point in the
subset of nodes (group) it belongs to
Example:
Reference Point group mobility model
Exponential Correlated mobility model
Nomadic Community mobility model
Pursue mobility model

25
Important Graph
Theory Concepts
Graph Spanners
Proximity
Unit Distance Graph (UDG)
Nearest Neighbor Graphs (NNG)
Minimum Spanning Trees (MST)
Relative Neighborhood Graphs (RNG)
Delaney Triangulation (DT)
Gabriel Graphs
Spectral graph theory

26
Concept Of Connectivity Index
(CI)
Metric to study the connectivity of the
network.
CI was proposed by Randi index in
1975 to study the physico- chemical
properties properties of the chemical
compounds..
CI of a network is defined by =
CI for random graphs are redefined for
the first time novelly.
( ) G _

e ) (
) ( ) (
1
G E uv
G G
v d u d
27
CI contd..
CI for Erdos and Renyi Model is
defined as
Lemmas
connectivity index of k-regular Erdos and
Renyi random graph is

The connectivity index of complete Erdos
and Renyi random graph is

( )

e
=
) (
) ( ) (
1
,
G E uv
G G
v d u d
p G
p p
_
( )
k 1 n k
2
p 1 p
k
1 n
1 n

|
|
.
|

\
|
|
|
.
|

\
|
|
|
|
.
|

\
|
2
n
28
CI Simulation Analysis

29
Mobility and Transmission
Power Effect on Topology
Affects performance of the MANETs
Connectivity (topology)
Routing
Power Consumption.
Feng Xue and P.R. Kumar[1]:The study
demonstrates that each node in a network
with n randomly placed nodes should be
connected to at least nearest neighbors
Random Geometric Graph (RGG) Model is
adopted to analyze wireless networks.
( ) n log u
30
Mobility and Transmission Power
Effect on Topology Contd..
RGG model

Random Walk
Mobility graph

0
5
10
15
20
5
10
15
4
6
8
10
12
Time(in Seconds)
Mobility of two nodes in Random walk mobility model
X-LOCATION
Y
-
L
O
C
A
T
I
O
N

31
Mobility Effect on Links of the
Network
Mobility Vs CI

Mobility Vs Link

0 10 20 30 40 50 60 70 80 90 100
900
950
1000
1050
1100
1150
1200
1250
1300
Time(in Seconds)
L
i
n
k
s

o
f

t
h
e

N
e
t
w
o
r
k
Effect of Mobility on Number of Links of the network at Tx=30

0 10 20 30 40 50 60 70 80 90 100
48.8
48.9
49
49.1
49.2
49.3
49.4
49.5
49.6
Time(in Seconds)
C
I
Effect of Mobility of Nodes on CI of Network with 100 Nodes at Tx=30
32
Transmission Power Effect on
Links of the Network
Tx Power Vs CI

Tx Power Vs Links

0 20 40 60 80 100 120 140
0
500
1000
1500
2000
2500
3000
3500
4000
4500
5000
Tx Power
Links
Effect of Transmission Power on Links of the 100 nodes Network
0 20 40 60 80 100 120
10
20
30
40
50
60
70
80
90
100
110
Transmission Range of the Nodes
C
o
n
n
e
c
t
i
v
i
t
y

I
n
d
e
x
Effect of Transmission Range on Connectivity Index of the Network with 100 Nodes
33
Transmission Power Effect on
Links of the Network
Link Power Vs CI

Tx Power Vs Links

20 40 60 80 100 120
0
10
20
30
40
50
60
70
80
90
100
Tx Power
C
o
n
n
e
c
t
i
v
i
t
y

o
f

t
h
e

N
e
t
w
o
r
k
Effect of TX Power onConnectivity of the 100 Nodes Network
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000
10
20
30
40
50
60
70
80
90
100
110
NumberOf Links Vs Connectivity Index of the Network with 100 Nodes
Links
C
o
n
n
e
c
t
i
v
i
t
y

I
n
d
e
x

34
Transmission Power Effect on
Links of the Network
Link Power Vs CI

Tx Power Vs Links

0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000
10
20
30
40
50
60
70
80
90
100
110
NumberOf Links Vs Connectivity Index of the Network with 100 Nodes
Links
C
o
n
n
e
c
t
i
v
i
t
y

I
n
d
e
x

35
Transmission Power Effect on
Links of the Network
Link Power Vs CI

Nodes Vs Degree @Tx=30 units

10 20 30 40 50 60 70 80 90 100
0
2
4
6
8
10
12
14
16
18
20
Degree Distribution of the nodes of the network atTransmiision Range 20
Nodes of the Network
D
e
g
r
e
e

o
f

t
h
e

N
o
d
e

0 10 20 30 40 50 60 70 80 90 100
0
500
1000
1500
2000
2500
3000
3500
4000
4500
5000
Connectivity Vs Links of a 100 node wireless Network under Varying Tx Power
Connectivity
L
i
n
k
s

36
Transmission Power Effect on
Links of the Network

Topology @ Tx=20 units


Topology @ Tx=10 units
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
Network Topology at Tx=10, Edges=148 connectivity=0

0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
Network Topology at Tx=20, Edges=501 connectivity=1
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
Network Topology at Tx=30, Edges=975 connectivity=1
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
Network Topology at Tx=40, Edges=1612 connectivity=1
Topology @ Tx=30 units
Topology @ Tx=40 units
37
Transmission Power Effect on
Links of the Network
Topology @ Tx=20 units


Topology @ Tx=80 units
Degree Distribution
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
Tx=80Network Topology at Tx=80, Edges=4079 connectivity=51
0 10 20 30 40 50 60 70 80 90 100
0
10
20
30
40
50
60
70
80
90
100
Fully Connected Network Topology at Tx=126, Edges=4950 connectivity=99
10 20 30 40 50 60 70 80 90 100
0
1
2
Effect Of Variation of Transmission Range of the Nodes on the Degree distribution
10 20 30 40 50 60 70 80 90 100
0
20
40
10 20 30 40 50 60 70 80 90 100
0
50
100
10 20 30 40 50 60 70 80 90 100
0
50
100
10 20 30 40 50 60 70 80 90 100
0
50
100
Nodes of the Network
Degree of the Nodes
Tx=1
Tx=25
Tx=50
Tx=75
Tx=100



38
K-Connected Networks
Between any two nodes of the network K
disjoint paths exist.
K-1 Routes fault tolerant networks.
39
K-Connected Networks Contd..
Lemma
1. Minimum number of edges required for K-
connected graph is or N-1
2. Minimum number of edges that needs to be
added to construct a K+1 connected graph G
from K-connected graph G is
3. The number of possible K-connected graphs
with minimum number of is at-most
or with K=1 and K>1
4. The probability of constructing random K-
connected graph ( K > 1) is less than or equal
to
(

2
KN
(

2
N
(

2
KN
( )
|
|
.
|

\
|

1 N
1 N N
( )
|
|
|
.
|

\
|
(


2
1
KN
N N
( )
( )
( )

=
|
|
.
|

\
|
|
|
|
|
.
|

\
|
(

2
1
2
1
2
2
1
1 N N
n
n
N N
KN
N N
40
K-Connected Networks Contd..
5. The maximum number of packets
transmitted from the nodes in order to
send a packet from one node to another
node in an N-1 connected network
through flooding is
6. Let G be a graph with vertices
and . Suppose for some K,
Such that then
G is K-connected.
( ) 1 ) 2 ( 1 + N N
, ....... , ,
3 2 1 N
x x x x
). ( ..... ) ( ) (
2 1 N
x d x d x d s s s
, 0 N K s s
, 1 ) ( + > K j x d
j
) ( 1 1
1 +
=
K N
x d N j for
41
Simulation of K-Connected
Network
42
Analytical Simulation of K-
Connected Network
K-Connectivity Vs number of possible K-
Connected networks
1 2 3 4 5 6 7 8 9
0
0.5
1
1.5
2
2.5
3
3.5
x 10
12
Connecitvity
N
o

o
f

P
o
s
s
i
b
l
e

N
e
t
w
o
r
k
s
Connectivity Vs Number of Possible Networks(nodes=10)
Connectivity Vs number of K-Connected
networks
1 2 3 4 5 6 7 8 9
0
0.01
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0.09
0.1
Connectivity
P
r
o
b
a
b
i
l
i
t
y
Probability Distribution of Possible K-Connected Networks(with 10 Nodes)

Connectivity Vs CI, energy,links
Connectivity Vs CI, energy ,links
43
NS2 Simulation of K-
Connected Network
QoS Parameters
Packet delivery ratio (PDR)
End to end delay
Routing overhead
Drop packets
Dequeue packets
Average number of packets
generated.
Number of Packets generated
Request packets
Reply packets
Acknowledgement packets
Send packets
Receive packets
Forward packets
Routing Protocols
AODV
DSR
DSDV
44
NS2 Simulation of K-
Connected Network
Time vs Throughput (1-Connected)
0.94
0.95
0.96
0.97
0.98
0.99
1
10 20 30 40 50
Time(Seconds)
T
h
r
o
u
g
h
p
u
t
Throughput for
AODV
Throughput for
DSDV
Throughput for
DSR
Time vs Dropped Packets (1-
Connected)
0
50
100
150
200
250
10 20 30 40 50
Time (Seconds )
D
r
o
p
p
e
d

P
a
c
k
e
t
s
Drop for AODV
Drop for DSDV
Drop for DSR
Time vs Throughput (3-Connected)
0.93
0.94
0.95
0.96
0.97
0.98
0.99
1
10 20 30 40 50
Time (Seconds)
T
h
r
o
u
g
h
p
u
t
Throughput for
AODV
Throughput for
DSDV
Throughput for
DSR
Time vs Dropped Packets(3-
Connected)
0
100
200
300
400
500
600
700
10 20 30 40 50
Time (Seconds)
D
r
o
p
p
e
d

P
a
c
k
e
t
s
Drop for AODV
Drop for DSDV
Drop for DSR
45
NS2 Simulation of K-
Connected Network
Time vs Throughput (5-Connected)
0.88
0.9
0.92
0.94
0.96
0.98
1
1.02
10 20 30 40 50
Time (Seconds)
T
h
r
o
u
g
h
p
u
t
Throughput for
AODV
Throughput for
DSDV
Throughput for
DSR
Time vs Dropped Packets(5-
Connected)
0
100
200
300
400
500
600
700
800
10 20 30 40 50
Time (Seconds )
D
r
o
p
p
e
d

P
a
c
k
e
t
s
Drop for AODV
Drop for DSDV
Drop for DSR
Average Packet Graph (DSDV)
0
5000
10000
15000
20000
25000
1
-
C
o
n
n
e
c
t
e
d
2
-
C
o
n
n
e
c
t
e
d
3
-
C
o
n
n
e
c
t
e
d
4
-
C
o
n
n
e
c
t
e
d
5
-
C
o
n
n
e
c
t
e
d
Connectivity
P
a
c
k
e
t
s
REQUEST
REPLY
ACK
Send
Receive
Drop
Dequeue
Forward
Average Packet Graph (AODV)
0
5000
10000
15000
20000
25000
1
-
C
o
n
n
e
c
t
e
d
2
-
C
o
n
n
e
c
t
e
d
3
-
C
o
n
n
e
c
t
e
d
4
-
C
o
n
n
e
c
t
e
d
5
-
C
o
n
n
e
c
t
e
d
Connectivity
P
a
c
k
e
t
s
REQUEST
REPLY
ACK
Send
Receive
Drop
Dequeue
Forward
46
NS2 Simulation of K-
Connected Network
Average Packet Graph (DSR)
0
5000
10000
15000
20000
25000
30000
35000
1
-
C
o
n
n
e
c
t
e
d
2
-
C
o
n
n
e
c
t
e
d
3
-
C
o
n
n
e
c
t
e
d
4
-
C
o
n
n
e
c
t
e
d
5
-
C
o
n
n
e
c
t
e
d
Connectivity
P
a
c
k
e
t
s
REQUEST
REPLY
ACK
Send
Receive
Drop
Dequeue
Forward
QoS Throughput
0.98
0.982
0.984
0.986
0.988
0.99
0.992
0.994
0.996
AODV
Throughput
DSDV
throughput
DSR Throughput
Protocol
T
h
r
o
u
g
h
p
u
t
Series1
Packet Delivery Ratio
96.9
97
97.1
97.2
97.3
97.4
97.5
97.6
AODV DSDV DSR
Protocols
P
D
RPacket Delivery
Ratio
End to end Delay
0
0.00005
0.0001
0.00015
0.0002
0.00025
0.0003
0.00035
AODV DSDV DSR
Protocols
T
i
m
e
End to end
Delay
47
Network Partition Detection
Partition Detection
pre-detection
Prediction Algorithms
Watch Dogs
Adoptive routing
algorithms
Overhead processing
post-detection
Unstable till partition
detected
Congestion
Less overhead
processing

Network Partition
The failure of set of links
or nodes
Network breaks away
into two or more
components or clusters.
Cause
Mobility Of Nodes
Dynamic topology
changes
Effect
Performance of the
network
Throughput
PDR
Routing performance



48
Clustered Network Partition
Detection (post) using CI
Complete Product of
Two Graphs
Direct Sum of Graphs


0 10 20 30 40 50 60 70 80 90
10
20
30
40
50
60
70
Cluster1
Cluster2
Common Link
0 10 20 30 40 50 60 70 80
10
20
30
40
50
60
70
Complete Prodcut of Two Clusters
Cluster2
Cluster1
49
Clustered Network Partition
Detection (post) using CI
Lemmas
Detection Methods
Spectral graph theory
Demands high processing
time.
Needs distributed algorithm.
Processing time
Exponentially increases with
size of the network.
Connectivity Index
Approach
Less processing time
Simple distributed
algorithm.
Complexity increases with
the links rather than the
nodes.

50
Clustered Network Partition
Detection (post) using CI
51
Network Partition Detection
Algorithm
Input: two minimal 1-connected clustered networks with N1 and
N2 as number of nodes in clusters G1 and G2 respectively .
Let G is a network obtained by the union of two clusters G1 and
G2
Steps
Compute the parameters: CI (G), eigenvalue2 and graph energy.
Choose two nodes u and v randomly, where, and then add the
link between them.
Compute energy of a graph, eigenvalue2 and connectivity index.
Progressively add the links in each cluster.
Partition the network by dropping the link (u, v) between two
clusters and compute the parameters mentioned in step 1 and
restore back the link.
52
Direct Cluster Network
Partition Detection
Algorithm
Input: two minimal 1-connected clustered networks with N1 and
N2 as number of nodes in clusters G1 and G2 respectively .
Let G is a network obtained by the union of two clusters G1 and
G2
Steps
1. Compute the parameters: CI (G), eigenvalue2 and graph energy.
2. Choose two nodes u and v randomly, where, and then add the link
between them.
3. Compute energy of a graph, eigenvalue2 and connectivity index.
4. Progressively add the links in each cluster.
5. Partition the network by dropping the link (u, v) between two
clusters and compute the parameters mentioned in step 1 and
restore back the link.
53
Direct Cluster Network
Partition Detection
6. At some jth iteration, drop a link in each cluster and
compute the parameters mentioned in step 1. Restore
back the links and go to step 3.
7. If the resultant cluster topologies are not fully connected
then go to step 3.
8. Plot the graphs.
9. Step 4 and 5 are executed in order to demonstrate the
post detection of network partition by using CI. Step 6 is
executed in order to study the effect of dropping of two
links from each cluster which do not cause network
partition.
54
Direct Cluster Network
Partition Detection Result
Partition Detection using
spectral value
Higher peak-partition
Lower peak-connected
Partition Detection using CI
Higher peak-partition
Lower peak-connected


55
Direct Product Cluster Network
Partition Detection Result
Partition Detection using
spectral value
Higher peak-partition
Lower peak-connected
Partition Detection using CI
Higher peak-Connected
Lower peak-partitioned
56
CI based Cross Layer Design
(CLD) Methodology
CLD Applicability
1. Resource optimization
2. Topology control
3. Self healing based on node
4. Energy management
5. Load balancing
6. Congestion control
7. Mobility management
8. Scalability
9. Optimized Routing.
10. Fault tolerant
11. QoS efficient networks
12. Video streaming
CLD
Methodology.
Information is
exchanged between
different protocol layers
dynamically.
Exploits interaction
between layers
Promotes adaptability
QoS efficient.
Collaboration across
layers.
networking
signal processing
information theory

57
CI based Cross Layer Design
(CLD) Methodology
PHYSICAL
LINK
NETWORK
TRANSPORT
Synchronization
Adjacent nodes
Discovery
Transmission
Scheduling
remote
radios
simulated
PHY
Node interconnection
End-to-end transport protocols
Routing-structure
maintenance
Packet forwarding

APPLICATION
Collaborative applications
Typical Protocol Stack of an Adhoc Network

58
CI based Cross Layer Design
(CLD) Methodology
Functional Protocol Stack of an Adhoc Network

Application Layer Topology Control Algorithm
Server Location
Network Map
Transport Layer Congestion window
Timeout clock
Packet Losses Rate
Network Layer Routing Affinity
Routing Lifetime
Multiple Routing
MAC/Link Layer Link Bandwidth
Link Quality
Mac Packet Delay
Physical Layer

Nodes Location
Mobility pattern
Radio Transmission Range
SNR Information
59
CI based Cross Layer Design
(CLD) Methodology
CI based CLD Methodology
Based on location and neighbor information of the
nodes, compute the CI of the paths (CIP).
Higher the CI
Lesser will be the signal interference across the path.
Lesser the probability of collisions due to transmission from
hidden nodes across the path.
Network layer can adopt the routing based on CIP only when
application layer demands the high quality Qos Packet.

A Connectivity Index of a Path is denoted as CIP
and is defined as

( )
n n
i i i i n
v v v v P
1
2
1
.......

( )
n
P
( )
( ) ( )

=
=
+

1
1
1
1
n j
j
i i
n
j j
v d v d
P CIP
.
60
CI based Cross Layer Design
(CLD) Methodology


v
1

v
3

v
4

v
5

v
6

v
2

Path
1

Path
2

Path
3

( ) 2
1
v d
( ) 4
2
v d
( ) 3
3
v d
( ) 3
4
v d
( ) 4
5
v d ( ) 2
6
v d
61
CI based Cross Layer Design (CLD)
Methodology
.
Algorithm to compute
the CIP of a path
62
CI based Cross Layer Design (CLD)
Methodology

PHYSICAL
LINK
NETWORK
TRANSPORT
APPLICATION
Synchronization
Neighborhood
Discovery
Transmission
Scheduling
remote
radios
simulated
PHY
Node interconnection
Collaborative applications
End-to-end transport protocols
Routing-structure
maintenance
Packet forwarding
based on Q bit
CIP routing
Protocol Stack with proposed Cross Layer Design Architecture
63
CI based Cross Layer Design (CLD)
Methodology
.
Algorithm to compute
the CIP of a path
64
Future Work
Implementation and Evaluation of CI
based CLD.
New Protocol stack design based on CI-
CLD.
Extending the work for Cognitive Radio
Networks.
Further study on applications of graph
theory in CRN
65


Open For Discussions.

Potrebbero piacerti anche