پديد آورنده :
سلماسي، مهرداد
عنوان :
ظرفيت شبكه هاي حذفي تحت كدينگ فضايي شبكه
گرايش تحصيلي :
مهندسي برق
محل تحصيل :
اصفهان، دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر
صفحه شمار :
يازده،[160]ص: مصور، جدول، نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
جمال الدين گلستاني
استاد مشاور :
امين امين زاده گوهري
توصيفگر ها :
كدينگ شبكه، شبكه هاي پخشي.
تاريخ نمايه سازي :
25/7/91
استاد داور :
معصومه نصيري كناري، بهناز عمومي، محمدعلي خسروي فرد
دانشكده :
مهندسي برق و كامپيوتر
كد ايرانداك :
ID438 دكتري
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Capacity of Erasure Networks under Spatial Network Coding Mehrdad Salmasi salmasi@ec iut ac ir Date of Submission March 14 2012 Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Professor S Jamaloddin GolestaniAdvisor Professor Amin Aminzadeh GohariDepartment Graduate Program Coordinator Professor Amir Borji Abstract We study the capacity of a multicast session in an interference free broadcast erasurenetwork under a class of network coding schemes referred to as spatial network coding Inthis class of coding nodes are prohibited from performing coding on successive data unitsof a link only data units arriving on different incoming links to a node may be combined In this thesis rst we prove that the capacity of a unicast session is equal to the statisticalmean of the minimum cut rate of the corresponding random graph where the notions ofgraph model and minimum cut rate are extended to apply to broadcast networks Then weshow that the capacity of a multicast session is equal to the minimum of the capacities ofthe constituent unicast sessions Our approach is to rst develop these results for a point to point erasure network Then we devise a kind of equivalence relationship between pairs of point to point and broadcasterasure networks each coming with a speci ed network coding scheme Using this equiv alence relationship we are able to extend the capacity results obtained for point to pointnetworks to the more general case of interference free broadcast erasure networks In order to study the ef ciency of spatial network coding we evaluate the capacity ofpoint to point and broadcast multi layer erasure networks We suppose that the network sizeenlarges such that the number of nodes in each layer increases faster than the number oflayers We prove that when the network size goes to in nity the ratio of capacity underspatial network coding to the capacity under general network coding converges to one Keywords Network Coding Erasure Networks Capacity Multicast Spatial NetworkCoding Broadcast Networks
استاد راهنما :
جمال الدين گلستاني
استاد مشاور :
امين امين زاده گوهري
استاد داور :
معصومه نصيري كناري، بهناز عمومي، محمدعلي خسروي فرد
