Stable AODV Routing Protocol with Energy-aware in Mobile Ad Hoc Network

Transcription

1 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER Stable AODV Routng Protocol wth Energy-aware n Moble Ad Hoc Network Jncheng Huang 1, Huhu Xang 1, and Yaheng Zhang 2 1. Department of Informaton Engneerng, Yancheng Insttute of Technology, Yancheng, Jangsu Provnce, 22401, P. R. Chna 2. Department of Materals Engneerng, Yancheng Insttute of Technology, Yancheng, Jangsu Provnce, 22401, P. R. Chna Abstract In Moble Ad Hoc Network (MANET), due to the moblty of the nodes t s dffcult to fnd the route whch can mantan the whole process of data transmsson. Therefore, t s very crtcal to balance, mantan and repar the route wthn the moblty of nodes and the lmted battery energy. Currently there are many protocols from dfferent aspects to solve ths problem. Ths paper proposes a new mproved routng protocol, whch s based on delayed replay program, and ts man objectve s to create the stable routng protocol based on hop AODV, node moblty speed and node communcaton state. The dscovery process of mproved routng protocols only let the low-speed node forwards the RREQ package, and re-routng request packet delay broadcast accordng to node s degree of busy. NS2 smulator s adopted to assess the performance of usng the program. Smulaton results show that the proposed has better performance than conventonal s, whch manly shows n better performance on the aspects on packet transmsson rate of mproved protocol, control overhead and end to end delay. Index Terms Moble Ad Hoc Network; Route Mantenance; Energy-aware Routng; Replay Program; Stable Routng I. INTRODUCTION Moble Ad Hoc Network (MANET) [1] s the network wthout nfrastructure and conssts of many dynamc moble nodes; nodes as a termnal or routng communcate wth other nodes n network. Routng protocol n MANET s based on the routng nformaton mantenance and stored, whch can be classfed as the frst type, table-drven and reactve and on-demand hrng agreement. In proactve routng protocol, each node mantans all nformaton on all nodes n the network, and there s a global vew of the network topology. The man advantage of proactve routng s that t determnes a route only need shortest tme, but snce the control packets and routng are not utlzed, there s a waste of network resources. Due to the lmted resources of nodes n the network, the dynamc characterstcs and unstable wreless connecton, routng process s the most mportant challenge of MANET. In Moble Ad hoc Network (MANET) [2], there s no need of the support for wreless devces, because the moble nodes can connects, dstrbutes and exchanges the date wth the adjacent nodes durng the movement. Va any specfc routng protocols, the source node can receve and re-broadcast a seres of data to the ntermedate node, and they are transferred the data to any destnaton node wth MANET protocol. Popular self-organzng routng protocols, such as on-demand dstance vector routng protocol [3] and dynamc source routng protocol [4], t s assumed between any source and destnaton node exsts a complete end to end path, frst usng AODV and DSR determne a the complete routng and forwardng data. However, ths assumpton s vulnerable when n the absence of delay-tolerant network (DTN) [6] n the mmedate end to end path. The evdent transmsson delay and nterrupt n DTN wll cause the damage of network topology, ncludng the reasons lke the terran around the obstacle, exhauston of battery, the lmted transmsson dstance, unrelable wreless connecton and the moble termnal []. Therefore, n the DTN, It s unwse of usng the tradtonal store and forward routng protocol, even though t s commonly used n tradtonal computer networks and n MANET. In reactve routng protocols, only when a node n the network need to transmt data to other nodes n network, a route s created, and there s no predefned route. The Destnaton-Sequenced Dstance Vector Routng (DSDV) [6] s the representatve of ths type of routng. The man advantage s that t reduces the network cost, because there s no exchange of network topology nformaton. On the other hand, when the old route fals, the source node must sent a request for startng a new routes, whch ncreases tme to fnd the route. Auto-organzng demand dstance vector (AODV) [7] and Dynamc Source Routng DSR) [8] are examples of reactve protocols. AODV s a reactve protocol whch manly conssts of three phases: route dscovery, routng answerng and routng mantaned. When a node needs to send a message to another node, t broadcasts request packets to all adjacent nodes to ntalze the dscovery process of route. And then each adjacent node rebroadcasts the RREQ to ts neghborng ponts; ths process contnues untl the packet reaches the destnaton pont or the ntermedate nodes contanng the destnaton ponts. Many copes of the same RREQ flood nto the network and cause the broadcast storm. Ths problem waste the network resources, such as bandwdth and node battery power. Snce many redundant request packets are broadcasted by the neghborng nodes, and a node may 14 ACADEMY PUBLISHER do: /jnw

2 2434 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 14 receve the packet more than once. If all the ntermedate node receves the REEQ and replay t at the same tme, there wll be competton and collson. In the reacton formula network many proposals have been proposed to solve the problem of the broadcast storm. Researchers use dfferent mechansms to control the broadcast process, and they allow the one certan group of adjacent nodes (not all nodes) to replay t, n whch the group s chosen based on dfferent characterstcs. Many programs based on counts, dstance and probablstc [9] replay the tme. Node uses a threshold to determne whether replay or not, and these programs reduce the delay tme and the number of RREQ packets. On the other hand, there are several dsadvantages, such as usng the loss probablty of the fxed threshold value and destnaton nodes. Currently the new solutons have been proposed, such as the use of other features lke the moble of node and the communcaton load. Some new programs wll be ntroduced n the next sectons. The purpose of these programs s to reduce the end to end average delay and routng load and maxmze the network throughput. Lterature [10] defnes the stablty of the lnk as the degree of stablty of lnk and a measure of duraton of the communcaton. Sgnal strength s a parameter used to assess the stablty of the lnk. Lterature [11] proposes the SSA, and the route dscovery s based on the stablty of average sgnal strength and the poston of the node. Lterature [12] proposes the RABR; the routng selecton of ths s based on the ntellgent routng remanng lfe assessment of canddate routes. The man dffculty of ths protocol s how to choose the optmal protocol threshold. In lterature [13] N. Sharma based on the receved sgnal strength calculates the and stablty of the lnk and routng stablty and puts forward the RSQR, whch s based on the threshold and the lnk s dvded nto stable and unstable lnk. Lterature [14] proposes the EBL, and the author consders the lnk stablty and remanng battery capacty are mportant. EBL not only mproves the energy effcency but also reduces the network segmentaton. Lterature [1] proposes the LAER, lnk stablty and energy wastage rate are jonted n route dscovery to reduce the control overhead and balance the traffc load. Lterature [16] proposes the PERRA; t s a knd of reactve routng protocol, whch takes nto account the lnks stablty and energy effcency. Due to constrants of congeston and mantenance of alternatve paths, the control overhead s greatly reduced. Accordng to the battery power and lnk stablty of the parameter node [17] the expected route lfetme s roughly predcted, and more approprate stable lnk s choose. Wth backup route, when AODV-BR [18] s nterrupted n the unpredctable lnk, the rapd recovery of route s acheved, whch s updated by montorng data packets and RREP packets. In ths hghly dense network hgh control nformaton overhead and collsons wll be caused. Lterature [19] mproves the route dscovery process of AODV, whch s based on the remanng energy of nodes, communcaton state and the qualty of the wreless connecton; the ntermedate node delays the tme of RREQ. Ths technology prevents the death of nodes wth a small amount of resdual energy. Furthermore, the hgh load nodes are avoded to add to the route, whch reduces the end-to-end average delay [] AODV protocol s the most popular reactve protocol, whose man objectve s fndng the shortest path between the source node and the destnaton node n the dscovery process. Route dscovery process of ths protocol broadcasts the route request packet (RREQ) n the network, whch wll lead to a sharp degradaton of network performance, especally when moblty of node s hgher. By removng the hgh-speed moble nodes to solve the problems, some routngs are congested and other routes are not used, whch can lead to poor network performance. So the route dscovery process should be changed to look for a stable routng and load of balancng dfferent nodes. To solve ths problem, ths thess proposes a soluton usng the node moblty of the ntermedate node and communcaton load to determne the best relable routng. The mproved route dscovery process only let the low-speed node forwards RREQ packet and accordng to the busy degree of nodes (such as the number of cache packets) to delay the broadcast of request packet. Through usng NS2 smulaton platform the mprovements are evaluated. The results show that the proposed program s better than the orgnal AODV on the end to end average delay and routng load. II. PROBLEM MODEL Qualty of the lnk wll affect the performance of the network, mproved verson of AODV based on lnk qualty has been proposed. It determnes the optmal steady route based SNR values [21]. Ths modfes the route dscovery process of AODV, and route selecton process based on the number of hops and SNR s feed backed. In the routng process, by measurng the obtaned data packets of ntermedate adjacent nodes and the SNR of control packets the lnk qualty s montored and mantaned [22]. The program wll get rd of the lnk n whch the value s less than the preset threshold value, but f there s no avalable route stable, the weak lnk wll be repeatedly added to the network to keep the network connecton. Furthermore, a sgnal swtchng mechansm has been proposed to mantan the route and the lnk qualty feedback on the lnk layer s used to montor the connecton of the nodes. The technology promotes the early dscovery of non-connectvty, so the early warnng of routng errors wll be sent to the upstream node; n the current destructon of the route, the source node wll be allowed to fnd a new route. Topology of MANET s represented as the undrected graph G ( V, E), wheren V s the collecton of node; E s the set of edges of the node connecton. Let P( u, v) { P0, P1, P2,..., P n }, wheren each P s a feasble path between u and v. consderng the route stablty and remanng energy, the problem of selectng the optmum path from the source to the destnaton node can be descrbed as: 14 ACADEMY PUBLISHER

3 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER where n, f 1 LS( e) (1) ep f 2 Ce( t) (2) ep R Ce() t F and R EThr1, q QThresh. where n R and F are respectvely the remanng energy and full capacty of the nodes For each ndcator of the objectves mportant factors w 1 and w 2 are provded; the above optmzaton can be transferred nto a sngle objectve problem expressed as follows: RFact( P ) w1 f 1w2 f 2 = w1 LS( e) w2 Ce( t) ep ep where n p1 p2 1. Maxmzng the sum of the objectves expressed as follows: RFact ( P) max{ RFact ( P), RFact ( P ),..., RFact ( P )} () III. 1 2 PROPOSED SCHEME A. Route Dscovery scheme mproves the route request phase of AODV, and dependng on the speed of the node (VON program) [8] and the communcaton load whch nodes wll be replayed s determned to create a stable route. VON scheme dvde the nodes nto hgh-speed and low-speed node. Snce the hgh speed generates nstable routes, they do not partcpate n the route dscovery phase. Because there are more nformaton s broadcasted caused by nstable routes, the delay tme of load and the destnaton pont wll be ncreased. In VON, the speed of node s calculated based on the control packet of data transmsson and the requred tme of the date. Because routng may be destroyed, any communcaton between two nodes at least requres one RREQ, one RREP, and a data transformaton shown n Fgure 1. Assumpton T the requred tme of source pont transferrng one packet to the destnaton pont, then a successful communcaton wll take 3T. Based on the dscusson above, the speed node do not needs to satsfy the condton: V R/3T n (3) (4) V of the where n R s the transmsson range of node. Threshold parameter V s the low-speed node based th on rate. When an ntermedate node B receves the DRREQ package, t s not the destnaton node, and the operatons on the node are as follows: If V Vth, then Replay RREQ packet; Otherwse, Dscardng RREQ packets. Fgure 2 descrbes the AODV routng dscovery phase based on VON program Source pont RREQ T RREP T DATA T V1 Fgure 1. AODV basc mechansms S R 2 7 node The target pont Fgure 2. AODV routng dscovery phase based on VON program Node S broadcasts a RREQ to the node 1, node 2 and node 3. Node 2 and node 3 forwards the route request packet and 3 to ther neghborng ponts except node 1. Node 1 compares ts speed and threshold parameter V th, and then dscarded because t s a hgh-speed node. When node D receves the RREQ packet, t sends a RREP and then back to the source node S,; ts routng recovery phase s the same wth AODV. B. Routng Selecton When the destnaton node receves the frst RREQ, t wll start the tmer t t seconds. Accordng to the objectve functon (Formula ) value, route request receved APST and AEC to calculate the relablty of the path. It stores all the RREQ of relablty values contaned n the routng cache. After the tmer expres, t fnds the path wth the mnmum target value, and then t wll send RREP. After the completon of the tmer t, the arrved route request wll be dscarded. Algorthm 1: Target node performs Input: Packets of neghbor node f ( P s a RREQ packet) then f (SS 1 < SThr2) then Dscard the packet P return end f f (SS 1 > SThrl ) then LS = 1 DSS = SS2 -SSI f (SS1< SThrl ) and (SS 1 > SThr2 ) then f (DSS < ul) then LS=l else LS = (u2 -DSS)/ (u2 -ul) end f end f 8 D 14 ACADEMY PUBLISHER

4 2436 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 14 APST = APST * LS RF ACT: = PI * APST + P2 * AEC Make Entry n Route Cache f(n=1) then Sends a RREP packet to the source node else Select the route wth the largest value RFACT Send RREP packet to the source node end f end f In network wth larger load, the low-speed node s busy and the busy node ncreases the end delay. To acheve load balancng, ths thess delays the replay of busy node and gve the opportunty to non-busy node. Delay tme D s gven by the followng formula: D F T () where n F s a measured communcaton status of the node, whch s the rato of the number of queued packets N and the buffer sze N B. q F =N /N 0 q B (6) T 0 s the standardzed delay tme based on network densty, and the delay tme of dense network s greater. When the ntermedate node receves the route request packet, the operaton s shown n Fgure 3. Node I movement speed (V) NO Dscardng the RREQ V <=V After a short delay broadcastng RREQ YES Whether the node s busy NO YES After a long delay broadcastng RREQ Fgure 3. Operaton on ntermedate nodes after receved the RREQ S Fgure 4. Routng requests of the mproved routng protocol Fgure 4 shows the mproved routng protocol how to select a stable route S D ; the source node S replays RREQ to the neghborng nodes: node 1, 2 and 3. Node 1 wll dscard the RREQ packet, because t s a hgh speed node; the delay tme of node 3 s greater than node 2, because node 3 s buser. Node 2 has less delay tme, whch llustrates that RREQ has earler replay on the node, because t may be early arrved the destnaton node compared wth node 3. So, Node 2 wll forward the RREQ packet to ts neghborng nodes before the node 3. When the route request packet arrved the destnaton D pont D, D and tradtonal AODV wll send a RREP packet to the source node S at the same tme. Fgure 4 shows that a few of the control message needs to reach the destnaton node. Smlarly, snce the RREQ packets wll early reache the destnaton node through the non-busy peak, whch reduces the latency. Wthn the Frame tme slot s conssted of unreserved, successful, and faled. Unreserved tme slot means that there s no node currently occuped at ths slot. Successful tme slot refers to the tme slot data successfully transmtted from the destnaton node to the source node. Faled tme slot s all tmeslots except for UTS and STS. The ablty dealng wth channel errors s used to evaluate the performance of MANET protocol. In the AODV based on MANET, the number of STS owned by each frame s the parameters to measure ther capablty. If under the relatvely poor channel condtons and MANET protocol data packets can stll vald, t ndcates that t can get a lot of STS. p s s the probablty of successfully transmttng packets n UTS. where n, collson. p (1 p ) p (7) s p c represents the transmsson probablty of Accordng to the lterature[8], the desred number of STS can be expressed as EX : F 1 2r s j1 F E X p F j pf s 1 c F 1 j1 2r F j 2r j j j! e e! 2r Throughput s defned as the rato of the number of success slots STS n each frame F and the overall slots. and are respectvely the throughput of AODV coop shown n formula (7). E X F E X coop F Normalzed throughput gan s shown n formula (8) as follows: IV. gan (8) (9) coop (10) SIMULATION RESULTS AND ANALYSIS Ths thess adopts the NS2 smulator [23, 24] to evaluate the proposed solutons. Study presents the performance of the protocol and compares wth ts tradtonal AODV and AODV protocol based on VON. A. Smulaton Envronment The network conssts of nodes wthn the 600m 800m rectangular area and uses a random pont 14 ACADEMY PUBLISHER

5 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER path as the moble model. Constant bt rate (CBR) s used as the packets of 12 bts. Source-destnaton combnaton s randomly spread n the network. Packet rate s set as 10, 1 and packets / second. The channel capacty on MAC layer protocol s 2Mb / s and the protocol wth the transmsson range as 0m. These nodes select a random speeds between the mnmum speed value 0 m / s and a maxmum speed of 30 m / s. Queue Interface on MAC layer can mantan 12packets (26kB) [2,26]. B. Experments and Analyss Fgure shows the end to end delay. As expected, the proposed can reduce the end-to-end delay, especally n hgh-speed networks. When the rate s growth, there are more control messages need for dscoverng the route. These messages cause the competton and collson problems. Through allowng non-busy nodes broadcast early than the busy node, mproved s can allevate ths problem. These non-busy nodes may faster fnd a route. So, end-to-end delay wll be reduced, and unnecessary control messages from busy nodes wll be deleted. Fgure depcts the average end-to-end delay result obtaned by these three solutons. The obtaned results show that n the all speeds condtons mproved s better than the tradtonal AODV, whch under the low speed condtons acheves a compettve performance and n hgh-speed condtons t s better than AODV based on VON. Delay (s) Based on the VON AODV AODV Node moblty (M/s) Fgure. End-to-end delay when the packet rate s 4 Standardzed routng load Based on the VON AODV AODV Node moblty (M/s) Fgure 6. Routng load Snce the low and non-busy nodes perform the retransmsson, whch reduce the load and cost of routng; there nodes also reduce the number of nodes requred for the control message; the structure s shown n Fgure 6. Fgure 7 shows that when the packet rate s hgh, the performance of the proposed s mproved relatve to the tradtonal AODV and AODV based on VON. When the packet rate s low (less than 10) the AODV based on VON s better AODV; when the packet rate s low, most of the nodes wll be dle, so there s no need to delay the broadcast and these measured delay tme of the nodes wll be the same, whch also cause the collsons and competton ssues, so the end-to-end delay tme wll be longer. However, to the busy nodes wth a hgh packet rate wll be avoded to broadcast at once, whch wll become apparent. The routng load of the mproved wth dfferent packet rates s better than the tradtonal AODV and AODV based on VON; the expermental results are shown n Fgure 8, whch mnmze the number of packets. Delay (s) Based on the VON AODV AODV Package rate Fgure 7. End-to-end delay when the speed s m / s Standardzed routng load Based on the VON AODV AODV Package rate Fgure 8. Standardzed routng load when the speed s m / s For a number of dfferent moble speeds 0,, 10, 1 and, an extensve set of smulaton s carred out. 10 runs of smulatons are conducted, and the mean value of the obtaned results s gven as the performance ndcators. In Fgure 9 t can be seen that snce the lnk nterrupted and the route repared the NCO s ncrease wth the ncrease of the moblty. When the moblty s low, the NCO of the proposed, and LAER are.1%,.4% and 6.3%. When the moblty hgh, the NCO of the proposed, and LAER are 22.8% 26.2% and 31.3%. At hgh dynamc envronment shows better performance. Because the the frst connect, the last break and the local route repar mechansm, there s less control overhead compared wth other two protocol. Lnk break s earler forecasted, and the data transmsson can be swtched to the alternatve route before t s nterrupted. From Fgure 10 t can be observed that n the three protocols, PDR s reduced wth the ncrease of speed. The reason of decreasng s that when the speed s ncreased, the lnk wll be nterrupted and the route wll be searched agan. When the moblty s hgh, the PDR of the 14 ACADEMY PUBLISHER

6 2438 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 14 proposed, and LAER are respectvely as 94.7%, 93.8% and 91.3%. The PDA of the proposed s ncreased by 1%relatve to, and ths s because t combnes the the frst connect, the last nterrupt" route mantenance mechansm, whch sgnfcantly reduces the number of the packet loss caused by unpredctable lnk nterrupton. The normalzed control overhead Node moblty (M/s) Fgure 9. Relatonshp between the control overhead and the node moblty PDR(%) Node moblty (M/s) Fgure 10. Relatonshp between PDR and node moblty Energy varance (%) Node moblty (M/s) Fgure 11. Relatonshp between energy varance and node moblty The varance of the remanng nodes energy s shown n Fgure 11. Ths parameter shows the load balancng capabltes of the agreements. Wth the ncrease of moblty due to frequent routng swtch, the varance of the resdual energy decreases. When the Moblty s Low, the energy varance percentages of the proposed, and LAER are 18.8%, 19.2% and 21.4%. When the moblty s hgh, the energy varance percentages of the proposed, and LAER are 7.8%, 8.3% and 11.3%. As shown n Fgure 12, the end-to-end delays of three protocols ncrease wth the ncrease of the moblty due to the frequent nterrupton. When the moblty s hgh, the average end-to-end delays of the proposed, and the LAER are 0.18 seconds, 0.21 seconds and 0.32 seconds. The reason why the delay of the proposed s the lowest s that t avods the lnk nterrupton caused by node moblty and battery energy loss. agreement combnes the frst connect the last break route mantenance mechansm, whch can quckly adapt to the changes n the network. When the moblty s hgh, the performance of the proposed s hgher than the by 14%. The end-to-end delay (ms) Node moblty (M/s) Fgure 12. Relatonshp between the end-to-end delay and node moblty The normalzed control overhead Node moblty (M/s) Fgure 13. The relatonshp between control overhead and node moblty Energy varance (%) Node moblty (M/s) Fgure 14. The relatonshp between energy varance and node moblty The end-to-end delay (ms) Node moblty (M/s) Fgure 1. End delay and node moblty to the end When s n the hgh dynamc envronment, t shows a better performance. Because of the repar mechansm of "frst connect, and then break" and the local route, ths leads to less control overhead compared wth the other two protocols, n whch It forecasts the 14 ACADEMY PUBLISHER

7 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER Lnk outage earler, so the data transmsson can be swtched to an alternatve route before the orgnal route lnk nterrupted. As can be seen from the experment, when the moblty s low, the NCO of proposed, and LAER are.1%,.4% and 6.3%. In hgh moblty, the NCO of proposed, and LAER are 22.8%, 26.2% and 31.3%, whch can be specfcally seen n Fgure 13. Wth the ncreasng of moblty, due to frequent routng swtch, the varance of the resdual energy decreases. When the moblty s Low, the energy varance percentages of proposed, and LAER are 18.8%, 19.2% and 21.4%. When n hgh moblty, the energy varance percentages of proposed, and LAER are 7.8%, 8.3% and 11.3%. The varance of the energy remanng nodes s shown n Fgure 14. Ths parameter characterzes the load balancng capabltes of the agreements. From the expermental analyss, the end to end delay of three protocols ncreases wth the ncreasng of moblty, because the path s frequently nterrupted. When wth hgh moblty, the average end-to-end delay of the proposed, and LAER are 0.18 seconds, 0.21 seconds and 0.32 seconds. The reason of the lowest delay of the proposed s that the lnk nterrupton caused by node moblty and battery energy loss s avoded. In the agreement, the mantenance mechansm of "frst connect, and then break" s combned, whch can quckly adapt to the changes n the network. When wth hgh moblty, the performance of proposed s hgher than the at 14%. It s can be specfcally seen n Fgure 1. V. CONCLUSION Ths thess ntroduces an mproved AODV to establsh a stable routng, whch s based on hop AODV, node moble speed and node communcaton status. The results show that the proposed program through pre-alarmng sgnfcantly mproves the transmsson rate of data packet and reduces the control overhead and delay caused by unpredctably lnk nterrupton. Compared wth LAER, t also reduces the varance of the node energy and ncreases the tme of network partton. In the hgh-speed dynamc network, t exhbts superor performance. When the moblty s low, compared wth the LAER, the delay of the proposed s slghtly hgh. The proposed AODV s superor to the tradtonal AODV and AODV based on VON on the aspects of end-to-end delay, routng load and spend. In order to avod passng the congeston and fast nodes, the number of the control packets n the routng dscovery process s mnmzed. In the future, n a dfferent node densty, traffc and moblty model, the proposed protocol wll be the mportant part of research. REFERENCES [1] DS Sandhu, S Sharma, "Performance Evaluaton of DSDV, DSR, OLSR, TORA Routng Protocols A Revew", Moble Communcaton and Power Engneerng. 13 pp [2] C. E. Perkns, E. M. Royer, and S. R. Das, Ad Hoc On Demand Dstance Vector (AODV) Routn, IETF Internet Draft, draftetf-manet-aodv-08. txt, March 10. [3] N Ntyananda Sharm Sukumar Nand, "Route Stablty Based QoS Routng n Moble Ad Hoc Networks", Wreless Pers. Communcaton, Sprnger, 09. [4] G. W. Park, S. Lee, "A routng protocol for Extent Network Lfetme through the Resdual Battery and Lnk Stablty n MANET", ACC '08, Istanbul, Turkey, 08. [] P Srnvasan, P Kamalakkannan, "Enhancng route mantenance n -AODV for moble ad hoc networks", Intellgent Systems and Control (ISCO), 13. [6] N S Y, Tseng Y C, Chen Y S, et al. The broadcast storm problem n a moble ad hoc network. Proc. Int l Conf. Moble computng and networkng (MOBICOM). 1999: [7] Yshuang Geng, Je He, Kaveh Pahlavan, Modelng the Effect of Human Body on TOA Based Indoor Human Trackng, Internatonal Journal of Wreless Informaton Networks (IJWIN) (4), , Dec. 13 [8] Mkael Håkansson, Jan Renman, Smulaton and Analyss of Wreless Ad Hoc Routng Schemes. Bleknge Teknska Högskola. February 04. [9] Maro Gerla Lokesh Bajaj, Mneo Taka, Rajat Ahuja, Rajve Bagroda. GloMoSm: A Scalable Network Smulaton Envronment. Techncal Report , Unversty of Calforna, 13, 09. [10] Peng Zhnan, Ye Danxa, Fan Mngyu. The black hole attack n moble Ad hoc networks. Computers Applcaton and Research, 09, 26(11) pp [11] J. He, Y. Geng and K. Pahlavan, Modelng Indoor TOA Rangng Error for Body Mounted Sensors, 12 IEEE 23nd Internatonal Symposum on Personal Indoor and Moble Rado Communcatons (PIMRC), Sydney, Australa Sep. 12 (page ) [12] Morteza Malek, Karthk, Pedram, 'Power-aware Source Routng Protocol for Moble Ad hoc Networks", ISLPED'08, Calforna, USA, 08. [13] R. Dube, C. D. Ras, K. Wang and SK Trpath, "Sgnal Stablty Based Adaptve Routng for Ad-Hoc moble network", IEEE Personal Communcaton, [14] LI Tng, TANG Ru-bo, JI Hong, Status adaptve routng wth delayed rebroadcas t scheme n AODV-based MANETs. Scence Drect 08 Elsever. [1] Amta Ran and Mayank Dave, Performance Evaluaton of Modfed AODV for Load Balancng. Journal of Computer Scence 3 (11): , 07. ISSN Scence Publcatons. [16] LIU Wang-gu, QU Zhao-we, Scheme for on-demand route protocol n Ad-hoc networks. Scence Drect 08 Elsever. [17] GloMoSm: Global Moble Informaton Systems Smulaton Lbrary. cs. ucla. edu/projects/glomosm/. [18] Idrees, M. Yousaf, M. M. Jaffry, S. W. Pasha, M. A. Hussan, S. A Enhancement n AODV Routng Usng Moblty Aware Agents. IEEE Internatonal Conference on Emergng Technologes. Sept ember 17-18, Islamabad. [19] S. L, Y. Geng, J. He, K. Pahlavan, Analyss of Three-dmensonal Maxmum Lkelhood Algorthm for Capsule Endoscopy Localzaton, 12 th Internatonal Conference on Bomedcal Engneerng and Informatcs (BMEI), Chongqng, Chna Oct. 12 (page ) [] Yshuang Geng, Yadong Wan, Je He, Kaveh Pahlavan, An Emprcal Channel Model for the Effect of Human Body on Ray Tracng, 13 IEEE 24nd Internatonal Symposum 14 ACADEMY PUBLISHER

8 2440 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 14 on Personal Indoor and Moble Rado Communcatons (PIMRC), London, Brtan Sep. 13 pp [21] Sulobh Agorcvol, Ashsh Ahujo, lornder Pol Sngh, "Route Lfetme Assessment Based Routng(RABR)Protocol for Moble Ad Hoc Networks", IEEE conference, 00. [22] Wang Jan, Lu Yanheng, Zhang Jng, et al. Manet's subjectve trust modelng and smulaton. Acta electronca Snca, 11, 39(12): [23] Perkns, C. E., Royer, E. M., "Ad hoc on demand dstance vector (AODV) routng", IETF RC 361, 08. [24] Y. Geng, J. He, K. Pahlavan, Modelng the Effect of Human Body on TOA Based Indoor Human Trackng, Internatonal Journal of Wreless Informaton Networks (4), [2] F. D. Rango, F. Guerrero, "Lnk Stablty and Energy Aware Routng Protocol n Dstrbuted Wreless Networks", IEEE Trans. on Parallel and Dstrbuted systems, 12. [26] F. Guerrero, "A B-objectve Optmzaton Model for Routng n Moble Ad-hoc Networks", IEICE Trans. Comm., Elsever, 09. Jncheng Huang receved the B.S. degree n Computer Scence and Technology from Xuzhou Normal Unversty, PRC, n 03, the M.S. degree n Economcs from Yamaguch Unversty, Japan, n 09, and the Ph. D. degree n Eng. from Yamaguch Unversty, and the Ph. D. degree n Eng. from Yamaguch Unversty, Japan, n 12. From 03 to 07, he was a research assocate and a vce-secton chef at Xuzhou Normal Unversty, PRC. Snce 12, he has been an lecture of the Department of nformaton Engneerng at Yancheng Insttute of Technology. Hs current research nterests nclude wreless communcatons and advanced OFDM technques. 14 ACADEMY PUBLISHER