Abstract
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 for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.
Highlights
Wireless networks draw lots of attention due to their potential applications in various areas
To avoid the uneven load distribution of shortest path routing, we focus on designing routing protocols for wireless networks which can achieve both small traveled distance and evenly distributed load in the network
We theoretically prove that for any networks, the stretch factor of Circular Sailing Routing (CSR) is bounded by max(π(1+ )/2, π), where is a constant parameter only depends on the ratio between the size of the network and the radius of the sphere used in CSR
Summary
Wireless networks draw lots of attention due to their potential applications in various areas. We are interested in designing a load balancing routing for large wireless networks. By spreading the traffic across the wireless network via the elaborate design of the routing algorithm, load balancing routing averages the energy consumption. To avoid the uneven load distribution of shortest path routing, we focus on designing routing protocols for wireless networks which can achieve both small traveled distance and evenly distributed load in the network. Notice that recently Popa et al [6] proposed a similar routing technique, called curveball routing (CBR), which maps the 2D network on a sphere using another stereographic projection method and route the packets based on spherical distances between their virtual coordinates on the sphere. This version introduces a new definition of circular distance which fixes a bug in the proof of Lemma 2, contains a new 3D projection method and stretch analysis for 3D networks, and provides better overall presentation
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
