IJBTT

Load Distribution of SPR and CSR in Wireless Network

	International Journal of Recent Engineering Science (IJRES)
	© 2014 by IJRES Journal
	Volume-1 Issue-4
	Year of Publication : 2014
	Authors : P.Ramya
	DOI : 10.14445/23497157/IJRES-V1I4P104

How to Cite?

P.Ramya, "Load Distribution of SPR and CSR in Wireless Network," International Journal of Recent Engineering Science, vol. 1, no. 4, pp. 21-16, 2014. Crossref, https://doi.org/10.14445/23497157/IJRES-V1I4P104

Abstract
In a wireless network, route travelled by a packet from source to destination usually consist of multiple hops. Routing algorithms are used to find optimal route for each pair of source and destination in a given network. Routing algorithms typically choose the shortest path among all possible routes between source and destination. Taking the shortest path can achieve smallest delay and shortest travelled distance; However this may lead to uneven distribution of traffic load in a network. Under uneven distribution, the center of a network becomes crowded, because shortest paths go through the center rather than through the periphery of a network Circular Sailing Routing (CSR) provides remedy for the above problem as it offers balanced traffic load distribution to the network. CSR maps the nodes on the surface of a sphere and selects routes based on surface distance. This project analyses and compares the load distribution of CSR & SPR under various network traffic for various topologies.

Keywords
CSR, routing algorithms, SPR, topology

Reference
[1] S. Chen and Y. Wang, Data collection capacity of randomdeployed wireless sensor networks under physical models, Tsinghua Science and Technology, vol. 17, no. 5, pp. 487-498, 2012.
[2] F. Li and Y. Wang, Circular sailing routing for wireless networks, in Proc. of IEEE INFOCOM, 2008, pp. 1346-1354.
[3] F. Li, S. Chen, and Y. Wang, Load balancing routing with bounded stretch, EURASIP Journal on Wireless Communications and Networking, vol. 2010, Article ID 623706, 2010.
[4] E. Hyyti¨a and J. Virtamo, On traffic load distribution and load balancing in dense wireless multi-hop networks, EURASIP Journal on Wireless Communications and Networking, Article ID 16932, 2007.
[5] P.P. Pham and S. Perreau, Performance analysis of reactive shortest path and multipath routing mechanism with load balance, in Proc. of IEEE INFOCOM, 2003, pp.251-259. v[6] S.J. Lee and M.Gerla, Dynamic load-aware routing in ad hoc networks, in Proc. of IEEE ICC, 2001.
[7] H. Hassanein and A. Zhou, Routing with load balancing in wireless ad hoc networks, in Proc. of ACM MSWIM, 2001, pp. 3206-3210.
[8] Y. Yoo and S. Ahn, A simple load-balancing approach in cheat-proof ad hoc networks, in Proc. of IEEE Globecom, 2004, pp. 3573-3577.
[9] Y. Ganjali and A. Keshavarzian, Load balancing in ad hoc networks: single-path routing vs. multi-path routing, in Proc. of IEEE INFOCOM, 2004, pp. 1120-1125.
[10] L. Popa, A. Rostami, R. Karp, C. Papadimitriou, and I. Stoica, Balancing the traffic load in wireless networks with curveball routing, in Proc. of ACM Mobihoc, 2007,pp. 170-179.
[11] F. Li and Y. Wang, Stretch Factor of Curveball Routing in Wireless Network: Cost of Load Balancing, in Proc. of IEEE ICC, 2008, pp. 2650-2654.
[12] H. S. M. Coxeter, Introduction to Geometry, New York: John Wiley & Sons, 1969.