tailieunhanh - Báo cáo hóa học: "Research Article Load Balancing Routing with Bounded Stretch"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Load Balancing Routing with Bounded Stretch | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010 Article ID 623706 16 pages doi 2010 623706 Research Article Load Balancing Routing with Bounded Stretch Fan Li 1 Siyuan Chen 2 and Yu Wang2 1 Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing 100081 China 2 Department of Computer Science College of Computing and Informatics The University of North Carolina at Charlotte Charlotte NC 28223 USA Correspondence should be addressed to Yu Wang Received 27 April 2009 Accepted 19 June 2009 Academic Editor Benyuan Liu Copyright 2010 Fan Li et al. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However shortest path-based routing protocols suffer from uneven load distribution in the network such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load we propose a novel routing method called Circular Sailing Routing CSR which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection and then the route decision is made by a newly defined circular distance on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network the distance traveled by the packets using CSR is no more than a small constant factor of the minimum the distance of the shortest path . We also extend CSR to a localized version Localized CSR by modifying greedy routing without any additional communication overhead. In addition we investigate how to design CSR routing .