Spherical representation and polyhedron routing for load balancing in wireless sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 621-625

  Yu, Xiaokang ^a   Ban, Xiaomeng ^b   Zeng, Wei ^b   Sarkar, Rik ^b   Gu, Xianfeng ^b   Gao, Jie ^b  

^a SHANDONG UNIVERSITY   (China)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

3-CONNECTED PLANAR GRAPHS; CONVEX POLYHEDRONS; DISTRIBUTED ALGORITHM; GREEDY ROUTING; LOAD BALANCING PROPERTIES; LOAD-BALANCED; OPTIMIZATION ROUTINE; SPHERICAL REPRESENTATION;

GEOMETRY; PARALLEL ARCHITECTURES; SENSOR NODES; SENSORS; SPHERES; TELECOMMUNICATION EQUIPMENT;

WIRELESS NETWORKS;

EID: 79960868637     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935240     Document Type: Conference Paper

References (20)

1. P. Angelini, F. Frati, and L. Grilli, "An algorithm to construct greedy drawings of triangulations," in Proc. of the 16th International Symposium on Graph Drawing, 2008, pp. 26-37.
2. M. Ben-Chen, C. Gotsman, and C. Wormser, "Distributed computation of virtual coordinates," in Symposium on Computational Geometry, 2007, pp. 210-219.
3. A. I. Bobenko and B. A. Springborn, "Variational principles for circle patterns and koebe's theorem," Trans. Amer. Math. Soc, vol. 356, pp. 659-689, 2004.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001. [Online]. Available: citeseer.ist.psu.edu/ bose01routing.html
5. C. R. Collins and K. Stephenson, "A circle packing algorithm," Comput. Geom. Theory Appl., vol. 25, no. 3, pp. 233-256, 2003.
6. R. Dhandapani, "Greedy drawings of triangulations," in SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, 2008.
7. R. Flury, S. Pemmaraju, and R. Wattenhofer, "Greedy routing with bounded stretch," in Proc. of the 28th Annual IEEE Conference on Computer Communications (INFOCOM), April 2009.
8. J. Gao and L. Zhang, "Load balanced short path routing in wireless networks," IEEE Transactions on Parallel and Distributed Systems, Special Issue on Localized Communications, vol. 17, no. 4, pp. 377-388, April 2006.
9. E. A. Jonckheere, M. Lou, F. Bonahon, and Y. Baryshnikov, "Euclidean versus hyperbolic congestion in idealized versus experimental networks," CoRR, vol. abs/0911.2538, 2009.
10. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 2000, pp. 243-254.
11. R. Kleinberg, "Geographic routing using hyperbolic space." in Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM'07), 2007, pp. 1902-1909.
12. T. Leighton and A. Moitra, "Some results on greedy embeddings in metric spaces," in Proc. of the 49th IEEE Annual Symposium on Foundations of Computer Science, October 2008, pp. 337-346.
13. A. Mei and J. Stefa, "Routing in outer space: fair traffic load in multihop wireless networks," in MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing. New York, NY, USA: ACM, 2008, pp. 23-32.
14. C. H. Papadimitriou and D. Ratajczak, "On a conjecture related to geometric routing," Theor. Comput. Sci., vol. 344, no. 1, pp. 3-14, 2005.
15. L. Popa, A. Rostamizadeh, R. Karp, C. Papadimitriou, and I. Stoica, "Balancing traffic load in wireless networks with curveball routing," in MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing. New York, NY, USA: ACM, 2007, pp. 170-179.
16. P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs," J. Comp. and System Sciences, pp. 130-143, 1988.
17. P. Raghavan and C. D. Thompson, "Provably good routing in graphs: regular arrays," in Proceedings of the 17th annual ACM Symposium on Theory of Computing, 1985, pp. 79-87.
18. R. Sarkar, X. Yin, J. Gao, F. Luo, and X. D. Gu, "Greedy routing with guaranteed delivery using ricci flows," in Proc. of the 8th International Symposium on Information Processing in Sensor Networks (IPSN'09), April 2009, pp. 97-108.
19. W. Thurston, "The finite riemann mapping theorem," in Invited talk, An International Symposium at Purdue University on the occasion of the proof of the Bieberbach conjecture, March 1985.
20. W. Zeng, R. Sarkar, F. Luo, X. D. Gu, and J. Gao, "Resilient routing for sensor networks using hyperbolic embedding of universal covering space," in Proc. of the 29th Annual IEEE Conference on Computer Communications (INFOCOM'10), March 2010.