Context-Aware Clustering for SDN Enabled Network Ran Duo Celimuge - - PowerPoint PPT Presentation

context aware clustering for sdn enabled network
SMART_READER_LITE
LIVE PREVIEW

Context-Aware Clustering for SDN Enabled Network Ran Duo Celimuge - - PowerPoint PPT Presentation

Context-Aware Clustering for SDN Enabled Network Ran Duo Celimuge Wu Tsutomu Yoshinaga Yusheng Ji The University of Electro-Communications, National Institute of Informatics CONTENT Introduction 1 Related woks


slide-1
SLIDE 1

Context-Aware Clustering for SDN Enabled Network

Ran Duo†・Celimuge Wu†・Tsutomu Yoshinaga†・Yusheng Ji ‡ †The University of Electro-Communications, ‡ National Institute of Informatics

slide-2
SLIDE 2

CONTENT

Related woks

2

Conclusion

5

Simulation

4

Introduction

1

Content

SDN-enabled context-aware clustering

3

slide-3
SLIDE 3

Introduction

Highly dynamic network topology and limited network resources Clustered VANETs improve the network efficiency in vehicular environments

slide-4
SLIDE 4

Different types of applications could have different requirements for network quality SDN-enabled context- aware clustering

Introduction

l Vehicular sensor data collections l Deliver safety messages or control messages l Vehicle camera data analysis

slide-5
SLIDE 5

Related wok

Research name Category Metrics

MANET (Mobile Ad Hoc Network) clustering

Lowest ID [7] Non ID Highest Degree [8] Connectivity based connectivity MOBIC [9] Mobility based signal power

VANET clustering

CDS-SVB [10] Mobility based speed, moving direction, relative location HCA [11] Connectivity based connectivity status Dong et al. [12] Connectivity based connectivity status Duan et al. [13] SDN based signal strength, velocity Qi et al. [14] SDN based social attributes, inter-vehicle, distance, relative speed

slide-6
SLIDE 6

Cluster algorithm SDN-enabled VANET architecture

SDN-ENABLED CONTEX-AWARE CLUSTERING

slide-7
SLIDE 7

SDN-enabled context-aware clustering

  • SDN-enabled VANET architecture
slide-8
SLIDE 8

SDN-enabled context-aware clustering

  • SDN-enabled VANET architecture

Identify an application: use IP address and port number pairs

  • Delay-sensitive applications:

Higher priority

  • Traffic-intensive applications:

Large amounts of forwarding bytes

  • Computation-intensive applications:

With few forwarding bytes at the road side but having unique port number Cluster head (CH)

slide-9
SLIDE 9

SDN-enabled context-aware clustering - cluster algorithm

𝒆 ≤ 𝝁×𝑺

  • R denotes the value of largest IEEE 802.11p communication range.
  • 𝛍 is a coefficient to control the scale of clusters in different applications.

Divide vehicles into groups and satisfy the group scale:

Cluster initialization:

slide-10
SLIDE 10

SDN-enabled context-aware clustering - cluster algorithm

Primary context Processed parameters Vehicle velocity Parameter D for estimating the duration time in the cluster. Vehicle location Vehicle received signal quality Parameter S for measuring the received signal quality of vehicle. Computing capability Parameter Q for measuring the computational capability of vehicle. By collecting vehicle’s mobility context, obtain clustering algorithm metrics: 𝐸, 𝑇,𝑅

slide-11
SLIDE 11

SDN-enabled context-aware clustering - cluster algorithm

D, = ∑ 𝑒,

1 2 034

𝑂 𝑇, = 6 𝑡,

2 034

𝑅, = 𝑟, 1 − 𝜀

𝑒,

0 represents connection stability between 𝑊 , and vehicle 𝑊 0,

N is number of vehicles in the cluster 𝑡,

0 means, the received signal power of 𝑊 , from 𝑊

𝑟, represents the CPU performance of 𝑊

, and δ is CPU usage

slide-12
SLIDE 12

SDN-enabled context-aware clustering - cluster algorithm

Normalize 𝑬,𝑻, 𝑹 into a value ranging between 0 and 1:

𝐸,

B =

𝐸, − 𝑛𝑗𝑜 𝐸0 max 𝐸0 − min 𝐸0 ,𝑗 ∈ 𝑝, 𝑂 𝑇,

B =

𝑇, − 𝑛𝑗𝑜 𝑇0 max 𝑇0 − min 𝑇0 ,𝑗 ∈ 𝑝, 𝑂 𝑅,

B =

𝑅, − 𝑛𝑗𝑜 𝑅0 max 𝑅0 − min 𝑅0 ,𝑗 ∈ 𝑝, 𝑂

slide-13
SLIDE 13

SDN-enabled context-aware clustering - cluster algorithm

  • Delay-sensitive applications:

ü Max number of connection and Max 𝐸0

B

  • Traffic-intensive applications:

ü Max 𝑞𝑏𝑠𝑏0 = 𝜈4𝐸0

B + 𝜈1𝑇0 B 𝑥ℎ𝑓𝑠𝑓 𝜈4 + 𝜈1 = 1

  • Computation-intensive applications :

ü Satisfy the application computation requirement and select Max 𝐸0

B

Cluster head selection:

slide-14
SLIDE 14

Simulation

Parameters Values Transport Layer TCP (RENO)/UDP Interface IEEE 802.11p/cellular Data Rate 6Mbps Beacon Interval 0.1s Simulation Topology Straight road Topology Size 2000m with 4 lanes Simulation tools: OMNET+5.0 simulator with INET open-source model Mobility tools: SUMO mobility simulator

slide-15
SLIDE 15

Simulation

Running UDP application to simulate network alarm in case of emergency

  • Cellular-IEEE 802.11p:

Ø Two hops intra-cluster communication Ø Up to four hops of wireless propagation to reach all vehicles

  • IEEE 802.11p :

Ø Flood to n hops

For delay-sensitive application

slide-16
SLIDE 16

Simulation

Running UDP application to simulate network alarm in case of emergency

Ø Proposal Ø Stable: longest life time in the cluster Ø Random: randomly select CH.

For delay-sensitive application

slide-17
SLIDE 17

Simulation

Cluster life time increases, the cluster handover frequency decreases

Long cluster life time performs better to the traffic-intensive application !

For traffic-intensive application

slide-18
SLIDE 18

Simulation Received signal quality is important in improving transmission capability for traffic-intensive application.

For traffic-intensive application

slide-19
SLIDE 19

Simulation

Vehicles are set to run TCP applications communicating with cluster head continuously.

  • Computing data size is

influenced by the number of cluster members and cluster’s life time

  • When more vehicles join,

computational capability of the cluster head should be considered

For computation-intensive application

slide-20
SLIDE 20

Simulation

  • The total required time for the

application in computing different size of data.

  • The total time is mainly affected

by data transmission delay and computation delay.

For computation-intensive application

slide-21
SLIDE 21

Conclusion

ü SDN-enabled VANET architecture ü Clustering algorithm Ø Large cluster size better support delay-sensitive applications. Ø Make connection life time longer for traffic-intensive applications. Ø Offer large computation capability in case of too many cluster members.

slide-22
SLIDE 22 P P T 模板下载:w w w . 1 p p t . c
  • m /
m o b a n / 行业P P T 模板:w w w . 1 p p t . c
  • m /
h a n g y e / 节日P P T 模板:w w w . 1 p p t . c
  • m /
j i e r i / P P T 素材下载:w w w . 1 p p t . c
  • m /
s u c a i / P P T 背景图片:w w w . 1 p p t . c
  • m /
b e i j i n g / P P T 图表下载:w w w . 1 p p t . c
  • m /
t u b i a o / 优秀P P T 下载:w w w . 1 p p t . c
  • m /
x i a z a i / P P T 教程:w w w . 1 p p t . c
  • m /
p o w e r p o i n t / Wo r d 教程:w w w . 1 p p t . c
  • m /
w o r d / E x c e l 教程:w w w . 1 p p t . c
  • m /
e x c e l / 资料下载:w w w . 1 p p t . c
  • m /
z i l i a o / P P T 课件下载:w w w . 1 p p t . c
  • m /
k e j i a n / 范文下载:w w w . 1 p p t . c
  • m /
f a n w e n / 试卷下载:w w w . 1 p p t . c
  • m /
s h i t i / 教案下载:w w w . 1 p p t . c
  • m /
j i a o a n / P P T 论坛:w w w . 1 p p t . c n

Thanks!

Ran Duo