The Community for Technology Leaders
RSS Icon
Issue No.08 - Aug. (2012 vol.23)
pp: 1508-1519
M. Elena Renda , IIT—National Research Council, Pisa
Giovanni Resta , IIT—National Research Council, Pisa
Paolo Santi , IIT—National Research Council, Pisa
In this paper, we address the problem of balancing the network traffic load when the data generated in a wireless sensor network is stored on the sensor node themselves, and accessed through querying a geographic hash table. Existing approaches allow balancing network load by changing the georouting protocol used to forward queries in the geographic hash table. However, this comes at the expense of considerably complicating the routing process, which no longer occurs along (near) straight-line trajectories, but requires computing complex geometric transformations. In this paper, we demonstrate that it is possible to balance network traffic load in a geographic hash table without changing the underlying georouting protocol. Instead of changing the (near) straight-line georouting protocol used to send a query from the node issuing the query (the source) to the node managing the queried key (the destination), we propose to “reverse engineer” the hash function used to store data in the network, implementing a sort of “load-aware” assignment of key ranges to wireless sensor nodes. This innovative methodology is instantiated into two specific approaches: an analytical one, in which the destination density function yielding quasiperfect load balancing is analytically characterized under uniformity assumptions for what concerns location of nodes and query sources; and an iterative, heuristic approach that can be used whenever these uniformity assumptions are not fulfilled. In order to prove practicality of our load balancing methodology, we have performed extensive simulations resembling realistic wireless sensor network deployments showing the effectiveness of the two proposed approaches in considerably improving load balancing and extending network lifetime. Simulation results also show that our proposed technique achieves better load balancing than an existing approach based on modifying georouting.
Geographic hash tables, load balancing, wireless sensor networks, in-network data storage, network lifetime.
M. Elena Renda, Giovanni Resta, Paolo Santi, "Load Balancing Hashing in Geographic Hash Tables", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 8, pp. 1508-1519, Aug. 2012, doi:10.1109/TPDS.2011.296
[1] M. Albano, S. Chessa, F. Nidito, and S. Pelagatti, "Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks," Proc. IEEE Conf. Mobile Data Management, pp. 166-173, 2007.
[2] 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.
[3] C. Canali, M.E. Renda, P. Santi, and S. Burresi, "Enabling Efficient Peer-to-Peer Resource Sharing in Wireless Mesh Networks," IEEE Trans. Mobile Computing, vol. 9, no. 3, pp. 333-347, Mar. 2010.
[4] C. Canali, M.E. Renda, and P. Santi, "Evaluating Load Balancing in Peer-to-Peer Resource Sharing Algorithms for Wireless Mesh Networks," Proc. IEEE MeshTech, pp. 603-609, 2008.
[5] Texas Instruments CC2530 Data Sheets, , 2012.
[6] L. Galluccio, G. Morabito, S. Palazzo, M. Pellegrini, M.E. Renda, and P. Santi, "Georoy: A Location-Aware Enhancement to Viceroy Peer-to-Peer Algorithm," Computer Networks, vol. 51, no. 8, pp. 379-398, June 2007.
[7] J. Gao and L. Zhang, "Tradeoffs between Stretch Factor and Load Balancing Ratio in Routing on Growth Restricted Graphs," Proc. ACM Symp. Principles of Distributed Computing (PODC), pp. 189-196, 2004.
[8] P. Gupta and P.R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks," Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998.
[9] E. Hyytiä, P. Lassila, and J. Virtamo, "Spatial Node Distribution of the Random Waypoint Mobility Model with Applications," IEEE Trans. Mobile Computing, vol. 5, no. 6, pp. 680-694, 2006.
[10] D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Mobile Computing, Kluwer Academic Publishers, pp. 153-181, 1996.
[11] B. Karp and H. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM Mobicom, pp. 243-254, 2000.
[12] A. Mei and J. Stefa, "Routing in Outer Space: Fair Traffic Load in Multi-hop Wireless Networks," Proc. ACM MobiHoc, pp. 23-31, 2008.
[13] A.D. Polyanin and A.V. Manzhirov, Handbook of Integral Equations, CRC Press, Boca Raton, 1998.
[14] L. Popa, A. Rostamizadeh, R.M. Karp, C. Papadimitriou, and I. Stoica, "Balancing Traffic Load in Wireless Networks with Curveball Routing," Proc. ACM MobiHoc, pp. 170-179, 2007.
[15] S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu, "Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table," Mobile Networks and Appl., vol. 8, no. 4, pp. 427-442, 2003.
[16] R. Sarkar, W. Zeng, J. Gao, and X.D. Gu, "Covering Space for In-Network Sensor Data Storage," Proc. ACM/IEEE IPSN, pp. 232-243, 2010.
[17] L. Wang, F. Yao, and C.-W. Yi, "Improved Asymptotic Bounds on Critical Transmission Radius for Greedy Forward Routing in Wireless Ad Hoc Networks," Proc. ACM MobiHoc, pp. 131-138, 2008.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool