11-06-1481-00-000s-updated-ra-olsr-texts-clause-11a-5 (1).doc

8/13/2019 11-06-1481-00-000s-updated-ra-olsr-texts-clause-11a-5 (1).doc

1/24

September 2006 doc.: IEEE 802.11-06/1481r0

IEEE P802.11

Wireless LANs

pd!ted "A-#LS" $e%ts &or 'l!(se 11A.)

*!te: 2006-09-19

A(t+or,s:

N!me 'omp! Address P+oe em!il

Kyeongsoo(Joseph) Kim

STMicroelectronics, Inc.1060 !st "ro#!$ %o!&, MS 212,S!n Jose, ' 91*1

+1-0-1-1*#yeongsoo.#im/st.com

m!n-sm!nim

3!tion!l Instit4te o5

In5orm!tion !n&'omm4nic!tionsTechnology (3I'T)

*- i#!ri&!i, Sei#!-cho, Sor!#4-g4n, Kyoto 619-029, J!p!n

+1--9-66 !olim/nict.go.7p

8o4iti K!&o

3!tion!l Instit4te o5In5orm!tion !n&'omm4nic!tions

Technology (3I'T)

*- i#!ri&!i, Sei#!-cho, Sor!#4-g4n, Kyoto 619-029, J!p!n

+1--9-6900 #!&o/nict.go.7p

"ing h!ng

3!tion!l Instit4te o5In5orm!tion !n&

'omm4nic!tionsTechnology (3I'T)

*- i#!ri&!i, Sei#!-cho, Sor!#4-

g4n, Kyoto 619-029, J!p!n +1--9-620 h!ng/nict.go.7p

M!s!nori

3o!#i

#i lectric In&4stry

'o., t&.

2-- onm!chi, 'h4o-#4, s!#!

1-00*, J!p!n+1-6-6260-000

no!#i6/o#i.co

m

y4nchimegSh!g&!r

T% &!pti:e'omm4nic!tion%ese!rch !;or!tories

2-2-2 i#!ri&!i, Sei#!-cho, Sor!#4-g4n, Kyoto 619-02, J!p!n

+1--9-1*2 oy4n!!/!tr.7p

M!h&!& 3.

Shir!i

T% &!pti:e'omm4nic!tion

%ese!rch !;or!tories

2-2-2 i#!ri&!i, Sei#!-cho, Sor!#4-

g4n, Kyoto 619-02, J!p!n+1--9-106 shir!i/!tr.7p

S4h4! T!ngT% &!pti:e'omm4nic!tion%ese!rch !;or!tories

2-2-2 i#!ri&!i, Sei#!-cho, Sor!#4-g4n, Kyoto 619-02, J!p!n

+1--9-1 sht!ng/!tr.7p

S4;mission p!ge 1 Joseph Kim,STMicroelectronics et !l.

Abstr!ct

This s4;mission pro:i&es ne$ 4p&!te& te


2/24


7!c5ro(dThis contri;4tion pro:i&es 4p&!te& te


3/24


11.5 Radio Aware OLSR Path Selection Protocol (Optional)

11.5.1 Introduction

%!&io $!re ptimie& in# St!te %o4ting (%-S%) protocol is ! pro!cti:e, lin#-st!te $ireless mesh p!th

selection protocol ;!se& on ptimie& in# St!te %o4ting (S%) protocol HIT %' *626 $ith e

It option!lly controls (!n& there;y re&4ces) the mess!ge e


4/24


!n& c!n there5ore s4st!in ! re!son!;le loss o5 some o5 s4ch mess!ges. S4ch losses occ4r 5re4ently in r!&ionet$or#s &4e to collisions or other tr!nsmission pro;lems.

lso, %-S% &oes not re4ire se4ence& &eli:ery o5 mess!ges. !ch control mess!ge cont!ins ! se4ence

n4m;er $hich is incremente& 5or e!ch mess!ge. Th4s the recipient o5 ! control mess!ge c!n, i5 re4ire&, e!sily

i&enti5y $hich in5orm!tion is more recent L e:en i5 mess!ges h!:e ;een re-or&ere& $hile in tr!nsmission.

Gi:en ! net$or# $ith only single-inter5!ce M@s, !n M@ m!y &e&4ct the neigh;or set &irectly 5rom the in5orm!tion

e see cl!4se .*.2.9 5or &et!ils) !re c!rrie& in !n %-S% 5r!me (see

cl!4se ...1 5or its 5orm!t). ere $e &escri;e ! gener!l r4le 5or processing !n& 5or$!r&ing mess!ges incl4&e& in

!n %-S% 5r!me.

11.5.".1 #e$$ae Proce$$in and %loodin

Opon recei:ing !n %-S% m!n!gement 5r!me, !n M@ e


5/24


recei:e&=Ptime


6/24


=Pretr!nsmitte& is set to tr4e i5 !n& only i5 the mess!ge $ill ;e retr!nsmitte& !ccor&ing to step .ther$ise ! ne$ entry is !&&e& to the &4plic!te set $ithB

=P!&&r QQ rigin!tor M' &&ress.=PsePn4m QQ Mess!ge Se4ence 34m;er.

=Ptime Q c4rrent time + =O@P=PTIM.

=Pi5!cePlist cont!ins the recei:ing inter5!ce !&&ress.

=Pretr!nsmitte& is set to tr4e i5 !n& only i5 the mess!ge $ill ;e retr!nsmitte& !ccor&ing to step .

I5, !n& only i5, !ccor&ing to step , the mess!ge m4st ;e retr!nsmitte& thenB

6. The TT o5 the mess!ge is &ecremente& ;y one.. The hop-co4nt o5 the mess!ge is incre!se& ;y one.

. The mess!ge is ;ro!&c!st on !ll inter5!ces.

11.5."." on$ideration$ on Proce$$in and %orwardin

It sho4l& ;e note& th!t the processing !n& the 5or$!r&ing o5 mess!ges !re t$o &i55erent !ctions, con&itione& ;y

&i55erent r4les. @rocessing is rel!te& to 4sing the content o5 the mess!ges, $hile 5or$!r&ing is rel!te& to

retr!nsmitting the s!me mess!ge 5or other M@s in the net$or#.

3otice th!t this speci5ic!tion incl4&es ! &escription 5or ;oth the 5or$!r&ing !n& the processing o5 e!ch #no$n

mess!ge type (i.e., I=N). Mess!ges $ith #no$n mess!ge types m4st not ;e 5or$!r&e& ;lin&lyN ;y the !lgorithm&escri;e& in cl!4se 11..*.2. or$!r&ing (!n& setting the correct mess!ge 5iel& in the 5or$!r&e&, #no$n mess!ge) is

the responsi;ility o5 the !lgorithm speci5ying ho$ the mess!ge is to ;e h!n&le& !n&, i5 necess!ry, retr!nsmitte&. This

en!;les ! mess!ge type to ;e speci5ie& s4ch th!t the mess!ge c!n ;e mo&i5ie& $hile in tr!nsit (e.g., to re5lect the

ro4te the mess!ge h!s t!#en). In this reg!r&, it $o4l& ;e possi;le to ;yp!ss the M@% 5loo&ing mech!nism i5 5or some

re!sons, cl!ssic!l 5loo&ing is re4ire& 5or ! mess!ge type> in s4ch ! c!se, the 5or$!r&ing !lgorithm 5or th!t mess!ge

type $ill speci5y simple re;ro!&c!sting o5 recei:e& mess!ges, reg!r&less o5 M@%s.

"y &e5ining ! set o5 mess!ge types, $hich m4st ;e recognie& ;y !ll implement!tions o5 %-S%, it $ill ;e

possi;le to e


7/24


$here 7itter is ! r!n&om :!l4e in H0, MUJITT%. 3otice th!t $hen the M@ sen&s ! control mess!ge, theopport4nity to piggy;!c# other mess!ges (;e5ore their #eeping perio& is e

or e!ch &estin!tion in the net$or#, Inter5!ce ssoci!tion T4plesN !re recor&e&B

(IPi5!ceP!&&r, IPm!inP!&&r, IPtime)

;ield *escriptio

IPi5!ceP!&&r n inter5!ce !&&ress o5 ! no&e

IPm!inP!&&r The m!in !&&ress o5 ! no&e

IPtime The e


8/24


no&e recor&s ! set o5 2-hop t4plesNB

(3Pneigh;Pm!inP!&&r, 3P2hopP!&&r, 3Ptime)

&escri;ing symmetric lin#s ;et$een its neigh;ors !n& the symmetric 2-hop neigh;orhoo&.

;ield *escriptio

3Pneigh;Pm!inP!&&r The m!in !&&ress o5 ! neigh;or3P2hopP!&&r The m!in !&&ress o5 ! neigh;or, $hich h!s ! symmetric lin# to

3Pneigh;orPm!inP!&&r

3Ptime The e


9/24


!ch M@, !s ! res4lt o5 the 02.11 !ssoci!tion protocol, #eeps ! set o5 !ssoci!te& st!tions, &enote& oc!lssoci!tion "!seN (") in this &oc4ment, $hich hol&s oc!l ssoci!tion T4pleN, one 5or e!ch !ssoci!te& st!tion.

&&ition!lly, to pro:i&e s4pport 5or ! l!rge n4m;er o5 st!tions, e!ch M@ &i:i&es its " into ;loc#s o5 loc!l!ssoci!tion t4plesB e!ch ;loc# is ! s4;set o5 the ", !n& the " is the 4nion o5 those s4;sets. The ;loc#s o5 the

" !re n4m;ere&> hence e!ch ;loc# is i&enti5ie& ;y !n integer, the ;loc# in&e


10/24


no&e $ith se:er!l inter5!ces, $here more th!n one is p!rticip!ting in the F3 Mesh !n& r4nning %-S%MOST gener!te MI= mess!ges !s speci5ie&.

The timeN !n& TTN 5iel&s o5 the MI= mess!ge sh!ll ;e set to const!nt MI=P=PTIM !n& 2,

respecti:ely.

11.5.5.2 #I& #e$$ae %orwardin

MI= mess!ges !re ;ro!&c!st !n& retr!nsmitte& ;y the M@%s in or&er to &i554se the mess!ges in the entire net$or#.The &e5!4lt 5or$!r&ing !lgorithmN MOST ;e 4se& 5or 5or$!r&ing o5 MI= mess!ges.

11.5.5." #I& #e$$ae Proce$$in

The t4ples in the m4ltiple inter5!ce !ssoci!tion set !re recor&e& $ith the in5orm!tion th!t is e


11/24


Pneigh;Pi5!ceP!&&r is !ssoci!te& is selecte& !s M@% (i.e., ! correspon&ing t4ple e


12/24


Then, the neigh;or t4ple SO= ;e 4p&!te& !s 5ollo$sB3P$illingness QQ $illingness 5rom the mess!ge

11.5.7 Populatin the 2/hop -eihor Set

The 2-hop neigh;or set &escri;es the set o5 M@s $hich h!:e ! symmetric lin# to ! symmetric neigh;or. This

in5orm!tion set is m!int!ine& thro4gh perio&ic e

3P2hopP!&&r QQ m!in !&&ress o5 the 2-hop neigh;or>

3Ptime Q c4rrent time + :!li&ity time.

This t4ple m!y repl!ce !n ol&er simil!r t4ple $ith s!me 3Pneigh;Pm!inP!&&r !n& 3P2hopP!&&r :!l4es.

11.5.8 Populatin the #PR $et

M@%s !re 4se& to 5loo& control mess!ges 5rom !n M@ into the net$or# $hile re&4cing the n4m;er o5retr!nsmissions th!t $ill occ4r in ! region. Th4s, the concept o5 M@% is !n optimi!tion o5 ! cl!ssic!l 5loo&ing

mech!nism.

!ch M@ in the net$or# selects, in&epen&ently, its o$n set o5 M@%s !mong its 1-hop neigh;orhoo&. The neigh;or

inter5!ces, $hich !re selecte& !s M@%, !re !&:ertise& $ith !n !ssoci!te& neigh;or-tl: $ith typeQM@% in

mess!ges.

The M@% set MOST ;e c!lc4l!te& ;y !n M@ in s4ch ! $!y th!t it, thro4gh the neigh;ors in the M@%-set, c!n re!ch!ll strict 2-hop neigh;ors $ith minim4m r!&io-!$!re metric. (3otice th!t !n M@, !, $hich is ! &irect neigh;or o5

!nother M@, ;, is not !lso ! strict 2-hop neigh;or o5 M@ ;). This me!ns th!t the 4nion o5 the symmetric 1-hop

neigh;orhoo&s o5 the M@% M@s cont!ins the strict 2-hop neigh;orhoo&. M@% set rec!lc4l!tion sho4l& occ4r $hen

ch!nges !re &etecte& in the symmetric neigh;orhoo& or in the symmetric strict 2-hop neigh;orhoo&. M@% set

rec!lc4l!tion sho4l& !lso occ4r $hen the ch!nge o5 ! r!&io-!$!re metric is l!rger th!n ! &e5ine& threshol&.

M@%s !re comp4te& per inter5!ce, the 4nion o5 the M@% sets o5 e!ch inter5!ce m!#es 4p the M@% set 5or the M@.

Fhile it is not essenti!l th!t the M@% set is minim!l, it is essenti!l th!t !ll strict 2-hop neigh;ors c!n ;e re!che&

thro4gh the selecte& M@% M@s. n M@ SO= select !n M@% set s4ch th!t !ny strict 2-hop neigh;or is co:ere&;y !t le!st one M@% M@. Keeping the M@% set sm!ll ens4res th!t the o:erhe!& o5 the protocol is #ept !t !

minim4m.

The M@% set c!n coinci&e $ith the entire neigh;or set. This co4l& ;e the c!se !t net$or# initi!li!tion (!n& $ill

correspon& to cl!ssic lin#-st!te ro4ting).

S4;mission p!ge 12 Joseph Kim, STMicroelectronics et !l.


13/24


The he4ristic 5or the selection o5 M@%s in the origin!l S% &oes not t!#e into !cco4nt the r!&io-!$!re metric. It

comp4tes !n M@% set $ith minim!l c!r&in!lity !n& there5ore lin#s $ith lo$er r!&io-!$!re metric c!n ;e omitte&.'onse4ently, the p!th c!lc4l!te& ;et$een t$o no&es 4sing the #no$n p!rti!l topology is not optim!l (in terms o5

r!&io-!$!re metric) in the $hole net$or#.

The &ecision o5 ho$ e!ch no&e selects its M@%s is essenti!l to &etermin!te the optim!l r!&io-!$!re metric p!th in

the net$or#. In the M@% selection, lin#s $ith lo$ r!&io-!$!re metric SO= not ;e omitte&.

11.5.8.1 #PR omputation

The 5ollo$ing speci5ies ! recommen&e& he4ristic 5or selection o5 M@%s. It constr4cts !n M@%-set th!t en!;les !n

M@ to re!ch !ny M@ in the strict 2-hop neigh;orhoo& thro4gh rel!ying ;y one M@% $ith $illingness &i55erent 5romFIP3%. The he4ristic MOST ;e !pplie& per inter5!ceB The M@% set 5or !n M@ is the 4nion o5 the M@% sets

5o4n& 5or e!ch inter5!ce. The 5ollo$ing terminology $ill ;e 4se& in &escri;ing the he4risticsB

$ermiolo5 *escriptio

3eigh;or o5 !n

inter5!ce

n M@ is ! neigh;or o5 !n inter5!ceN i5 the inter5!ce (on the loc!l M@) h!s !

lin# to !ny one inter5!ce o5 the neigh;or M@.

2-hop neigh;ors

re!ch!;le 5rom !ninter5!ce

The list o5 2-hop neigh;ors o5 the M@ th!t c!n ;e re!che& 5rom neigh;ors o5 this

inter5!ce.

M@% set o5 !n

inter5!ce

(s4;)set o5 the neigh;ors o5 !n inter5!ce $ith ! $illingness &i55erent 5rom

FIP3%, selecte& s4ch th!t thro4gh these selecte& M@s, !ll strict 2-hop

neigh;ors re!ch!;le 5rom th!t inter5!ce !re re!ch!;le.3 3 is the s4;set o5 neigh;ors o5 the M@, $hich !re neigh;or o5 the inter5!ce I.

32 The set o5 2-hop neigh;ors re!ch!;le 5rom the inter5!ce I, e


14/24


ther !lgorithms, !s $ell !s impro:ements o:er this !lgorithm, !re possi;le. or e

m4ltiple-inter5!ce scen!rio there e


15/24


11.5.11 Topolo! &i$cover!

The lin# sensing !n& neigh;or &etection p!rt o5 the protocol ;!sic!lly o55ers, to e!ch M@, ! list o5 neigh;ors $ith

$hich it c!n comm4nic!te &irectly !n&, in com;in!tion $ith the @!c#et orm!t !n& or$!r&ing p!rt, !n optimie&

5loo&ing mech!nism thro4gh M@%s. "!se& on this, topology in5orm!tion is &issemin!te& thro4gh the net$or#. The

present section &escri;es $hich p!rt o5 the in5orm!tion gi:en ;y the lin# sensing !n& neigh;or &etection is&issemin!te& to the entire net$or# !n& ho$ it is 4se& to constr4ct ro4tes.

%o4tes !re constr4cte& thro4gh !&:ertise& lin#s !n& lin#s $ith neigh;ors. n M@ m4st !t le!st &issemin!te lin#s;et$een itsel5 !n& the M@s in its M@%-selector set, in or&er to pro:i&e s455icient in5orm!tion to en!;le ro4ting.

11.5.11.1 Adverti$ed -eihor Set

T' mess!ge is sent ;y !n M@ in the net$or# to &ecl!re ! set o5 lin#s, c!lle& !&:ertise& lin# set $hich MOST

incl4&e !t le!st the lin#s to !ll M@s o5 its M@% Selector set, i.e., the neigh;ors $hich h!:e selecte& the sen&er M@ !s

!n M@%.

The se4ence n4m;er (3S3) !ssoci!te& $ith the !&:ertise& neigh;or set is !lso sent $ith the list. The 3S3n4m;er MOST ;e incremente& $hen lin#s !re remo:e& 5rom the !&:ertise& neigh;or set> the 3S3 n4m;er

SO= ;e incremente& $hen lin#s !re !&&e& to the !&:ertise& neigh;or set.

11.5.11.2 T #e$$ae 3eneration

In or&er to ;4il& the topology in5orm!tion ;!se, e!ch M@, $hich h!s ;een selecte& !s M@%, ;ro!&c!sts Topology

'ontrol (T') mess!ges. T' mess!ges !re 5loo&e& to !ll M@s in the net$or# !n& t!#e !&:!nt!ge o5 M@%s. M@%s

en!;le ;etter sc!l!;ility in the &istri;4tion o5 topology in5orm!tion.

The list o5 !&&resses c!n ;e p!rti!l in e!ch T' mess!ge (e.g., &4e to mess!ge sie limit!tions, impose& ;y thenet$or#), ;4t p!rsing o5 !l T' mess!ges &escri;ing the !&:ertise& lin# set o5 !n M@ MOST ;e complete $ithin !

cert!in re5reshing perio& (T'PI3T%). The in5orm!tion &i554se& in the net$or# ;y these T' mess!ges $illhelp e!ch M@ c!lc4l!te its ro4ting t!;le.

Fhen the !&:ertise& lin# set o5 !n M@ ;ecomes empty, this M@ SO= still sen& (empty) T'-mess!ges &4ring

the &4r!tion e4!l to the :!li&ity timeN (typic!lly, this $ill ;e e4!l to T@P=PTIM) o5 its pre:io4sly

emitte& T'-mess!ges, in or&er to in:!li&!te the pre:io4s T'-mess!ges. It SO= then stop sen&ing T'-mess!ges4ntil some M@ is inserte& in its !&:ertise& lin# set.

n M@ M8 tr!nsmit !&&ition!l T'-mess!ges to incre!se its re!cti:eness to lin# 5!il4res. Fhen ! ch!nge to theM@% selector set is &etecte& !n& this ch!nge c!n ;e !ttri;4te& to ! lin# 5!il4re, ! T'-mess!ge SO= ;e

tr!nsmitte& !5ter !n inter:!l shorter th!n T'PI3T%.

In or&er to re!lie the 5re4ency control, $hen ! no&e initi!tes ! T' mess!ge, %-S% sets &i55erent m!


16/24


1. I5 the sen&er inter5!ce (3"B not origin!tor) o5 this mess!ge is not in thesymmetric 1-hop neigh;orhoo& o5 this M@, the mess!ge MOST ;e &isc!r&e&.

2. I5 there e


17/24


To constr4ct the ro4ting t!;le o5 M@ U, ! shortest p!th !lgorithm is r4n on the &irecte& gr!ph cont!ining the !rcs U-D 8 $here 8 is !ny symmetric neigh;or o5 U ($ith 3eigh;or Type e4!l to S8M), the !rcs 8 -D $here 8 is !

neigh;or M@ $ith $illingness &i55erent o5 FIP3% !n& there ethe ne


18/24


11.5.1". LAA #e$$ae Proce$$in

Opon recei:ing !n " Mess!ge, e!ch Mesh @oint 4p&!tes its Glo;!l ssoci!tion "!se !n& its oc!l ssoci!tion

"!se, !s &escri;e& in the 5ollo$ing sections.

11.5.1"..1 Populatin the 3loal A$$ociation a$e Population

!:ing recei:e& !n " Mess!ge, the recei:er Mesh @oint $ill 4se the 5ollo$ing in5orm!tionB

the origin!tor !&&ress in the %-S% mess!ge he!&er o5 the " mess!geB the !&&ress o5 the Mesh @

$hich gener!te& the mess!ge

the list o5 !ssoci!te& STs !&&resses ($ith their se4ence n4m;ers)

It $ill per5orm the !ctions o5B

ens4ring th!t !ny ne$ !ssoci!tion is !&&e& to the Glo;!l ssoci!tion "!se

ens4ring th!t !ny termin!te& !ssoci!tion is remo:e& 5rom the Glo;!l ssoci!tion "!se

4p&!ting properly the e


19/24


To h!n&le the occ4rrence o5 s4ch e:ent, the 5ollo$ing processing is &oneB

or e!ch !&&e& entry in the list o5 !ssoci!te& STs, i5 there e


20/24


The policy 5or choosing to gener!te "' mess!ges inste!& o5 " mess!ges is le5t !s ! choice to the Mesh@, ;4t the 5ollo$ing is s4ggeste&B

I5 there h!:e ;een no ch!nges in the oc!l ssoci!tion T!;le 5or ! &4r!tion gre!ter th!n

ST"P'PSS'ITI3PTIM, the Mesh @ gener!tes "' mess!ges.

I5 there is ! ch!nge (i.e., st!tion !ssoci!tion or &is!ssoci!tion), it s$itches ;!c# to sen&ing ".

s ! si&e note, rem!r# th!t ! prere4isite 5or !pplic!tion o5 this mo&e o5 oper!tion is th!t !ll Mesh @oints in theF3 Mesh s4pport it.

11.5.1".0.2 &etailed #e$$ae 3eneration and #e$$ae Proce$$in

The processing o5 the " mess!ges is 4nch!nge& comp!re& to the oper!ting mo&e 4ll "!se =i554sionN.

11.5.1".0." LAA #e$$ae 3eneration %orwardin and Proce$$in

The gener!tion o5 "' mess!ges c!n repl!ce the gener!tion o5 " mess!ges, !n& is str!ight5or$!r& 5rom the

"' mess!ge 5orm!t &escription, !n& 5rom the chec#s4m c!lc4l!tion &escri;e& in ! 5ollo$ing section.

The 5or$!r&ing o5 "' mess!ges is &one !ccor&ing to the &e5!4lt 5or$!r&ing !lgorithmN

The processing o5 "' mess!ges is !lso simpleB !s in&ic!te&, ! :eri5ic!tion o5 !ll the 'hec#s4m St!t4s !l4es isper5orme& 5or !ll ;loc#s.

In c!se o5 one mism!tch or more !n ""% mess!ge is gener!te&. o$e:er, 5or e!ch ;loc# $hich m!tches, the

GPe


21/24


"ro!&c!st ! " mess!ge $ith !ll the content o5 ;loc#s 5or $hich there $!s (!t le!st) one re4est, !n&

;ro!&c!st one "' mess!ge in !&&ition.

11.5.1".0.5 hec,$um alculation

The other sections 4se the 5!ct th!t ! chec#s4m is c!lc4l!te& !n& :eri5ie&. In this cl!4se, ! proce&4re 5or per5orming

chec#s4m c!lc4l!tion is pro:i&e&B or ! ;loc# $ith ! gi:en in&e


22/24


PI3T% Q 2 secon&s%%SPI3T% Q 2 secon&s

T'PI3T% Q secon&sMI=PI3T% Q T'PI3T%

3PI3T% Q T'PI3T%

11.5.1." 4oldin Time

3IG"P=PTIM Q * < %%SPI3T%

T@P=PTIM Q * < T'PI3T%

=O@P=PTIM Q *0 secon&s

MI=P=PTIM Q * < MI=PI3T%3P=PTIM Q * < 3PI3T%

The time in the mess!ge he!&er (see cl!4se 11..*), !n& the time in the mess!ge (see cl!4se 11..6)

!re the 5iel&s $hich hol& in5orm!tion !;o4t the !;o:e :!l4es in m!ntiss! !n& e


23/24


11.5.1.0 ?illinne$$

FIP3% Q 0

FIPF Q 1

FIP=OT Q *

FIPIG Q 6FIPF8S Q

The $illingness o5 !n M@ m!y ;e set to !ny integer :!l4e 5rom 0 to , !n& speci5ies ho$ $illing !n M@ is to ;e5or$!r&ing tr!55ic on ;eh!l5 o5 other M@s. M@s $ill, ;y &e5!4lt, h!:e ! $illingness FIP=OT.

FIP3% in&ic!tes !n M@ $hich &oes not $ish to c!rry tr!55ic 5or other M@s, 5or e

constr!ints (li#e ;eing lo$ on ;!ttery). FIPF8S in&ic!tes th!t !n M@ !l$!ys sho4l& ;e selecte& to c!rry

tr!55ic on ;eh!l5 o5 other M@s, 5or e

inter5!ces to other M@s).

n M@ m!y &yn!mic!lly ch!nge its $illingness !s its con&itions ch!nge.

ne possi;le !pplic!tion $o4l&, 5or e

ch!rge& ;!tteries, to !&:ertise ! $illingness o5 FIPF8S. Opon ;eing &isconnecte& 5rom the perm!nent

po$er s4pply (e.g., ! @= ;eing t!#en o4t o5 its ch!rging cr!&le), ! $illingness o5 FIP=OT is !&:ertise&.

s ;!ttery c!p!city is &r!ine&, the $illingness $o4l& ;e 54rther re&4ce&. irst to the interme&i!te :!l4e ;et$een

FIP=OT !n& FIPF, then to FIPF !n& 5in!lly to FIP3%, $hen the ;!ttery c!p!cityo5 the M@ &oes no longer s4pport c!rrying 5oreign tr!55ic.

11.5.1. #i$c. on$tant$

MUJITT% Q PI3T% C

11.5.15 Se@uence -umer$

Se4ence n4m;ers !re 4se& in %-S% $ith the p4rpose o5 &isc!r&ing ol&N in5orm!tion, i.e., mess!ges recei:e&

o4t o5 or&er. o$e:er $ith ! limite& n4m;er o5 ;its 5or representing se4ence n4m;ers, $r!p-!ro4n& (th!t the

se4ence n4m;er is incremente& 5rom the m!


24/24


"e&ereces:

H1 Draft in progress, [email protected]=0.0* =r!5t men&ment to St!n&!r& 5or In5orm!tion Technology -

Telecomm4nic!tions !n& In5orm!tion

Documents

11-06-1481-00-000s-updated-ra-olsr-texts-clause-11a-5 (1).doc