September 2006 IEEE P802.

11 Wireless LANs

doc.: IEEE 802.11-06/1481r0

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

*!te: 2006-09-19 A(t+or,s-: N!me
Kyeongsoo (Joseph) Kim (0m!n-1sm!n 2im

'omp!./
STMicroelectronics, Inc. 3!tion!l Instit4te o5 In5orm!tion !n& 'omm4nic!tions Technology (3I'T) 3!tion!l Instit4te o5 In5orm!tion !n& 'omm4nic!tions Technology (3I'T) 3!tion!l Instit4te o5 In5orm!tion !n& 'omm4nic!tions Technology (3I'T) 1#i lectric In&4stry 'o., 2t&. (T% (&!pti:e 'omm4nic!tion %ese!rch 2!;or!tories (T% (&!pti:e 'omm4nic!tion %ese!rch 2!;or!tories (T% (&!pti:e 'omm4nic!tion %ese!rch 2!;or!tories

Address
1060 !st "ro#!$ %o!&, MS 212, S!n Jose, '( 9)1*1 *-) 6i#!ri&!i, Sei#!-cho, Sor!#4g4n, Kyoto 619-02-9, J!p!n *-) 6i#!ri&!i, Sei#!-cho, Sor!#4g4n, Kyoto 619-02-9, J!p!n *-) 6i#!ri&!i, Sei#!-cho, Sor!#4g4n, Kyoto 619-02-9, J!p!n 2-)-. 6onm!chi, 'h4o-#4, 1s!#! ),1-00)*, J!p!n 2-2-2 6i#!ri&!i, Sei#!-cho, Sor!#4g4n, Kyoto 619-02--, J!p!n 2-2-2 6i#!ri&!i, Sei#!-cho, Sor!#4g4n, Kyoto 619-02--, J!p!n 2-2-2 6i#!ri&!i, Sei#!-cho, Sor!#4g4n, Kyoto 619-02--, J!p!n

P+o.e
+1-,0--,)1--1*. +-1-..,-9--6-6-

em!il
#yeongsoo.#im/st. com !olim/nict.go.7p

8o4iti K!&o

+-1-..,-9--6900

#!&o/nict.go.7p

"ing 9h!ng M!s!nori 3o0!#i 1y4nchimeg Sh!g&!r M!h&!& 3. Shir!0i S4h4! T!ng

+-1-..,-9--6-20 +-1-6-6260-0.00 +-1-..,-9)-1)*2 +-1-..,-9)-1)06 +-1-..,-9)-1),,

0h!ng/nict.go.7p no0!#i.6)/o#i.co m oy4n!!/!tr.7p shir!0i/!tr.7p sht!ng/!tr.7p

Abstr!ct
This s4;mission pro:i&es ne$ 4p&!te& te<ts 5or %(-12S% protocol, $hich completely repl!ce those in 'l!4se 11(.) o5 the c4rrent &r!5t =0.0*.

Notice: This &oc4ment h!s ;een prep!re& to !ssist I -02.11. It is o55ere& !s ! ;!sis 5or &isc4ssion !n& is not ;in&ing on the contri;4ting in&i:i&4!l(s) or org!ni0!tion(s). The m!teri!l in this &oc4ment is s4;7ect to ch!nge in 5orm !n& content !5ter 54rther st4&y. The contri;4tor(s) reser:e(s) the right to !&&, !men& or $ith&r!$ m!teri!l cont!ine& herein. "ele!se: The contri;4tor gr!nts ! 5ree, irre:oc!;le license to the I to incorpor!te m!teri!l cont!ine& in this contri;4tion, !n& !ny mo&i5ic!tions thereo5, in the cre!tion o5 !n I St!n&!r&s p4;lic!tion> to copyright in the I ?s n!me !ny I St!n&!r&s p4;lic!tion e:en tho4gh it m!y incl4&e portions o5 this contri;4tion> !n& !t the I ?s sole &iscretion to permit others to repro&4ce in $hole or in p!rt the res4lting I St!n&!r&s p4;lic!tion. The contri;4tor !lso !c#no$le&ges !n& !ccepts th!t this contri;4tion m!y ;e m!&e p4;lic ;y I -02.11. P!te.t Polic/ !.d Proced(res: The contri;4tor is 5!mili!r $ith the I -02 @!tent @olicy !n& @roce&4res AhttpBCC ieee-02.orgCg4i&esC;yl!$sCs;-;yl!$s.p&5D, incl4&ing the st!tement EI st!n&!r&s m!y incl4&e the #no$n 4se o5 p!tent(s), incl4&ing p!tent !pplic!tions, pro:i&e& the I recei:es !ss4r!nce 5rom the p!tent hol&er or !pplic!nt $ith respect to p!tents essenti!l 5or compli!nce $ith ;oth m!n&!tory !n& option!l portions o5 the st!n&!r&.E !rly &isclos4re to the For#ing Gro4p o5 p!tent in5orm!tion th!t might ;e rele:!nt to the st!n&!r& is essenti!l to re&4ce the possi;ility 5or &el!ys in the &e:elopment process !n& incre!se the li#elihoo& th!t the &r!5t p4;lic!tion $ill ;e !ppro:e& 5or p4;lic!tion. @le!se noti5y the 'h!ir Ast4!rt.#erry/philips.comD !s e!rly !s possi;le, in $ritten or electronic 5orm, i5 p!tente& technology (or technology 4n&er p!tent !pplic!tion) might ;e incorpor!te& into ! &r!5t st!n&!r& ;eing $ithin the I -02.11 For#ing Gro4p. I& /o( S4;mission p!ge 1 &e:elope& Joseph Kim, STMicroelectronics et !l. +!0e 1(estio.s2 co.t!ct t+e IEEE P!te.t 'ommittee Admi.istr!tor !t 3p!tcom4ieee.or56.

September 2006

doc.: IEEE 802.11-06/1481r0

7!c85ro(.d
This contri;4tion pro:i&es 4p&!te& te<ts 5or %(-12S% protocol ;!se& on the ne$ !ction 5r!me 5orm!t !n& in5orm!tion elements speci5ic!tions gi:en in ! sep!r!te contri;4tion H2I.

$+e &ollo9i.5 is .orm!ti0e te%t proposed !s !. !me.dme.t to P802.11s/*0.0:.

Replace the whole texts in clause 11A.5 with those given in the followinig pages:

S4;mission

p!ge 2

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

11.5 Radio Aware OLSR Path Selection Protocol (Optional)

11.5.1 Introduction %!&io ($!re 1ptimi0e& 2in# St!te %o4ting (%(-12S%) protocol is ! pro!cti:e, lin#-st!te $ireless mesh p!th selection protocol ;!se& on 1ptimi0e& 2in# St!te %o4ting (12S%) protocol HI TJ %J' *626I $ith e<tensions 5rom Jisheye St!te %o4ting (JS%) protocol !n& 4ses r!&io-!$!re metrics in 5or$!r&ing p!th !n& m4ltipoint rel!y (M@%) set c!lc4l!tion. %(-12S% en!;les the &isco:ery !n& m!inten!nce o5 optim!l ro4tes ;!se& on ! pre&e5ine& metric, gi:en th!t e!ch no&e h!s ! mech!nism to &etermine the metric cost o5 ! lin# to e!ch o5 its neigh;ors. In or&er to prop!g!te the metric lin# cost in5orm!tion ;et$een no&es, ! metric 5iel& is 4se& in %(-12S% control mess!ges. In &issemin!ting topology in5orm!tion o:er the net$or#, %(-12S% !&opts the 5ollo$ing !ppro!ches in or&er to re&4ce the rel!te& control o:erhe!&B It 4ses only ! s4;set o5 no&es in the net$or#, c!lle& M@%s, in 5loo&ing process> It option!lly controls (!n& there;y re&4ces) the mess!ge e<ch!nge 5reK4encies ;!se& on the Jisheye scopes.

The c4rrent %(-12S% protocol speci5ic!tions !lso incl4&e !n !ssoci!tion &isco:ery !n& m!inten!nce protocol to s4pport non-mesh ST(s ;oth intern!l (!ssoci!te& $ith M(@s) !n& e<tern!l ($ith M@@s)B Fhen ! non-mesh ST( is ! so4rce or ! &estin!tion o5 !n I -02 &!t! lin#, %(-12S% protocol sets 4p ! ro4ting p!th to the M(@ or the M@@ !ssoci!te& $ith th!t ST( ;y complementing ro4ting in5orm!tion !mong M@s $ith ST( !ssoci!tion in5orm!tion. 11.5.2 Overview %(-12S% is !n optimi0!tion o:er ! cl!ssic!l lin#-st!te ro4ting protocol, t!ilore& 5or F2(3 mesh net$or#s> !s s4ch, it inherits !ll the ;ene5its o5 lin#-st!te ro4ting protocols, incl4&ing the imme&i!te !:!il!;ility o5 ro4tes $hen nee&e&, $hich gre!tly re&4ces the initi!l ro4te set4p &el!y. The optimi0!tion in %(-12S% m!inly 5oc4ses on the minimi0!tion o5 5loo&ing o:erhe!&B Jirst, in %(-12S% only ! selecte& s4;set o5 1-hop neigh;or M@s (i.e., M@%s) is 4se& ;y !n M@ in retr!nsmitting control mess!ges. The M@%s !re selecte& s4ch th!t ! ;ro!&c!st mess!ge, retr!nsmitte& ;y these M@%s, c!n re!ch !ll 2-hop neigh;or M@s o5 the selecting M@ (i.e., M@% selector). The in5orm!tion reK4ire& to per5orm M@% selection is !cK4ire& thro4gh the perio&ic e<ch!nge o5 6 221 mess!ges. In !&&ition, %(-12S% c!n !lso option!lly control the mess!ge e<ch!nge 5reK4encies ;!se& on the 5isheye scopes to 54rther re&4ce the !mo4nt o5 control mess!ges e<ch!nges. These techniK4es signi5ic!ntly re&4ce the n4m;er o5 retr!nsmissions reK4ire& to 5loo& ! mess!ge to !ll M@s in the net$or#. Secon&, %(-12S% reK4ires only p!rti!l lin# st!te to ;e 5loo&e& in or&er to pro:i&e shortest p!th ro4tes. The minim!l set o5 lin# st!te in5orm!tion reK4ire& is th!t !ll the no&es selecte& !s M@%s m4st &ecl!re the lin#s to their M@% selectors. (&&ition!l topologic!l in5orm!tion, i5 present, m!y ;e 4tili0e&, e.g., 5or re&4n&!ncy p4rposes. In $ireless mesh net$or#s, 4nli#e tr!&ition!l mo;ile !& hoc net$or#s $here !ll mo;ile no&es !re &irectly p!rticip!ting in ro4ting proce&4res, leg!cy ST(s th!t &o not s4pport F2(3 mesh ser:ices !re in&irectly p!rticip!ting in ro4ting proce&4res thro4gh their !ssoci!te& M(@s or M@@s. To s4pport these ST(s, %(-12S% pro:i&es in5orm!tion repositories 5or ST( !ssoci!tion !t M(@sCM@@s L 2oc!l (ssoci!tion "!se (2(") !n& Glo;!l (ssoci!tion "!se (G(") L $ith e55icient !&:ertisement !n& m!n!gement schemes, $hich complements ! ro4ting t!;le !t e!ch M@ &4ring p!th selection process. This is &et!ile& in cl!4se 11(.).1*. %(-12S% m!y optimi0e the re!cti:ity to topologic!l ch!nges ;y re&4cing the m!<im4m time inter:!l 5or perio&ic control mess!ge tr!nsmissions. J4rthermore, !s %(-12S% contin4o4sly m!int!ins ro4tes to !ll &estin!tions in the net$or#, the protocol is ;ene5ici!l 5or tr!55ic p!tterns $here ! l!rge s4;set o5 M@s !re comm4nic!ting $ith !nother l!rge s4;set o5 M@s, !n& $here the Hso4rce, &estin!tionI p!irs !re ch!nging o:er time. The protocol is p!rtic4l!rly s4ite& 5or l!rge !n& &ense net$or#s, !s the optimi0!tion &one 4sing M@%s $or#s $ell in this conte<t. The l!rger !n& &enser is ! net$or#, the more optimi0!tion c!n %(-12S% !chie:es th!n the cl!ssic lin#-st!te !lgorithm. %(-12S% is &esigne& to $or# in ! completely &istri;4te& m!nner !n& &oes not &epen& on !ny centr!l entity. The protocol &oes not reK4ire reli!;le tr!nsmission o5 control mess!gesB !ch M@ sen&s control mess!ges perio&ic!lly,

S4;mission

p!ge *

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

!n& c!n there5ore s4st!in ! re!son!;le loss o5 some o5 s4ch mess!ges. S4ch losses occ4r 5reK4ently in r!&io net$or#s &4e to collisions or other tr!nsmission pro;lems. (lso, %(-12S% &oes not reK4ire seK4ence& &eli:ery o5 mess!ges. !ch control mess!ge cont!ins ! seK4ence n4m;er $hich is incremente& 5or e!ch mess!ge. Th4s the recipient o5 ! control mess!ge c!n, i5 reK4ire&, 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<ch!nge& !s p!rt o5 lin# sensingB the MM!in (&&ressN o5 ! single inter5!ce M@ is, ;y &e5inition, the !&&ress o5 the only inter5!ce on th!t M@. In ! net$or# $ith m4ltiple-inter5!ce M@s, !&&ition!l in5orm!tion is reK4ire& in or&er to m!p inter5!ce !&&resses to m!in !&&resses (!n&, there;y, to M@s). This !&&ition!l in5orm!tion is !cK4ire& thro4gh m4ltiple inter5!ce &ecl!r!tion (MI=) mess!ges, &escri;e& in cl!4se 11(.).). 11.5.2.1 Terminolo ! $ermi.olo5/ M!in (&&ress 1rigin!tor (&&ress Sen&er Inter5!ce (&&ress %ecei:ing Inter5!ce (ssoci!te& St!tion 2oc!l (ssoci!tion "!se (2(") Glo;!l (ssoci!tion "!se (G(") (ssoci!tion T4ple 'hec#s4m *escriptio. @rim!ry M(' !&&ress o5 the M@, i5 it h!s more th!n one r!&io inter5!ce The m!in !&&ress o5 ! 31= , $hich sent ! gi:en mess!ge The !&&ress o5 the inter5!ce, o:er $hich the mess!ge $!s l!st tr!nsmitte& The inter5!ce, o:er $hich the mess!ge $!s recei:e& ( st!tion $hich is !ssoci!te& $ith ! M(@ The t!;le o5 the !ssoci!te& st!tions to ! gi:en M(@ The in5orm!tion ;!se $hich m!int!ins the list o5 the !ssoci!te& st!tions to !ll the M(@s in the F2(3 Mesh (in other terms, !ll the 2oc!l (ssoci!tion "!se o5 !ll the M(@s o5 the F2(3 Mesh) The in5orm!tion !;o4t !ssoci!te& st!tions is m!int!ine& in entries c!lle& M!ssoci!tion t4plesN, either M2oc!l (ssoci!tion T4pleN, in the 2(", or MGlo;!l (ssoci!tion T4pleN, in the G(" The :!l4e o;t!ine& ;y !pplying ! h!sh 54nction to the in5orm!tion in the 2(" C G(" (or s4;sets o5 these (ssoci!tion "!ses)

11.5." #e$$a e Proce$$in and %orwardin 1ne or more %(-12S% mess!ges (i.e., I s> see cl!4se ..*.2.)9 5or &et!ils) !re c!rrie& in !n %(-12S% 5r!me (see cl!4se ..,.).1, 5or its 5orm!t). 6ere $e &escri;e ! gener!l r4le 5or processing !n& 5or$!r&ing mess!ges incl4&e& in !n %(-12S% 5r!me. 11.5.".1 #e$$a e Proce$$in and %loodin Opon recei:ing !n %(-12S% m!n!gement 5r!me, !n M@ e<!mines e!ch o5 the incl4&e& mess!ges (i.e., I s). "!se& on the MI=N :!l4e, the M@ c!n &etermine the 54rther processing o5 the mess!ge. (n M@ m!y recei:e the s!me mess!ge se:er!l times in ! $ireless mesh net$or#. There5ore, e!ch M@ m!int!ins ! M=4plic!te SetN $here the M@ recor&s in5orm!tion !;o4t the most recently recei:e& mess!ges, ;y $hich !ny &4plic!te processing o5 those mess!ges c!n ;e !:oi&e&. Jor s4ch ! mess!ge, !n M@ recor&s ! M=4plic!te T4pleN !s 5ollo$sB (=P!&&r, =PseKPn4m, =Pretr!nsmitte&, =Pi5!cePlist, =Ptime) ;ield =P!&&r =PseKPn4m =Pretr!nsmitte& =Pi5!cePlist *escriptio. The origin!tor !&&ress o5 the mess!ge The mess!ge seK4ence n4m;er o5 the mess!ge ( ;oole!n in&ic!ting i5 the mess!ge h!s !lre!&y ;een retr!nsmitte& ( list o5 the !&&resses o5 the inter5!ces on $hich the mess!ge h!s ;een

S4;mission

p!ge ,

Joseph Kim, STMicroelectronics et !l.

September 2006
=Ptime

doc.: IEEE 802.11-06/1481r0

recei:e& <pir!tion time o5 the t4ple $hen it m4st ;e remo:e&

In !n M@, the set o5 =4plic!te T4ples !re &enote& the M=4plic!te setN. Th4s, 4pon recei:ing !n %(-12S% m!n!gement 5r!me, !n M@ m4st per5orm the 5ollo$ing t!s#s 5or e!ch enc!ps4l!te& mess!geB 1. 2. *. I5 the %(-12S% 5r!me cont!ins no mess!ges, the 5r!me m4st ;e silently &isc!r&e&. I5 the TT2 o5 the mess!ge is less th!n or eK4!l to 0ero, or i5 the mess!ge $!s sent ;y the recei:ing M@ (i.e., the 1rigin!tor (&&ress o5 the mess!ge is the m!in !&&ress o5 the recei:ing M@), then the mess!ge m4st ;e silently &roppe&. @rocessing con&itionB !) I5 there e<ists ! t4ple in the &4plic!te set, $hereB =P!&&r QQ 1rigin!tor (&&ress, (3= =PseKPn4m QQ Mess!ge SeK4ence 34m;er. Then the mess!ge h!s !lre!&y ;een processe& !n& m4st not ;e processe& !g!in. ;) 1ther$ise, i5 the M@ implements the mess!ge type (i.e., MI=N) o5 the mess!ge, the mess!ge m4st ;e processe& !ccor&ing to the speci5ic!tions 5or the mess!ge type. Jor$!r&ing con&itionB !) I5 there e<ists ! t4ple in the &4plic!te set, $hereB =P!&&r QQ 1rigin!tor (&&ress, (3= =PseKPn4m QQ Mess!ge SeK4ence 34m;er, (3= the recei:ing inter5!ce (!&&ress) is in =Pi5!cePlist. Then the mess!ge h!s !lre!&y ;een consi&ere& 5or 5or$!r&ing !n& sho4l& not ;e retr!nsmitte& !g!in. ;) 1ther$iseB i. I5 the M@ implements the mess!ge type o5 the mess!ge, the mess!ge m4st ;e consi&ere& 5or 5or$!r&ing !ccor&ing to the speci5ic!tions 5or the mess!ge type. ii. 1ther$ise, i5 the M@ &oes not implement the mess!ge type o5 the mess!ge, the mess!ge sho4l& ;e processe& !ccor&ing to the &e5!4lt 5or$!r&ing !lgorithm &escri;e& in cl!4se 11.).*.2.

,.

11.5.".2 &e'ault %orwardin Al orithm The &e5!4lt 5or$!r&ing !lgorithm is the 5ollo$ingB 1. I5 the sen&er inter5!ce !&&ress o5 the mess!ge is not &etecte& to ;e in the symmetric 1-hop neigh;orhoo& o5 the M@, the 5or$!r&ing !lgorithm m4st silently stop here (!n& the mess!ge m4st not ;e 5or$!r&e&). 2. I5 there e<ists ! t4ple in the &4plic!te set $hereB =P!&&r QQ 1rigin!tor (&&ress, (3= =PseKPn4m QQ Mess!ge SeK4ence 34m;er. Then the mess!ge $ill ;e 54rther consi&ere& 5or 5or$!r&ing i5 !n& only i5B =Pretr!nsmitte& is 5!lse, (3= the (!&&ress o5 the) inter5!ce $hich recei:e& the mess!ge is not incl4&e& !mong the !&&resses in =Pi5!cePlist. *. 1ther$ise, i5 s4ch !n entry &oesn?t e<ist, the mess!ge is 54rther consi&ere& 5or 5or$!r&ing. I5 the mess!ge is not consi&ere& 5or 5or$!r&ing !5ter steps 1 thro4gh *, the processing o5 this cl!4se stops here (i.e., steps , to !re ignore&). 1ther$ise, the 5ollo$ing !lgorithm is 4se&B ,. ). I5 the sen&er inter5!ce !&&ress is !n inter5!ce !&&ress o5 !n M@% selector o5 this M@ (3= the TT2 o5 the mess!ge is gre!ter th!n R1?, the mess!ge m4st ;e retr!nsmitte& (!s &escri;e& l!ter in steps 6 to -). I5 there e<ists !n entry in the &4plic!te set $ith the s!me 1rigin!tor (&&ress !n& Mess!ge SeK4ence 34m;er, the entry is 4p&!te& !s 5ollo$sB =Ptime Q c4rrent time + =O@P612=PTIM The recei:ing inter5!ce M(' !&&ress is !&&e& to =Pi5!cePlist.

S4;mission

p!ge )

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

=Pretr!nsmitte& is set to tr4e i5 !n& only i5 the mess!ge $ill ;e retr!nsmitte& !ccor&ing to step ,. 1ther$ise ! ne$ entry is !&&e& to the &4plic!te set $ithB =P!&&r QQ 1rigin!tor M(' (&&ress. =PseKPn4m QQ Mess!ge SeK4ence 34m;er. =Ptime Q c4rrent time + =O@P612=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 TT2 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., MI=N). Mess!ges $ith #no$n mess!ge types m4st not ;e 5or$!r&e& M;lin&lyN ;y the !lgorithm &escri;e& in cl!4se 11.).*.2. Jor$!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 reK4ire& 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 recogni0e& ;y !ll implement!tions o5 %(-12S%, it $ill ;e possi;le to e<ten& the protocol thro4gh intro&4ction o5 !&&ition!l mess!ge types, $hile still ;eing !;le to m!int!in comp!ti;ility $ith ol&er implement!tions. 11.5.".) #e$$a e *mi$$ion and +itter (s ! ;!sic implement!tion reK4irement, the synchroni0!tion o5 control mess!ges sho4l& ;e !:oi&e&. (s ! conseK4ence, %(-12S% control mess!ges sho4l& ;e emitte& s4ch th!t they !:oi& synchroni0!tion. mission o5 control tr!55ic 5rom neigh;or M@s m!y L 5or :!rio4s re!sons (m!inly timer inter!ctions $ith p!c#et processing) L ;ecome synchroni0e& s4ch th!t se:er!l neigh;or M@s !ttempt to tr!nsmit control tr!55ic sim4lt!neo4sly. This m!y le!& to collisions !n& hence mess!ge loss, possi;ly the loss o5 se:er!l s4;seK4ent mess!ges o5 the s!me type. To !:oi& s4ch synchroni0!tions, the 5ollo$ing simple str!tegy 5or emitting control mess!ges is recommen&e&. ( no&e sho4l& !&& !n !mo4nt o5 7itter to the inter:!l !t $hich mess!ges !re gener!te&. The 7itter m4st ;e ! r!n&om :!l4e 5or e!ch mess!ge gener!te&. Th4s, 5or !n M@ 4tili0ing 7itterB (ct4!l mess!ge inter:!l Q M SS(G PI3T %S(2 T 7itter $here 7itter is ! r!n&om :!l4e in H0, M(UJITT %I !n& M SS(G PI3T %S(2 is the :!l4e o5 the mess!ge inter:!l speci5ie& 5or the mess!ge ;eing emitte& (e.g., 6 221PI3T %S(2 5or 6 221 mess!ges, T'PI3T %S(2 5or T'-mess!ges, etc.). Jitter S61O2= !lso ;e intro&4ce& $hen 5or$!r&ing mess!ges. The 5ollo$ing simple str!tegy m!y ;e !&opte&B Fhen ! mess!ge is to ;e 5or$!r&e& ;y !n M@, it sho4l& ;e #ept in the M@ &4ring ! short perio& o5 timeB Keep mess!ge perio& Q 7itter

S4;mission

p!ge 6

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

$here 7itter is ! r!n&om :!l4e in H0, M(UJITT %I. 3otice th!t $hen the M@ sen&s ! control mess!ge, the opport4nity to piggy;!c# other mess!ges (;e5ore their #eeping perio& is e<pire&) m!y;e t!#en to re&4ce the n4m;er o5 5r!me tr!nsmissions. 11.5.) In'ormation Repo$itorie$ Thro4gh the e<ch!nge o5 %(-12S% control mess!ges, e!ch no&e !cc4m4l!tes in5orm!tion !;o4t the net$or#. This in5orm!tion is store& !ccor&ing to the &escriptions in this section. 11.5.).1 Lin, Set ( no&e recor&s ! set o5 Mlin# t4plesNB (2Ploc!lPi5!ceP!&&r, 2Pneigh;Pi5!ceP!&&r, 2Ptime, 2Plin#Pmetric) &escri;ing lin#s ;et$een loc!l !n& remote inter5!ces. The t4ples in this set !re m!int!ine& ;y some other component o5 -02.11 !n& pop4l!te& 4sing 3eigh;or T!;le ntry $hose st!te is s4;or&in!te lin# 4p or S4peror&in!te, lin# 4p !s &escri;e& in cl!4se 11(.*.).1. ;ield 2Ploc!lPi5!ceP!&&r 2Pneigh;Pi5!ceP!&&r 2Ptime 2Plin#Pmetric *escriptio. The inter5!ce on the loc!l M@ The inter5!ce on the remote M@, $ith $hich there e<ists ! symmetric lin# The e<pir!tion time o5 this t4ple The :!l4e representing the metric cost o5 the lin#. (n e<!mple is the (irtime cost gi:en in cl!4se 11(.,.2.1

11.5.).2 -ei h.or Set (n M@ recor&s ! set o5 Mneigh;or t4plesNB (3Pneigh;Pm!inP!&&r, 3P$illingness) &escri;ing neigh;ors. ;ield 3Pneigh;Pm!inP!&&r 3P$illingness *escriptio. The inter5!ce on the loc!l M@ (n integer, ;et$een 0 !n& ., speci5ying the no&es $illingness to c!rry tr!55ic on ;eh!l5 o5 other M@s

11.5.)." Inter'ace A$$ociation Set Jor e!ch &estin!tion in the net$or#, MInter5!ce (ssoci!tion T4plesN !re recor&e&B (IPi5!ceP!&&r, IPm!inP!&&r, IPtime) ;ield IPi5!ceP!&&r IPm!inP!&&r IPtime *escriptio. (n inter5!ce !&&ress o5 ! no&e The m!in !&&ress o5 ! no&e The e<pir!tion time o5 the t4ple

11.5.).) 2/hop -ei h.or Set

S4;mission

p!ge .

Joseph Kim, STMicroelectronics et !l.

September 2006
( no&e recor&s ! set o5 M2-hop t4plesNB (3Pneigh;Pm!inP!&&r, 3P2hopP!&&r, 3Ptime)

doc.: IEEE 802.11-06/1481r0

&escri;ing symmetric lin#s ;et$een its neigh;ors !n& the symmetric 2-hop neigh;orhoo&. ;ield 3Pneigh;Pm!inP!&&r 3P2hopP!&&r 3Ptime 11.5.).5 #PR Set (n M@ m!int!ins ! set o5 neigh;ors $hich !re selecte& !s M@%. Their m!in !&&resses !re liste& in the M@% Set. 11.5.).0 #PR Selector Set (n M@ recor&s ! set o5 MM@%-selector t4plesNB (MSPm!inP!&&r, MSPtime) &escri;ing the neigh;ors $hich h!:e selecte& this M@ !s !n M@%. ;ield MSPm!inP!&&r MSPtime 11.5.).1 Topolo ! Set !ch no&e in the net$or# m!int!ins topology in5orm!tion !;o4t the net$or#. This in5orm!tion is !cK4ire& 5rom T'mess!ges !n& is 4se& 5or ro4ting t!;le c!lc4l!tions. Th4s, 5or e!ch &estin!tion in the net$or#, !t le!st one MTopology T4pleNB (TP&estP!&&r, TPl!stP!&&r, TPseK, TPtime, TPlin#Pmetric) is recor&e&. ;ield TP&estP!&&r TPl!stP!&&r TPseK TPtime TPlin#Pmetric *escriptio. The m!in !&&ress o5 ! no&e, $hich m!y ;e re!che& in one hop 5rom the no&e $ith m!in !&&ress TPl!stP!&&r (n M@ $hich c!n re!ch TP&estP!&&r in one hop ( seK4ence n4m;er The e<pir!tion time o5 the t4ple The :!l4e representing the metric cost o5 the lin#. I5 more th!n one lin# e<ists, the minim4m cost (i.e., the cost o5 the lin# $ith the ;est K4!lity) sho4l& ;e 4se&. (n e<!mple o5 lin# metric is the (irtime cost gi:en in cl!4se 11(.,.2.1. *escriptio. The m!in !&&ress o5 !n M@%-selector The e<pir!tion time o5 the t4ple *escriptio. The m!in !&&ress o5 ! neigh;or The m!in !&&ress o5 ! neigh;or, $hich h!s ! symmetric lin# to 3Pneigh;orPm!inP!&&r The e<pir!tion time o5 the t4ple

11.5.).1.1 Local A$$ociation 2a$e (LA2)

S4;mission

p!ge -

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

!ch M(@, !s ! res4lt o5 the -02.11 !ssoci!tion protocol, #eeps ! set o5 !ssoci!te& st!tions, &enote& 2oc!l (ssoci!tion "!seN (2(") in this &oc4ment, $hich hol&s M2oc!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 2(" into ;loc#s o5 loc!l !ssoci!tion t4plesB e!ch ;loc# is ! s4;set o5 the 2(", !n& the 2(" is the 4nion o5 those s4;sets. The ;loc#s o5 the 2(" !re n4m;ere&> hence e!ch ;loc# is i&enti5ie& ;y !n integer, the M;loc# in&e<N. !ch element o5 the 2(", ! M2oc!l (ssoci!tion T4pleN o5 !n !ssoci!te& st!tion, h!s the 5ollo$ing 5iel&sB (;loc#Pin&e<, st!tionP!&&ress, st!tionPseK4encePn4m;er) ;ield ;loc#Pin&e< st!tionP!&&ress st!tionPseK4encePn4m;er *escriptio. In&e< o5 the ;loc# the M2oc!l (ssoci!tion T4pleN ;elongs to The M!c !&&ress o5 the !ssoci!te& st!tion. 3ote th!t ! st!tion !&&ress &oes not incl4&e the MGro4p M(' !&&ress ;itN in the ,- ;it M(' !&&ress The seK4ence n4m;er (i.e., the $hole 2-octet MSeK4ence 'ontrolN 5iel&) o5 the m!n!gement 5r!me th!t ! ST( sent to the M(@ $hen the ST( is !ssoci!te& $ith or &is!ssoci!te& $ith the M(@

11.5.).1.2 3lo.al A$$ociation 2a$e (3A2) !ch M(@ m!int!ins in5orm!tion concerning $hich st!tion is !ssoci!te& to $hich M(@ in the entire F2(3 Mesh, in ! MGlo;!l (ssoci!tion "!seN (G(") $hich is 4nion o5 !ll 2(" o5 e!ch M(@ in the F2(3 Mesh. It is ! set o5 Mglo;!l !ssoci!tion t4plesN cont!ining (;loc#Pin&e<, (@P!&&ress, st!tionP!&&ress, st!tionPseK4encePn4m;er, e<pir!tionPtime) Jiel& ;loc#Pin&e< (@P!&&ress st!tionP!&&ress st!tionPseK4encePn4m;er e<pir!tionPtime =escription In&e< o5 ;loc# !ssoci!te& to the st!tion !&&ress ;y the M(@ in its 2(" The M(' !&&ress o5 the M(@ The M(' !&&ress o5 the !ssoci!te& ST(. 3ote th!t ! ST( !&&ress &oes not incl4&e the MGro4p M(' !&&ress ;itN in the ,- ;it M(' !&&ress The seK4ence n4m;er (i.e., the $hole 2-octet MSeK4ence 'ontrolN 5iel&) o5 the m!n!gement 5r!me th!t ! ST( sent to the M(@ $hen the st!tion !ssoci!te& $ith or &is!ssoci!te& $ith the M(@ The time !t $hich the entry is no longer :!li&

11.5.5 #ultiple Inter'ace$ The rel!tionship ;et$een %(-12S% inter5!ce !&&resses !n& m!in !&&resses is &e5ine& thro4gh the e<ch!nge o5 M4ltiple Inter5!ce =ecl!r!tion (MI=) mess!ges. This section &escri;es ho$ MI= mess!ges !re e<ch!nge& !n& processe&. !ch no&e $ith m4ltiple inter5!ces MOST !nno4nce, perio&ic!lly, in5orm!tion &escri;ing its inter5!ce con5ig4r!tion to other M@s in the net$or#. This is !ccomplishe& thro4gh 5loo&ing ! MI= mess!ge to !ll M@s in the net$or#. 11.5.5.1 #I& #e$$a e 3eneration (n MI= mess!ge is sent ;y !n M@ in the net$or# to &ecl!re its m4ltiple inter5!ces (i5 !ny) i.e., the MI= mess!ge cont!ins the list o5 inter5!ce !&&resses $hich !re !ssoci!te& to its m!in !&&ress. The list o5 !&&resses c!n ;e p!rti!l in e!ch MI= mess!ge (e.g., &4e to mess!ge si0e limit!tions, impose& ;y the net$or#), ;4t p!rsing o5 !ll MI= mess!ges &escri;ing the inter5!ce set 5rom !n M@ MOST ;e complete $ithin ! cert!in re5reshing perio& (MI=PI3T %S(2). The in5orm!tion &i554se& in the net$or# ;y these MI= mess!ges $ill help e!ch M@ to c!lc4l!te its ro4ting t!;le. (n M@ $hich h!s only ! single inter5!ce !&&ress p!rticip!ting in the F2(3 mesh net$or# r4nning %(-12S%, MOST 31T gener!te !ny MI= mess!ge.

S4;mission

p!ge 9

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

( no&e $ith se:er!l inter5!ces, $here more th!n one is p!rticip!ting in the F2(3 Mesh !n& r4nning %(-12S% MOST gener!te MI= mess!ges !s speci5ie&. The MStimeN !n& MTT2N 5iel&s o5 the MI= mess!ge sh!ll ;e set to const!nt MI=P612=PTIM respecti:ely. 11.5.5.2 #I& #e$$a e %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 M&e5!4lt 5or$!r&ing !lgorithmN MOST ;e 4se& 5or 5or$!r&ing o5 MI= mess!ges. 11.5.5." #I& #e$$a e Proce$$in The t4ples in the m4ltiple inter5!ce !ssoci!tion set !re recor&e& $ith the in5orm!tion th!t is e<ch!nge& thro4gh MI= mess!ges. Opon recei:ing ! MI= mess!ge, the M:!li&ity timeN MOST ;e comp4te& 5rom the Stime 5iel& o5 the mess!ge he!&er (!s &escri;e& in cl!4se 11(.).*). Then the M4ltiple Inter5!ce (ssoci!tion In5orm!tion "!se sho4l& ;e 4p&!te& !s 5ollo$sB 1. 2. I5 the sen&er inter5!ce (3"B not origin!tor) o5 this mess!ge is not in the symmetric 1-hop neigh;orhoo& o5 this M@, the mess!ge MOST ;e &isc!r&e&. Jor e!ch inter5!ce !&&ress liste& in the MI= mess!geB 2.1 I5 there e<ists ! t4ple in the inter5!ce !ssoci!tion set $hereB IPi5!ceP!&&r QQ inter5!ce !&&ress, (3= IPm!inP!&&r QQ origin!tor !&&ress. Then the hol&ing time o5 th!t t4ple is set toB IPtime Q c4rrent time + :!li&ity time. 2.2 1ther$ise, ! ne$ t4ple is recor&e& in the inter5!ce !ssoci!tion set $hereB IPi5!ceP!&&r QQ inter5!ce !&&ress, IPm!inP!&&r QQ origin!tor !&&ress, IPtime Q c4rrent time + :!li&ity time. !n& 2)),

11.5.5.) #appin Inter'ace Addre$$e$ and #P Addre$$e$ In net$or#s $ith m4ltiple inter5!ce M@s oper!ting $ithin ! common %(-12S% !re!, it is reK4ire& to ;e !;le to m!p !ny inter5!ce !&&ress to the correspon&ing m!in !&&ress. Gi:en !n inter5!ce !&&ressB 1. i5 there e<ists some t4ple in the inter5!ce !ssoci!tion set $hereB IPi5!ceP!&&r QQ inter5!ce !&&ress. Then the res4lt o5 the m!in !&&ress se!rch is the origin!tor !&&ress IPm!inP!&&r o5 the t4ple. 2. 1ther$ise, the res4lt o5 the m!in !&&ress se!rch is the inter5!ce !&&ress itsel5.

11.5.0 4*LLO #e$$a e 3eneration5 %orwardin 6 Proce$$in 6 221 mess!ges !re e<ch!nge& ;et$een neigh;or M@s, !n& ser:e the p4rpose o5 pop4l!ting the 2-hop neigh;or set !s $ell !s c!rry M@% sign!ling. 11.5.0.1 4*LLO #e$$a e 3eneration This in:ol:es tr!nsmitting the 3eigh;or Set !n& the M@% Set. These !re tr!nsmitte& perio&ic!lly, !n& !re scope& 5or the no&e?s neigh;orhoo& only (TT2Q1). The lists o5 !&&resses &ecl!re& in ! 6 221 mess!ge is ! list o5 neigh;or inter5!ce !&&resses comp4te& !s 5ollo$sB Jor e!ch non-e<pire& t4ple in the 2in# Set, $here 2Ploc!lPi5!ceP!&&r is the inter5!ce $here the 6 221 is to ;e tr!nsmitte&, 2Pneigh;Pi5!ceP!&&r is !&:ertise&. I5 the M@, to $hich

S4;mission

p!ge 10

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

2Pneigh;Pi5!ceP!&&r is !ssoci!te& is selecte& !s M@% (i.e., ! correspon&ing t4ple e<ists in the M@%-set), ! neigh;or-tl: $ith type Q M@% is !ssoci!te& $ith this !&&ress. The origin!tor !&&ress 5or ! 6 221 mess!ge is set to the m!in !&&ress o5 the M@, gener!ting the 6 221 mess!ge. 11.5.0.2 4*LLO #e$$a e %orwardin !ch 6 221 mess!ge gener!te& is ;ro!&c!st ;y the no&e on one inter5!ce to its neigh;ors (i.e., the inter5!ce 5or $hich the 6 221 $!s gener!te&). 6 221 mess!ges S6(22 not ;e 5or$!r&e&. 11.5.0." 4*LLO #e$$a e Proce$$in (n M@ processes incoming 6 221 mess!ges 5or the p4rpose o5 con&4cting lin# sensing (&et!ile& in cl!4se 11(.*.2), neigh;or &etection !n& M@% selector set pop4l!tion (&et!ile& in cl!4se 11(.,.*.2.10). 1nly mess!ges 5rom s4;or&in!te !n& s4peror&in!te lin#s (!s &escri;e& in cl!4se 11(.*.).1) !re !ccepte& 11.5.1 Populatin the -ei h.or Set (n M@ m!int!ins ! set o5 neigh;or t4ples, ;!se& on the lin# t4ples. This in5orm!tion is 4p&!te& !ccor&ing to ch!nges in the 2in# Set. The 2in# Set #eeps the in5orm!tion !;o4t the lin#s, $hile the 3eigh;or Set #eeps the in5orm!tion !;o4t the neigh;ors. There is ! cle!r !ssoci!tion ;et$een those t$o sets, since !n M@ is ! neigh;or o5 !nother M@ i5 !n& only i5 there is !t le!st one lin# ;et$een the t$o M@s. 1nly mess!ges 5rom s4;or&in!te !n& s4peror&in!te lin# (!s &escri;e& in 11(.*.).1) !re !ccepte& In !ny c!se, the 5orm!l correspon&ence ;et$een lin#s !n& neigh;ors is &e5ine& !s 5ollo$sB The M!ssoci!te& neigh;or t4pleN o5 ! lin# t4ple, is, i5 it e<ists, the neigh;or t4ple $hereB 3Pneigh;Pm!inP!&&r QQ m!in !&&ress o5 2Pneigh;Pi5!ceP!&&r The M!ssoci!te& lin# t4plesN o5 ! neigh;or t4ple, !re !ll the lin# t4ples, $hereB 3Pneigh;Pm!inP!&&r QQ m!in !&&ress o5 2Pneigh;Pi5!ceP!&&r The 3eigh;or Set MOST ;e pop4l!te& ;y m!int!ining the proper correspon&ence ;et$een lin# t4ples !n& !ssoci!te& neigh;or t4ples, !s 5ollo$sB 're!tion !ch time ! lin# !ppe!rs, th!t is, e!ch time ! lin# t4ple is cre!te&, the !ssoci!te& neigh;or t4ple MOST ;e cre!te&, i5 it &oesnVt !lre!&y e<ist, $ith the 5ollo$ing :!l4esB 3Pneigh;Pm!inP!&&r QQ m!in !&&ress o5 2Pneigh;Pi5!ceP!&&r (5rom the lin# t4ple) %emo:!l !ch time ! lin# is &elete&, th!t is, e!ch time ! lin# t4ple is remo:e&, the !ssoci!te& neigh;or t4ple MOST ;e remo:e& i5 it h!s no longer !ny !ssoci!te& lin# t4ples. These r4les ens4re th!t there is e<!ctly one !ssoci!te& neigh;or t4ple 5or ! lin# t4ple, !n& th!t e:ery neigh;or t4ple h!s !t le!st one !ssoci!te& lin# t4ple. 11.5.1.1 4*LLO #e$$a e Proce$$in The M1rigin!tor (&&ressN o5 ! 6 221 mess!ge is the m!in !&&ress o5 the M@, $hich h!s emitte& the mess!ge. 2i#e$ise, the M$illingnessN MOST ;e comp4te& 5rom the Fillingness 5iel& o5 the 6 221 mess!ge (see cl!4se 11(.,.*.2.6). Opon recei:ing ! 6 221 mess!ge, !n M@ S61O2= 4p&!te its 3eigh;or Set !s 5ollo$sB I5 the 1rigin!tor (&&ress is the 3Pneigh;orPm!inP!&&r 5rom ! neigh;or t4ple incl4&e& in the 3eigh;or SetB

S4;mission

p!ge 11

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

Then, the neigh;or t4ple S61O2= ;e 4p&!te& !s 5ollo$sB 3P$illingness QQ $illingness 5rom the 6 221 mess!ge 11.5.7 Populatin the 2/hop -ei h.or 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<ch!nge o5 6 221 mess!ges !s &escri;e& in this section. 11.5.7.1 4*LLO #e$$a e Proce$$in The M1rigin!tor (&&ressN o5 ! 6 221 mess!ge is the m!in !&&ress o5 the M@, $hich h!s emitte& the mess!ge. Opon recei:ing ! 6 221 mess!ge, !n M@ S61O2= 4p&!te its 2-hop 3eigh;or Set. 3otice th!t ! 6 221 mess!ge MOST neither ;e 5or$!r&e& nor ;e recor&e& in the &4plic!te set. Opon recei:ing ! 6 221 mess!ge, the E:!li&ity timeE MOST ;e comp4te& 5rom the Stime 5iel& o5 the mess!ge he!&er (see cl!4se 11(.).*). The 2-hop 3eigh;or Set S61O2= ;e 4p&!te& !s 5ollo$sB 1. 1.1 Jor e!ch !&&ress (hence5orthB 2-hop neigh;or !&&ress), liste& in the 6 221B I5 the m!in !&&ress o5 the 2-hop neigh;or !&&ress QQ m!in !&&ress o5 the recei:ing M@B silently &isc!r& the 2-hop neigh;or !&&ress. (in other $or&sB !n M@ is not its o$n 2-hop neigh;or). 1ther$ise, ! 2-hop t4ple is cre!te& $ithB 3Pneigh;Pm!inP!&&r QQ 1rigin!tor !&&ress> 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.

1.2

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 o5 retr!nsmissions th!t $ill occ4r in ! region. Th4s, the concept o5 M@% is !n optimi0!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 6 221 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@ S61O2= 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!li0!tion (!n& $ill correspon& to cl!ssic lin#-st!te ro4ting).

S4;mission

p!ge 12

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

The he4ristic 5or the selection o5 M@%s in the origin!l 12S% &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&. 'onseK4ently, 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 S61O2= 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 5rom FI22P3 S %. 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 $ermi.olo5/ 3eigh;or o5 !n inter5!ce 2-hop neigh;ors re!ch!;le 5rom !n inter5!ce M@% set o5 !n inter5!ce 3 32 *escriptio. (n M@ is ! Mneigh;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@. The list o5 2-hop neigh;ors o5 the M@ th!t c!n ;e re!che& 5rom neigh;ors o5 this inter5!ce. ( (s4;)set o5 the neigh;ors o5 !n inter5!ce $ith ! $illingness &i55erent 5rom FI22P3 S %, 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 is the s4;set o5 neigh;ors o5 the M@, $hich !re neigh;or o5 the inter5!ce I. The set o5 2-hop neigh;ors re!ch!;le 5rom the inter5!ce I, e<cl4&ingB (i) the M@s only re!ch!;le ;y mem;ers o5 3 $ith $illingness FI22P3 S % (ii) the M@ per5orming the comp4t!tion (iii) !ll the neigh;orsB the M@s 5or $hich there e<ists ! lin# to this M@ on some inter5!ce The &egree o5 ! 1-hop neigh;or M@ y ($here y is ! mem;er o5 3), is &e5ine& !s the n4m;er o5 symmetric neigh;ors o5 M@ y, U'2O=I3G !ll the mem;ers o5 3 !n& U'2O=I3G the M@ per5orming the comp4t!tion.

=(y)

The recommen&e& he4ristic is !s 5ollo$sB 1. St!rt $ith !n M@% set m!&e o5 !ll mem;ers o5 3 $ith 3P$illingness eK4!l to FI22P(2F(8S. 2. '!lc4l!te =(y), $here y is ! mem;er o5 3, 5or !ll M@s in 3. *. (&& to the M@% set those M@s in 3, $hich !re the WonlyW M@s to pro:i&e re!ch!;ility to !n M@ in 32. Jor e<!mple, i5 M@ R;? in 32 c!n ;e re!che& only thro4gh ! symmetric lin# to M@ R!? in 3, then !&& M@ R!? to the M@% set. %emo:e the M@s 5rom 32 $hich !re no$ co:ere& ;y !n M@ in the M@% set. ,. Fhile there e<ist M@s in 32 $hich !re not co:ere& ;y !t le!st one M@ in the M@% setB ,.1 Jor e!ch M@ in 3, c!lc4l!te the re!ch!;ility, i.e., the n4m;er o5 M@s in 32 $hich !re not yet co:ere& ;y !t le!st one M@ in the M@% set, !n& $hich !re re!ch!;le thro4gh this 1-hop neigh;or> ,.2 Select !s !n M@% the M@ $ith the highest 3P$illingness !mong the M@s in 3 $ith non-0ero re!ch!;ility. In c!se o5 m4ltiple choices, $e 4se tie-;re!#ers in the 5ollo$ing or&erB - M!<im4m re!ch!;ility (i.e., re!ch!;ility to the m!<im4m n4m;er o5 M@s in 32)> - M!<im4m &egree (=(.)) - Minim4m r!&io-!$!re metric (i.e., the ;est lin# K4!lity !ccor&ing to the r!&io-!$!re metric)> %emo:e the M@s 5rom 32 $hich !re no$ co:ere& ;y !n M@ in the M@% set. ). (n M@?s M@% set is gener!te& 5rom the 4nion o5 the M@% sets 5or e!ch inter5!ce. (s !n optimi0!tion, process e!ch M@ Ry?, in the M@% set in incre!sing or&er o5 3P$illingness. I5 !ll M@s in 32 !re still co:ere& ;y !t le!st one M@ in the M@% set e<cl4&ing M@ Ry?, !n& i5 3P$illingness o5 M@ Ry? is sm!ller th!n FI22P(2F(8S, then M@ Ry? M(8 ;e remo:e& 5rom the M@% set.

S4;mission

p!ge 1*

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

1ther !lgorithms, !s $ell !s impro:ements o:er this !lgorithm, !re possi;le. Jor e<!mple, !ss4me th!t in ! m4ltiple-inter5!ce scen!rio there e<ists more th!n one lin# ;et$een M@s R!? !n& R;?. I5 M@ R!? h!s selecte& M@ R;? !s M@% 5or one o5 its inter5!ces, then M@ R;? c!n ;e selecte& !s M@% $itho4t !&&ition!l per5orm!nce loss ;y !ny other inter5!ces on M@ R!?. 11.5.19 Populatin the #PR Selector Set The M@% selector set o5 !n M@, n, is pop4l!te& ;y the m!in !&&resses o5 the M@s $hich h!:e selecte& n !s M@%. M@% selection is sign!le& thro4gh 6 221 mess!ges. 11.5.19.1 4*LLO #e$$a e Proce$$in Opon recei:ing ! 6 221 mess!ge, i5 !n M@ 5in&s one o5 its o$n inter5!ce !&&resses in the list $ith ! 3eigh;or Type eK4!l to M@%P3 IG6, in5orm!tion 5rom the 6 221 mess!ge m4st ;e recor&e& in the M@% Selector Set. The M:!li&ity timeN MOST ;e comp4te& 5rom the Stime 5iel& o5 the mess!ge he!&er (see cl!4se 11(.).*). The M@% Selector Set S61O2= then ;e 4p&!te& !s 5ollo$sB 1. I5 there e<ists no M@% selector t4ple $ithB MSPm!inP!&&r QQ 1rigin!tor !&&ress then ! ne$ t4ple is cre!te& $ithB MSPm!inP!&&r QQ 1rigin!tor !&&ress 2. The t4ple (ne$ or other$ise) $ith MSPm!inP!&&r QQ 1rigin!tor !&&ress is then mo&i5ie& !s 5ollo$sB MSPtime Q c4rrent time + :!li&ity time. =eletion o5 M@% selector t4ples occ4rs in c!se o5 e<pir!tion o5 the timer or in c!se o5 lin# ;re!#!ge !s &escri;e& in the M3eigh;orhoo& !n& 2-hop 3eigh;orhoo& 'h!ngesN. 11.5.19.2 -ei h.orhood and 2/hop -ei h.orhood (han e$ ( ch!nge in the neigh;orhoo& is &etecte& $henB The 2PS8MPtime 5iel& o5 ! lin# t4ple e<pires. This is consi&ere& !s ! neigh;or loss i5 the lin# &escri;e& ;y the e<pire& t4ple $!s the l!st lin# $ith ! neigh;or M@ (on the contr!ry, ! lin# $ith !n inter5!ce m!y ;re!# $hile ! lin# $ith !nother inter5!ce o5 the neigh;or M@ rem!ins $itho4t ;eing o;ser:e& !s ! neigh;orhoo& ch!nge). ( ne$ lin# t4ple is inserte& in the 2in# Set $ith ! non e<pire& 2PS8MPtime or ! t4ple $ith e<pire& 2PS8MPtime is mo&i5ie& so th!t 2PS8MPtime ;ecomes non-e<pire&. This is consi&ere& !s ! neigh;or !ppe!r!nce i5 there $!s pre:io4sly no lin# t4ple &escri;ing ! lin# $ith the correspon&ing neigh;or M@.

( ch!nge in the 2-hop neigh;orhoo& is &etecte& $hen ! 2-hop neigh;or t4ple e<pires or is &elete& !ccor&ing to cl!4se 11(.).-. The 5ollo$ing processing occ4rs $hen ch!nges in the neigh;orhoo& or the 2-hop neigh;orhoo& !re &etecte&B In c!se o5 neigh;or loss, !ll 2-hop t4ples $ith 3Pneigh;Pm!inP!&&r QQ M!in !&&ress o5 the neigh;or MOST ;e &elete&. In c!se o5 neigh;or loss, !ll M@% selector t4ples $ith MSPm!inP!&&r QQ M!in !&&ress o5 the neigh;or MOST ;e &elete&. The M@% set MOST ;e re-c!lc4l!te& $hen ! neigh;or !ppe!r!nce or loss is &etecte&, or $hen ! ch!nge in the 2-hop neigh;orhoo& is &etecte&. (n !&&ition!l 6 221 mess!ge M(8 ;e sent $hen the M@% set ch!nges.

S4;mission

p!ge 1,

Joseph Kim, STMicroelectronics et !l.

September 2006
11.5.11 Topolo ! &i$cover!

doc.: IEEE 802.11-06/1481r0

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 Jorm!t !n& Jor$!r&ing p!rt, !n optimi0e& 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 -ei h.or 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 seK4ence n4m;er ((3S3) !ssoci!te& $ith the !&:ertise& neigh;or set is !lso sent $ith the list. The (3S3 n4m;er MOST ;e incremente& $hen lin#s !re remo:e& 5rom the !&:ertise& neigh;or set> the (3S3 n4m;er S61O2= ;e incremente& $hen lin#s !re !&&e& to the !&:ertise& neigh;or set. 11.5.11.2 T( #e$$a e 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 si0e limit!tions, impose& ;y the net$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 %S(2). The in5orm!tion &i554se& in the net$or# ;y these T' mess!ges $ill help e!ch M@ c!lc4l!te its ro4ting t!;le. Fhen the !&:ertise& lin# set o5 !n M@ ;ecomes empty, this M@ S61O2= still sen& (empty) T'-mess!ges &4ring the &4r!tion eK4!l to the M:!li&ity timeN (typic!lly, this $ill ;e eK4!l to T1@P612=PTIM ) o5 its pre:io4sly emitte& T'-mess!ges, in or&er to in:!li&!te the pre:io4s T'-mess!ges. It S61O2= then stop sen&ing T'-mess!ges 4ntil some M@ is inserte& in its !&:ertise& lin# set. (n M@ M(8 tr!nsmit !&&ition!l T'-mess!ges to incre!se its re!cti:eness to lin# 5!il4res. Fhen ! ch!nge to the M@% selector set is &etecte& !n& this ch!nge c!n ;e !ttri;4te& to ! lin# 5!il4re, ! T'-mess!ge S61O2= ;e tr!nsmitte& !5ter !n inter:!l shorter th!n T'PI3T %S(2. In or&er to re!li0e the 5reK4ency control, $hen ! no&e initi!tes ! T' mess!ge, %(-12S% sets &i55erent m!<im4m hop co4nt :!l4e 5or the p!c#et !ccor&ing to the &i55erent 5reK4encies. Fith the &i55erent m!<im4m hop co4nt :!l4es, the p!c#ets c!n only re!ch &i55erent &esigne& scopes. The MTT2N 5iel& o5 the %(-12S% mess!ge 5or the T' mess!ges is 4se& to control the scope. In the &e5!4lt ;eh!:ior, the TT2 is !ltern!ti:ely set to 2, ,, !n& the m!<im4m TT2 :!l4e in e:ery T'PI3T %S(2. 11.5.11." T( #e$$a e %orwardin T' 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#. T' mess!ges MOST ;e 5or$!r&e& !ccor&ing to the E&e5!4lt 5or$!r&ing !lgorithmE (&escri;e& in cl!4se 11(.).*). 11.5.11.) T( #e$$a e Proce$$in Opon recei:ing ! T' mess!ge, the M:!li&ity timeN MOST ;e comp4te& 5rom the Stime 5iel& o5 the mess!ge he!&er (see cl!4se 11(.).*). The topology set S61O2= then ;e 4p&!te& !s 5ollo$s (4sing cl!4se 11(.,.*.2.1) 5or comp!rison o5 (3S3)B

S4;mission

p!ge 1)

Joseph Kim, STMicroelectronics et !l.

September 2006
1.

doc.: IEEE 802.11-06/1481r0

I5 the sen&er inter5!ce (3"B not origin!tor) o5 this mess!ge is not in the symmetric 1-hop neigh;orhoo& o5 this M@, the mess!ge MOST ;e &isc!r&e&. 2. I5 there e<ist some t4ple in the topology set $hereB TPl!stP!&&r QQ origin!tor !&&ress, (3= TPseK D (3S3, then 54rther processing o5 this T' mess!ge MOST 31T ;e per5orme& !n& the mess!ge MOST ;e silently &isc!r&e& (c!seB mess!ge recei:e& o4t o5 or&er). *. (ll t4ples in the topology set $hereB TPl!stP!&&r QQ origin!tor !&&ress, (3= TPseK A (3S3 MOST ;e remo:e& 5rom the topology set. ,. Jor e!ch o5 the !&:ertise& neigh;or m!in !&&ress recei:e& in the T' mess!geB ,.1 I5 there e<ist some t4ple in the topology set $hereB TP&estP!&&r QQ !&:ertise& neigh;or m!in !&&ress, (3= TPl!stP!&&r QQ 1rigin!tor !&&ress, then the hol&ing time o5 th!t t4ple MOST ;e set toB TPtime Q c4rrent time + :!li&ity time. ,.2 1ther$ise, ! ne$ t4ple MOST ;e recor&e& in the topology set $hereB TP&estP!&&r QQ (&:ertise& neigh;or m!in !&&ress, TPl!stP!&&r QQ 1rigin!tor !&&ress, TPseK QQ (3S3, TPtime Q c4rrent time + :!li&ity time 11.5.12 Routin Ta.le (alculation !ch M@ m!int!ins ! ro4ting t!;le $hich !llo$s it to ro4te &!t! &estine& 5or the other M@s in the net$or#. The ro4ting t!;le is ;!se& on the in5orm!tion cont!ine& in the loc!l lin# in5orm!tion ;!se !n& the topology set. There5ore, i5 !ny o5 these sets !re ch!nge&, the ro4ting t!;le is rec!lc4l!te& to 4p&!te the ro4te in5orm!tion !;o4t e!ch &estin!tion in the net$or#. The ro4te entries !re recor&e& in the ro4ting t!;le in the 5ollo$ing 5orm!tB 1. %P&estP!&&r 2. %P&estP!&&r *. ,, %Pne<tP!&&r %Pne<tP!&&r ,, %P&ist %P&ist ,, %Pmetric %Pi5!ceP!&&r %Pmetric %Pi5!ceP!&&r ,, ,,

!ch entry in the t!;le consists o5 %P&estP!&&r, %Pne<tP!&&r, %P&ist, %Pmetric !n& %Pi5!ceP!&&r. S4ch entry speci5ies th!t the M@ i&enti5ie& ;y %P&estP!&&r is estim!te& to ;e %P&ist hops !$!y 5rom the loc!l M@ $ith the c4m4l!ti:e r!&io-!$!re metric eK4!l to %Pmetric, th!t the symmetric neigh;or M@ $ith inter5!ce !&&ress %Pne<tP!&&r is the ne<t hop M@ in the ro4te to %P&estP!&&r, !n& th!t this symmetric neigh;or M@ is re!ch!;le thro4gh the loc!l inter5!ce $ith the !&&ress %Pi5!ceP!&&r. ntries !re recor&e& in the ro4ting t!;le 5or e!ch &estin!tion in the net$or# 5or $hich ! ro4te is #no$n. (ll the &estin!tions, 5or $hich ! ro4te is ;ro#en or only p!rti!lly #no$n, !re not recor&e& in the t!;le. More precisely, the ro4ting t!;le is 4p&!te& $hen ! ch!nge is &etecte& in eitherB the lin# set, the neigh;or set, the 2-hop neigh;or set, the topology set, the M4ltiple Inter5!ce (ssoci!tion In5orm!tion "!se,

More precisely, the ro4ting t!;le is rec!lc4l!te& in c!se o5 neigh;or !ppe!r!nce or loss, $hen ! 2-hop t4ple is cre!te& or remo:e&, $hen ! topology t4ple is cre!te& or remo:e& or $hen m4ltiple inter5!ce !ssoci!tion in5orm!tion ch!nges. The 4p&!te o5 this ro4ting in5orm!tion &oes not gener!te or trigger !ny mess!ges to ;e tr!nsmitte&, neither in the net$or#, nor in the 1-hop neigh;orhoo&. 11.5.12.1 Path Selection Al orithm

S4;mission

p!ge 16

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

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 eK4!l to S8M), the !rcs 8 -D 9 $here 8 is ! neigh;or M@ $ith $illingness &i55erent o5 FI22P3 S % !n& there e<ists !n entry in the 2-hop 3eigh;or set $ith 8 !s 3Pneigh;Pm!inP!&&r !n& 9 !s 3P2hopP!&&r, !n& the !rcs O -D S, $here there e<ists !n entry in the topology set $ith S !s TP&estP!&&r !n& O !s TPl!stP!&&r. The optim!l p!th $ill ;e selecte& thro4gh the 5ollo$ing proce&4re 4sing the neigh;or set, the lin# set, the 2-hop neigh;or set !n& the topology setB 1. 2. (ll the entries 5rom the ro4ting t!;le !re remo:e&. 'le!r the list o5 c!n&i&!te mesh points. Initi!li0e the shortest-p!th tree to only the root. '!ll the mesh point 74st !&&e& to the tree mesh point S. Jor e!ch mesh point F $hich is the onehop neigh;or !n& the lin# ;et$een S !n& F is the S8M lin#, c!lc4l!te the lin# cost (the s4m o5 r!&io-!$!re metric) = o5 the res4lting p!th 5rom the root to F. = is eK4!l to the s4m o5 the lin# cost o5 the (!lre!&y c!lc4l!te&) shortest p!th to :erte< S !n& the !&:ertise& cost o5 the lin# ;et$een :ertices S !n& F. I5 = isB Gre!ter th!n or eK4!l to the :!l4e th!t !lre!&y !ppe!rs 5or :erte< F on the c!n&i&!te list, then e<!mine the ne<t mesh point. 2ess th!n the :!l4e th!t !ppe!rs 5or F on the c!n&i&!te list, or i5 F &oes not yet !ppe!r on the c!n&i&!te list, then set the entry 5or F on the c!n&i&!te list to in&ic!te = 5rom the root. The ne<t hop th!t res4lt 5rom the c!n&i&!te p!th 5or F !ccor&ingly is set to the s!me !s the ne<t hop o5 S. I5 !t this step the c!n&i&!te list is empty, the shortest-p!th tree (o5 tr!nsit :ertices) h!s ;een completely ;4ilt !n& the !lgorithm termin!tes. 1ther$ise, choose the mesh point ;elonging to the c!n&i&!te list th!t is closest to the root, !n& !&& it to the shortest-p!th tree (remo:ing it 5rom the c!n&i&!te list in the process). The ne$ ro4te entries 5or the &estin!tion M@ F is recor&e& in the ro4ting t!;le. Iter!te the !lgorithm ;y ret4rning to Step 2.

*. ,. ).

11.5.1" A$$ociated Station &i$cover! There !re t$o &i55erent oper!tion mo&es 5or !ssoci!te& st!tion &isco:ery L (1) MJ4ll "!se =i554sionN mo&e !n& (2) M'hec#s4mN mo&e> in the 5irst mo&e ! M(@ !&:ertises the 54ll contents o5 its 2(", $hile in the secon& mo&e it !&:ertises only the chec#s4ms o5 ;loc#s in the 2(" 5or possi;le &etection o5 inconsistent ;loc#s in G(" !t recei:ing M@s. 11.5.1".1 A$$ociated Station &i$cover! in :%ull 2a$e &i''u$ion; mode (s e<pl!ine& pre:io4sly, in MJ4ll "!se =i554sionN mo&e, the M(@ ;ro!&c!sts perio&ic!lly mess!ges (2("( mess!ges), representing the 54ll content o5 its 2oc!l (ssoci!tion "!se> the other M@s recei:e them !n& pop4l!te their Glo;!l (ssoci!tion T!;le ;y this me!ns. 11.5.1".2 Local A$$ociation 2a$e Adverti$ement (LA2A) #e$$a e 3eneration ( Mesh (@ $ith !ssoci!te& st!tion gener!tes perio&ic!lly 2("( mess!ges cont!ining the p!irs o5 ((ssoci!te& St!tion (&&resses, St!tion SeK4ence 34m;er), $ith proper ;loc# in&e<, correspon&ing to the c4rrently !ssoci!te& st!tions in its 2oc!l (ssoci!te& St!tion "!se. 2("( mess!ges !re ;ro!&c!st to the entire F2(3 Mesh. The Mesh (@ m4st gener!te 2("( mess!ges ;e5ore the entries o5 the pre:io4s 2("( mess!ge(s) re!ch their e<pir!tion time (!s !&:ertise& ;y e<pire time). (s !n optimi0!tion to incre!se responsi:eness o5 the st!tion &isco:ery protocol to ch!nges in the !ssoci!tion t!;les, ! Mesh (@ m!y gener!te !n e!rlier 2("( mess!ge in c!se o5 ch!nge ($hich m!y incl4&e in5orm!tion 5or !ll ;loc#s !s pre:io4s 2("( mess!ges, or only the ;loc#s th!t h!:e ch!nge&). 11.5.1"." LA2A #e$$a e %orwardin 2("( mess!ges !re ;ro!&c!st !n& retr!nsmitte& ;y the M@%s in or&er to &i554se the mess!ges to the entire net$or#. 2("( mess!ges MOST ;e 5or$!r&e& !ccor&ing to the M&e5!4lt 5or$!r&ing !lgorithmN (&escri;e& in cl!4se 11(.,.*.2.*)

S4;mission

p!ge 1.

Joseph Kim, STMicroelectronics et !l.

September 2006
11.5.1".) LA2A #e$$a e Proce$$in

doc.: IEEE 802.11-06/1481r0

Opon recei:ing !n 2("( Mess!ge, e!ch Mesh @oint 4p&!tes its Glo;!l (ssoci!tion "!se !n& its 2oc!l (ssoci!tion "!se, !s &escri;e& in the 5ollo$ing sections. 11.5.1".).1 Populatin the 3lo.al A$$ociation 2a$e Population 6!:ing recei:e& !n 2("( Mess!ge, the recei:er Mesh @oint $ill 4se the 5ollo$ing in5orm!tionB the origin!tor !&&ress in the %(-12S% mess!ge he!&er o5 the 2("( mess!geB the !&&ress o5 the Mesh (@ $hich gener!te& the mess!ge the list o5 !ssoci!te& ST(s !&&resses ($ith their seK4ence 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<pir!tion times o5 the glo;!l !ssoci!tion t4ple $ith the one 5rom the mess!ge recei:e& More precisely, it 4p&!tes the Glo;!l (ssoci!tion "!se !s 5ollo$sB 1. Glo;!l (ssoci!tion "!se "loc# cle!ning 5or origin!tor Mesh (@B 5or e!ch !&:ertise& ;loc#, the recei:e& in5orm!tion $ill incl4&e !ll the content o5 the ;loc# !s present in the l!st 2oc!l (ssoci!tion "!se (o5 the origin!tor Mesh (@)B !ll pree<isting t4ples !re no$ o;solete, !n& hence the 5ollo$ing step is per5orme&B 2. The recei:ing Mesh @oint &eletes !ny glo;!l !ssoci!tion t4ple $here G(P(@P!&&ress QQ 2("( mess!ge origin!tor, !n& $here G(P;loc#Pin&e< is one o5 the ;loc# in&ices in the 2("( mess!ge. *. Op&!te o5 in5orm!tion 5or !&:ertise& !ssoci!te& st!tionsB Jor e!ch st!tion entry in the list o5 !ssoci!te& ST(s, potenti!l correspon&ing in5orm!tion in the Glo;!l (ssoci!tion T!;le is !&&e& or 4p&!te&B *.1 I5 there e<ists ! glo;!l !ssoci!tion t4ple in glo;!l !ssoci!tion ;!se $hereB G(P(@P!&&ress QQ 2("( Mess!ge origin!tor, (3= G(Pst!tionP!&&ress QQ st!tion !&&ress, (3= G(Pst!tionPseK4encePn4m;er AQ St!tion seK4ence n4m;er o5 the entry Then, it is 4p&!te& !s 5ollo$sB G(Pst!tionPseK4encePn4m;er QQ st!tion seK4ence n4m;er in 5r!me G(P;loc#Pin&e< QQ ;loc# in&e< G(Pe<pir!tionPtime Q c4rrent time + :!li&ity time *.2 1ther$ise, i5 there e<ists ! st!tion t4ple in the glo;!l !ssoci!tion ;!ses $hereB G(P(@P!&&ress QQ 2("( Mess!ge origin!tor, (3= G(Pst!tionP!&&ress QQ st!tion !&&ress o5 the c4rrent entry, (3= G(Pst!tionPseK4encePn4m;er D St!tion seK4ence n4m;er o5 the entry Then, the in5orm!tion in the mess!ge rel!ti:e to the st!tion is ignore& ;ec!4se it is consi&ere& o;solete *.* 1ther$ise, ! ne$ st!tion t4ple is recor&e& in the Glo;!l (ssoci!tion "!se $hereB G(P(@P!&&ress QQ 2("( Mess!ge origin!tor, G(Pst!tionP!&&ress QQ st!tion !&&ress o5 the c4rrent entry G(P;loc#Pin&e< QQ ;loc# in&e<, G(Pst!tionPseK4encePn4m;er QQ st!tion seK4ence n4m;er o5 the entry G(Pe<pir!tionPtime Q c4rrent time + :!li&ity time 11.5.1".).2 Populatin the Local A$$ociation 2a$e< =pdate "ec!4se ! Mesh (@ m!y not !l$!ys ;e in5orme& &irectly o5 ! &is!ssoci!tion o5 ! ST(, it c!n ;e the c!se th!t it &etects in&irectly ! &is!ssoci!tion ;y &isco:ering th!t !nother Mesh @oint !&:ertises ! ST( ;elie:e& to ;e !ssoci!te&, !n& $ith ! ne$er seK4ence n4m;er.

S4;mission

p!ge 1-

Joseph Kim, STMicroelectronics et !l.

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

doc.: IEEE 802.11-06/1481r0

Jor e!ch !&&e& entry in the list o5 !ssoci!te& ST(s, i5 there e<ists ! t4ple in the 2oc!l (ssoci!tion "!se $hereB 2(Pst!tionP!&&ress QQ !ssoci!te& st!tion !&&ress o5 the entry 2(Pst!tionPseK4encePn4m;er AQ st!tion seK4ence n4m;er o5 the entry

Then the 2oc!l (ssoci!tion T4ple is &elete& !n& the correspon&ing ST(s !re !ss4me& to ;e &is!ssoci!te& (!n& other -02.11 protocols might ;e in5orme& o5 s4ch !n e:ent). 11.5.1".5 A$$ociated Station Addre$$ Search and Population o' the Routin Ta.le The intent o5 the m!inten!nce o5 the &i55erent (ssoci!tion T!;les is th!t $hen ! Mesh @oint $o4l& nee& ! mesh p!th 5or !n !ssoci!te& st!tion !&&ress, it $o4l& procee&s !s 5ollo$sB it $o4l& se!rch in its 2oc!l (ssoci!tion "!se, !n& in its Glo;!l (ssoci!tion "!se, 5or !ssoci!tion t4ples $ith the reK4ire& !&&ress. I5 more th!n one $ere 5o4n& to ;e present, the Mesh @oint $o4l& choose the !ssoci!tion t4ple $ith the highest G(Pst!tionPseK4encePn4m;er. "ec!4se the ro4tes !re pro!cti:ely comp4te&, inste!& o5 per5orming this se!rch, the Mesh @oint $ill complement the ro4ting t!;le c!lc4l!tion &escri;e& in !nother section in !n eK4i:!lent $!y $ith the 5ollo$ing stepB Jor e!ch entry in the Glo;!l (ssoci!tion "!se $hereB There is no loc!l !ssoci!tion t4ple in the 2(", nor glo;!l !ssoci!tion t4ple in the G(" $ith the s!me st!tionP!&&ress, !n& ! higher st!tionPseK4encePn4m;er, (3= There e<ists ! recor&e& ro4ting entry s4ch th!tB %P&estP!&&r QQ G(P(@P!&&ress Then ! ro4te entry is cre!te& $ithB %P&estP!&&r QQ G(Pst!tionP!&&ress %Pne<tP!&&r QQ %Pne<t !&&ress (o5 the recor&e& ro4ting entry) %P&ist QQ %P&ist (o5 the recor&e& ro4ting entry) %Pi5!ceP!&&r QQ %Pi5!ceP!&&r (o5 the recor&e& ro4ting entry) 11.5.1".0 A$$ociated Station &i$cover! in :(hec,$um &i''u$ion; mode 11.5.1".0.1 Overview "ec!4se sen&ing perio&ic!lly the 54ll 2oc!l (ssoci!tion "!se c!n ;e e<pensi:e, especi!lly in the presence o5 n4mero4s Mesh (@s, !nother mo&e o5 oper!tion is presente& here, $ith the 5ollo$ing ch!nges in the mess!ge gener!tion !n& processing. Mess!ge Gener!tion ;y ! Mesh (@B r!ther th!n sen&ing the $hole 2oc!l (ssoci!tion "!se, ! chec#s4m is comp4te& 5or e!ch ;loc# o5 the "!se, !n& the list o5 chec#s4ms is sent in ! 2oc!l (ssoci!tion "!se 'hec#s4m (&:ertisement (2("'() mess!ge. Mess!ge @rocessing ;y recei:er Mesh @ointsB !s ! res4lt, the recei:er Mesh @oints, c!n no longer pop4l!te their Glo;!l (ssoci!tion T!;le 5or the origin!tor Mesh (@, n!t4r!lly. "4t they $ill :eri5y th!t the chec#s4m o5 their Glo;!l (ssoci!tion T!;le m!tches inste!&. "loc# %eK4est ;y ! recei:er Mesh @ointB $hen ! chec#s4m mism!tch is &etecte&, ! recei:er Mesh @oint $ill iss4e !n (ssoci!tion "!se "loc# %eK4est ((""%) mess!ge, $ith the list o5 in&ices o5 mism!tching ;loc#s. It $ill ;e 4nic!st to the Mesh (@. "loc# %eK4est processingB the in&ices o5 mism!tching ;loc#s !re recor&e&, !n& $ill ;e !&:ertise& in the ne<t 2("(C2("'( gener!tion.

S4;mission

p!ge 19

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

The policy 5or choosing to gener!te 2("'( mess!ges inste!& o5 2("( 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 2oc!l (ssoci!tion T!;le 5or ! &4r!tion gre!ter th!n ST("2 P21'(2P(SS1'I(TI13PTIM , the Mesh (@ gener!tes 2("'( mess!ges. I5 there is ! ch!nge (i.e., st!tion !ssoci!tion or &is!ssoci!tion), it s$itches ;!c# to sen&ing 2("(.

(s ! si&e note, rem!r# th!t ! prereK4isite 5or !pplic!tion o5 this mo&e o5 oper!tion is th!t !ll Mesh @oints in the F2(3 Mesh s4pport it. 11.5.1".0.2 &etailed #e$$a e 3eneration and #e$$a e Proce$$in The processing o5 the 2("( mess!ges is 4nch!nge& comp!re& to the oper!ting mo&e MJ4ll "!se =i554sionN. 11.5.1".0." LA2(A #e$$a e 3eneration5 %orwardin and Proce$$in The gener!tion o5 2("'( mess!ges c!n repl!ce the gener!tion o5 2("( mess!ges, !n& is str!ight5or$!r& 5rom the 2("'( mess!ge 5orm!t &escription, !n& 5rom the chec#s4m c!lc4l!tion &escri;e& in ! 5ollo$ing section. The 5or$!r&ing o5 2("'( mess!ges is &one !ccor&ing to the M&e5!4lt 5or$!r&ing !lgorithmN The processing o5 2("'( mess!ges is !lso simpleB !s in&ic!te&, ! :eri5ic!tion o5 !ll the 'hec#s4m St!t4s S!l4es is per5orme& 5or !ll ;loc#s. In c!se o5 one mism!tch or more !n (""% mess!ge is gener!te&. 6o$e:er, 5or e!ch ;loc# $hich m!tches, the G(Pe<pir!tionPtime o5 t4ples in the m!tching ;loc#s is 4p&!te&, !n& !lso e!ch entry in ! ;loc# $hich h!s &is!ppe!re& is &elete&B 1. Jor e!ch t4ple in the Glo;!l (ssoci!tion "!se $hereB G(P(@P!&&ress QQ 1rigin!tor (&&ress, (3= G(P;loc#Pin&e< QQ in the r!nge 5rom 0 to the n4m;er o5 ;loc#s-1 in the mess!ge The 5iel& G(Pe<pir!tionPtime is 4p&!te& !s 5ollo$sB G(Pe<pir!tionPtime Q c4rrent time + :!li&ity time (5rom mess!ge he!&er) Jor e!ch t4ple in the Glo;!l (ssoci!tion "!se $hereB G(P(@P!&&ress QQ 1rigin!tor !&&ress, (3= G(P;loc#Pin&e< is gre!ter th!n l!st ;loc# in&e< in the 2("'( mess!ge, The t4ple is &elete&.

2.

11.5.1".0.) A22R #e$$a e 3eneration5 %orwardin and Proce$$in (s in&ic!te&, !t the recei:er Mesh @oint, !n (""% mess!ge is gener!te& e!ch time !re &etecte& ;y the recei:er Mesh @oint, 5or the ;loc#s o5 the Glo;!l (ssoci!tion "!se correspon&ing the origin!tor Mesh (@ !&&ress o5 the 2("'( mess!ge. The (""% mess!ge incl4&es the list o5 the ;loc# in&ices 5or $hich there is ! mism!tch. It is sent to the Mesh (@ origin!tor o5 the mism!tching 2("'( mess!ge, $ith !n %(-12S% Mess!ge he!&er in ! %(-12S% p!c#et 5orm!t, !s ! 4nic!st p!c#et $ith &estin!tion M(' !&&ress set to the !&&ress o5 the Mesh (@. The (""% mess!ge 5or$!r&ing is simpleB ;ec!4se the (""% mess!ge is 4nic!st, the mess!ge is 5or$!r&e& in ! simil!r $!y the &!t! mess!ge !re 5or$!r&e&, i.e., hop ;y hop !n& 4sing the ro4ting t!;le to re!ch the &estin!tion Mesh (@. 3ote ho$e:er th!t the hop co4nt !n& the TT2 5iel&s o5 the %(-12S% mess!ge he!&er m!y ;e 4p&!te& !t e!ch hop. The processing o5 (""% mess!ges !t the &estin!tion Mesh (@ consists in recor&ing !ll the ;loc#s in&ices 5or $hich there is ! mism!tch. (t the ne<t 2("(C2("'( gener!tion, the Mesh (@ $ill eitherB "ro!&c!st ! J4ll 2("( mess!ge ($ith !ll 2oc!l (ssoci!tion "!se).

S4;mission

p!ge 20

Joseph Kim, STMicroelectronics et !l.

September 2006

doc.: IEEE 802.11-06/1481r0

"ro!&c!st ! 2("( mess!ge $ith !ll the content o5 ;loc#s 5or $hich there $!s (!t le!st) one reK4est, !n& ;ro!&c!st one 2("'( 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 Jor ! ;loc# $ith ! gi:en in&e<, (ll the correspon&ing !ssoci!tion t4ples, !ppropri!tely either in 2(" or in the G(", !re retrie:e&.

They !re con:erte& in seK4ence o5 octets (-)B (M(' !&&ress, seK4ence n4m;er) They !re sorte& ;y incre!sing or&er. They !re conc!ten!te& !s ! seK4ence o5 octets. ( h!shing 54nction1 is !pplie& to the seK4ence. The res4lt o5 the h!shing 54nction is 4se& to represent the chec#s4m

11.5.1) Recommended >alue$ 'or (on$tant$ This cl!4se lists the :!l4es 5or the const!nts 4se& in the &escription o5 the protocol. 11.5.1).1 Settin emi$$ion interval$ and holdin time$ The recommen&e& :!l4e 5or const!nt ' is the 5ollo$ingB ' Q 1C16 secon&s (eK4!l to 0.062) secon&s) ' is ! sc!ling 5!ctor 5or the M:!li&ity timeN c!lc4l!tion (MStimeN !n& M6timeN 5iel&s in mess!ge he!&ers, see cl!4se 11(.).* !n& 11(.).6). The M:!li&ity timeN !&:ertisement is &esigne& s4ch th!t M@s in ! net$or# m!y h!:e &i55erent !n& in&i:i&4!lly t4n!;le emission inter:!ls, $hile still interoper!tes 54lly. Jor protocol 54nctioning !n& interoper!;ility to $or#B The !&:ertise& hol&ing time MOST !l$!ys ;e gre!ter th!n the re5resh inter:!l o5 the !&:ertise& in5orm!tion. Moreo:er, it is recommen&e& th!t the rel!tion ;et$een the inter:!l (5rom cl!4se 11(.).)), !n& the hol& time is #ept !s speci5ie& in cl!4se 11(.).), to !llo$ 5or re!son!;le p!c#et loss. The const!nt ' S61O2= ;e set to the s4ggeste& :!l4e. In or&er to !chie:e interoper!;ility, ' MOST ;e the s!me on !ll M@s. The emission inter:!ls, !long $ith the !&:ertise& hol&ing times (s4;7ect to the !;o:e constr!ints M(8 ;e selecte& on ! per M@ ;!sis. 3ote th!t the timer resol4tion o5 ! gi:en implement!tion might not ;e s455icient to $!#e 4p the system on precise re5resh times or on precise e<pire timesB the implement!tion S61O2= ro4n& 4p the R:!li&ity time? (MStimeN !n& M6timeN o5 p!c#ets) to compens!te 5or co!rser timer resol4tion, !t le!st in the c!se $here M:!li&ity timeN co4l& ;e shorter th!n the s4m o5 emission inter:!l !n& m!<im4m e<pecte& timer error. 11.5.1).2 *mi$$ion Interval$

In the speci5ic!tion o5 2("'( I in cl!4se ..*.2.)9.), $e !ss4me th!t M=) is 4se& 5or chec#s4m c!lc4l!tion.

S4;mission

p!ge 21

Joseph Kim, STMicroelectronics et !l.

September 2006
6 221PI3T %S(2 Q 2 secon&s % J% S6PI3T %S(2 Q 2 secon&s T'PI3T %S(2 Q ) secon&s MI=PI3T %S(2 Q T'PI3T %S(2 63(PI3T %S(2 Q T'PI3T %S(2 11.5.1)." 4oldin Time 3 IG6"P612=PTIM Q * < % J% S6PI3T %S(2 T1@P612=PTIM Q * < T'PI3T %S(2 =O@P612=PTIM Q *0 secon&s MI=P612=PTIM Q * < MI=PI3T %S(2 63(P612=PTIM Q * < 63(PI3T %S(2

doc.: IEEE 802.11-06/1481r0

The Stime in the mess!ge he!&er (see cl!4se 11(.).*), !n& the 6time in the 6 221 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<ponent 5orm!t (ro4n&e& 4p). In other $or&sB S!l4e Q 'W(1+!C16)W2; Hin secon&sI $here ! is the integer represente& ;y the 5o4r highest ;its o5 the 5iel& !n& ; the integer represente& ;y the 5o4r lo$est ;its o5 the 5iel&. 3otice, th!t 5or the pre:io4s recommen&e& :!l4e o5 ', (1C16 secon&s), the :!l4es, in secon&s, e<presse& ;y the 5orm4l! !;o:e c!n ;e store&, $itho4t loss o5 precision, in ;in!ry 5i<e& point or 5lo!ting point n4m;ers $ith !t le!st ;its o5 5r!ction!l p!rt. This correspon&s $ith 3T@ time-st!mps !n& single precision I St!n&!r& .), 5lo!ting point n4m;ers. Gi:en one o5 the !;o:e hol&ing times, ! $!y o5 comp4ting the m!ntiss!Ce<ponent represent!tion o5 ! n4m;er T (o5 secon&s) is the 5ollo$ingB Jin& the l!rgest integer R;? s4ch th!tB TC' DQ 2; 'omp4te the e<pression 16W(TC('W(2;))-1), $hich m!y not ;e ! integer, !n& ro4n& it 4p.

This res4lts in the :!l4e 5or R!? i5 R!? is eK4!l to 16B increment R;? ;y one, !n& set R!? to 0 no$, R!? !n& R;? sho4l& ;e integers ;et$een 0 !n& 1), !n& the 5iel& $ill ;e ! ;yte hol&ing the :!l4e !W16+;

Jor inst!nce, 5or :!l4es o5 2 secon&s, 6 secon&s, 1) secon&s, !n& *0 secon&s respecti:ely, R!? !n& R;? $o4l& ;eB (!Q0, ;Q)), (!Q-,;Q6), (!Q1,,;Q.) !n& (!Q1,,;Q-) respecti:ely. 11.5.1).) #e$$a e T!pe$ 6 221PM SS(G Q 1 T'PM SS(G Q 2 MI=PM SS(G Q * 63(PM SS(G Q , 11.5.1).5 -ei h.or T!pe$ 31TP3 IG6 Q 0 S8MP3 IG6 Q 1 M@%P3 IG6 Q 2

S4;mission

p!ge 22

Joseph Kim, STMicroelectronics et !l.

September 2006
11.5.1).0 ?illin ne$$ FI22P3 S % Q 0 FI22P21F Q 1 FI22P= J(O2T Q * FI22P6IG6 Q 6 FI22P(2F(8S Q .

doc.: IEEE 802.11-06/1481r0

The $illingness o5 !n M@ m!y ;e set to !ny integer :!l4e 5rom 0 to ., !n& speci5ies ho$ $illing !n M@ is to ;e 5or$!r&ing tr!55ic on ;eh!l5 o5 other M@s. M@s $ill, ;y &e5!4lt, h!:e ! $illingness FI22P= J(O2T. FI22P3 S % in&ic!tes !n M@ $hich &oes not $ish to c!rry tr!55ic 5or other M@s, 5or e<!mple &4e to reso4rce constr!ints (li#e ;eing lo$ on ;!ttery). FI22P(2F(8S 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<!mple &4e to reso4rce !;4n&!nce (li#e perm!nent po$er s4pply, high c!p!city inter5!ces to other M@s). (n M@ m!y &yn!mic!lly ch!nge its $illingness !s its con&itions ch!nge. 1ne possi;le !pplic!tion $o4l&, 5or e<!mple, ;e 5or !n M@, connecte& to ! perm!nent po$er s4pply !n& $ith 54lly ch!rge& ;!tteries, to !&:ertise ! $illingness o5 FI22P(2F(8S. Opon ;eing &isconnecte& 5rom the perm!nent po$er s4pply (e.g., ! @=( ;eing t!#en o4t o5 its ch!rging cr!&le), ! $illingness o5 FI22P= J(O2T is !&:ertise&. (s ;!ttery c!p!city is &r!ine&, the $illingness $o4l& ;e 54rther re&4ce&. Jirst to the interme&i!te :!l4e ;et$een FI22P= J(O2T !n& FI22P21F, then to FI22P21F !n& 5in!lly to FI22P3 S %, $hen the ;!ttery c!p!city o5 the M@ &oes no longer s4pport c!rrying 5oreign tr!55ic. 11.5.1).1 #i$c. (on$tant$ M(UJITT % Q 6 221PI3T %S(2 C , 11.5.15 Se@uence -um.er$ SeK4ence n4m;ers !re 4se& in %(-12S% $ith the p4rpose o5 &isc!r&ing Mol&N in5orm!tion, i.e., mess!ges recei:e& o4t o5 or&er. 6o$e:er $ith ! limite& n4m;er o5 ;its 5or representing seK4ence n4m;ers, $r!p-!ro4n& (th!t the seK4ence n4m;er is incremente& 5rom the m!<im4m possi;le :!l4e to 0ero) $ill occ4r. To pre:ent this 5rom inter5ering $ith the oper!tion o5 the protocol, the 5ollo$ing MOST ;e o;ser:e&B The seK4ence n4m;er S1 is s!i& to ;e Mgre!ter th!nN the seK4ence n4m;er S2 i5B S1 D S2 (3= S1 - S2 AQ M(US(2O C2 1% S2 D S1 (3= S2 - S1 D M(US(2O C2 $here the term M(US(2O &esign!tes the l!rgest possi;le :!l4e 5or ! seK4ence n4m;er. Th4s $hen comp!ring t$o mess!ges, it is possi;le L e:en in the presence o5 $r!p-!ro4n& L to &etermine $hich mess!ge cont!ins the most recent in5orm!tion.

S4;mission

p!ge 2*

Joseph Kim, STMicroelectronics et !l.

September 2006
"e&ere.ces:

doc.: IEEE 802.11-06/1481r0

H1I Draft in progress, I @-02.11sC=0.0* =r!5t (men&ment to St!n&!r& 5or In5orm!tion Technology Telecomm4nic!tions !n& In5orm!tion <ch!nge "et$een Systems - 2(3CM(3 Speci5ic %eK4irements - @!rt 11B Fireless Me&i4m (ccess 'ontrol (M(') !n& physic!l l!yer (@68) speci5ic!tionsB (men&mentB SS Mesh 3et$or#ing, (4g4st 2006. H2I K. Kim et !l., M(ction Jr!me Jorm!t !n& In5orm!tion lements Speci5ic!tions 5or %(-12S%,N I -02.11-06C1*9)r2.

S4;mission

p!ge 2,

Joseph Kim, STMicroelectronics et !l.