دانلود رایگان مقاله لاتین بهبود بهره وری از طریق مسیریابی از سایت الزویر
عنوان فارسی مقاله:
بهبود بهره وری از طریق مسیریابی هدف میانی بر اساس مسیریابی جغرافیایی
عنوان انگلیسی مقاله:
Improving routing efficiency through intermediate target based geographic routing
سال انتشار : 2015
برای دانلود رایگان مقاله بهبود بهره وری از طریق مسیریابی اینجا کلیک نمایید.
بخشی از مقاله انگلیسی :
We use a simple example to illustrate the basic idea of ourapproach. We assume that all nodes are static and distributedin a two dimensional space. As shown in Fig. 1, weassume that S is the source node and D1, D2 and D3 are threedifferent destination nodes. When S wants to send packetsto D1, it can find an efficient path by greedy forwarding.However, when S wants to send a packet to D2, it uses thegreedy forwarding and the packet will reach node P.Because of the existence of the void area, P is closer toD2 than all of the P's neighbors. So P cannot reach D2 bygreedy forwarding and is called a local minimum node.Fortunately, we have various routing algorithms [14] to let Pchange from the greedy mode to the perimeter routingmode. The packet will be forwarded along a detour pathuntil it arrives at node B, where the forwarding mode ischanged from the perimeter routing mode to greedyforwarding. Node B is called a landmark node. After nodeB, the packet can be forwarded to destination D2 by greedyforwarding. Because D2 is shaded by the hole, the originalsimple greedy forwarding has to take a detour. This detourpath can be long.To deal with routing inefficiency caused by the detour, wecan let either destination node D2 or landmark node Binform source S that such a detour occurred. After receivingthe message, S keeps a record that associates D2 with B,meaning that if the destination is D2, forward throughintermediate node B. After that, if S later needs to sendpackets to D2, it can send them to B first (using B as anintermediate target) by greedy forwarding. The path will befrom S to B and then to D2, instead of from S to P, to B, andthen to D2. This new path can be much shorter and may bethe best path to get to D2 from S. The significance of thetechnique depends on how likely S needs to send packets toD2 again.
برای دانلود رایگان مقاله بهبود بهره وری از طریق مسیریابی اینجا کلیک نمایید.
کلمات کلیدی:
Improving routing efficiency through intermediate target based ...https://www.osti.gov/.../1251806-improving-routing-efficiency-through-intermediate-...by Z Fei - 2015 - Cited by 4 - Related articlesAug 1, 2015 - ... efficiency through intermediate target based geographic routing ... Sponsoring Org: USDOE Office of Energy Efficiency and Renewable ...Combining Source-Location Privacy and Routing Efficiency in ...ieeexplore.ieee.org/document/6134560/by J Ren - 2011 - Cited by 4 - Related articlesIn this paper, we propose a scheme to provide both source-location privacy and routing efficiency through routing to an intermediate node selected from a ...Improving throughput in Hybrid Wireless Networks using P2P based ...ieeexplore.ieee.org/document/7586380/by G Poovila - 2016 - Related articlesOct 10, 2016 - A challenge in this paper is to improve an efficient routing, thus it ... to destination by relaying through intermediate hops, uses the shortest path.Experimental Study of Load Balancing Routing for Improving Lifetime ...ieeexplore.ieee.org/document/5303522/by K Daabaj - 2009 - Cited by 10 - Related articlesOrganizing wireless sensor networks (WSNs) using energy efficient routing tree ... two potential factors: the residual power in the intermediate sensor node and ...Control Engineering and Information Systems: Proceedings of the 2014 ...https://books.google.com/books?isbn=1315724383Zhijing Liu - 2015 - Computers3 COOPERATIVE ROUTING In cooperative wireless communication, ... the co-operation of relay nodes to improve the forwarding efficiency performance and increase ... Through network coding at the intermediate nodes, not only the overall ...Advances in Artificial Intelligence -- IBERAMIA 2012: 13th ...https://books.google.com/books?isbn=3642346545Juan Pavón, Néstor D. Duque-Méndez, Rubén Fuentes Fernández - 2012 - ComputersData routing: Data is sent through the nodes to the destination using the route ... use a multihop technique, which involves sending data through intermediate nodes. ... Also, the use of disjoint route could improve the efficiency of the algorithm.Improved routing algorithm for interconnected local area networks ...ieeexplore.ieee.org/document/149374/by IJ Warford - 1992 - Cited by 1 - Related articlesAbstract: An improved version of the ISO intermediate system to intermediate system (IS-IS) routing algorithm is presented. Through simulation it is shown that ...
