Abstract
This paper proposes a routing algorithm named RCBDF (Ring and Clustering Based on Data Field).The algorithm uses the concept of physical field to form clusters on the ring network model. The routing algorithm mainly considers the remaining energy of nodes and the coverage of the cluster to balance energy consumption in network. Simulation analysis shows that: the routing policy will balance the energy consumption of the network at a large extent and greatly extend the network lifetime.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Liu Y, Luo Z, Xu K, Chen L (2010) A reliable clustering algorithm based on LEACH protocolin wireless mobile sensor networks. IEEE Computer Society, Singapore, 10–12 Sept 2010
Wu X, Chen G, Das SK (2008) Avoiding energy holes in wireless sensor networks with nonuniform node distribution. J IEEE Trans Parallel Dist Syst 19(5):710–720
Li J, Mohapatra P (2005) An analytical model for the energy hole problem in many-to-one sensor networks. In: Proceedings of 62nd IEEE vehicular technology conference. IEEE Communications Society, NewYork, pp 2721–2725
Li J, Mohapatra P (2007) Analytical modeling and mitigation techniques for the energy hole problems in sensor networks. Perv Mobile Comput 3(3):233–254
QING Li, Qing-Xin ZHU, Ming-Wen WANG (2006) A distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks. J Softw 17(3):481–489
Heinzelman WR, Chandrakasan A, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks.IEEE Trans Wirel Commun 1:660–670
Handy MJ, Haase M, Timmermann D (2002) Low energy adaptive clustering hierarchy with deterministic cluster-head selection. In : Proceedings of the Fourth IEEE conference on mobile and wireless communications networks, Stockholm, erschienen, S 368–372, ISBN 0-7803-7606-4. World Scientific, Singapore, Sept 2002
Xu K, Meng Y, Liu Y, Xiong N, Yang LT, Zheng M (2010) An effective method to improve the resistance to frangibility in scale-free networks. The 13th IEEE international conference on computational science and engineering (CSE-2010). IEEE Computer Society, Hongkong, China, 11–13 Dec 2010
Zhang K-B, Orgun MA, Zhang P, Zhang P (2006) Hypothesis oriented cluster analysis in data mining by visualization. ACM, Venezia, Italy, May 254–257 May 2006
Dai X, Gan W, Li D (2004) Study of image data mining based on data field. J Comput Eng Appl
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media B.V.
About this paper
Cite this paper
Dai, W., Xu, K., Park, J.J., Xiong, N., Liu, Y. (2012). A Ring and Clustering Routing Scheme Based on Data Field in Sensor Network. In: J. (Jong Hyuk) Park, J., Chao, HC., S. Obaidat, M., Kim, J. (eds) Computer Science and Convergence. Lecture Notes in Electrical Engineering, vol 114. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-2792-2_18
Download citation
DOI: https://doi.org/10.1007/978-94-007-2792-2_18
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-2791-5
Online ISBN: 978-94-007-2792-2
eBook Packages: EngineeringEngineering (R0)