4357

4105

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

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

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

1387

نه، 88، [II] ص: مصور، جدول، نمودار

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

پژمان خديوي

حسين سعيدي

28/12/87

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

ID4105

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

AbstractIn multihop wireless networks fair allocation of bandwidth among different nodes is oneof the critical problems Although there is a significant research on the fairness issues insingle hop wireless networks research on multihop fairness is rarely found in theliterature A user node in a multi hop network has to transmit both relayed and its owntraffic Therefore besides the contention with other nodes for the same destination there isan inevitable contention between its own and relayed traffic in the network layer Accordingly a mechanism for fair data flow scheduling in a node is needed In this thesis a scheduling algorithm is proposed which is trying to allocate node s bandwidth fairlybetween different contention traffic flows The main purpose of this algorithm namedHBPQ History Based Priority Queuing is the prevention of starvation occurance for anyactive flow in network At the other hand HBPQ tries to bring close together thesatisfaction of users HBPQ uses a satisfaction function to measure the user s gratifications If HBPQ is used for flow scheduling in multihop wireless ad hoc networks the simulationresults show that each active network s flow receives a throughput proportional to distancebetween its source and destination

پژمان خديوي

حسين سعيدي