UNIT 5 MESH NETWORKS

1. WHAT IS MESH NETWORK?

The term 'wireless mesh networks' describes wireless networks in which each node can communicate directl !ith one or more "eer node#.

The term 'mesh' originally used to suggest that all nodes were connected to all other nodes, but most modern meshes connect only a sub-set of nodes to each other.

Nodes are comprised of me#h router# and me#h client#.

Each node o"erate# not onl a# a ho#t $ut al#o a# a router, forwarding packets on behalf of other nodes that may not be within direct wireless transmission range of their destinations.

A W N is d namicall #el%&or'ani(ed and #el%& con%i'ured) with the nodes in the network automatically establishing and maintaining mesh connecti!ity among themsel!es.

*.

NE+ESSIT, -OR MESH NETWORKS

There i# a need o% the net!or. !ith %ollo!in' %eature#

"sing %e!er !ire# means it costs less to set up a network, particularly for large areas of co!erage. The more nodes you install, the $i''er and %a#ter your wireless network becomes. Rel on the #ame Wi-i #tandard# #$%&.''a, b and g(

already in place for most wireless networks.

+on/enient where Ethernet wall connections are lacking -- for instance, in outdoor concert !enues, warehouses or transportation settings.

"seful

for

Non&0ine&o%&Si'ht

#N)o*(

network

configurations where wireless signals are intermittently blocked. +or e,ample, in an amusement park a +erris wheel occasionally blocks the signal from a wireless access point. -f there are do.ens or hundreds of other nodes around, the mesh network will ad/ust to find a clear signal.

Networks

of

1#el%

con%i'urin'21

the

network

automatically incorporates a new node into the e,isting structure without needing any ad/ustments by a network administrator.

Networks

of

1#el%

healin')1

since

the

network

automatically finds the fastest and most reliable paths to send data, e!en if nodes are blocked or lose their signal.

A network configurations allow local networks to run %a#ter, because local packets don't ha!e to tra!el back to a central ser!er. Nodes are ea# to in#tall and unin#tall) making the

network e,tremely adaptable and e,pandable as more or less co!erage is needed.

3. A45ANTA6ES O- WIRE0ESS MESH NETWORKS

"sing fewer wires means it co#t# le## to set up a network, particularly for large areas of co!erage. The more nodes you install, the $i''er and %a#ter your wireless network becomes.

They rel

on the #ame Wi-i #tandard# #$%&.''a, b and

g( already in place for most wireless networks.

They are con/enient where Ethernet wall connections are lacking -- for instance, in outdoor concert !enues, warehouses or transportation settings. They are useful for Non&0ine&o%&Si'ht #N)o*( network configurations where wireless signals are intermittently blocked. +or e,ample, in an amusement park a +erris wheel occasionally blocks the signal from a wireless access point. -f there are do.ens or hundreds of other nodes around, the mesh network will ad/ust to find a clear signal. esh networks are 1#el% con%i'urin'21 the network automatically incorporates a new node into the e,isting structure without needing any ad/ustments by a network administrator. esh networks are 1#el% healin')0 since the network automatically finds the fastest and most reliable paths to send data, e!en if nodes are blocked or lose their signal. Wireless mesh configurations allow local networks to run %a#ter, because local packets don't ha!e to tra!el back to a central ser!er. Wireless mesh nodes are ea# making the network to in#tall and unin#tall) ada"ta$le and

e,tremely

e7"anda$le as more or less co!erage is needed.

8.

+HARA+TERISTI+S O- WIRE0ESS MESH NETWORKS 1 Multi&ho" WMN9

To pro!ide greater co!erage and non-line-of-sight #N)2*( among nodes, indispensable. 1 Su""ort %or ad hoc net!or.in') and ca"a$ilit #el% %ormin') #el%& healin') and #el%&or'ani(ation9 These properties result in enhanced o% the multi-hop function becomes

network

performance and gradual growth. 1 Mo$ilit can be de"endence on t "e o% me#h node#9 stationary or mobile nodes. : Multi"le t "e# o% net!or. acce##9 W Ns can support backhaul access to the -nternet and peer-topeer communications. 1 4e"endence o% "o!er&con#um"tion con#traint# on the t "e o% me#h node#9 esh clients re3uire power efficient protocols in contrast to : +om"ati$ilit !irele## net!or.#9 W Ns built based on -EEE $%&.'' technologies ha!e to be compatible with the -EEE $%&.'' standards. must be inter-operable Wi A4, 5ig6ee with and Additionaly, such networks cellular networks. AR+HITE+TURE O- WMN#. Three architecture, based on the functionality of the nodes. different categories distinguish in the W Ns mesh routers. and intero"era$ilit !ith e7i#tin' inimal mobility of mesh routers but mesh clients

other types of wireless networks, e.g.

7.

: In%ra#tructure;$ac.$one WMN#

The abo!e 8gure shows an infrastructure9backbone W N. The dashed and solid lines denote wireless and wired connections respecti!ely. As it can be seen in the 8gure, different kinds of clients connect to the mesh routers that form the infrastructure. The radio technology used by the mesh routers !aries signi8cantly. +urthermore, routers apply selfcon8guring, self-healing links among themsel!es to form the backbone network. They can also connect to the internet by gateway functions. :on!entional clients can connect to the mesh routers either by using the Ethernet interface or by using the same radio technology as the routers. 1 +lient WMN#

-n this type of architecture, no mesh router e,ists. -nstead, con!entional de!ices establish peer-to-peer networks among them to constitute the actuall network performing routing and con8guration functions as well as pro!iding end-user applications to customers. There e,ists one single radio interface among the de!ices and a packet is forwarded to its destination by hopping through de!ices. : H $rid WMN#

As the name of the architecture denotes, this is the case where the network comprises by both infrastructure and client mesh networks. The clients can access the network by other

clients or by routers pro!iding impro!ed connecti!ity and co!erage within the W N.

;.

<=*.11# MA+ ENHAN+EMENTS

WMN MA+ di%%er %rom Wirele## Net!or.# MA+# a# %ollo!#

A:s for W Ns are concerned with more than one ho" communication A: mu#t $e di#tri$uted) needs to be collaborati!e, and must work for multipoint-to-multipoint communication.

Net!or. #el%&or'ani(ation is needed for better collaboration between neighboring nodes and nodes in multi-hop distances.

Mo$ilit affects the performance of

A:.

Im"ro/in' E7i#tin' MA+ >rotocol#

A: protocols are proposed for multi-hop W Ns by enhancing e,isting A: protocols. +or e,ample, in an -EEE $%&.'' mesh networks, these schemes usually ad/ust parameters of :* A9:A, e.g., contention window si.e, and modify backoff procedures.

<owe!er, these solutions only achie!e a low end-toend throughput, because they cannot significantly reduce the probability of contentions among neighboring nodes.

As long as contention occurs fre3uently, whiche!er method is taken to modify backoff or contention resolution procedures, the end-to-end throughput will still be significantly reduced due to the accumulating effect on the multi-hop path.

The e7i#tin' <=*.11 MA+ la er i# $ein' enhanced %or

Su""ortin' ?oS9

E=:A#Enhanced =istributed :hannel Access( specified in $%&.''e, as the $%&.''s> basic operation mechanism 2ther features of $%&.''e, like <::A, are not considered.

E=:A is a mandatory mechanism in $%&.''e that is reused in $%&.''s to pro!ide prioriti.ed ?o* ser!ices. E4+A Enhanced =istributed :hannel Access is an e,tension of =istributed :oordination +unction #=:+(. Thus, =:+ is the basis for E=:A. ?o* stations #?*TAs( access the medium using $ different user priorities #"@s(. This means that packets sent by the ?*TAs are assigned a priority !alue, before entering the A:. These packets are then mapped to the four 8rst-in 8rst-out #+-+2( 3ueues,called access categories #A:s( implemented in E=:A. +or each A:, an enhanced !ariant of the =:+, namely the enhanced distributed channel access function #E=:A+(, contends for T42@s using a set of E=:A parameters.

Transmission opportunity #T42@( is de8ned as the inter!al of time when a particular ?*TA has the right to initiate transmission. Eack A: beha!es like a !irtual stationA it contends for medium access starting its backoff timer after sensing the medium idle after A-+*, #A-+* being the corresponding =-+* in =:+(. The rule that applies is that the A: with the lowest A-+* has the higher priority. The different parameters are used to gi!e a low-priority class a longer waiting time.

M4A -n in!ol!ing esh =eterministic Access # =A( scheme, @s ha!e to support sychroni.ation. =A2@s, to pre!ent =A sets up

time periods, called

@s of initiating @s that set up =A access

transmission se3uences in case they interfere with each others transmissions or receptions. =A2@s access the medium by using the periods. A esh =Tinter!al comprises of @. After the =A2@ is set upA =A:Wma,, and =A-+*N =A2@s, such an inter!al is set up between the addressing 1 The T42@ using =A2@ owner and the

parameters :W in, :W a,, and A-+*N within these

=A2@ owner uses :* A9:A and backoff to obtain a the =A:Wmin,

parameters. The ranges of !alues of the parameters are identical to those used in E=:A. 1 6oth the =A2@ owner and the addressed =A2@ owner, all other @ ad!ertise the @s should not =A2@. =A2@s =A2@ =A2@. E,cept the

initiate transmissions during the T42@ initiated in the A sender @ has the ability to establish a set of

each identi8ed by a uni3ue -= called the set id has to be uni3ue for the sending

=A2@ *et -=. *uch a @, so that the

set -= and the senders =A2@ set in the mesh. A

A: address uni3uely identify an =A2@ *et -= can also handle set up =A2@s in an =A2@ set. @ in

and teardown of the the entire set of T42@s also e,ist in a =A2@, it is called =A2@ times for a end within the

=A but since it is obtained by a

=A T42@. *uch an T42@ is re3uired to

=A2@ it origianlly was obtained. Neighborhood @ are those T4B4 @s, forming a set of Neighbor @ are

times that are ad!ertised by neighboring cannot set up new

=A2@s currently used in the neighborhood. Thus, a sender =A2@s within these times. =A2@ interfering times for a latter. Thus, creating result in interference. The =T=A access fraction, at a @, is de8ned as the ratio of =A2@ Times0in a esh A+ of esh =Tinter!al. -t e,ists @ in relation to another

the times when the former cannot set up

=A2@s with the

=A2@s within these times can and will

the total duration of its Neighborhood inter!al to the duration of the @ to e,ceed a =A to make sure that a new another An

=A2@ set does not cause the

A+ limit. -f the limit is e,ceeded, the

=A2@ re3uest should be refused. anager e,ists to allow end-to-end Cows using =A features and is responsible for 1 @ath computation. 1 -n!oking path. The =A anager can make path computation in the following two different waysA 1 "sing =i/kstra algorithm. =A2@ *etup @rocedure on node along the

1 "sing +ord algorithm.

Im"ro/in' the net!or. ca"acit 9

The usage of multiple channels and multiple radios Efficient handling of the two different kinds of traffic #6** traffic D +orwarding mesh traffic( -ntra-mesh congestion control esh coordinated channel access esh A@

<andling 6** and mesh traffic by

6i/in' "riorit

to me#h tra%%ic ma

#tar/e STA#

6i/in' "riorit to STA# mi'ht !a#te re#ource utili(ed $ me#h tra%%ic

Ad/anced #olution#9 #e"arate radio %or me#h and @SS tra%%ic

-ntra-mesh congestion control

A #im"le ho"&$ &ho" im"lemented at each M>

con'e#tion

control

0ocal con'e#tion monitorin') +on'e#tion control #i'nalin') 0ocal rate control

Me#h +oordinated +hannel Acce## AM++AB

O"tional #cheme $a#ed on the re#er/ation o% contention %ree time #lot#

0o!er contention Amore determini#ticB mechani#m %or im"ro/ed ?oS %or "eriodic %lo!#

obility is of little concern #do not support seamless hando!er(. No mechanism for multi-channel operation

One "ro"o#al called C++- A+ommon +hannel -rame!or.B !a# ado"ted in the earl /er#ion o% the dra%t A$e%ore dra%t 1.=B) $ut remo/ed %rom the dra%t.

0imitation# cau#ed $ the E4+A

@erformance en!ironments

limitations

in

multi-hop

End-to-end ?o* limitations

More relia$le and #ta$le metric %or lin. Dualit mea#urement and routin'.

@etter #olution# %or "o!er mana'ement.

More ro$u#t a""roache# than it# current #ecurit #olution inherited %rom <=*.11i) in

term# o% #ecurit .

routin'

#ecurit

or

end&to&end

MA+ Im"ro/ement#

:ross-layer techni3ues

design

with

ad!anced

physical

layer

MA+# $a#ed on 4irectional Antenna#

Eliminate e,posed nodes if antenna beam is assumed to be perfect. =ue to the directional transmission, more hidden nodes are produced. Also face other difficulties such as cost, system comple,ity, and practicality of fast steerable directional antennas.

>ro"o#in' Inno/ati/e MA+ >rotocol#9

=etermined by their poor scalability in an ad hoc multi-hop network, random access protocols such as :* A9:A are not an efficient solution. Thus, re!isiting the design of A: protocols based on T= A or := A is indispensable. To date, few T= A or := A A: protocols are a!ailable for W Ns, probably because of two factorsA

and

The comple,ity and cost of de!eloping a distributed cooperati!e A: with T= A or := A.

The compatibility of T= A #or := A( e,isting A:

A: with

protocols.

MA+# !ith >o!er +ontrol

They reduce e,posed nodes, especially in a dense network, using low transmission power, and thus, impro!e the spectrum spatial reuse factor in W Ns. <owe!er, hidden nodes may become worse because lower transmission power le!el reduces the possibility of detecting a potential interfering node.

+or e,ample, in -EEE $%&.';, the original A: protocol is a centrali.ed T= A scheme, but a distributed T= A A: for -EEE $%&.'; mesh is still missing.

-n -EEE $%&.'' W Ns, how to design a distributed T= A A: protocol o!erlaying :* A9:A is an interesting but a challenging problem.

Multi&+hannel Sin'le&Tran#cei/er MA+9

-f cost and compatibility are the concern, one transcei!er on a radio is a preferred hardware platform. *ince only one transcei!er is a!ailable, only one channel is acti!e at a time in each network node. <owe!er, different nodes may operate on different channels simultaneously.

To coordinate transmissions between network nodes under this situation, protocols such as the multi-channel A: and the seed-slotted channel hopping #**:<( scheme are needed. **:< is actually a !irtual A: protocol, since it works on top of -EEE $%&.'' A: and does not need changes in the -EEE $%&.'' A:.

Multi&+hannel Multi&Tran#cei/er MA+#

A radio includes multiple parallel B+ front-end chips and baseband processing modules to support se!eral simultaneous channels. 2n top of the physical layer, only one A: layer module is needed to coordinate the functions of multiple channels.

To date, no multi-channel multi-transcei!er protocol has been proposed for W Ns.

A:

Multi&Radio MA+# The network node has multiple radios each with its own A: and physical layers. :ommunications in these radios are totally independent. Thus, a !irtual A: protocol such as the multi-radio unification protocol # "@( is re3uired on top of A: to coordinate communications in all channels. -n fact, one radio can ha!e multiple channels in this case. <owe!er, for simplicity of design and application, a single fi,ed channel is usually applied in each radio.

Scala$le Sin'le&+hannel MA+#9

The scalability issue in multi-hop ad hoc networks has not been fully sol!ed yet. ost of e,isting A: protocols only sol!e partial problems of the o!erall issue, but raise other problems. To make the A: protocol really scalable, new distributed and collaborati!e schemes must be proposed to ensure that the network performance #e.g., throughput and e!en ?o* parameters such as delay and delay /itter( will not degrade as the network si.e increases.

Scala$le Multi&+hannel MA+#

ulti-channel A: protocols for radios with multiple transcei!ers ha!e not been thoroughly e,plored, possibly due to the relati!ely high cost of such radios. <owe!er, as the cost goes down, a multi-channel multi-transcei!er A: will be a rather promising solution for W Ns.

-t is ob!ious that a multi-channel A: protocol can achie!e higher throughput than a single-channel A:. <owe!er, to really achie!e spectrum efficiency and impro!e the per-channel throughput, the scalable A: protocol needs to consider the o!erall performance impro!ement in multiple channels.

Thus, de!eloping a scalable multi-channel A: is a more challenging task than a single-channel A:.

E.

IEEE <=*.11# AR+HITE+TURE

$%&.''s is an amendment being de!eloped to the -EEE $%&.'' W)AN #Wireless )ocal Area Networks( standard. <=*.11# Sco"e

<=*.11# W0AN Me#h Net!or.in' & -ntegrates mesh

networking ser!ices and protocols with $%&.'' at the )ayer

A:

1 >rimar
o

Sco"e9

Amendment to -EEE $%&.'' to create a Wireless =istribution *ystem with automatic topology learning and wireless path configuration. *mall9medium mesh networks #FG& forwarding nodes( H can be larger. =ynamic, radio-aware path selection in the mesh, enabling data deli!ery on single-hop and multi-hop paths #unicast and broadcast9multicast(. E,tensible to allow support for di!erse applications and future inno!ation. "se $%&.''i security or an e,tension thereof. :ompatible with higher layer protocols #broadcast )AN metaphor(.

o o

The net!or. architecture is depicted in the following figures.

4e/ice +la##e# in a W0AN Me#h Net!or. 1 Me#h >oint AM>B9 establishes peer links with @ neighbors, full participant in W)AN esh ser!ices. )ight Weight @ participates only in '-hop communication with immediate neighbors #routingIN"))(. 1 Me#h A> AMA>B9 functionality of a @, collocated with A@ which pro!ides 6** ser!ices to support communication with *TAs. 1 Me#h >ortal AM>>B9 point at which *="s e,it and enter a W)AN esh #relies on higher layer bridging functions(. !ia 1 Station ASTAB9 outside of the W)AN esh A@. esh, connected

The $%&.'' de8nes an e,tended ser!ice set #E**(, usually refered to as a mesh network. E!ery -EEE $%&.''-based entity #A@ or *TA( that fully or partially supports mesh functionality is refered to as a mesh point # @(. inimal @ operations include neighbor disco!ery, channel selection, and forming associations with neighbors. A W=* is formed by @s and mesh links that

connect the

@s. This way, the E** is distinguished from the A@s are speci8c @s

6**, de8ned in the legacy -EEE $%&.''. but can act as A@s as well. @@s is another type of

@s that has the ability of

interconnecting other W * with the network it belongs to. +urthermore, it can act as a bridge9gateway of the mesh network and other networks in the =*. *uch a W N is uni3uely identi8ed by a mesh -= assigned to e!ery E**. Medium Acce## +oordination -unction @ to represent an

The

edium :oordination +unction # :+( components are

shown in the abo!e figure. The sublayer is built on top of the @<J layer where no modi8cations ha!e been made. The $%&.''s A: sublayer is an amendment to -EEE $%&.'' to create a W=*.

The most important parts of Me#h To"olo'

+: are, @s, this ser!ice set @s.

0earnin') Routin' and -or!ardin'

+ocused on peer-to-peer disco!ery of forms a dynamic data deli!ery path across 1 Topology disco!ery and formationA

#**( enables automatic topology learning, establishes links and

A new candidate node initially gathers information from neighboring nodes either by acti!e scaning #i.e. sending probe messages( or by passi!e listening #i.e. by recei!ing periodic beacons(. +inally, two peers form a partial or a full mesh topology by associating with each other. 1 @ath selection protocolA +ormally, a )& path selection protocol is used to handle unicast and broadcast9multicast data deli!ery. 2n the other hand, @s might be mobile or nonmobile and thus a hybrid routing protocol supporting both proacti!e and on-demand schemes is more suitable for such a network. Thus, the hybrid scheme uses the ad hoc ondemand !ector #A2=K( and the optimi.ed link state routing #2)*B( to reach the goal. To make the routing prototcols more robust against link failures, radio aware metrics are proposed. 1 +orwarding schemeA The traf8c in a W N consists of L-address data frames. When a @ recei!es such frames, it checks for the frame A: address before A@ arri!e the G-address frame which authenticity and the destination forwarding. -n the

is con!erted to a L-address format and then it is

forwarded to its destination. The support of forwarding multicast and broadcast traf8c is also supported. Medium Acce## +oordination

The proposal is to use the enchanced distributed channel access #E=:A( mechanism as medium access coordination which is the re-use of pre!ious $%&.''e. The A: encahncements, i.e. A: mechanisms support congestion control,

power sa!ing, synchroni.ation and beacon collision a!oidance. The proposed mechanisms shall make it possible to enable multiple channel operations in multiradio or single radio as well as mi,ed en!ironments. +urthermore, there must be compatibility with legacy de!ices. 2ptional Access # =A( A: enchancements include that is a esh =eterministic deterministic

reser!ation-based

mechanism, :ommon :hannel +ramework #::+( that is a multichannel operation mechanism, -ntra-mesh :ongestion :ontrol and power management. Me#h +onE'uration and Mana'ement *ince the deployment of self-con8guring paths and links can be unmanaged, it is re3uired the use of autonomic management modules. The purpose of management is to ensure a free of problems network operation. A mesh point that may fail does not effect the o!erall network performance but it has to be managed anyway. "se :ases are detailed belowA

 Re#idential +a#e -n this model, the primary purposes for the mesh network are to create low-cost, easily deployable, high performance wireless co!erage throughout the digital home. The mesh network is intended to eliminate B+ dead-spots and areas of low-3uality co!erage. <igh bandwidth applications tend to be used but also simple ones, e.g. !ideo streaming and wireless printers. OFce +a#e The ob/ecti!e in the of8ce case is to create low-cost, easily deployable wireless networks that pro!ide reliable co!erage and performance. A wireless mesh )AN becomes useful in areas where Ethernet cabling does not e,ist or is cost prohibiti!e. :ompanies reduce their costs in association with cable and time of installation. +urthermore, they can bene8t also from increase in employee producti!ity through e,panded connecti!ity to key network resources.

+am"u# ; +omamunit

; >u$lic Acce## +a#e

esh networks can in this case pro!ide connecti!ity o!er large geographic areas in low cost, higher bandwidth internet access in contrast to the traditional methods and location based ser!ices for information and safety purposes. >u$lic Sa%et +a#e

Access to emergency and municipal safety personnel such as 8re, police, and hospital is important if a corresponding incident occurs. The network can be used for !ideo sur!eillance, tracking emergency workers with biosensors,

!oice and data communication between emergency personnel and so on. Me#h Securit +on#ideration#

1 -unction# in the #co"e Transport le!el security 1 -unction# out o% the #co"e H -nternal routing H E,ternal routing H +orwarding H :urrent technology is not mature enough to address all !ulnerabilities from routing and forwarding Tran#"ort Securit @re!ent unauthori.ed de!ices from directly sending and recei!ing neighbor traffic !ia the mesh. -t protects unicast traffic @s and protects broadcast traffic between @s and @s. between neighbor

-t is re3uired to mutually authenticate neighbor

to generate and manage session keys and broadcast keys. =ata confidentiality o!er a link needs to be maintained. -t is essential to detect message forgeries and replays recei!ed on a link. Authentication and Initial Ke Mana'ement facilitates

6asic approach is to re-use $%&.''i9$%&.'4 implementation and allows other AM

schemes. $%&.'4 is

widely used and is suitable for many mesh scenarios. -t can be replaced with small scale alternati!es if re3uired. -t @ro!ides a basis for secure key distribution #@ M(.-n a mesh, @ M is treated as token of authori.ation for a neighbours. @ to /oin the mesh and authori.ed to send and recei!e messages to9from mesh

4i#co/er

and Role Ne'otiation

4i#co/er This ser!ice implies to disco!er the a!ailable mesh for /oining and and what Authenticated Mey anagement #AM ( @rotocol is being used and to ensure the a!ailability of "nicast ulticast :iphersuites. Ne'otiation This ser!ice enables parties to agree on the security roles and security policy to use with a peer link, Who>s the authenticator, who>s the supplicantN and agree on which of those options enabled to use. <=*.11# Inter!or.in' A""roach

Su""ort %or connectin' an <=*.11# me#h to an <=*.14 $rid'ed 0AN 1 6roadcast )AN #transparent forwarding( 1 2!erhearing of packets #bridge learning( 1 *upport for bridge-to-bridge communications #e.g. allowing esh @ortal de!ices to participate in *T@( Inter!or.in'9 M> /ie!

1. 4etermine i% the de#tination i# in#ide or out#ide o% the Me#h a. )e!erage layer-& mesh path disco!ery *. -or a de#tination in#ide the Me#h) a. "se layer-& mesh path disco!ery9forwarding 3. -or a de#tination out#ide the Me#h) a. -dentify the OrightP portal, and deli!er packets !ia unicast b. -f not known, deli!er to all mesh portals