مشخصات مقاله | |
انتشار | مقاله سال 2018 |
تعداد صفحات مقاله انگلیسی | 17 صفحه |
هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
منتشر شده در | نشریه الزویر |
نوع مقاله | ISI |
عنوان انگلیسی مقاله | Using Flow Cost to Globally Allocate and Optimize Limited Bandwidth in Multipath Routing |
ترجمه عنوان مقاله | استفاده از هزینه جریان برای تخصیص جهانی و بهینه سازی پهنای باند محدود در مسیریابی چندگانه |
فرمت مقاله انگلیسی | |
رشته های مرتبط | مهندسی فناوری اطلاعات، مهندسی کامپیوتر |
گرایش های مرتبط | شبکه های کامپیوتری، سامانه های شبکه ای، اینترنت و شبکه های گسترده |
مجله | شبکه های کامپیوتر – Computer Networks |
دانشگاه | School of Electrical Engineering and Computer Science – University of Ottawa – Canada |
کلمات کلیدی | شبکه ادهاک بی سیم، تخصیص پهنای باند محدود، بهینه سازی، مسیریابی چندگانه شناخته شده جهانی |
کد محصول | E5845 |
وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
بخشی از متن مقاله: |
1. Introduction
Wireless Ad hoc Network has attracted significant attention in recent years because no fixed infrastructure is required; its communicating nodes can cooperate to maintain network connectivity even when randomly distributed. While a node can communicate directly with others within itsradio transmission range, a sequence of intermediate nodes are used to relay messages to a destination node beyond its range. Thusmulti-hop routing is one important design challenge in order to provide adequate network services. Time of action is one way to categorize the many existing works in multi-hop routing. In general, Reactive Routing computes routes when they are needed, and hence referred to ason-demand routing sometimes. Examples are DSR (Dynamic Source Routing) [JoMa96] and AODV (Ad hoc On-demand Distance Vector) [PeRo99]. In contrast, Proactive Routing needs to maintain/save the routing information/activitybetween two nodes. It is also called table-driven routing because a node keeps track of routes to all destinations and stores such information in a table. When a new route is required (such as when an application starts or when an old path is disrupted), a new route can be immediately/quicklyselected from the routing table. Examples are the DSDV (Destination Sequenced Distance Vector) Routing [PeBh94] and the WRP (Wireless Routing Protocol) [MuGa96]. Note that these two classes of routing protocols are usually used in uni-path routing with no consideration of bandwidth limitation. In reality, link bandwidth is usually limited in a mobile ad hoc network, and a route along a single path may not have enough bandwidth to support the transmission requirements of an application. Therefore, it becomes more popular to use multipath routing to provide additionalpaths/bandwidth through a network [AlSe16, Gall77, BeGa84, TsMo06].There are several steps to follow. The first step is Route Discovery where a flooding approach is usually used. Zone-based routing [JoLu99] is proposed to improve the flooding efficiency by reducing the searcharea. However, the traditional zone-based methods(e.g., [GaMa07, JoLu99]) have some problems especially in the possibility of discarding useful nodes. The next step is to split data transmission into multiple data streams, each along a different path to the same destination. In this way, adequate bandwidth can be allocated to support total bandwidth requirement of a data transmission. |