Sie sind auf Seite 1von 34

K THUT NH TUYN TRONG MNG AD-HOC

LI NI U T thp k 90 ca th k trc vi s ra i ca k thut s y nhanh s pht trin cc cng ngh v ng dng chng vo cc lnh vc i sng hng ngy, c bit l truyn thng v cng ngh thng tin. Cc h thng truyn thng t c nh n di ng ph rng khp th gii lm cho con ngi khp ni trn th gii c th thng tin vi nhau mi lc, mi ni. Tuy vy, trong mt s hon cnh c bit nh thin tai, ng t, chin tranh vv c s h tng vin thng b ph v, lc con ngi s lin lc vi nhau nh th no? gii quyt bi ton , gn y mt dng cng ngh mng ra i, l mng AD HOC. Mng Ad hoc l mt tp hp cc nt mng di ng khng dy, nm phn tn v mt a l to thnh mt mng tm thi m khng s dng bt c cu trc h tng mng c sn hay qun l tp trung no. Cc nt mng lin lc vi nhau qua mi trng v tuyn khng cn cc b nh tuyn c nh, v vy mi nt mng phi ng vai tr nh mt b nh tuyn di ng c trang b mt b thu pht khng dy. Cc b nh tuyn t do di chuyn ngu nhin, v vy cu hnh mng thay i thng xuyn. Mng nh vy c th hot ng c lp hoc kt ni vi mng h tng chung to thnh mng thng tin ton cu. Vi c im , mt lot thch thc vi mng ad hoc c t ra cn gii quyt: Nng lng: Cc phn t ca mng ad hoc hot ng c nh ngun nng lng l pin. V vy vn tui th ca pin,cng sut pin cn c bit quan tm. Cu hnh mng khng c cu trc v bin i ngu nhin. Cht lng lin lc thp. Bng thng rt hn ch. Kh nng m rng phi rt cao v mng c rt nhiu nt mng. Vi nhng bi ton c bn , nhiu nh khoa hc dnh thi gian thch ng nghin cu v gii quyt. Ring trong lnh vc nh tuyn v iu khin cu hnh c nhng kt qu ni bt. Cc cng trnh ny tp trung vo cc giao thc nh tuyn. Vi nhng kin thc thu thp c em chn ti K thut nh tuyn trong mng Ad-Hoc lm n mn hc 2 cho mnh.

Sinh vin nghin cu L PH HI

Thut ng vit tt
RREP RREQ TC TORA TTL WLAN ACK AODV Route Reply Route Request Topology Control Temporally-Ordered Routing Algorithm Time to live Wireless Local Area Network Acknowledgment Ad-hoc on-demand distance vector routing Hi p tuyn Yu cu tuyn iu khin cu hnh mng Thut ton nh tuyn tun t tm thi Thi gian sng Mng cc b khng dy

DSR LLACK LSA MAC MANET MID MPR OLSR QoS RERR

Bo nhn nh tuyn khong cch vct theo yu cu ty bin Dynamic Source Routing nh tuyn ngun ng link-layer acknowledgments Bo nhn lp lin kt Link-state advertisement Qung b trng thi lien kt Medium Access Control iu khin truy nhp mi trng Mobile Ad-hoc Network Mng ty bin di ng multiple interface Cng b a giao din declaration Multi-Point Relay Chuyn tip a im Optimized Link State Giao thc nh tuyn Routing Protocol trng thi lin kt ti u. Quality of service Cht lng dch v Route Error Li tuyn

CHNG I :TNG QUAN V MNG AD-HOC


Chng ny cp n cc vn : + Tng quan v mng Ad-Hoc. + c im ca mng Ad-Hoc. + Cc ng dng ca mng Ad-Hoc. + Vn an ninh mng Ad-Hoc. 1.1.Tng quan v mng AD-HOC Vo nhng nm 1970, mng khng dy tr nn ngy cng ph bin trong ngnh cng nghip my tnh. iu ny c bit ng trong thp k va qua c thy mng khng dy ang c thch nghi cho php di ng. Hin ti c hai dng mng di ng khng dy. Mng u tin c bit n nh mng c s h tng, l cc mng c nh v c cng dy. Cu cho cc mng ny c gi l trm c s . n v di ng trong mng ny c kt ni v giao tip vi trm c s gn l trong giao tip bn knh ca n. Khi di ng trn phm vi ca mt trm c s v vo trong phm vi khc, chuyn giao xy ra t trm c s c n trm c s mi v l in thoi di ng c th tip tc lin lc lin tc trong sut mng. ng dng in hnh ca kiu mng ny bao gm cc l mng khng dy cc b WLAN (Wireless Local Area Network ). Loi th hai ca mng di ng khng dy l mng di ng khng c c s h tng, thng c gi l mng ty bin. Mng khng c c s h tng l mng khng nh tuyn; tt c cc nt c kh nng chuyn ng v c th c kt ni mt cch ngu nhin. Cc nt ca cc mng ny c chc nng nh router m n pht hin ra v duy tr cc router n cc nt khc trong mng. Vi tin b gn y v lnh vc my tnh v cng ngh truyn thng,ng dng ca cng ngh di ng khng dy s ngy cng c s dng rng ri, nhiu trong s s lin quan n vic s dng b giao thc mng ( IP ). Kh nng ca mng di ng ty bin khng dy l h tr mnh m cc hot ng c hiu qu trong mng di ng khng dy bng cch kt hp cc chc nng nh tuyn vo cc nt di ng.

Mng ny c nhn nh c nhiu kh nng pht trin, i khi c th thay i nhanh chng, ngu nhin. Trong Internet, hin nay giao thc nh tuyn h tr cho my ch tr thnh cng ngh IP di ng . y l cng ngh h tr my ch lu ng, ni my ch di chuyn c th kt ni ti Internet thng qua cc phng tin khc ngoi a ch c inh tn min khng gian ca n. My ch c th kt ni trc tip vi mng c nh trn mt subnet ngoi hoc c th kt ni thng qua ng dn khng dy, dng a ch v.vH tr di hnh thc my ch di ng ( di chuyn ) yu cu qun l a ch. Giao thc ci tin kh nng tng tc v thch nghi, nhng cc chng trnh ct li ca mng nh nh tuyn hop-by-hop hin gi vn da vo cc giao thc nh tuyn hot ng trong mng c nh. Ngc li, mc tiu ca Ad-Hoc l m rng tnh di ng vo cc lnh vc c lp, di ng, lnh vc khng dy, ni ci t cc nt - ni c th kt hp routers v my ch t to thnh mng li c s h tng trong mng ty bin khng dy. Trong th h tip theo ca h thng truyn thng khng dy ,s trin khai nhanh chng c lp vi ngi dng di ng thc s cn thit. Nhng v d quan trng bao gm thit lp s tn ti ,hiu qu, truyn thng linh ng i vi cc hot ng khn cp ,cc n lc cu nguy cc thm ha v cc mng qun i. Hu ht cc kch bn mng khng th da trn kt ni c sp xp v kim sot iu ny c th tng tng nh cc ng dng ca mng Ad-Hoc. Cc mng Ad-Hoc (Mobile ad-hoc network) hay cc mng tn ti ngn hot ng m khng cn c s h tng c nh. Chng cung cp s trin khai nhanh chng v d dng cho mng trong nhng tnh hung khng th thc hin theo cch no khc. Ad-Hoc l mt t latinh c ngha l dnh cho hoc ch dnh cho.Ad-Hoc l mt h t qun bao gm mt tp cc ngi dng di ng truyn thng vi nhau qua bng thng c rng buc bi cc lin kt khng dy. Khi cc nt (my tnh hoc thit b tham gia vo mng) mng di chuyn, hnh trng mng(topo) c th thay i mt cch nhanh chng v khng th on trc c. Mng b phn chuyn trong tt c phm vi hot ng bao gm vic tm ra hnh trng mng v nhn cc thng ip phi c thc hin bi chnh cc nt mng. Chc nng nh tuyn s c kt hp cht ch vi cc nt di ng. Cc nt trong mng Ad-Hoc t do di chuyn v t t chc theo mt cch ty tin.Mi ngi dng t do di chuyn trong khi truyn thng vi nhng ngi khc. ng truyn gia mi cp s dng c th c nhiu lin kt v song radio gia chng c th khng ng nht ,iu ny cho php mt s kt hp ca nhiu lin kt khc

nhau. Cc mng Ad-Hoc c th hot ng mt cch c lp hoc c th c kt ni vi mt mng ln hn nh Internet.

1.2 c im ca mng Ad-Hoc Mng Ad-Hoc gm nhng nn tng di ng ( v d mt router vi nhiu my ch v thit b lin lc khng dy). y gi l cc nt m chng c th t do di chuyn. Cc nt c th trong hoc trn my bay, tu, xe ti, xe hi, thm ch trn ngi hoc nhng thit b rt nh, v c th c nhiu my ch trn mi router. Mng Ad-Hoc l mt h thng t ng ca cc nt di ng. H thng c th hot ng c lp hoc c th c cng vo ra v giao din vi mt mng c nh. Trong ch hot ng sau, n c hnh dung nh mt ci mng gc kt ni vi mt mng c nh. Cc nt trong mng Ad-Hoc c trang b truyn thng khng dy v thu nhn s dng ng-ten c th pht sng theo mi hng, hng cao (im ti im), hay mt s s kt hp. Ti mt im c a ra trong mt thi gian, ty thuc vo v tr ca cc nt truyn v nhn an ton. Topo trong mng Ad-Hoc c th thay i theo thi gian nh cc nt di chuyn hoc iu chnh s truyn dn v tip nhn cc thng s ca chng. Mt s dc im ni bt ca Ad-Hocs: 1. Chc nng ca topo: Cc nt di chuyn t do, do cc topo mng thng l multihop c th thay i ngu nhin v nhanh chng vo cc thi im khng th on trc, c th bao gm cc lin kt hai chiu v theo ng dn duy nht. 2. Bng thng hn ch, kh nng thay i lin kt: Lin kt khng dy s tip tc c cng sut thp hn cc loi khc . Ngoi ra, thng qua vic thc hin cc giao tip khng dy sau khi tnh ton nh hng ca ngi truy cp, s nhiu sng, ting n v s can thip c iu kin v.v. thng nh hn rt nhiu so vi kh nng truyn ti a ca sng v tuyn. Mt trong nhng nh hng tng i thp n kh nng lin kt trung bnh l tnh trng tc nghn chun ch khng phi l ngoi l, l tng hp cc ng dng c kh nng tip cn vt qu cng sut mng thng xuyn. Khi cc mng di ng thng ch n gin l mt phn m rng ca c s h tng mng c nh, mng di

ng ty bin ca ngi dng s yu cu cc dich v tng t. Nhng yu cu ny s tip tc tng ln nh my tnh a phng tin v cc ng dng mng cng gia tng. 3. Hn ch nng lng hot ng: Mt vi hoc tt c cc nt trong mng ADHOC c th da vo nng lng yu hoc cn kit. i vi cc nt, qua trng nht khi thit k h thng l tiu ch ti u ha c th bo tn c nng lng. 4. Gii hn an ninh vt l: Mng di ng khng dy thng d b e da v an ninh vt l hn l cp c nh. Kh nng nghe trm, gi mo v t chi cc cuc truy nhp ca dch v nn c xem xt cn thn. K thut lin kt bo mt thng c p dng gia cc mng khng dy gim thiu ti a e da v an ninh mng. Nh l mt li ch, s phn cp kim sot trong mng Ad-Hoc cung cp mnh m cc b sung chng li im li duy nht hn l phng php tp trung. c im chnh ca mng Ad-Hoc l: S dng phn quyn cho cc nt mng. Cc nt mng t n sp xp tuyn v t n trin khai tuyn, mng Ad-Hoc l mt mng c cu trc mng ng. Mng Ad-Hoc khng c ng truyn chuyn dng (specialized routers), Ngoi ra n khng dng cc ng truyn c nh (fixed routers ) hay cc ng truyn vt l (dy dn). Mng Ad-Hoc c cu trc v bin i cu trc mt cch thng xuyn, cu trc mng c tnh cht tm thi, cc nt lin kt vi nhau theo kiu mng ngang hng, cc nt c vai tr nh nhau v c chc nng tm kim, duy tr v nh tuyn. Mng Ad-Hoc dng mt s k thut lin quan n cc vn k thut dng truyn thng v tuyn v n c nhng c tnh: - Tnh khng ng nht gia cc thit b. - c trng lu lng mng. - Di chuyn ca cc nt trong mt tuyn u im ca mng Ad-Hoc Trong mng c bn th c s h tng, cc trm trung gian, thu pht sng l yu t quan trng quyt nh cht lng ca mng, cn trong mng Ad-Hoc cc nt mng kt ni thng qua cc nt mng ( khng cn n cc trm thu pht), cc nt mng c th di chuyn t do trong cu trc mng do n c tnh cht c ng cao v do lm gim bt s ph thuc vo c s h tng, lm cho mng d pht trin d dng, tc pht trin ca mng nhanh. Nhng thch thc i vi mng Ad-Hoc:

- Chi ph cho vic s dng ph tn s. - Vic nh tuyn. - Hiu qu s dng ngun in. - Giao thc iu khin truyn. - nh v cung cp v truy nhp dch v. 1.3 Cc ng dng ca mng Ad-Hoc Cc cng ngh ca mng khng dy kiu khng cu trc em li rt nhiu li ch so vi cc mng truyn thng (c khng dy v c dy) trong nhng ng cnh kh c th trin khai c mt c s h tng mng c nh hoc vic trin khai l khng kh thi do nhng l do v mt thc hnh (a hnh,) hoc do nhng l do v kinh t (chi ph cp trong mt khng gian ln, chi ph thit lp nhiu im truy cp). Cng ngh ca mng Ad-Hoc ging nh mt gi mng pht sng di ng. Mng li di ng( mt thut ng xut hin trong tc phm ECONOMIST v cu trc ca cc mang trong tng lai) v di ng, Multihop, mng khng dy (c l l thut ng chnh xc nht mc d hi rm r ). l hin ti v tng lai cho mng Ad-Hoc. Mt lnh vc mi ni ca my tnh v in thoi di ng vi tnh nhn mnh hin thi v IP di ng, dn dn s m rng v i hi cng ngh mng di ng cao qun l hiu qu Multihop, mng ty bin khng dy c th hot ng t ng hoc hn th c km theo mt s im ti mng c nh. Mt s ng dng ca cng ngh mng Ad-Hoc c th bao gm cc ng dng cng nghip v thng mi lin quan n trao i d liu trn in thoi di ng. Ngoi ra, da trn mng li in thoi di ng c th hot ng mnh m, thay th cc phng php r tin hoc ci tin cc thit b da trn c s h tng mng. Phn di y s gii thiu cc ng dng ca mng Ad-Hoc. 1.3.1 ng dng trong qun i Nhng thnh tu mi ca cng ngh thng tin thng c p dng trong qun s u tin, v mng khng dy kiu khng cu trc cng khng phi l mt ngoi l. Nhiu nm nay, qun i s dng cc mng packet radios mt nguyn mu u tin ca mng chuyn mch gi khng dy ngy nay.

Hnh 1-2: M hnh di ng ca mng Ad-Hoc thun ty v gii php dng trong qun i Gii php mng Ad-Hoc cho qun i c nhng c im khc so vi mng Ad-Hoc thun ty. Mng Ad-Hoc thun ty thng tun theo mt m hnh im ngu nhin,cc nt t do di chuyn theo bt c hng no, vi bt c tc no. Trong m hnh mng Ad-Hoc cho qun i, cc nt phn nhm theo bn cht t nhin ca chng khi chng cng thc hin mt nhim v c th. Xu hng di ng y l theo nhm (group mobility). Do , nu a ra c mt m hnh chuyn ng theo nhm, cc vn ca mng Ad-Hoc s tr nn c th hn (v d: nh tuyn, s dng cc ng dng thi gian thc nh ting ni, video,), cho php pht trin mt gii php ti u. 1.3.2 Cc ng dng trong cuc sng Mng Ad-Hoc l rt l tng trong cc trng hp khng c sn mt c s h tng thng tin, tuy nhin li cn phi thnh lp mt mng tm thi nhm trao i thng tin v hp tc cng lm vic. Cu h Ti cc vng b thin tai, thm ha, kh c th c c mt c s h tng v thng tin vng chc. H thng c trc rt c th b hng hoc b ph hy hon ton. Ti vng c thm ha, tt c cc phng tin v h thng truyn thng u b ph hy hon ton. Mi chic xe ca cnh st, cu ha, cu thng, u c trang b nh mt thit b u cui di ng l mt phn ca mng ad-hoc. Mi nhn vin cng mang theo mt thit b u cui di ng. Cc thit b u cui ny u lin kt vi nhau, hnh thnh nn mt mng tm thi nhm trao i thng

tin. Cu hnh mng thay i theo nhng thi im khc nhau. Ngoi ra,cc thit b u cui di ng khng ch cung cp chc nng gi v nhn thng tin m cn c th chuyn tip thng tin, ng vai tr nh router trn Internet . Hi tho Khc vi cch lm truyn thng khi nhng ngi tham gia hi tho mun chia s ti liu cho nhau l gi file nh km qua email hoc sao chp qua cc thit b lu tr th cp c kh nng di ng, tt c nhng ngi tham d hi tho u c th s dng thit b di ng to thnh mt mng ad-hoc trong sut thi gian . Cc thit b c th truyn thng vi nhau, truyn/nhn cc ti liu c s dng trong hi tho. Khi hi tho kt thc, cc thit b c tt ngun, mng t b hy b. i sng hng ngy Gi s mt em hc sinh s dng thit b cm tay di ng i hc hng ngy bng xe bus. Khi ln xe bus, thit b u cui ca em chuyn sang ch ad-hoc. Em gp bn v mun trao i file so snh kt qu bi tp ton v nh. Sau ,hai em mun chi tr chi in t. c th chi vi nhng ngi chi khc,hai em phi kim tra xem trn xe but hoc trong cc t xung quanh c mt mng chi tr chi in t no hay cha. Em chy mt ng dng ngang hng v tm mt tr chi no c th chi trong lc i trn xe but. Rt may, mt ai trn xe but chia s cc tr chi v cho php ngi khc ti v t thit b u cui ca anh ta. Em chn mt tr chi. Tr chi c t ng ti v, ci t v cu hnh trn thit b u cui ca em. Em c th chi in t ngay sau . Bn em cng c th tham gia vo tr chi nu mun, ngay trn my ca em.

Hnh v 1-3: Mng ad-hoc thun ty (mi trng trn xe but) Mi trng mng y l mt mng khng dy kiu khng cu trc thun ty, tc l khng c c s h tng v cp, cc thit b u cui t cu hnh thnh lp mng, m khng c s qun l tp trung. Mng ny c th t chia nh thnh cc mng con: mt mng ring gia em hc sinh v bn ca em, mt mngchung c khi

to bi ngi mun chia s cc chng trnh tr chi in t trn my ca anh ta. Hai mng ny c trn ln vo nhau mt cch ng. 1.4 Vn an ninh Mng di ng khng dy ni chung u d b e da v an ninh hn mng c nh. Mt s cp bo mt thng c p dng gia cc mng khng dy gim bt cc mi e da. Khng c lin kt m ha ti cc tng mng,vn bc xc nht l mt trong cc route cc thc trc khi trao i iu khin thng tin mng. Mt s cp xc thc khc nhau, t khng c an ninh v chia s nhng phng php tip cn n gin v y . h tr cc phng thc lm vic nhm, mt s ch xc thc ty chn c chun ha s dng trong Ad-Hocs.

Chng 2:c im mt s loi giao thc nh tuyn trong mng Ad-hoc.


2.1 Mt s vn v k thut nh tuyn theo bng(Proactive routing): Trong phng php nh tuyn theo bng, cc node trong mng MANET lin tc nh gi cc tuyn ti cc node duy tr tnh tng thch, cp nht ca thng tin nh tuyn. V vy, mt node ngun c th a ra mt ng dn nh tuyn ngay lp tc khi cn. Trong cc giao thc nh tuyn theo bng, tt c cc node cn duy tr thng tin v cu hnh mng. Khi cu hnh mng thay i, cc cp nht c truyn lan trong mng nhm thng bo s thay i. Hu ht cc giao thc nh tuyn theo bng u k tha v sa i c tnh tng thch t cc thut ton chn ng dn ngn nht trong cc mng hu tuyn truyn thng. Cc thut ton nh tuyn theo bng c s dng cho cc node cp nht trng thi mng v duy tr tuyn bt k c lu lng hay khng. V vy, tiu thng tin duy tr cu hnh mng i vi cc giao thc ny thng l ln. Mt s giao thc nh tuyn in hnh theo bng trong MANET gm: + Giao thc nh tuyn khng dy WRP (Wireless Routing Protocol) + nh tuyn vector khong cch tun t ch DSDV (Destination Sequence Distance Vector) + nh tuyn trng thi ti u lin kt OLSR (Optimized Link State Routing)

2.2 Mt s vn v k thut nh tuyn theo nhu cu(Reactive routing). Trong phng php nh tuyn theo yu cu, cc ng dn c tm kim ch khi cn thit, hot ng tm tuyn bao gm c th tc xc nh tuyn. Th tc tm tuyn kt thc khi mt tuyn c tm thy hoc khng c tuyn kh dng sau khi xc minh ton b tp hon v tuyn. Trong mng MANET, cc tuyn hot ng c th ngng do tnh di ng ca node. V vy, thng tin duy tr tuyn l ti quan trng i vi cc giao thc nh tuyn theo yu cu. So vi cc giao thc nh tuyn theo bng, cc giao thc nh tuyn theo yu cu thng c tiu trao i thng tin nh tuyn nh hn. V vy, v mt nguyn tc, cc giao thc ny c kh nng m rng tt hn so vi cc giao thc nh tuyn theo bng. Tuy nhin, vn ln nht ca cc giao thc nh tuyn theo yu cu l tr do tm kim tuyn trc khi chuyn tip thng tin d liu. V d v mt s giao thc nh tuyn theo yu cu gm: + Giao thc nh tuyn ngun ng DSR (Dynamic Source Routing) + Giao thc nh tuyn vector khong cch theo yu cu AODV (Ad hoc Ondemand Distance Vector routing) + Giao thc nh tuyn theo th t tm thi TORA (Temporally Ordered Routing Algorithm)

2.3 K thut nh tuyn lai ghp(Hybrid routing). Cc giao thc nh tuyn lai ghp c xut kt hp cc c tnh u im ca cc giao thc nh tuyn theo bng v theo yu cu. Thng thng, cc giao thc nh tuyn lai ghp Manet c s dng trong kin trc phn cp. Cc giao thc nh tuyn theo bng v theo yu cu c trin khai trong cc cp thch hp. Mt s v d v giao thc nh tuyn lai ghp: + Giao thc nh tuyn vng ZRP (Zone Routing Protocol) + Giao thc nh tuyn trng thi lin kt da trn vng ZHLS (Zone-based Hierarchical Link State routing) + Giao thc nh tuyn mng ty bin lai HARP (Hybrid Ad hoc Routing Protocol), v.v...

Chng 3:K thut nh tuyn theo bng OLSR.


3.1 Khi qut giao thc OLSR. Nh c gii thiu, OLSR l mt giao thc nh tuyn khi to theo chu k c ti u cc mng ty bin. Giao thc ny tha k tnh n nh ca thut ton trng thi lin kt v lun sn sng cc tuyn ng khi cn thit. Vi mc ch gim thiu chi ph cho cng vic trn lt lu lng iu khin OLSR ch s dng cc nt MPR c chn truyn dn cc bn tin ny. K thut ny lm gim ng k s lng yu cu truyn li trn lt mt bn tin ti tt c cc nt trong mng. OLSR ch s dng mt phn thng tin trng thi lin kt c trn lt la chn tuyn ng ngn nht. C mt yu cu cho tt c MPR l phi thng bo cc lin kt ti cc nt la chn chng. Ngoi ra thng tin cu hnh mng c th c s dng cho mc ch d phng. OLSR c th ti u cc phn ng khi cu hnh mng thay i bng cch gim thi gian gia hai ln truyn bn tin iu khin. Hn th na, n lun duy tr cc tuyn n tt c cc ch trong mng. V th OLSR rt ph hp cho truyn thng gia cc tp hp nhiu nt mng vi nhau hoc cho cc cp ngun - ch thay i theo thi gian. Giao thc ny c bit ph hp vi cc mng ln v giy c. Cc li th ny c mang li nh s dng k thut chuyn tip a im cng nh cc li th ca nh tuyn khi to theo chu k. OLSR c thit k lm vic trong cc mng phn tn v khng ph thuc vo bt k mt thc th trung tm no. Giao thc ny khng yu cu truyn dn tin cy cho cc bn tin iu khin. Mi nt gi cc bn tin iu khin theo chu k v c th duy tr mt t l mt gi hp l. Hin tng mt gi ny xy ra thng xuyn trong mng v tuyn do xung t hoc cc vn v truyn dn. OLSR khng yu cu chuyn tip tun t cc bn tin. Mi bn tin iu khin cha mt s th t v c t tng dn cho mi bn tin. V vy bn nhn s d dng xc nh c bn tin no mi hn thm ch i vi cc bn tin c sp xp li trong qu trnh truyn dn. Hn th OLSR cn c cc h tr h xung nh hot ng trong ch ng v nh tuyn a phng (multicast). Cc h tr xung ny hon ton tng thch vi cc phin bn khc nhau ca giao thc. OLSR khng yu cu bt k thay i no v khun dng ca gi tin IP v th n hon ton ph hp vi chng giao thc IP hin ti. 3.1 Chuyn tip a im.

tng ca nhng chuyn tip a im s ti thiu ha th tc b sung ca vic bao ph nhng thng tin trong mng bng vic gim s truyn li khng cn thit trong cng min. Mi mt nt mng la chn mt tp hp nhng nt trong 1-hop lng ging i xng, ci c th truyn li thng tin ca n. B nhng nt lng ging c chn c gi l b MPR ca nt . Nhng nt lng ging ca nt N khng c trong b MPR nhn v x l nhng thng tin pht sng nhng khng truyn li nhng thng tin c nhn t nt N. Mi nt la chn b MPR ca n t trong s nhng 1-hop lng ging i xng ca n. B ny c la chn nh n bao gm (k hn ca trm pht sng ) tt c cc nt 2-hop i xng . B MPR ca nt N c k hiu nh MPR{N},sau mt tp hp ty ca 1-hop ln cn i xng ca N tha mn iu kin tip theo: mi nt trong 2-hop ln cn i xng ca N phi c mt lin kt i xng hng v MPR{N}. Mt b MPR nh hn, kt qu thng tin b sung t lu lng iu kin t giao thc nh tuyn.mt v d v phn tch thut ton la chn MPR.Mi mt nt duy tr thng tin v tp hp nhng nt lng ging la chn n nh MPR. B ny c gi l chuyn tip a im ca mt nt. Mt nt cha nhng thng tin ny t nhng thng tin HELLO nh k nhn c t cc nt lng ging. Thng tin pht sng c mc ch truyn vo ton b mng, n n t bt k b chn MPR ca nt N c truyn li bi nt N nu N vn cha nhn c. B ci t c th thay i theo thi gian ( v d nh khi mt nt la chn mt b ci t MPR khc) v c ch ra bi nhng nt c la chn trong bn tin HELLO ca chng. OLSR c pht trin cho mng AD-HOC. N hot ng nh mt bng iu khin, loi giao thc proactive l trao i thng tin poto vi cc nt khc ca mng theo quy tc. Mi mt nt s la chn nhng nt lng ging ca n nh chuyn tip a im ( MPR ). Trong OLSR ch nhng nt c chn nh MPR s chu trch nhim cho vic tng cng kim sot lu thng, dng cho vic khuych tn vo ton b mng. MPR cung cp mt ch ch hiu qu cho vic kim sot lu thng bng vic gim s lng cn truyn. Nhng nt c chn nh MPR cng c trch nhim c bit khi khai bo thng tin trng thi lin kt trong mng. Nh vy, ch mt yu cu cho OLSR cung cp nhng ng truyn nhn nht ti tt c cc im ch l nhng nt MPR do khai bo thng tin trng thi lin kt cho b chn MPR ca chng. Thm vo thng tin trng thi lin kt c sn c th c dng cho trng thi d tha. Nhng nt c chn nh MPR bi vi nt lng ging s thng bo thng tin ny theo chu k trong thng tin iu khin ca chng. V vy mt nt thng bo n mng th l n c th n vi nhng nt la chn n nh mt MPR. Theo s hoch nh ng truyn, nhng MPR c s dng to ln ng truyn t mt nt nh ti bt k im ch no trong mng. Hn na, giao thc s dng MPR lm tng hiu qu ca thng tin iu khin trong mng.

Mt nt c la chn nhng MPR t mt trong s cc nt lng ging ca n vi "symetric" nh hai chiu, s lin kt. Do , vic la chn ng truyn thng qua MPR t ng trnh nhng vn kt hp vi gi d liu dch chuyn qua s lin kt mt chiu ( nh vn ca vic khng tha nhn lp lin kt cho nhng g d liu ti mi hop, vi nhng tng lin kt p dng cng ngh ny cho lu lng unicast. OLSR c pht trin lm vic c lp t nhng giao thc khc. Cng nh vy, OLSR khng to ra nhng gi thit v tng lin kt c bn. OLSR tha hng khi nim ca vic vn chuyn v vic chuyn tip t HIPERLAN ( mt giao thc tng MAC ) c tiu chun ha bi ETSI [3]. Giao thc c pht trin trong d n IPANEMA ( mt phn ca chng trnh Euclid ) v trong d n PRIMA (mt phn ca chng trnh RNRT ). 3.1 Nguyn tc trao i thng ip.

Trong cc giao thc nh tuyn trng thi ng lin kt, cc nt truyn danh sch qung b ng nh tuyn cho cc nt ln cn trc tip vi n. Cc bn tin qung b ny c gi l qung b trng thi lin kt (LSA), n c broadcast trn ton mng. Khi cc mng Ad-Hoc b gii hn bi bng thng ng truyn.OLSR kt hp mt khi nim gi trn lt cc bn tin nh tuyn qua mng da trn nguyn tc chuyn tip a im (MPRs). Mc ch ca MPR l ti u ha trong vic gi trn lt cc bn tin cp nht trng thi. Mi nt s nhn cc bn tin trn lt t tt c cc hng (t bt c nt no nm trong gii truyn dn). Hnh 2.6 m t mt nt A khi to v gi trn lt cc gi tin qua mng.

Hnh 2.3: Cc gi tin nh tuyn trn lt trong mng C ch gi trn lt khng my hiu qu do cc nt khc nhau c th nhn cng mt bn tin cc thi gian khc nhau. Trong OLSR, mt c ch nhiu hiu qu hn

c s dng cho qu trnh truyn dn thng tin nh tuyn l mi nt ch c nhim v truyn thng tin trng thi lin kt LSA ca n cho mt s cc nt ln cn i xng mt bc (one-hop) ca n. Cc nt c bit ny c chn sao cho cc bn tin qung b trng thi ng lin kt LSA s ti c tt c cc nt ln cn hai bc (two-hop) ca n. Cc nt ny c chn chuyn tip cc bn tin qung b trng thi ng lin kt c gi l MPRs. Hnh 2.7 m t qu trnh mt nt A truyn mt bn tin cp nht nh tuyn, n s broadcast bn tin ny. Tt c cc nt trong gii truyn pht u nhn v x l bn tin ny nhng ch c cc nt l MPRs ca A mi tip tc gi bn tin ny. Vi c ch ny OLSR c th gim c bng thng tiu tn cho vic qung b trng thi ng lin kt. Trong OLSR, mi nt truyn cc bn tin Hello theo chu k trn cc giao din ca nt vi mc ch duy tr lin kt vi cc nt ln cn trc tip (one-hop) ca n. Cc bn tin Helloch broadcast ti cc nt ln cn mt bc (onehop)vi ni dung cha tn ca nt khi to, ca cc nt ln cn mt bc c chn t trc. Cc nt khi to c th chn cc MPRs cho n. Mt nt lng nghe bn tin hello v kim tra xem bn tin no c pht ra t mt nt ln cn mi hay khng, nu c nt s cp nht vo danh sch nt ln cn mt bc ca n. ng thi s kim tra xem n c c nt ln cn chn lm MPR hay khng. Nu c chn n tip tc gi trn lt thng tin cp nht nh tuyn v ch cc nt ln cn l MRP ca n mi tip tc chuyn tip thng tin cp nht nh tuyn ny. Cc nt u c th tm ra c cc nt ln cn hai bc (two-hop) ca n thng qua danh sch cc nt ln cn mt bc trong cc bn tin Hello m n nhn c t cc nt ln cn mt bc (one-hop). Mi nt chn cc MRPs da trn khu vc ln cn nt ln cn hai bc do ng ti cc nt ln cn hai bc c th i qua cc MPR.

Hnh 2.4: Trao i thng tin trong OLSR Cp nht trng thi ng lin kt c truyn qua mng thng qua mt bn tin c gi l bn tin iu khin topo mng (TC-topology control message). Cc bn tin TC c trn lt qua mng v tt c cc nt u c th tnh ton li bng nh tuyn ca n thng qua thng tin cha trong bn tin ny. Qu trnh trn lt c thc hin bi cc MRPs c m t nh trong hnh 2.7. OLSR khng yu cu mt nt phi

qung b cho tt c cc nt ln cn ca n m ch cho cc nt c chn lm MPR ca n. OLSR cng bao gm hai loi bn tin: Cc bn tin lin kt host v mng c cc tuyn b a giao din (MID-multiple interface declaration) ch c dng bi cc nt c nhiu giao din s dng OLSR, do cc nt khc c th lin kt vi cc giao din khc nhau trn cng mt nt. 3.1 Kh nng p dng.

OLSR l mt giao thc nh tuyn tin phong cho mng AD-HOC. N kh ph hp vi nhng mng di ng ln v dy c cng nh s ti u ha hon thnh vic dng MPR lm vic n trong hnh thc ny. Vi mng ln v dy c hn h s ti u ha hn c th c hon thnh cng nh so snh c vi thut ton trng thi lin kt in hnh. OLSR dng nh tuyn hop-by-hop, v d nh mi nt s dng thng tin ca n ti cc gi nh tuyn.OLSR kh ph hp vi mng m lu lng l ngu nhin v bt inh gia mt tp hp nhng nt ln hn v gn nh tr thnh duy nht gia mt tp hp nhng nt c bit. Cng nh mt giao thc tin phong, OLSR cng ph hp cho nhng kch bn ni nhng cp truyn thng thay i qua thi gian: thm vo , lu lng khng iu khin c to thnh trong hon cnh ny t khi nhng nh tuyn c sa cha cho tt c nhng im ich ti cng mt thi im.

Chng 4: K thut nh tuyn theo nhu cu AODV


4.1 Tm ng. Qu trnh tm ng c khi to bt c khi no mt nt cn truyn thng tin vi nt khc m ng lin kt gia chng khng c tm thy trong bng nh tuyn. Mi nt duy tr hai b m ring bit: mt s th t nt v mt ID qung b. Nt ngun bt u tm ng bng vic qung b mt gi tin yu cu ng RREQ (Route REQuest) ti cc nt ln cn ca n. Gi tin RREQ cha mt s trng sau: <source_addr source sequence# Broadcast ID dest_addr dest_sequence# hopcount> <a ch ngun, th t ngun#, ID qung b, a ch ch, th t ch#, hopcount> Cp <source_addr, broadcast_id> xc nh n nht mt RREQ,broadcast_id c tng ln mi khi ngun pht ra mt gi tin RREQ mi. Mi nt ln cn s gi li mt bn tin tr li RREP (Route REPly) nu tha mn yu cu ca gi RREQ hoc s qung b gi tin RREQ sau khi tng gi tr ca

trng hop_count. Mt nt c th nhn nhiu bn sao ca cng mt gi tin RREQ t cc nt khc nhau. Khi mt nt trung gian nhn nhn c mt RREQ, nu n nhn c mt RREQ vi cng broadcast_id v a ch ch, n s loi b gi tin RREQ n sau. Nu mt nt khng tha mn RREQ, n gi li cc thng tin cn thit thit lp ng chuyn tip o chiu cho gi tin RREP, cc thng tin ny bao gm: a ch IP ch a ch IP ngun ng b i gian sng cho ng o chiu th t ca nt ngun

4.2 Thit lp ng o chiu. C hai s th t (ngoi tr s th t ca broadcast_id) trong mt RREQ l: S th t ngun v s th t ch mi nht. S th t ngun c s dng duy tr thng tin v mi ca tuyn ng o chiu n ngun, s th t ch ch r tuyn ng ti ch phi mi nh th no mi c nt ngun chp nhn. RREQ i t mt ngun n nhiu ch khc nhau, cc ng o chiu v nt ngun s c thit lp t ng ti tt c cc nt m n i qua. thit lp ng o chiu, mt nt ghi li a ch ca nt ln cn t bn sao RREQ u tin m n nhn c. Tuyn ng o chiu ny c duy tr trong khong thi gian t nht cho gi tin RREQ i qua mng v to c mt phn hi v cho bn gi. 4.1 Thit lp ng chuyn tip Khi mt nt trung gian nhn c bn tin RREQ, nu n c cha tuyn ng n ch mong mun trong bng nh tuyn, n s kim tra tnh kh dng ca tuyn ng bng cch so snh s th t ch tng ng vi tuyn ng c trong bng nh tuyn ca n vi s th t ch trong gi tin RREQ m n nhn c. Nu s th t ch ca RREQ ln hn s th t ch c lu gi bi nt trung gian th nt khng c s dng thng tin v tuyn ng n ch trong bng nh tuyn tr li cho gi tin RREQ. Thay vo n s phi tip tc qung b gi tin RREQ. Nt trung gian ch c th phn hi khi n c mt tuyn ng n ch vi s th t ch tng ng ln hn hoc bng s th t ch cha trong RREQ. Khi nt trung gian c mt tuyn n ch kh dng v gi tin RREQ cha c x l trc , th n s tr

li bng mt gi tin RREP theo ng truyn n hng ngc li nt m n nhn RREQ trc . Mt RREP cha cc thng tin sau: <source_addr, dest_addr, dest_sequence#, hop_cnt, lifetime> <a ch ngun, a ch ch, s th t ch, hop count, thi gian sng> Khi RREQ c qung b n mt nt c th cung cp tuyn ng n ch mong mun, mt ng o chiu ti nt ngun ca RREQ s c thit lp. Mi nt dc theo tuyn o chiu m RREP quay li ngun s ng vai tr l mt nt chuyn tip, cc nt ny s cp nht li ton b thng tin v tuyn ng gia ngun v ch ng thi ghi li s th t ch gn nht ca nt ch. Tuyn ng m RREP quay li ngun c gi l ng chuyn tip. Cc nt khng nm trn tuyn chuyn tip s xa cc tuyn ngc chiu m chng thit lp trc khi khong thi gian ACTIVE_ROUTE_TIMEOUT kt thc (3000 mili giy). Mt nt s truyn gi tin RREP u tin v ngun ngay khi n nhn c. Nu n nhn nhiu gi tin RREP, cp nht thng tin nh tuyn v truyn bn tin RREP ch c thc hin khi RREP cha s th t ch ln hn so vi gi tr s th t ch trong RREP trc hoc bng nhng tuyn ng mi c s hop-count nh hn. Vic tng s lng RREP gi v ngun m bo thng tin c cp nht nhanh v nhiu nht. Nt ngun c th thc hin truyn d liu sm nht c th khi n hon thnh qu trnh cp nht thng tin t RREP u tin m n nhn c v c th tip tc cp nht thng tin nh tuyn nu n hc c mt tuyn ng tt hn. 4.2 Qun l bng nh tuyn Ngoi cc s th t ngun v ch, c thng tin hu dng khc cng c lu trong cc mc ca bng nh tuyn gi l trng thi mm v c lin kt vi cc mc. Lin kt vi cc mc nh tuyn ng o chiu l mt b m thi gian c gi l b m thi gian gii hn yu cu ng. Vi cc nt khng nm trn tuyn ng t ngun n ch, thng tin v cc ng o chiu s c xa khi thi gian gii hn kt thc. Thi gian gii hn ny ph thuc vo ln ca mng. Mt tham s quan trng khc lin quan n cc mc nh tuyn l gii hn thi gian lu tr cho cc tuyn ng, sau khong thi gian ny tuyn ng c xem nh khng hp l. Trong mi mc ca bng ch tuyn, a ch hot ng ca cc ln cn thng qua cc gi tin nh tuyn cng c duy tr. Mt nt ln cn c xem l lin kt vi ngun nu n khi to hoc chuyn tip t nht mt gi tin cho ngun trong ACTIVE_ROUTE_TIMEOUT gn nht. Thng tin nh tuyn ny c duy tr tt c cc nt ngun hot ng c th c thng bo khi mt lin kt dc theo ng ti ch b ph v. Mt mc tuyn ng c xem l hiu dng nu n c s dng bi

bt k nt ln cn no. Ging vi DSDV, tt c cc tuyn trong bng nh tuyn c xc nh vi cc s th t ch m bo khng xy ra hin tng lp vng trong qu trnh nh tuyn. Mt nt c th duy tr mc bng nh tuyn cho mi ngun quan tm. Mi mc bng nh tuyn cha cc thng tin sau:

hop (gi hay chi ph ca tuyn ng) n hiu dng cho tuyn ng i gian gii hn cho bng mc tuyn ng Trong khong thi gian hiu dng, tuyn ng s c s dng cho truyn d liu t ngun n ch, thi im ht hn s c cp nht li bng cch cng thi im thc hin truyn dn vi khong thi gian gii hn. Nu mt tuyn mi c yu cu cho mt nt, n s so snh s th t ch ca tuyn ng mi vi s th t ch ca tuyn ng hin ti. Tuyn ng vi s th t ch ln hn s c chn. Nu cc s th t l nh nhau, tuyn mi ch c chn khi n c chi ph nh hn (s hop-cont nh hn) n ch. 4.3 Duy tr tuyn Di chuyn ca cc nt khng nm trn tuyn ng ngun - ch th khng nh hng n hot ng lin kt gia hai nt ny. Nu nt ngun di chuyn, n c th khi to li th tc tm ng thit lp mt tuyn ng mi ti ch. Khi ch hoc mt s nt trung gian di chuyn, mt gi tin RREP c bit s c gi t cc nt chu nh hng. Cc bn tin Hello (hello periodic) theo chu k c th c s dng m bo cc lin kt i xng,cng nh hng li lin kt. Theo cch khc, li c th c pht hin bng s dng cc bo nhn lp lin kt LLACK (Link-Layer ACKnowleddgments). Mt tuyn li cng c ch ra nu n lc chuyn tip mt gi tin n nt k tip tht bi. Khi mt nt khng th vn ti nt k tip, n s truyn ngc li mt gi tin RREP khng lin kt vi s th t mi ln hn s th t c bit trc v hop-count ca ca tt c cc nt ln cn hot ng ngc chiu. Cc nt ny tip tc chuyn tip gi tin cho n khi no tt c cc nt ngun hot ng c thng bo. N

s kt thc do AODV ch duy tr cc tuyn ng khng lp v ch c mt s lng nt hu hn trong mng. Khi nhn cc thng bo v mt lin kt b ph v nt ngun c th khi ng li qu trnh tm ng nu n vn yu cu mt tuyn ng n ch. xc nh mt tuyn ng nh vy trc tin n kim tra xem c tuyn ng no c s dng gn y hay khng, cng nh kim tra cc khi iu khin giao thc lp trn bit c c kt ni no ang hot ng vi ch hay khng. Khi mt nt quyt nh cn xy dng li tuyn ng n ch, n s gi mt gi tin RREQ vi mt s th t ch ln hn s th t ch c bit trc m bo tuyn ng ang xy dng l hon ton mi, v s khng c nt no tr li nu chng vn xem tuyn ng trc l hp l. 4.4 X l li, ht hn v xa b tuyn Thng thng, vic x l RERR v lin kt gy cn n cc bc sau y: t hiu lc cc tuyn hin ti. t k cc ch b nh hng. nh r nu c bt k nt ln cn no c th b nh hng. c hin mt RERR ti cc nt ln cn Mt bn tin RERR c th l broadcast, unicast hay multicast. Ngay c khi bn tin RERR l mt unicast lp li ti mt s chng trc, n c xem l mt bn tin iu khin n. Vi cch hiu , mt nt khng nn khi to nhiu hn mt lng RERR_RATELIMIT bn tin RERR trn mt giy. Mt nt bt u x l cho mt RERR trong ba hon cnh sau: 1/ Nu n pht hin mt lin kt gy cho chng ti ca mt tuyn hot ng trong bng nh tuyn ca n trong khi truyn d liu. 2/ Nu c c mt gi d liu i n mt nt m n khng c mt tuyn hot ng v khng c sa cha. 3/ Nu n nhn mt RERR t mt nt ln cn cho mt hoc nhiu tuyn hot ng i vi trng hp (1), u tin nt to mt danh sch cc nt khng ti c cha cc nt ln cn khng ti c v b sung bt k ch no trong bng nh tuyn ni vng ci m s dng cc nt ln cn khng th ti c nh cc chng tip theo. Trong trng hp ny, nu mt tuyn mng con c tm thy l khng th ti c,

mt a ch IP ch cho mng con ny c thit lp bng vic chn cc s 0 vo tin t mng con nh c ch ra trong mc bng nh tuyn. i vi trng hp (2), ch c mt ch khng th ti c, ci m l ch ca gi d liu m khng th c phn pht. Trong trng hp (3), danh sch nn bao gm cc ch ny trong RERR. Mt vi ch khng ti c trong danh sch c th c s dng bi cc nt nt ln cn, v v th n c th cn thit cho vic gi mt RERR. RERR nn cha cc ch l mt phn danh sch c to ra ca cc ch khng n c v c mt danh sch cch chng trc khng trng rng. Cc nt lng ging m c th nhn RERR l tt c cc nt thuc v mt danh sch chng trc ca t nht mt ch khng th ti c trong RERR mi c to. Trong trng hp c duy nht mt nt ln cn m cn nhn RERR, RERR nn c truyn unicast theo hng nt ln cn . Nu khng RERR c gi qung b cc a ch ni vng ( IP ch l 255.255.255.255 v TTL =1) vi cc ch khng th n c, v ch s th t ch tng ng ca cc ch , c cha trong gi tin. Trng DestCount ca gi RER xc nh s lng cc ch khng ti c bao gm tron gi tin.Ngay trc khi truyn RERR, nhng cp nht chc chn c to trn bng nh tuyn m c th nh hng ti ch s th t cho cc ch khng th n c. i vi mi mt ch ny, cc mc bng nh tuyn tng ng c cp nht nh sau: s th t ch ca mc nh tuyn ny, nu hin ti n l hp l,c tng trong cc trng hp (i) v (ii) trn, v c sao chp t RERR n trong trng hp (3) trn. c c cho l khng hp l bi s nh du ca mc tuyn khi khng hp l. ng Lifetime c cp nht bng thi gian hin ti cng vi thi gian DELETE_PERIOD. Trc thi gian ny, mc khng nn c xa. Trng Lifetime trong bng nh tuyn ng hai vai tr: i vi mt tuyn hot ng n l thi gian ht hn, v i vi mt tuyn khng hp l n l thi gian xa. Nu mt gi d liu c nhn mt tuyn khng hp l, trng Lifetime c cp nht bng thi gian hin ti cng vi thi gian DELETE_PERIOD. 4.5 Qun l kt ni ni vng

Cc nt c th hc thng tin t nt ln cn ca chng bng mt hoc nhiu cch khc nhau. Bt c khi no mt nt nhn c qung b t mt nt ln cn, n cp nht thng tin kt ni ni b m bo ang lin kt vi nt ln cn ny. Khi mt nt cha gi gi tin no cho cc nt ln cn trong khong thi gian Hello, n qung b ti cc nt ln cn mt bn tin Hello, mt bn tin RREP c bit cha nhn dng v s th t ca n. S th t ca nt khng c thay i khi truyn dn bn tin Hello. Bn tin Hello ny khng c qung b ra ngoi vng ln cn do gi tr thi gian sng Time-To-Live (TTL) l 1. Cc nt ln cn nhn gi tin ny s cp nht thng tin kt ni ni b cha trong gi tin. Nhn mt qung b hoc mt bn tin Hello t mt nt ln cn mi hoc mt lin tc cc gi tin Hello t mt nt ln cn trc trong vng ln cn c ngm hiu l kt ni ni b b thay i. Nu cc bn tin Hello khng c nhn t nt k tip dc theo tuyn ng hiu dng, cc nt ln cn hot ng s da vo nt k tip gi thng bo li kt ni. S ln mt Hello cho php l tng l hai. Qun l kt ni ni b vi cc bn tin Hello c th c s dng m bo ch cc nt c kt ni song hng mi c xem l ln cn ca nhau. Vi mc ch ny, mi Hello c gi bi mt nt lit k danh sch cc nt m n nghe c. Mi nt kim tra m bo n ch s dng cc tuyn ng n cc nt ln cn m n nghe c qua bn tin Hello. 4.6 Sa cha ni vng Khi t lin kt xy ra cc nt trong mng s c gng sa cha ni b lin kt nu ng ti ch khng di hn s bc nhy c ch r. sa lin kt cc nt tng s th t ch v qung b bn tin RREQ ti cc nt khc. TTL cho tiu IP phi c tnh sao cho qu trnh sa ni vng khng tri rng ra mng. Trng TTL ca RREQ nn c thit lp ban u bng gi tr nh sau: TTL = max (MIN_REPAIR_TTL, 0.5 x #hops) + LOCAL_ADD_TTL. Vi #hops l s lng cc chng ti nt khi u ca gi tin khng phn pht c hin ti. Nh vy, sa cha ni vng c gng s thng xuyn n ti nt khi u v s lun c TTL >= MIN_REPAIR_TTL + LOCAL_ADD_TTL. Nt khi u sa cha sau i trong khong thi gian khm ph nhn cc RREP hi p ti RREQ. Trong sut thi gian sa cha ni vng, cc gi d liuk nn c nh m. Nu, ti thi im cui cng ca mt thi gian khm ph, nt sa cha khng nhn c mt RREP cho ch , n s gi mt bn tin RERR i vi ch . Mt khc, nu nt nhn mt hay nhiu RREP trong sut thi gian khm ph, u tin n s so snh gi tr hop count ca tuyn mi vi gi tr trong trng hop

count ca mc bng nh tuyn khng hp l cho ch . Nu gi tr hop-count ca tuyn c xc nh mi nht ti ch ln hn hop count ca tuyn c bit trc , nt nn pht ra mt bn tin RERR cho ch vi bit N c thit lp. Sau n cp nhn mc bng nh tuyn cho ch . Mt nt nhn bn tin RERR vi c N c thit lp khng c xa b tuyn ti ch . Ch nn thc hin hnh ng truyn li gi tin, nu RERR c nhn t chng tip theo dc tuyn , v nu c mt hoc nhiu cc nt chng trc cho tuyn ti ch. Khi nt khi u nhn mt RERR vi c N c thit lp, nu bn tin ny n t chng tip theo ca n c thm tuyn ca n ti ch th nt khi u nn chn khi u li khm ph tuyn. Sa cha ni cng ca cc lin kt gy trong cc tuyn i khi cho kt qu l tng di tuyn ti cc ch . S sa cha lin kt ni vng c kh nng tng s lng cc gi d liu m c th c phn pht ti cc ch, v cc gi s khng b hy b khi RERR di chuyn ti nt khi u. Vic gi mt RERR ti nt khi u sau khi sa cha ni vng lin kt gy c th cho php nt khi u tm c mt tuyn mi ti ch m tt hn da trn v tr nt hin ti. Tuy nhin, n khng yu cu nt khi u xy dng li tuyn. Khi mt lin kt gy dc mt tuyn hot ng, thng xuyn c nhiu ch m tr nn khng ti c. Nt m l lung ln ca lin kt b mt lp tc th mt sa cha ni vng cho ch mt ch theo hng m gi d liu c di chuyn. Cc tuyn khc s dng cng lin kt phi c nh du l khng hp l, nhng nt iu khin sa cha ni vng phi bo hiu mi tuyn mt mi nht khi sa cha ni vng; c sa cha ni vng ny trong bng nh tuyn phi c t li khi tuyn ht hn. Trc khi thi gian ht hn xy ra, cc tuyn khc ny s c sa cha khi cn thit khi cc gi n cc ch khc. Do ,cc tuyn ny c sa cha khi cn; nu mt gi d liu khng n tuyn no,th tuyn s khng c sa cha. Ngoi ra, ty thuc vo s tc nghn ni vng, nt c th bt u x l thit lp cc sa cha ni vng cho cc tuyn khc, m khng i gi tin mi n. Bng vic sa cha tin phong cc tuyn m gy do mt lin kt, cc gi d liu n cho cc tuyn s phi chu s tr hon sa cha tuyn v c th ngay lp tc c chuyn tip. Tuy nhin vic sa cha tuyn ng trc khi mt gi d liu c nhn c th gp phi ri ro v vic cc ng sa cha khng cn tn ti na. V vy ty thuc vo lu lng ni vng trong mng v s tc nghn ang c tri qua, nt c th quyt nh sa cha tin phong cc tuyn hay khng trc khi mt gi d liu c nhn; nu khng, n c th i cho n khi mt gi d liu c nhn, v sau bt u sa cha tuyn.

Chng 5: u khuyt im 2 thut ton nh tuyn OLSR&AODV


5.1 u im 5.1.1 OLSR: OLSR l mt giao thc nh tuyn kiu dn tri,n khng cn h thng qun l trung tm x l qu trnh nh tuyn ca n. c tnh theo bng ca giao thc cho ta bit rng giao thc c tt c thng tin nh tuyn ti tt c cc host c bit trong mng. Thng tin cu hnh c chuyn i ti ton mng nh MPRs,v vy qu trnh trn lt bn tin c gim i rt nhiu. Cc phn ng ti nhng thay i cu hnh c th c iu chnh bng cch thay i khong thi gian qung b thng ip HELLO. N tng cc giao thc mt cch ph hp cho mng ad-hoc vi s thay i nhanh gia ngun v cc im ch. OLSR khng yu cu ng lin kt ng tin cy cho thng ip iu khin,t cc thng ip c gi mt cch nh k v vic chuyn bn tin khng phi lin tip na. OLSR ph hp vi ng dng m khng cho php c s chm tr ko di trong vic truyn gi d liu. OLSR c s m rng cho php cc hosts c cc giao din nhiu a ch nhm cung cp thng tin nh tuyn ti cc a ch bn ngoi. Nh vy cc hosts trong mng ad-hoc c th lm vic nh gateway ti cc mng khc. 5.1.1 AODV: AODV khng cn bt k h thng qun l trung tm no x l qu trnh nh tuyn. n c khuynh hng lm gim thi gian truyn thng ip iu khin lu lng tm kim s nh tuyn mi. Thm vo , AODV c gng gi thi gian chuyn tip ca bn tin nh i. Nu cc host c thng tin nh tuyn v nhng tuyn ng ang hot ng trong bng nh tuyn trong mng th khi khong thi gian chuyn tip ca qu trnh nh tuyn s nh li. AODV c phn ng nhanh ti s thay i cu hnh mng v ch cp nht cc node b tc ng bi nhng thay i ny. Thng ip HELLO c trch nhim cho vic gi gn nh tuyn,v vy n c gii hn chng khng to khong thi gian truyn khng cn thit trong mng .

Nu node phi chn la gia 2 ng nh tuyn th n s chn s chui ch ln hn. 5.2 Khuyt im 5.2.1 OLSR:

-Cn nhiu thi gian hn khm ph li ng lin kt b gy.


-Khi c s khm ph nh tuyn thay th th n cn cng sut qu trnh x l nhiu hn. 5.2.2 AODV: -AODV tiu tn nhiu bng thng hn -Mt nhiu thi gian xy dng li bng nh tuyn. -C nhu cu x l qu trnh nh tuyn cao hn.

Chng 6: So snh gia AODV&OLSR


6.1 Performance and Scalability OLSR lm suy gim khong thi gian iu khin bn tin m phi bt buc dng MPR truyn i thng tin cp nht trng thi lin kt. S la chn MPR vi s lng t to ra hiu sut truyn tin tt hn so vi giao thc trng thi lin kt c in. Nhng vn y l phi duy tr bng nh tuyn cho tt c cc loi nh tuyn hot ng. V vy khng c s khc nhau trong cc mng c din tch nh,nhng khi s host di ng tng ln th khi khong thi gian truyn bn tin iu khin cng tng theo. iu ny hn ch kh nng m rng ca giao thc OLSR. Giao thc OLSR hot ng hiu qu nht trong cc mng dy c. Trong khi vn thi gian truyn trong giao thc nh tuyn theo nhu cu nh AODV th lin quan ch yu ti vic khm ph ca nh tuyn mi v t s cp nht cc ng truyn hu dng. V th,mng vi dung lng t v tnh di ng thp, the reactive protocols scales perfectly to the larger networks with low bandwidth and storage overhead . Trong mi trng vi lu lng dy c v s lng host ch ln s to ra nhiu s nh tuyn ln v n s ph v ng truyn lp li v cc bn tin bo li trong mng. OLSR a ra hiu qu nh tuyn cao hn nh tuyn theo nhu cu trong mng vi lu lng phn tn. Bi v qu trnh cp nht xut pht t s cp nht mt cch

nh k v khng c khong thi gian truyn tin c thm vo xy ra cho vic tm kim nh tuyn mi,nhng khi giao thc nh tuyn theo bng s dng nhiu bng thng v ti nguyn hn nh tuyn theo nhu cu. V vy loi giao thc ny khng c dng trong cc gii php ngun ti nguyn mang tnh quan trng. Giao thc AODV cn khm ph ng truyn trc truyn d liu i,v vy s to ra tr trong mng vi giao thc AODV. Cn OLSR khng cn khm ph nh tuyn trc khi truyn d liu i,v vy n cung cp d liu vi tr truyn ti thp. Cc tc nhn trong vic pht hin s thay i cu hnh trong OLSR c th c ci thin bng cch rt ngn khong thi gian truyn tin ca thng ip iu khin nh k. Vn ca OLSR l n s dng bng thng mt cch lin tc nhng AODV c gng gi mc thp trong vic duy tr bng nh tuyn. Mt iu thun li ln trong giao thc OLSR na l n bit trng thi lin kt ngay lp tc v c kh nng m rng cht lng thng tin dch v vi nhiu giao thc cc host bit s thun li cht lng ca nh tuyn,tnh nng ny khng th c trong AODV. 6.2 Resource Usage Bng nh tuyn ca OLSR lin quan ti bao nhiu host trong mng,nhng lu tr phc tp ca AODV th lin quan ti s lng cc i truyn tin. Bi vy OLSR phi c tt c cc tuyn ng c th hnh thnh trong bng nh tuyn, trong khi cc tuyn ng mang tnh hiu dng th cn thit hn. Thm vo OLSR phi gi thng tin cu hnh trong b topology,thng tin MPR trong b MPR v cng cp nht trng thi thng tin v cc ng link v cc node ln cn. OLSR khng cn duy tr thng tin cc host. Vic duy tr cc ng truyn mt cch nh k tiu tn rt nhiu ngun ti nguyn. Vn ny c thc hin trong AODV bi bn tin HELLO v trong OLSR vi bn tin TC. AODV c gng thu nh li lu lng bng cch to ra nhng host m truyn i lu lng trong mng mt cch nh k gi i thng ip HELLO,cn OLSR th dng cc MPR qung b cc thng ip ny ti ton mng. OLSR s dng nhiu ngun ti nguyn hn AODV trong nhiu trng hp nhng ni mi trng ph hp vi cc giao thc. 6.3 Security Considerations im chnh trong giao thc AODV v OLSR l thng ip iu khin phi c bo v trnh cc bn tin c hi c th gy nh hng ti bn tin iu khin. C 2 giao thc phi s dng nhn thc IPsec cho vic nhn thc cc host. AODV cn

t s bo v thng ip iu khin,n bo v bn tin RREP & RRER trong OLSR th cn phi bo v tt c thng ip iu khin.

nhng

Chng 7: Cc ng dng trong mng Ad-hoc


7.1 ng dng trong qun i Nhng thnh tu mi ca cng ngh thng tin thng c p dng trong qun s u tin, v mng khng dy kiu khng cu trc cng khng phi l mt ngoi l. Nhiu nm nay, qun i s dng cc mng packet radios mt nguyn mu u tin ca mng chuyn mch gi khng dy ngy nay. Gii php mng Ad-Hoc cho qun i c nhng c im khc so vi mng Ad-Hoc thun ty. Mng Ad-Hoc thun ty thng tun theo mt m hnh im ngu nhin, cc nt t do di chuyn theo bt c hng no, vi bt c tc no. Trong m hnh mng Ad-Hoc cho qun i, cc nt phn nhm theo bn cht t nhin ca chng khi chng cng thc hin mt nhim v c th. Xu hng di ng y l theo nhm (group mobility). Do , nu a ra c mt m hnh chuyn ng theo nhm, cc vn ca mng Ad-Hoc s tr nn c th hn (v d: nh tuyn, s dng cc ng dng thi gian thc nh ting ni, video,), cho php pht trin mt gii php ti u. 7.2 Cc ng dng trong cuc sng Mng Ad-Hoc l rt l tng trong cc trng hp khng c sn mt c s h tng thng tin, tuy nhin li cn phi thnh lp mt mng tm thi nhm trao i thng tin v hp tc cng lm vic. Cu h Ti cc vng b thin tai, thm ha, kh c th c c mt c s h tng v thng tin vng chc. H thng c trc rt c th b hng hoc b ph hy hon ton. Ti vng c thm ha, tt c cc phng tin v h thng truyn thng u b ph hy hon ton. Mi chic xe ca cnh st, cu ha, cu thng, u c trang b nh mt thit b u cui di ng l mt phn ca mng ad-hoc.

Mi nhn vin cng mang theo mt thit b u cui di ng. Cc thit b u cui ny u lin kt vi nhau, hnh thnh nn mt mng tm thi nhm trao i thng tin. Cu hnh mng thay i theo nhng thi im khc nhau. Ngoi ra, cc thit b u cui di ng khng ch cung cp chc nng gi v nhn thng tin m cn c th chuyn tip thng tin ng vai tr nh router trn Internet . Hi tho Khc vi cch lm truyn thng khi nhng ngi tham gia hi tho mun chia s ti liu cho nhau l gi file nh km qua email hoc sao chp qua cc thit b lu tr th cp c kh nng di ng, tt c nhng ngi tham d hi tho u c th s dng thit b di ng to thnh mt mng ad-hoc trong sut thi gian . Cc thit b c th truyn thng vi nhau, truyn/nhn cc ti liu c s dng trong hi tho. Khi hi tho kt thc, cc thit b c tt ngun, mng t b hy b. i sng hng ngy Gi s mt em hc sinh s dng thit b cm tay di ng i hc hng ngy bng xe bus. Khi ln xe bus, thit b u cui ca em chuyn sang ch ad-hoc. Em gp bn v mun trao i file so snh kt qu bi tp ton v nh. Sau , hai em mun chi tr chi in t. c th chi vi nhng ngi chi khc, hai em phi kim tra xem trn xe but hoc trong cc t xung quanh c mt mng chi tr chi in t no hay cha. Em chy mt ng dng ngang hng v tm mt tr chi no c th chi trong lc i trn xe but. Rt may, mt ai trn xe but chia s cc tr chi v cho php ngi khc ti v t thit b u cui ca anh ta. Em chn mt tr chi. Tr chi c t ng ti v, ci t v cu hnh trn thit b u cui ca em. Em c th chi in t ngay sau . Bn em cng c th tham gia vo tr chi nu mun, ngay trn my ca em.

Mi trng mng y l mt mng khng dy kiu khng cu trc thun ty, tc l khng c c s h tng v cp, cc thit b u cui t cu hnh thnh lp mng, m khng c s qun l tp trung. Mng ny c th t chia nh thnh cc mng con: mt mng ring gia em hc sinh v bn ca em, mt mngchung

c khi to bi ngi mun chia s cc chng trnh tr chi in t trn my ca anh ta. Hai mng ny c trn ln vo nhau mt cch ng. 7.3 Vn an ninh Mng di ng khng dy ni chung u d b e da v an ninh hn mng c nh. Mt s cp bo mt thng c p dng gia cc mng khng dy gim bt cc mi e da. Khng c lin kt m ha ti cc tng mng,vn bc xc nht l mt trong cc route cc thc trc khi trao i iu khin thng tin mng. Mt s cp xc thc khc nhau, t khng c an ninh v chia s nhng phng php tip cn n gin v y . h tr cc phng thc lm vic nhm, mt s ch xc thc ty chn c chun ha s dng trong Ad-Hocs.

MC LC K THUT NH TUYN TRONG MNG AD-HOC. Li ni u. Chng 1:Tng quan v mng Ad-hoc. Chng 2:c im mt s loi giao thc nh tuyn trong mng Ad-hoc. 3 Mt s vn v k thut nh tuyn theo bng(Proactive routing). 4 Mt s vn v k thut nh tuyn theo nhu cu(Reactive routing). 5 K thut nh tuyn lai ghp(Hybrid routing). Chng 3:K thut nh tuyn theo bng OLSR. 3.2 3.3 3.4 3.5 Khi qut giao thc OLSR. Chuyn tip a im. Nguyn tc trao i thng ip. Kh nng p dng.

Chng 4: K thut nh tuyn theo nhu cu AODV. 4.7 4.8 4.9 4.10 4.11 4.12 4.13 4.14 4.15 Tm ng. Thit lp ng o chiu. Thit lp ng chuyn tip. Qun l bng nh tuyn. Duy tr tuyn. X l li, ht hn v xa b tuyn. Qun l kt ni ni vng. Sa cha ni vng. ng dng .

Chng 5: u khuyt im 2 thut ton nh tuyn OLSR&AODV. 5.1 u im. 5.1.1 OLSR. 5.1.2 AODV. 5.2 Khuyt im. 5.2.1 OLSR. 5.2.2 AODV.

Chng 6: So snh gia AODV&OLSR. Chng 7: Cc ng dng trong mng Ad-hoc. 7.1 ng dng trong qun i. 7.2 Cc ng dng trong cuc sng 7.3 Vn an ninh.

Das könnte Ihnen auch gefallen