دانلود رایگان ترجمه مقاله مسیریابی کنترل ازدحام با مکانیسم واگذاری کانال بهینه در شبکه مش بیسیم – IEEE 2017
دانلود رایگان مقاله انگلیسی مسیریابی کنترل تراکم با استفاده از مکانیزم اختصاص کانال بهینه به شبکه مش بی سیم به همراه ترجمه فارسی
عنوان فارسی مقاله: | مسیریابی کنترل تراکم با استفاده از مکانیزم اختصاص کانال بهینه به شبکه مش بی سیم |
عنوان انگلیسی مقاله: | Congestion Control Routing Using Optimal Channel Assignment Mechanism in Wireless Mesh Network |
رشته های مرتبط: | فناوری اطلاعات و ارتباطات و مهندسی فناوری اطلاعات، دیتا، سوئیچ، امنیت شبکه، شبکه های کامپیوتری |
فرمت مقالات رایگان | مقالات انگلیسی و ترجمه های فارسی رایگان با فرمت PDF میباشند |
کیفیت ترجمه | کیفیت ترجمه این مقاله متوسط میباشد |
نشریه | آی تریپل ای – IEEE |
کد محصول | F476 |
مقاله انگلیسی رایگان (PDF) |
|
ترجمه فارسی رایگان (PDF) |
|
خرید ترجمه با فرمت ورد |
بخشی از ترجمه فارسی مقاله: ۱٫ مقدمه در این مقاله، مفهوم الگوریتم Dijkstra جهت جلوگیری از پیوندهای پرشده و کاهش تاخیر سوئیچینگ کانال استفاده می شود. ما یک تکنیک مسیریابی معرفی کردیم که براساس میزان نمره متراکم شده است. در این رابطه، زمانی که پیوند متراکم می شود، گره دستخوش یک روش تغییر سوئیچ می شود. الگوریتم پیشنهادی اطلاعات احتمالی را به شکل یک جدول ذخیره می کند. سپس، این اطلاعات تراکم با کاربرد الگوریتم Dijkstra برای اختصاص یک میزان نمره مثبت و ایجاد صف پیوند استفاده می شود. ترافیک براساس رتبه بندی پیوند روت شده است. پروتکل IEEE 802.11 تعداد کمی از کانال های فرکانس قائم را فراهم می کند، بنابراین برخی از رادیوهای اطراف ممکن است در همان باند فرکانس کار کنند. در سیستم MR-MC، تخصیص کانال ها به رادیو ها با حفظ دخالت و تراکم در حداقل سطح بسیار چالش برانگیز است. با این حال، در طول CA؛ شبکه با یک تاخیر سوئیچینگ کانال و پردازش ها مواجه است که عملکرد کل شبکه را تحت تاثیر قرار می دهد. اختصاص چندین کانال به تعداد گره ها بدون افزایش تاخیر ناشی از سوئیچینگ کانال، یک چالش کلیدی در WMN است. این به ما انگیزه می دهد تا اهمیت رویکرد CA را برای افزایش عملکرد شبکه با اجتناب از پیوندهای پرجاذبه و استفاده از تکنیک مسیریابی کارآمد، برجسته کنیم. |
بخشی از مقاله انگلیسی: I. INTRODUCTION IEEE 802.11s standard is for Wireless Mesh Network (WMN) which is made up of mesh routers and mesh clients [1]. The mesh routers are the stationary access points which propagate the traffic from various routes to the gateway node that is connected to the internet, in a multi-hop fashion [2]. The multihop communication scenarios do not need a centralized control system. The out of range nodes transmits the packets using intermediate nodes. Therefore, the transmission power and thus interference effect can be reduced. IEEE 802.11s standard utilizes almost all the properties of IEEE 802.11 protocols. There are 12 non-overlapping channels in IEEE 802.11a protocols. An interference is produced if the nearby radios are operating on the same channel which results in congestion in the logical links. The nature of the congestion in MR-MC WMN is different to that in a wired network. The capacity of a wireless node highly depends on the transmission between its neighbors. The frequency channels are limited; therefore, the nearby radios may communicate on the same channel that causes the interference. This interference from a nearby node highly affects the network capacity; hence, results in network congestion. Efficient Channel Assignment (CA) scheme is needed to optimize the network performance [3] [4] [5]. During CA procedure, network undergoes a channel switching phenomenon. The switching from one channel to another produces switching overheads, needs tight time synchronization and produces a considerable amount of switching delay. IEEE 802.11 protocol states the physical channel switching time as 224µs [6]. The real delay is the addition of physical channel switching time, hardware registers reconfiguration time and MAC layer packets processing time. In this paper, the concept of Dijkstra’s algorithm has been used to avoid the congested links and reduce channel switching delay. We introduced a routing technique which is based on a congested link weighted score. In this regard, when the link becomes congested the node undergoes a channel switching procedure. The proposed algorithm saves the congestion information in the form of a table. Then, this congestion information is used using Dijkstra’s algorithm to assign a nonnegative weighted score and generate link ranks. The traffic is routed based on the link ranks. WMN has gained much popularity because it can increase network coverage area with less cost and complexity. CA is an active research area to increase the network capacity and performance by utilizing the frequency spectrum efficiently. IEEE 802.11 protocol provides a limited number of orthogonal frequency channels, therefore, some nearby radios may operate on the same frequency band. In MR-MC system, assigning the channels to the radios by keeping an interference and congestion to the minimum level is very challenging. However, during CA; network faces a channel switching delay and overheads which affect the overall network performance. Assigning multiple channels to the number of nodes without increasing delay caused by channel switching is a key challenge in WMN. This motivates us to highlight the importance of CA approach for enhancing the network performance by avoiding the congested links and employing efficient routing technique. In this paper, we present an effective solution using the channel selection technique which is based on congestion table information. Also, special emphasis is placed on provisioning appropriate algorithm for alleviating overhead and performance degradation resulting from continuous switching and computational complexity. In particular, the concept of Dijkstra’s algorithm to utilize the multi-path function by avoiding the weak links has been used. Moreover, the simulation setup to conduct the analysis is delineated. MC-MR WMN. The system model and problem statement are given in Section III. Section IV explains the overview of channel assignment in WMN and explains the proposed protocol. Section V describes performance evaluation and simulation results followed by the last section VI that concludes the paper. II. RELATED WORK CA research in WMN is based on either centralized or distributed manner. A centralized node is responsible for making CA decision and controls all maintenance functions in a centralized approach. Similarly, in a distributed scheme, each node is responsible for channel allocation to its corresponding nodes. There are a number of CA approaches that have been proposed to increase network goodput [7]. For better routing, Raniwala et al. [8] proposed centralized Load Aware Channel Assignment (LA-CA) protocol which balances the load distribution on each virtual links to avoid any bottleneck in the network. It assigns the channel in such a way that load on the link is less than its capacity. Raniwala and Chiueh [9] proposed a distributed scheme called Hyacinth, in which each node divides the Network Interface Card (NIC) into UP-NICs and DOWN-NICs. CA is done only at DOWN-NICs. This scheme uses a load-aware algorithm which only assigns the least used channel in the neighborhood without causing a ripple effect and channels oscillation. Kodialam and Nandagopal [10] proposed two centralized schemes called Balance Static Channel Assignment (BSCA) and Packing Dynamic Channel Assignment (PDCA). BSCA assign a time slot to each link that uses a particular channel. The channels that are assigned to each link are fixed and cannot be changed until next time slot. Similarly, PDCA performs link channel assignment and allows every link to switch channel in time slots. Lin et al. [11] also proposed a centralized scheme which is based on Genetic Algorithm (GA). The radios and channels are represented as a chromosome-like data structure. Each chromosome is assigned a fitness value using roulette wheel selection technique. A. Hamed et al. [12] proposed a scheme to optimize CA and congestion control problem called Distributed Congestion Aware Channel Assignment (DCACA) algorithm. In this scheme, channels are assigned based on congestion measure at every time slot in a distributed manner. Makram and Gunes [13] introduced the centralized Cluster Channel Assignment (CCA). Mohammad et al. [14] proposed interference reduction approach by using Improved Gravitational Search Algorithm (IGSA). The link scheduling scheme in CA is proposed by Andrew et al. [15] called. The scheme uses a centralized approach and partitions the WMN in a number of subnetworks using stability and matroid theory. Similarly, Alicherry et al. [16] also proposed a centralized scheme for joint CA, routing and link scheduling problem called RCL. Some other schemes are discussed elsewhere to solve the CA problem in WMNs [17], [18], [19], [20], [21], and [22]. |