networking now - skkumonet.skku.edu/wp-content/uploads/2016/09/mc2017_manets... · 2017-09-05 ·...

Sungkyunkwan University

Copyright 2000-2017 Networking Laboratory

Networking Now

Hyunseung ChooNetworking Laboratory

Sungkyunkwan University

[email protected]://monet.skku.ac.kr

mailto:[email protected]

Networking Now 2017 Networking Laboratory 2/52

MANETs/WSNs

Applications page 4~

Overview page 13~

Routing Protocols page 24~

Contents


MANETs/WSNs Projects

- Grand ICT 연구센터 지원사업라이프컴패니온쉽경험을위한지능형인터랙션융합연구

- 무선 포함 접속 방식에 독립적인 차세대 네트워킹 기술 개발SDN/NFV기반의기업유무선통합네트워크를위한액세스기술독립적오픈소스컨트롤러개발

- 자율 제어 네트워킹 및 자율 관리 핵심 기술 개발생체모방자율제어시스템및자율관리/통합플랫폼구축

- 스마트TV 2.0 소프트웨어 플랫폼M2M을위한디바이스인터랙션기술개발

- 첨단 인터랙션을 위한 기반 SW 융합기술 연구인간과기기, 기기와기기간의첨단인터랙션을위한융합 SW중심의기반SW 개발


WSN Applications


LORA-Smart parking system(1) Sensors embedded with LORA Technology are placed in parking spots throughout the city

(2) Sensors send status of parking spaces to gateway

(3) Gateway sends information to the cloud

(4) Application server provides open spot parking information to drivers


Koubachi Wi-Fi Plant Sensor/ Nimble Plant Protector/ Parrot Flower PowerFeed information about your plant and its growing environment (like moisture levels and sunlight) to your phone.

Give you care advice, and alarming you when something is wrong.


FarmSolution: Irrigation Monitoring & ControlCreate an optimized water budget, irrigation schedule, or elevate your operation to the next level with an

automated irrigation system.

Collecting sensor data

Processing data

Triggering actuators


MANETs/WSNs Overview


Computing Class Transition

year

log

(peop

le p

er

compu

ter)

streaming informationto/from physical world

Number CrunchingData Storage

productivityinteractive

Mainframe

Minicomputer

Workstation

PC

Laptop

PDA


MANETs & WSNs

Wireless Sensor Networks

The growth of laptops and 802.11/Wi-

Fi wireless networking have made

Mobile Ad-hoc Networks (MANETs) a

popular research topic since the mid- to

late 1990s

Based on the development of devices

and MANETs, Wireless Sensor

Networks (WSNs) have been a “hot”

research topic

Mobile Ad hoc Networks (MANETs)


A “mobile ad hoc network” (MANET) is an autonomous system of mobile routers

connected by wireless link--the union of which form an arbitrary graph

The routers are free to move randomly and organize themselves arbitrarily; thus,

the network’s wireless topology may change rapidly and un-predictably

MANETs

Evolution of Ad hoc Networks

The Early Influence of Military Applications

(Mobile Ad hoc and Sensor Networks)

Internet-based ad hoc Networks

Vehicular Ad hoc Networks, Underwater

Acoustic (Mobile) Ad hoc Networks

SDN-based Wireless Mobile Ad hoc Network

Internet of Things


What is WSNs?

Network of thousands of extremely small, low power devices

Network of equipments which are programmable computing, multiple

sensing, communication capability

Motivation: robustness, scalability, energy efficiency

Circulatory Net


Preliminaries (1/2)

*Ref: Wireless Sensor Network Survey, Computer Networks Journal, I. Akilydiz , et al.

Transducer: converts a physical phenomenon into electrical signals

Sensor node:

A device capable of physical sensing of environmental phenomena or events,

processing sensed data, and reporting the measurements


Actuator: action command generator based on data

Receives data from sensors and process it

Generates an action command based on the result

Action command is converted to an analog Signal

Preliminaries (2/2)

*Ref: Wireless Sensor Network Survey, Computer Networks Journal, I. Akilydiz, et al.

Sensor node Integrated with actuator


General Purpose Sensors

Single-purpose network is the typical assumption, but not

the future

Sensors for evolving applications

Sensors that can adapt to changing objectives

More memory and CPU will allow more complex applications

Network Independent

Hardware interface

Network SpecificNetwork


Sensor Hardware Platform

MicaZ 2004250kbps

2.4GHz ISM802.15.4/Zigbee


Sensor Network Characteristics Task (application)-specific information gathering platform

High node density and highly limited resources such as battery, data processing

capability, memory, and communication bandwidth

Frequent topology changes due to node mobility and node failure (energy

depletion)

Collaborative task-fulfillment to gather specific information to help

users/applications to make more meaningful decisions

Broadcasting based Communication for Data Dissemination

M-to-one or one-to-M communications, push (interest is sensed, by sensors) and

pull (what has been sensed so far, by the user) concept

Immediate reporting (sensed results) on critical changes of monitoring target

Sensor nodes do have either global IDs like IP addresses or network-specific ID

Deployment is ad hoc in general

Embedded in and adapting to physical environment

In-network processing, not end-to-end, as in traditional TCP/IP applications


Heterogeneous platform

Mobility in experimentation

Remote application development and experimentation

Large-scale Sensor TestbedFit-IoT testbed


Interconnected heterogeneous testbeds of large scale WSNs for

research purpose

Remote Application Development and Experimentation

Large-scale Sensor TestbedWISEBED


Routing in

MANETs/WSNs

- Reactive Routing Protocol

- Proactive Routing Protocol


Reactive Routing ProtocolsIntroduction (1/2)

Also called "on-demand" routing protocols

Routing paths are searched only when needed

A route discovery operation invokes a route-determination

procedure

This procedure terminates either when a route has been

found or no route available after examination for all route

permutations

In a mobile ad hoc network, active routes may be

disconnected due to node mobility

Route maintenance is an important operation of reactive routing

protocols


Reactive Routing ProtocolsIntroduction (2/2)

Pros and Cons:

Less control overhead compared to proactive routing protocols

Source nodes may suffer from long delays for route searching

before they can forward data packets

Reactive routing schemes/protocols

Dynamic Source Routing (DSR)

Ad Hoc On-Demand Distance Vector Routing (AODV)

Temporally-Ordered Routing Algorithm (TORA)


Reactive Routing ProtocolsReferences

[1] Dynamic Source Routing (DSR),

http://tools.ietf.org/html/rfc4728

[2] Ad Hoc On-Demand Distance Vector Routing (AODV),

https://tools.ietf.org/html/rfc3561

[3] V. D. Park and M. S. Corson, "A highly adaptive distributed

routing algorithm for mobile wireless networks," IEEE

INFOCOM, vol. 3, pp.1405-1413, 1997. (TORA)




Dynamic Source Routing (DSR)*

When node S wants to send a packet to node D, but does

not know a route to D, node S initiates a route discovery

Source node S floods Route Request (RREQ)

Each node appends its own identifier when forwarding

RREQ

[*] Dynamic Source Routing (DSR), http://tools.ietf.org/html/rfc4728



S

Dynamic Source Routing (DSR) Route Discovery (1/2)

B

A

E

F

H

J

D

C

G

I

K

M

N

L

[S][S,E]

[S,E,F]

[S,E,F,J]

Represents transmission of RREQ

[X,Y] Represents list of identifiers appended to RREQ


Dynamic Source Routing (DSR) Route Discovery (2/2)

Destination D on receiving the first RREQ, sends a Route

Reply (RREP)

RREP is sent on a route obtained by reversing the route

appended to received RREQ

RREP includes the route from S to D on which RREQ was

received by node D


S

Dynamic Source Routing (DSR) Route Reply (1/3)

Represents RREP control message

B

A

E

F

H

J

D

C

G

I

K

M

N

L

RREP [S,E,F,J,D]



Route Reply can be sent by reversing the route in Route

Request (RREQ) only if links are guaranteed to be bi-

directional

► To ensure this, RREQ should be forwarded only if it is received on

a bi-directional link



If unidirectional (asymmetric) links are allowed, then RREP

may need a route discovery for S from node D

► Unless node D already knows a route to node S

► If a route discovery is initiated by D for a route to S, then the Route

Reply is piggybacked on the Route Request from D

If IEEE 802.11 MAC is used to send data, then links have

to be bi-directional (since ACK is used)


Dynamic Source Routing (DSR) Sending data

Node S on receiving RREP, caches the route included in

the RREP

When node S sends a data packet to D, the entire route is

included in the packet header

► Hence the name is source routing

Intermediate nodes use the source route included in a

packet to determine to whom a packet should be

forwarded


Ad Hoc On-Demand Distance Vector

Routing (AODV)*

DSR includes source routes in packet headers

Resulting large headers can sometimes degrade performance► Particularly when data contents of a packet are small

AODV attempts to improve DSR by maintaining routing tables at the

nodes, so that data packets do not have to contain routes

AODV retains the desirable feature of DSR that routes are maintained

only between nodes which need to communicate

[*] Ad Hoc On-Demand Distance Vector Routing (AODV), https://tools.ietf.org/html/rfc3561




Routing (AODV)

Route Requests (RREQ) are forwarded in a manner similar to DSR

When a node re-broadcasts a Route Request, it sets up a reverse path

pointing towards the source► AODV assumes symmetric (bi-directional) links

When the intended destination receives a Route Request, it replies by

sending a Route Reply

Route Reply travels along the reverse path set-up when Route

Request is forwarded



Routing (AODV): Reverse Path Setup

S

B

A

E

F

H

J

D

C

G

I

K

M

N

L

Represents transmission of RREQ

Represents links on Reverse Path



Routing (AODV): Route Reply (1/2)

S

B

A

E

F

H

J

D

C

G

I

K

M

N

L

Represents links on path taken by RREP



Routing (AODV): Route Reply (2/2)

An intermediate node (not the destination) may also send a Route

Reply (RREP) provided that it knows a more recent path than the one

previously known to sender S

To determine whether the path known to an intermediate node is more

recent, destination sequence numbers are used

The likelihood that an intermediate node will send a Route Reply when

using AODV not as high as DSR► A new Route Request by node S for a destination is assigned a higher destination sequence

number. An intermediate node which knows a route, but with a smaller sequence number,

cannot send Route Reply



Routing (AODV): Forward Path Setup

S

B

A

E

F

H

J

D

C

G

I

K

M

N

L

Forward links are setup when RREP travels along

the reverse path

Represents a link on the forward path


Proactive Routing Protocols Introduction (1/2)

Routes are calculated and stored in routing table in each

node before a node needs to find a path to destination

Routing information in all nodes is updated every time

There are two ways of updating the routing tables:

Event-driven: update messages are sent only when the network

topology changes

Cycle: update messages are sent throughout the network

periodically


Proactive Routing Protocols Introduction (2/2)

Advantages

Low latency

Suitable for real-time traffic

Disadvantages

Bandwidth may get wasted due to periodic updates

Slow reaction on restructuring and failures

Proactive routing schemes

Destination Sequence Distance Vector (DSDV)

Wireless Routing Protocol (WRP)

Distance Routing Effect Algorithm for Mobility (DREAM)

Fisheye State Routing (FSR)


Destination Sequence Distance Vector

(DSDV)* (1/5)

DSDV is based on the traditional Bellman-Ford algorithm

Each node maintains routing information for all known

destinations

Routing information must be updated periodically

Traffic overhead occurs even if there is no change in

network topology

[*] C. E. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers,”

SIGCOMM, vol. 24, no.4, pp. 234–244, 1994.


Maintains routes which are never used

Keeps the simplicity of Distance Vector

Guarantees Loop Freeness by using Destination Sequence

Number

Allows fast reaction to topology changes

Making immediate route advertisement on significant changes in

routing table

But, waiting with advertising of unstable routes (damping

fluctuations)


(DSDV) (2/5)


Table entries

Metric: delay, number of hops, signal strength, etc.

Sequence number: originated from destination; ensures

loop freeness

Install Time: when entry was made (used to delete stale entries

from table)

Destination Next Metric Seq. Nr Install Time

A A 0 A-550 001000

B B 1 B-102 001200

C B 3 C-588 001200

D B 4 D-312 001200

Table Entries


(DSDV) (3/5)


Route Advertisements

Each node advertises its own routing information to its neighbors

Destination Address

Metric = Number of Hops to Destination

Destination Sequence Number

Rules for setting sequence number information are provided

On each advertisement, each node increases its own destination

sequence number (use only even numbers)

If a node is no longer reachable (timeout), its sequence number is

increased by 1 (odd sequence number) and the metric is set to infinite


(DSDV) (4/5)


Route Selection

Update information is compared to the current routing table

Selecting routes with higher destination sequence number (This ensure

s to use newest information from destination always)

Selecting routes with better metric when sequence numbers are equal


(DSDV) (5/5)


Publications (1/2) DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for Lossy

Wireless Sensor Networks

Accepted to MDPI Sensors, March 2010 (SCIE, 2008 IF: 1.870)

RGF: Receiver-based Greedy Forwarding for Energy Efficiency in Lossy Wireless

Sensor Networks

Accepted to KSII Transactions on Internet and Information Systems (TIIS), August 2010 (SCIE)

SCCS: Spatiotemporal Clustering and Compressing Schemes for Efficient Data

Collection Applications in WSNs

Accepted to International Journal of Communication Systems, March 2010 (SCIE).

A Novel Opportunistic Greedy Forwarding Scheme in Wireless Sensor Networks

Accepted to KSII Transactions on Internet and Information Systems (TIIS), October 2010 (SCIE)

Low-cost Two-hop Anchor Node-based Distributed Range-free Localization in Wireless

Sensor Networks

Accepted to Springer-Verlag ICCSA, March 2010

MGR: A Multicandidate Greedy Routing Scheme in Wireless Sensor Networks

Accepted to ACM ICUIMC, January 2010

Efficient Greedy Forwarding Scheme using Back-off Intervals in Wireless Sensor

Networks

Accepted to ICCSA, March 2010


Publications (2/2) Greedy Forwarding with Virtual Destination Strategy for Geographic Routing in Wireless

Sensor Networks

Accepted to ICCSA, March 2010

Energy Efficient Geographic Routing for Prolonging Network Lifetime in Wireless Sensor

Networks

Accepted to ICCSA, 26 March 2010

A Novel Multi-ACK Based Data Forwarding Scheme in Wireless Sensor Networks

Accepted to IEEE Wireless Communications and Networking Conference, April 2010

Energy-Efficient Models for Coverage Problem Using Sensors with Adjustable Sensing

Ranges

Accepted to IEEE Wireless Communications and Networking Conference, April 2010

A Cluster-based MDS Scheme for Range-free Localization in Wireless Sensor Networks

Accepted to CyberC, October 2010

PDF: A Novel Probability-based Data Forwarding Scheme in Lossy Wireless Sensor

Networks

Accepted to RACS, November 2010

69 Papers were published during 2007~2010


References (1/2)

M. Z. Zamalloa, K. Seada, B. Krishnamchari, and A. Helmy, “Efficient Geographic Routing over Lossy Links in Wireless Sensor Networks,” ACM Transactions on Sensor Networks, vol. 4, issue. 3, no. 12, 2008.

M. Z. Zamalloa and B. Krishnamchari, “An Analysis of Unreliability and Asymmetry in Low-Power Wireless Links,” ACM Transactions on Sensor Networks, vol. 3, issue. 2, no. 7, 2007.

Q. Fang, J. Gao, and L. Guibas, “Locating and bypassing routing holes in sensor networks,” IEEE INFOCOM, pp. 2458-2468, 2004.

Z. Jiang, J. Ma, W. Lou and J. Wu, “An information model for geographic greedy forwarding in wireless ad-hoc sensor networks,” IEEE INFOCOM, pp. 825-833, 2008.

H. Lee and A. Keshavarzian, “Towards energy-optimal and reliable data collection via collision-free scheduling in wireless sensor networks,” IEEE INFOCOM, 2008.

H. Lee, A. Keshavarzian ,and H. Aghajan, “Near-Lifetime-Optimal Data Collection in Wireless Sensor Networks via Spatio-Temporal Load Balancing,” ACM Transactions on Sensor Networks, Vol. 6, No. 3, Article 26, 2010.

J. Sheu, P. Chen, and C. Hsu, “A Distributed Localization Scheme for Wireless Sensor Networks with Improved Grid-Scan and Vector-Based Refinement,” IEEE Transactions on Mobile Computing. vol. 7, no. 9, pp. 1110-1123, 2008.

A. Boukerche, H. A. B. Oliveira, E. F. Nakamura, A. A. F. Loureiro, “Localization Systems for Wireless Sensor Networks,” IEEE Wireless Communications, vol. 14, no. 6, pp. 6-12, 2007.

D. Niculescu and B. Nath, “Ad Hoc Positioning System (APS),”IEEE Globecom, vol. 1, pp. 2926-2931, 2001.

Y. Shang, W. Ruml, Y. Zhang, and M. Fromhertz, “Localization from Mere Connectivity,” ACM MobiHoc, pp. 201-212, 2003.

G. Yu and S. Wang, “A Hierarchical MDS-based Localization Algorithm for Wireless Sensor Networks,” IEEE AINA, pp. 741-747, 2008.

T. D. Le and H. Choo, "Efficient Flooding Scheme Based on 2-Hop Backward Information in Ad Hoc Networks,“ IEEE ICC, 2008.

Z. Fan, “Prolonging Lifetime via Mobility and Load-balanced Routing in Wireless Sensor Networks,“ IEEE International Parallel & Distributed Processing Symposium, 2009.

F. Shen and A. Salazar, “Coverage-aware Sleep Scheduling for Cluster-based Sensor Networks,” IEEE WCNC, 2009.

G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella, “Energy conservation in wireless sensor networks: A survey,” Ad Hoc Networks, 2009.


References (2/2)

J. You, D. Lieckfeldt, Q. Han, J. Salzmann, and D. Timmermann, “Look-ahead geographic routing for sensor networks,” IEEE PERCOM, pp. 1-6, 2009.

N. D. Nguyen, D. T. Nguyen, M. L. Gall, N. Saxena, and H. Choo, "Greedy Forwarding with Virtual Destination Strategy for Geographic Routing in Wireless

Sensor Networks," ICCSA, pp. 217-221, 2010.

V. Zalyubovskiy, A. Erzin, S. Astrakov, and H. Choo, “Energy-efficient area coverage by sensors with adjustable ranges,” Sensors, vol. 9(4),pp. 2446-2460,

2009.

N. D. Nguyen, V. Zalyubovskiy, M. T. Ha, and H. Choo, "Energy-efficient Models for Coverage Problem using Sensors with Adjustable Sensing Ranges," IEEE

WCNC, pp. 1-6, 2010.

H. Liu, X. Jia, P. Wan, X. Liu and F. F. Yao, “A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile AdHoc Networks,” IEEE

Transactions on Parallel and Distributed System, vol. 18, no. 5, 2007.

T. D. Le and H. Choo, “Towards an Efficient Flooding Scheme Exploiting 2-Hop Backward Information in MANETs,” IEICE Transaction on Communications, vol.

E92-B, no. 4, pp. 1199-1209, 2009.

J. Hassan and S. Jha, “Optimising Expanding Ring Search for MultiHop Wireless Networks,” IEEE Global Telecommunications Conference, Dallas, TX, 2004.

N. D. Pham and H. Choo, “Energy Efficient Expanding Ring Search for Route Discovery in MANETs,” In Proceeding of IEEE International Conference on

Communications, pp. 3002-3008, 2008.

M. Medidi and Y. Zhou, “Extending Lifetime with Differential Duty Cycles in Wireless Sensor Networks,” In Proceeding of IEEE Globecom, pp. 1033-1037,

2007.

M. T. Ha, T. D. Le, and H. Choo “Employing a Novel Two Tiered Network Structure to Extend the Lifetime of WSNs,” In Proceeding of IEEE WCNC, pp. 1-6,

2009.

D. Johnson, D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing (T. Imielinski and H. Korth, eds.), Kluwer Acad. Publ.,

1996.

C.E. Perkins and E.M. Royer, "Ad hoc on demand Distance Vector routing, mobile computing systems and applications,“ WMCSA, pp.90-100, 1999.

Eli M. Gafni and Dimitri P. Bertsekas, "Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology," IEEE

Transactions on Communications, vol. 29, no. 1, pp. 11-18, 1981.

V. D. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," IEEE INFOCOM, vol. 3, pp.1405-1413, 1997.

S. Basagni, I. Chlamtac, V. Syrotiuk and B. WoodWard, A Distance Routing Effect Algorithm for Mobility (DREAM). MOBCOM, 1998.

C. E. Perkins and P. Bhagwat, "Highly dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers,“ ACM SIGCOMM, vol. 24,

no.4, pp.234-244, 1994.

G. Pei, M. Gerla and T.-W. Chen, "Fisheye State Routing in Mobile Ad Hoc Networks,“ ICDCS Workshops, pp. D71-D78, 2000.

networking now - skkumonet.skku.edu/wp-content/uploads/2016/09/mc2017_manets... · 2017-09-05 ·...

Documents