Recommendations Based QoS Trust Aggregation and Routing in Mobile Adhoc Networks

Transcription

1 215 Recommendaions Based QoS Trus Aggregaion and Rouing in Mobile Adhoc Neworks Nageswararao Sirisala 1 and C.Shoba Bindu 2 1 CSE Dep, Vardhaman College of Engg, Hyderabad, India 2 CSE Dep, JNTUACE, Ananapur, India Absrac: In mobile adhoc newok (MANET), a node s qualiy of service (QoS) rus represens how much i is reliable in qualiy. QoS rus of a node is compued based on is muliple qualiy parameers and i is an ineresing and challenging area in MANETs. In his work, QoS rus is evaluaed by aking ino consideraion qualiy parameers like node residual energy, bandwidh and mobiliy. The proposed mehod Recommendaions Based QoS Trus Aggregaion and Rouing in Mobile Adhoc Neworks-QTAR is a frame work. Where he rus is esablished hrough four phases like QoS rus compuaion, aggregaion, propagaion and rouing. The Dempser Shafer Theory (DST) is used for aggregaion of rus recommendaions. In he nework, rus informaion is propagaed hrough HELLO packes. Each node sores he QoS rus informaion of oher nodes in he form of rus marices. We applied marix algebra operaions on rus marices for roue esablishmen from source o desinaion. The ime and space complexiy of proposed mehod is discussed heoreically. The simulaion is conduced for he varying of node velociy and nework size, where he proposed mehod shown considerable improvemen over exising proocols. Keywords: Qualiy of Service, Trus, Aggregaion, Mobile Adhoc Neworks. 1. Inroducion A group of wireless mobile nodes form a emporary nework called a mobile Adhoc nework (MANET), where a node can communicae wih oher nodes hose are in is access region. Due o MANETs can be deployed quickly and easily, i became as a suiable communicaion nework for he applicaions like bale fields, emergency and rescue operaions. Provisioning of QoS in mobile adhoc neworks is a complicaed ask when compared wih wired neworks, he reason is node mobiliy, lack of adminisraion and limied available resources. In QoS rouing proocol, he inermediae nodes should have he minimum required energy, bandwidh and sabiliy o ransfer he source daa efficienly o desinaion node. By considering hese consrains, a node's QoS rus is compued in his work. A node compues he direc QoS rus for is 1-hop neighbours by esimaing heir available resources like residual energy [5,28], bandwidh [20] and sabiliy [6,21], hrough he ineracions. If he resources are more han hreshold level, hen QoS rus is incremened, oherwise decremened. By aggregaing 1-hop neighbour s rus recommendaions, he indirec rus of 2-hop neighbours is compued. Here he Dempser Shafer Theory (DST)[8,24] is used for aggregaion of rus recommendaions. DST can reduce he impac of biased recommendaions in indirec rus compuaion. A node mainains rus informaion in he form of rus marix, where is size of he nework (number of nodes). Compued rus values should be propagaed hrough he nework, so ha oher nodes can avoid heir risk in recompuaion of rus for mulihop away nodes. The compued rus values ge propagaed hrough he HELLO packes in he nework. In rouing, he inermediae node's QoS rus values from source o desinaion are compued based on rus ransiive rule( If A russ B and B russ C ; hen A russ C ). Using his rule,we applied marix algebra operaions over rus marices for roue esablishmen. In his paper, we did proper lieraure survey of differen QoS rus parameers and heir compuaion mehods in MANETs perspecive. In our proposed rus sysem, we evaluaed node s rus value based on is Qualiy resources like bandwidh, energy and bandwidh. We applied dempser Shafer mehod in MANETs for combining rus recommendaions. In unicas rouing, we inroduced ieraive based rus marix operaions o compue rused roue from source o desinaion node. The furher secions in he paper are organised as follows. In secion2, he exising mehods of rus compuaion are presened. In secion 3, he dempser safer mehod of rus combinaion is discussed and rus marix operaions are described. In secion 4, he proposed mehod QTAR is presened as a combinaion of rus compuaion, aggregaion, propagaion and rouing. Performance of proposed mehod is analysed heoreically. In secion 5, simulaion resuls of QTAR are explained. In secion 6, he work is concluded. In his work, he erm Trus refers QoS Trus. 2. Relaed Work In his secion, we are discussing differen auhor s rus handling mehods ha are proposed in MANETs. Trus compuaion mehods: The rus value of a neighbour node is evaluaed based on packe forwarding raio in [13,22], The misbehaviour facor of a neighbour node is evaluaed for roue reques, roue reply, roue error and daa packe. Each facor is compued based on number of such packes ha are forwarded successfully and dropped. In [19], rus value is evaluaed as a combinaion of 3-parameers i.e (,,). Here, and refers belief, disbelief and uncerainy respecively. Every successful ineracion wih he neighbour node incremens i s belief (=+1) and unsuccessful ineracion incremens he disbelief (=+1), where ++=1. In [27], bea disribuion is used for rus compuaion based on number of packes, a node forwarded correcly among he oal number of packes i received. Here and parameers are reaed as good and bad experiences wih ha node. Some auhors in

2 216 [7,9,10,15], used fuzzy logic for measuring node rus value. The rus managemen in MANETs is explained in [11]. In he paper [1], a node rus value is esimaed using dynamic grey-markov chain model, which works based on nodes hisorical behaviour paerns. In [4], he compued node rus value is validaed by aking second hand informaion from rusable nodes usually called wachdogs. The second hand rus informaion, which is less han hreshold deviaion is used in final rus compuaion. In paper [2], a node s final rus value (FTV) is evaluaed based on direc rus value (DTV) and indirec rus value (IDTV). DTV is compued based on packe forwarding raion, daa consisency and ime frequency. IDTV is compued based on recommendaions of a node behaviour a paricular ime. In paper[3], rus is calculaed based on similariy and ime aging facors. Similariy facor beween wo nodes represens he relaionship/similariy of heir owning aribues. Aging facor represens he rus aenuaion rae in successive ime inervals. Trus Aggregaion mehods: The work in [16] aggregaed he gossips abou a arge node for deriving is rus value. Here, once he rusor node receives gossips/rumours from differen nodes, i applies he push-sum operaion as gossip average funcion. In [17], auhor used probabiliy based mehods for rus aggregaion. Here wo approaches are used i.e sequenial and parallel aggregaion mehods. In sequenial aggregaion, he nodes rus values are aggregaed from rus node o rusee node. In parallel mehod, rus values are gahered from differen pahs, hese rus values are aggregaed by assigning differen weighs o he pahs. Trus propagaion mehods: Social neighbourhood concep is used in[14] for rus propagaion. Here he rusor node propagaes rus value of rusee o 1-hop neighbour nodes, and hen o 2-hop neighbours. Trus value is geing deduced by d-facor (based on forwarding nodes rus value) in every hop-by-hop propagaion and his process coninues ill he propagaed rus value reaches he hreshold level. Graph heory based rus propagaion mehod is used in [25]. Here he rus is propagaed hrough ransiive graphs using small world concep. In [12], he rus informaion is exchanged in he form of rus ickes. A node sends he rus reques icke and he provider replies hrough compued rus icke. Boh will mee a some common node (rendezvous) and from here, he rus value passed o he requeser node. Trus rouing: TAODV [18], is a rus rouing proocol, which esablishes he rus worhy roue o desinaion. I is a exension of AODV proocol, which uses he modified conrol packes TREQ(Trus reques ) and TREP(Trus reply). Source node sends he TREQ owards he desinaion, TREQ packes gaher he rus informaion of inermediae nodes along he journey o desinaion. Once he desinaion receives he TREQ packes, i selecs he TREQ wih higher rus value and gives reply (TREP) o source node. Trused- DSR[23] is he rus exension of DSR rouing proocol. In which he source node s rus value ges incremened for every acknowledged packe and ges decremened for every reransmission of daa. In [26], DyTR(Dynamic Trus) is proposed in erms of access conrol over he nework. 3. Sysem Model In his secion, some echniques are discussed like Dempser Shafer Theory (DST) and marix algebra operaions o make proposed mehod much clear in he nex secion. 3.1 Dempser shafer heory (DST) DST works based on hree merics namely mass funcion (basic probabiliy funcion-m), belief funcion (Bel) and plausibiliy funcion (Pl). Le =,, be he se of all possible evidences under some consideraion, hen he power se of E (. ()) is he se of all sub ses of E, also referred as frame of discernmen of E. i.e,,,,,,,,,,,!. The mass funcion (m) maps every subse in frame of discernmen o he range of values"0 1$, i.e %: () "01$. Where i follows wo condiions: %( )=0 and sum of mass funcions of all subses is 1 ( *,(-)%()) =1). If. is a se in he power se, hen belief funcion of. is defined as /(.)= 1 3 %(0) and he plausibiliy of he se. in power se is defined as he sum of all he masses of he ses ha inersec wih he se.: 4/(.)= 1 36 %( 0) Dempser s rule for combinaion Le. is an elemen in frame of discernmen, and % 7 (.), % * (.) are probabiliy funcion values of wo observer nodes 8 and ) respecively. The combinaion of hese wo mass values % 7,* (.) is calculaed in eq(1). % 7,* (.)=, :;3 % 7()% * (9) 1 = (1) Here he consan K is defined as == % 7 ()% * (9), :; 3.2 Trus marix operaions In he nework, each node mainains he rus informaion in he form of marix (>? ) wih order where n is he number of nodes in he nework, 1 1 k 1 n 1 >? = k k k n k n k n n n AB represens he rus value ha node i has on node j. A node calculaes he muli hop disance node s rus value by applying ransiive rule (ransiive rule: if node-i rus value of node-j AB, node-j rus value of node-k BC hen node-i rus value of node-k AC ) owards ha arge node A is he rus vecor, having rus values of oher nodes. A ="@ AE $. Calculaion A is represened as marix operaions in eq (2). i1 11 k1 N1 i ik = 1 k kk Nk ik (2) in NEXT 1n kn nn in CURRENT In he above marix operaion, an AC is calculaed AC =%GH BC!. Node i, ieraively execues he eq(2) for calculaion of muli hop disance node rus A =(>? )@ A =(>? A =(>? ) A

3 Advanages of QTAR In he proposed mehod (QTAR), node rus value is evaluaed in wo phases. In firs phase direc rus is evaluaed using dempser shafer heory, in second phase indirec rus is evaluaed using rus marix operaions. The proposed mehod is having he following advanages over exising mehods 1 The mehod can reduce he pah breaks in rouing process, since i selecs he nodes wih hreshold level of energy and bandwidh. 2 The mehod can improve he packe delivery ime by deploying sable nodes along he roue o desinaion 3 The mehod is capable of finding alernae rus roue, in case of roue failure. 4. Recommendaions Based QoS Trus Aggregaion and Rouing in Mobile Adhoc nework level, oherwise decremens (9KM 9KM 1). The hreshold bandwidh is evaluaed using TDMA mehod, where he bandwidh of a node is compued based on he number of free ransmission/ receiving slos i has wih is neighbour node Node sabiliy In MANETs, node mobiliy has significan impac on applicaion s performance. A rouing proocol prefers sable nodes along he pah o desinaion. A node esimaes neighbour node sabiliy in he form of link expiry ime wih ha node. If a neighbour node has hreshold level of link expiry ime, hen is rus value is increased( 9KM 9KM+ 1) oherwise decreased (9KM 9KM 1). The link expiry ime for a pair of nodes is evaluaed based on heir curren locaion, velociies and direcion of movemen. 4.2 QoS Trus aggregaion. The Dempser s rule of combinaion, combines he 1-hop neighbours rus recommendaions o derive he indirec rus for 2-hop neighbours. In MANET conex, a node can have hree possible rus evidences like rus K, disrus KW and uncerainy (rus/disrus) X=K,KW. Figure 1: QoS Trus frame work in MANETs In he figure 1, he QoS rus is managed hrough he following inerrelaed phases in proposed mehod (QTAR), QoS Trus Compuaion QoS Trus Aggregaion QoS Trus Propagaion QoS Trus Rouing 4.1 QoS rus compuaion Due o broadcas naure of MANETs, a node can observe and esimaes he neighbour node s resources in heir direc ineracions. For a node, QoS rus value is compued based on heir available QoS resources like residual energy, available bandwidh and node sabiliy Residual energy In pah esablishmen o a desinaion node, a source node defines he hreshold energy (Kh - ) ha an inermediae node should have for forwarding a packe. A node incremens i s neighbour node s rus value if i is having residual energy greaer han he hreshold energy (9KM 9KM+1) oherwise i decreases( 9KM 9KM 1). Threshold energy is evaluaed using equaion (3). Kh - =( NOP % Q )+(2 STU %) (3) Here NOP is a node forwarding energy, % is a size of daa packe in bis, Q is a node ransmission range and STU is he node s amplifier acivaion energy Available bandwidh Source node calculaes he hreshold bandwidh (Kh VP ) for an inermediae node for successful daa ransmission o he desinaion. A node incremens neighbour node rus value (9KM 9KM+1) if i has bandwidh more han hreshold Figure 2: Aggregaion of QoS rus recommendaions In figure 2, Le s assume P, Q nodes rus evidences (K,K, YX) on node-d are 0.7,0.2,0.1 and 0.3,0.5,0.2 respecively. Node S rus values of P, Q nodes are K, =0.9 G K = 0.8. Then node P, Q rus evidences are recompued like %, (K)=K, 0.7=0.63 %, (KW)=K, 0.2=0.18 %, (X)=K, 0.1=0.09 % : (K)=K : 0.3=0.24 % : (KW)=K : 0.5=0.40 % : (X)=K : 0.2=0.16 The aggregaion of P,Q nodes recommendaions on node-d is evaluaed as in eq(1). %,,: (K)= %, (K)% : (K)+%, (K)% : (X)+%, (X)% : (K) = a%, (K)% : (KW)+%, (KW)% : (K)b 0.09 =0.55 The above equaion can be exended for combining of n nodes recommendaions on node-d. i.e %.E (K). 4.3 QoS rus propagaion In he nework, he rus values are propagaed hrough he HELLO packes. Every node periodically sends he HELLO packes, which conains he 1-hop and 2-hop neighbours rus values. Addiionally a node can send rus reques (TREQ) o is neighbour nodes for remoe node rus value. The proposed mehod uses he AODV rouing principles for roue discovery. 4.4 QoS rus rouing Whenever a source node wans o send daa o desinaion node, i sends he RREQ packes o neighbour nodes wih pre calculaed QoS hreshold values.

4 218 1) On receiving RREQ packe, an inermediae node adds is ID and forwards o he nex hop neighbours. 2) RREQ packe collecs he rus values of he inermediae nodes in is journey o desinaion node. 3) Afer receiving RREQ packes, he desinaion node updaes is rus marix. 4) Desinaion node applies he ransiive operaions ieraively over i s rus marix o find ou he rus worhy roue from he source node (sec 3.2). Then i sends he RREP packe o source node hrough he compued roue. 5) On receiving RREP packe, source node esablishes he roue and sars he daa ransmission QoS rouing example. Figure 3: QoS rus rouing in MANETs In figure 3, source node-1, wans o esablish he pah o desinaion node-8. Source node sends he RREQ packe o he neighbour nodes. The RREQ packes collec he inermediae nodes rus values and reach he desinaion node. Desinaion node-8 prepares he rus marix (>? ) and applies he marix operaions o find ou he rus worhy pah from node-1 o node-8 ieraively. Ieraion 1: Iniially source node -1 conains he rus values of 1-hop neighbours, i.e nodes 2, = Afer he firs ieraion, source node s 2-hop neighbours (node 4,5) rus values are evaluaed Ieraion 2: Afer he second ieraion, source node s 3-hop neighbours (node 6,7) rus values are evaluaed = Ieraion 3: Afer hird ieraion, source node s 4-hop neighbour (node 8) i.e desinaion node rus value is evaluaed = Ieraion4: This process ends, afer finding desinaion node s rus value. Here he desinaion node rus value from source node is = Trace ou he roue In he rus marix( >? ) of las ieraion, idenify he node (j) such ha from which he desinaion node go he maximum rus value. By he backracking hrough previous ieraion s rus marices, idenify he node hrough which node-j go maximum rus value. This procedure is coninued ill he source node reached. Here he rus worhy pah from source o desinaion is Theoreical analysis of proposed mehod The frame work in he proposed mehod follows four phases. In able1, he ime and space complexiy of each phase is discussed. In rus compuaion, each node has o compue direc rus value for is q-number of neighbours, so i is O(n q). A node uses n n marix for rus mainenance, so i is O(n ). In rus aggregaion, for combining n- recommendaions a node has o spend f(m h ) ime, where m is he number of elemens in he frame of discernmens. Trus propagaes hrough HELLO packes, so i is O(n f j ), where O(f j ) is he frequency of hello packes. For roue idenificaion, desinaion node performs k ieraions of marix operaions, so i iso(kn ). Table 1: Time and Space complexiies of QTAR Time Space Mehod complexiy complexiy QoS Trus O(n q) O(n compuaion ) QoS Trus aggregaion QoS Trus propogaion QoS Trus rouing 5. Resuls f(m h ) no addiional space required O(n f j ). O(f j ) O(kn ) no addiional space required The simulaion resuls are aken in he nework simulaor (ns2). The proposed mehod(qtar) performance is compared wih exising proocols AODV and AQOR for he parameers bandwidh, energy consumpion, delay and packe delivery raio(pdr). 5.1 Experimen seup The simulaion is run for 600 sec where he nework size is increased from 10 o 50 nodes and node velociy is increased from 12 o 60 m/sec. We adoped he random way poin mobiliy model. A node s ransmission range is 250 m 5.2 Simulaion parameers 1) Packe delivery ime: i is calculaed as he facion of oal ime aken by daa packes o reach he

5 219 desinaion o he number of daa packes received a desinaion node. 2) Throughpu: The amoun of daa ransferred from source o desinaion in uni ime. 3) Rouing energy: oal energy consumed by he nodes along he roue in daa ransmission from source o desinaion. 4) packe delivery raio: i is he raio of number of daa packes are delivered o he number of oal packe generaed. 5.3 Simulaion resuls In figure 4, he packe delivery ime (sec) is increased when he nodes velociy is increased. While he nodes are moving a higher velociy, he links ge broken frequenly. The proposed mehod allows only sable nodes in is daa ransmission, here by reduces he packe delivery ime. Packe Delay(m.sec) AODV AQOR QTAR Node Velociy (m/sec) Rouing Enrgy (Jouls) Packe Delivery Raio AODV AQOR QTAR Number of Nodes Figure 6: number of nodes Vs rouing energy AODV 0.95 AQOR QTAR Node Velociy (m/sec) Figure 7: node velociy Vs PDR 6. Conclusion Throughpu Figure 4: node velociy Vs packe Delay AODV AQOR QTAR In his frame work, he QoS rus is esablished in four phases i.e compuaion, aggregaion, propagaion and rouing. Direc rus of a node is evaluaed based on is qualiy of available resources. In indirec rus compuaion, we used he dempser shafer combinaion rule for reducing he impac of biased recommendaions. Trus informaion is mainained in he form of rus marices a every node. We applied marix operaions for finding rusworhy roue from source o desinaion. The performance of he proposed mehod is analysed heoreically in erms of ime and space complexiies. In simulaion resuls, he QTAR ouperformed he exising proocols Number of Nodes Figure 5: number of nodes Vs hroughpu In figure5, he hroughpu is decreased wih increased nework size. When an inermediae node is having more neighbour nodes, hen is bandwidh is reduced. QTAR considers bandwidh as a QoS meric in pah consrucion. Hence he proposed mehod resuls in good hroughpu. In figure 6, he rouing energy (oal energy of inermediae nodes along he pah) is increased wih increased nework size. QTAR selecs he nodes wih sufficien energy, so ha he number of re ransmissions is reduced. Hence he rouing energy consumpion in QTAR is less han ohers. In figure 7, Packe delivery Raio (PDR) decreases for higher node velociies. If he pah is disconneced, he rouing proocol has o deploy alernae pah, so i reduces he PDR. By selecing sable nodes, he proposed mehod reduces he pah breaks and increases he PDR value. References [1] Hui Xia and Jia Yu Applying rus enhancemens o reacive rouing proocols in mobile ad hoc neworks journal of Wireless Neworks, vol 22, pp , [2] Priya Sehuraman and N. Kannan, Refined rus energy-ad hoc on demand disance vecor (ReTE-AODV) rouing algorihm for secured rouing in MANET journal of wireless neworks. Vol 22, pp1-11,2016 [3] V. Jayalakshmi and T. Abdul Razak Trus Based Power Aware Secure Source Rouing Proocol using Fuzzy Logic for Mobile Adhoc Neworks, IAENG Inernaional Journal of Compuer Science, vol 43, pp98-107, [4] Muhammad Saleem Khan and Majid Iqbal Khan, MATF: a muli-aribue rus frameworkfor MANETs, EURASIP Journal on Wireless Communicaions and Neworking, vol 2016,pp1-17, [5] Moussa Ali cherif and Sofiane Boukli Hacene A energyconserving predicive preempive mulipah rouing proocol for adhoc neworks: a lifeime improvemen, Inernaional Journal

6 220 of Communicaion Neworks and Informaion Securiy (IJCNIS), vol -8, issue 1, pp [6] Maryam el Azhari, Ahmed Toumanari, Rachid Laif, Nadya el Moussaid, Relay based hermal aware and mobiliy suppor rouing proocol for wireless body sensor neworks, Inernaional Journal of Communicaion Neworks and Informaion Securiy (IJCNIS), vol -8, issue 2, pp 64-73, [7] Fei Hao, Geyong Min, Man Lin, Changqing Luo, Yang, L.T. MobiFuzzyTrus: An Efficien Fuzzy Trus Inference Mechanism in Mobile Social Neworks, IEEE Transacions on Parallel and Disribued Sysems, vol.25, no.11, pp , [8] Zhexiong Wei; Tang, H.; Yu, F.R.; Maoyu Wang; Mason, P., Securiy Enhancemens for Mobile Ad Hoc Neworks Wih Trus Managemen UsingUncerain Reasoning,, IEEE Transacions on Vehicular Technology, vol.63, no.9, pp , [9] Hu-Chen Liu, Long Liu, Qing-Lian Lin, and Nan Liu Knowledge Acquisiion and Represenaion Using Fuzzy Evidenial Reasoning and Dynamic Adapive Fuzzy Peri Nes, IEEE Transacions On Cyberneics, Vol. 43, No. 3. Pp , [10] Sirisala, NageswaraRao.; C.Shoba Bindu. Uncerain Rule Based Fuzzy Logic QoS Trus Model in MANETs 21 s Inernaional Conference on Advanced Compuing and Communicaions-ADCOM, IIT madras, pp55-60,2015. [11] Kannan Govindan, Member IEEE and Prasan Mohapara, Fellow IEEE Trus Compuaions and Trus Dynamics in Mobile Adhoc Neworks: A Survey, IEEE Communicaions Surveys & Tuorials, Vol. 14, No. 2, [12] N. Cheng, K. Govindan and P. Mohapara, Rendezvous based rus propagaion o enhance disribued nework securiy, in Proceedings of IEEE INFOCOM Workshop on Securiy in Compuers, Neworking and Communicaions, china, pp , [13] Sirisala, NageswaraRao.; C.Shoba Bindu. Weighage based rused QoS proocol in Mobile Adhoc Neworks, IEEE Global Conference on Wireless Compuing and Neworking, lonavala, pp , [14] S. Trifunovic, F. Legendre and C. Anasasiades, Social rus in opporunisic neworks, IEEE Conference on Compuer Communicaions Workshops, San Diego, pp. 1 6, [15] J. Luo, X. Liu, and M. Fan, A rus model based on fuzzy recommendaion for mobile ad-hoc neworks, The Inernaional Journal of Compuer and Telecommunicaions Neworking, vol. 53, no. 14, pp , [16] Y. Bachrach, A. Parnes, A. D. Procaccia, and J. S. Rosenschein, Gossip-based aggregaion of rus in decenralized repuaion sysems,, Journal of Auonomous Agens and Muli-Agen Sysems, vol. 19, no. 2, pp , [17] J. Huang and D. Nicol, A calculus of rus and is applicaion o PKI and ideniy managemen, in The 8h ACM Symposium on Ideniy and Trus on he Inerne, Gaihersburg, pp , [18] A.Menaka and M.E Pushpa TAODV: A Trused AODV Rouing proocol for Mobile ad hoc neworks IEEE inernaional conference on Inerne mulimedia services archiecure and applicaions. Pp ,2009 [19] G. Lenzini, M. S. Bargh and B. Hulsebosch, Trus-enhanced securiy in locaion-based adapive auhenicaion, Journal of Elecronic Noes in Theoreical Compuer Science, no. 197, pp , [20] Chia-Cheng Hu, Eric Hsiao-Kuang Wu, Gen-HueyChen, bandwidh-saisfied Mulicas Trees in MANETs, IEEE Transacions On Mobile Compuing, Vol. 7, No. 6, pp: , [21] Nen-Chung Wang, Yung-Fa Huang Yu-Li Su A Power- Aware Mulicas Rouing Proocol for Mobile AdHoc Neworks Wih Mobiliy Predicion, Inernaional Journal of Wireless Personal Communicaions, Vol 43:pp , [22] A. Pirzada and C. McDonald, Trus esablishmen in pure adhoc neworks, Inernaional Journal of Wireless Personal Communicaions, vol. 37(1-2), pp , [23] C.D. Jensen, P.O. Connell, Trus-based roue selecion in dynamic source rouing, Proceedings of Inernaional Conference on Trus Managemen, Ialy, pp , [24] T. M. Chen and V. Venkaaramanan, Dempser Shafer heory for inrusion deecion in ad hoc neworks, IEEE journal of Inerne Compuing, vol. 9, no. 6, pp , Nov./Dec [25] E. Gray, J. marc Seigneur, Y. Chen, and C. Jensen, Trus propagaion in small worlds, 1s Inernaional. Conference on Trus Managemen, Greece, pp , [26] T. Hughes, J. Denny, P.A. Muckelbauer, J. Ezl, Dynamic rus applied o ad hoc nework resources, in Proceedings of he Auonomous Agens and Muli-Agen Sysems Conference, Melbourne, pp , 2003 [27] A.Jøsang and R. Ismail, The Bea Repuaion Sysem, in proceedings of Bled Elecronic Commerce Conference, Slovenia, pp , [28] Rappapor, T.S."Wireless Communicaions: Principles and pracice". Book, Upper Saddle River, NJ:Prenice-Hall, 1996.