دانلود رایگان ترجمه مقاله مسیریابی آگاهانه بار برای شبکه های مش بی سیم جهانی کوچک غیرمداوم – IEEE 2014
دانلود رایگان مقاله انگلیسی مسیریابی آگاهانه بار برای شبکه های مش بی سیم غیرمداوم کوچک به همراه ترجمه فارسی
| عنوان فارسی مقاله: | مسیریابی آگاهانه بار برای شبکه های مش بی سیم غیرمداوم کوچک |
| عنوان انگلیسی مقاله: | Load-aware Routing for Non-Persistent Small-World Wireless Mesh Networks |
| رشته های مرتبط: | مهندسی کامپیوتر و فناوری اطلاعات، شبکه های کامپیوتری و مهندسی الگوریتم ها و محاسبات |
| فرمت مقالات رایگان | مقالات انگلیسی و ترجمه های فارسی رایگان با فرمت PDF میباشند |
| کیفیت ترجمه | کیفیت ترجمه این مقاله متوسط میباشد |
| نشریه | آی تریپل ای – IEEE |
| کد محصول | F481 |
|
مقاله انگلیسی رایگان (PDF) |
دانلود رایگان مقاله انگلیسی |
|
ترجمه فارسی رایگان (PDF) |
دانلود رایگان ترجمه مقاله |
|
خرید ترجمه با فرمت ورد |
خرید ترجمه مقاله با فرمت ورد |
| جستجوی ترجمه مقالات | جستجوی ترجمه مقالات |
|
بخشی از ترجمه فارسی مقاله: مقدمه |
|
بخشی از مقاله انگلیسی: I. INTRODUCTION WIRELESS mesh network (WMN) consists of three types of nodes: gateway mesh router, mesh router and mesh client [1]. Gateway mesh routers are connected to other communication networks or the internet through wired links. Wireless mesh routers are deployed in the WMNs as partially mobile or fully static nodes whereas mesh clients are dynamic nodes in the network. WMNs have many advantages such as low up-front cost, easy network maintenance and robustness in network operation. Average path length (APL) which is defined by the end-to-end hop distance (EHD) averaged over the network, has greater value in the context of WMN due to its regular network topology. To reduce the APL value of the WMN, EHD between source-node (SN) and destinationnode (DN) has to be minimized. Therefore, long-links (LLs) can be established among the distant router nodes (as their positions are mostly static in the WMN) to reduce the APL and incorporate the small-world (SW) characteristics in the WMNs. Small-world characteristics can be achieved by lowering the value of APL in a regular network. Milgram [2] first observed the small-world characteristics in his 1967 experiment where he concluded that people are connected to each other with “six degrees of separation,” thus forming the smallworlds. In [3], the authors achieved SW characteristics by creating a few LLs by rewiring the normal-links (NLs) in a regular network which resulted in reduced APL, and low to moderate average clustering co-efficient (ACC), which is the measure of the connecting neighbor nodes averaged over the network. In [4]–[۱۰], the authors created the SW characteristics by adding a few LLs in the network. However, the above LL creation strategies deal with static or permanent LLs, as the LLs are established permanently for the whole data-transfer session in the network. We consider non-persistent LLs (NPLLs) in this paper where LLs are formed temporarily between nodes as and when traffic demands them. Therefore, after certain time interval, the LLs may change the directions of LL formation by creating connections among different node-pairs in the network. Therefore, to create NPLLs, we consider smart antennas to form directional beams for connecting the distant node-pairs in the network. Smart antennas [11]–[۱۴] or adaptive array antennas can be used to dynamically track the distant nodes by smart signal processing in the network to form NPLLs by highly directional beamformer. SW-WMNs find applications in the context of rural networks or community networks. In rural or community regions of operation, there are very limited access or no access of the infrastructure networks, therefore, the deployment of SWWMNs can provide cost-effective connectivity throughout such regions. In this paper, we propose LNPR algorithm in the context of SW-WMN. The algorithm better distributes the traffic load among the LLs and NLs, thus incorporate load-balancing in the network. The rest of this paper is structured as follows. Section II describes existing routing algorithms for WMN along with the difficulties to implement them in the context of SW-WMN. Section III describes LNPR algorithm for non-persistent SWWMN. In Section IV performance results of the algorithm is presented in terms of different metrics, which is followed by conclusion in Section V. II. ROUTING IN SW-WMNS Small-world characteristics can be achieved in a WMN by implementing a few LLs in the network as studied in [5]– [۱۰], [۱۵]. The LLs in the WMN can be implemented in two ways. In persistent LL creation, the locations of the LLs among SN and DN pairs do not change for the duration of operation in the WMN. Whereas, in non-persistent LL creation, 978-1-4799-2361-8/14/$31.00 © ۲۰۱۴ IEEE the LLs change their positions after a stipulated amount of time. Therefore, smart antennas equipped with a few mesh routers in the WMN, create directional beams to make nonpersistent LLs in specified directions depending on the traffic requirements. Routing for WMNs [1] can be divided into two categories: (i) reactive routing [17] is based on the strategy of on-demand data path establishment from SN to DN (e.g. Ad-hoc On Demand Distance Vector Routing (AODV) [18] or Dynamic Source Routing (DSR) [19]), whereas, (ii) in proactive routing [20], the data path is computed independently of demand and routing information is updated at every node in the network (e.g. Destination-Sequenced Distance Vector Routing (DSDV) [21] or Optimized Link State Routing (OLSR) [22]). However, these routing strategies do not provide efficient solutions for SW-WMNs with NPLLs. Figure 1 explains one example situation where the conventional routing algorithms overload the non-persistent LLs to find the shortest paths among SN and DN pairs in the grid-topology based SW-WMN. In Figure 1, smart-routers (SRs) are wireless mesh routers equipped with smart antennas which are capable of forming highly directional beam and changing the direction of beam adaptively to make non-persistent LLs in the SW-WMN. Therefore, for a specific time duration, non-persistent LLs can be made among SRs to transmit data packets among a set of SNs and DNs in the WMN. The conventional routing such as Link State Routing (LSR) [23] are based on the greedy strategy to find the shortest path between SN-DN pair. Hence, to find the shortest path, the routing strategies may choose the same LL repeatedly without considering the traffic load. Figure 1 also shows the data transmission session among three SN-DN pairs by using conventional routing strategies in the context of SW-WMNs. In Figure 1, data transfer session is established between Region 1 and Region 2 where the data packets of SN1 are transmitted to DN1 through LL1 which is created between SR1 and SR2. Similarly, the data packets from SN2 is transmitted to DN2 via LL1. However, when SN3 has to send data to DN3, LL1 is again used to deliver the data packets to DN3 with minimal hops, as shown in Figure 1. Therefore, the path for data transfer session among different SNs and DNs may include the same LL. As a result, LLs may be highly overloaded, therefore, LLs should be used in such a way to avoid overloading. Hence, conventional WMN routing algorithms are not efficient in the context of SW-WMN. A limited number of routing solutions exist in the context of SW-WMN to utilize the LLs in the network. In [10], the authors depicted a Small-world based Cooperative Routing (SCR) algorithm in the context of multi-hop wireless network, where, a few wireless nodes called cooperative nodes, have relaying capability to some distant cooperative nodes in the network. The cooperative nodes help to create long distant connections among SN-DN pairs by relaying the data packets to the distant DNs with cooperative capability, or to the nearest cooperative nodes of DNs. However, the global information is required to implement cooperative routing in the context of SW-WMNs. Moreover, the cooperative node has to transmit its own data and relay its neighbor’s data, therefore, the bandwidth requirement is more to implement cooperative routing. Jiang et. al. [16] considered data-mule or data ferry based NPLL creation in the multi-hop wireless networks. The datamule which is mobile in the network, has the location information for the path it travels. Depending on the location information of the DN (i.e., whether the DN is on the way of the path traversed by the data-mule), the data-mule loads and dispatches the data to the DN or to the nearest node of DN in the network. However, the router nodes in the WMNs are mostly static or with less mobility, therefore, router nodes cannot be used as the non-persistent or dynamic LLs in the network. In this paper we propose a Load-aware Non-persistent Small-World LL Routing (LNPR) algorithm for SW-WMNs. We consider a few non-persistent LLs among SR node-pairs and study the call block probability of NPLLs in the context of SW-WMN. |
