4048

3826

كارشناسي ارشد

معماري كامپيوتر

اصفهان: دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر

1386

هشت، [151]، [II] ص.: جدول، نمودار

ص. ع. به فارسي و انگليسي

مهدي مهدوي

پژمان خديوي

5/5/87

جمال الدين گلستاني، مسعود رضا هاشمي

1396/03/06

كتابنامه

برق و كامپيوتر

مهندسي برق و كامپيوتر

ID3826

به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي

AbstractMobile Ad Hoc networks are a sort of communication networks that do not have anyinfrastructure or controlling center and are usually set up for specific purposes temporarilyand quickly Their ability to be set up rapidly and also their independence frominfrastructure has made them being increasingly used in a variety of different areas likemunicipal military and rescue fields In such networks nodes are moving and can easilyjoin or leave the network therefore the network s topology is changing continuously Twonodes in this type of networks can communicate directly only if they are in thetransmission range of each other otherwise they have to communicate through a routeconsisting of intermediate nodes When two nodes get out of their common region of radiotransmission range the wireless link between them breaks If one of the links making upthe route breaks the whole path will become useless In this case the broken link shouldbe replaced or a new route should be constructed Most of the routing protocols intend tofind the shortest path route while studies show that the shortest path in MANET can bevery unstable and easily broken with a slight move in nodes With a broken route there is adecrease in packet delivery ratio while the average end to end delays and jitter of receivingpackets increase On the other hand the increased overhead of repairing or finding a newroute cuts the overall performance of the network and increases the whole energyconsumed by mobile nodes In this thesis the distance between mobile nodes in a MANEThas been estimated using the round trip time of data packets and the corresponding ack inthe MAC layer and stability of links has been evaluated dynamically Then a new routingalgorithm has been proposed that selects more stable routes based on link stability Thisalgorithm predicts when a route is about to break based on link state information andbefore any link breaks replaces it or tries to find a new route The proposed protocol issimulated using OMNET and the results indicate an improved performance compared toAODV routing protocol in different conditions

مهدي مهدوي

پژمان خديوي

جمال الدين گلستاني، مسعود رضا هاشمي