Abstract
In sensor networks, due to the limited resources of sensor nodes, energy efficiency is an important issue. Clustering reduces communication between sensor nodes and improves energy efficiency by transmitting the data collected from cluster members by a cluster header to a sink node. Due to the frequency characteristics in a wireless communication environment, interference and collision may occur between neighboring clusters, which may lead causing network overhead and increasing energy consumption due to the resulting re-transmission. Inter-cluster interference and collisions can be resolved by allocating non-overlapping channels between neighboring clusters. In our previous study, a channel allocation algorithm is proposed. It allocates exclusive channels among neighbor clusters in various polygonal cluster networks. But, we have found that channel collision occurs among neighbor clusters in the process of applying the algorithm in complex cluster topologies. In order to complete the non-collision channel allocation, a straightforward algorithm which has not completed in the previous studies is proposed. We provide 4 rules for proving the proposed algorithm has no weakness. The result of experiment shows that our proposed algorithm successfully allocates exclusive channels between neighboring clusters using only 4 channels in a very complex cluster topology environment.
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
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the Hwaii International Conference on System Science, pp. 1–10, January 2000
Iyengar, S.S., Brooks, R.R.: Distributed Sensor Networks: Sensor Networking and Applications. CRC Press, Boca Raton (2013)
Branch, J.W., Giannella, C., Szymanski, B., Wolff, R., Kargupta, H.: In-network outlier detection in wireless sensor networks. J. Knowl. Inf. Syst. 34(1), 23–54 (2013)
Bhanumathi, V., Dhanasekaran, R.: Path discovery and selection for energy efficient routing with transmit power control in MANET. Malays. J. Comput. Sci. 26(2), 124–139 (2013)
Hong, T.-P., Cheng-Hsi, W.: An improved weighted clustering algorithm for determination of application nodes in heterogeneous sensor networks. J. Inf. Hiding Multimed. Signal Process. 2(2), 173–184 (2011)
Karaboga, D., Okdem, S., Ozturk, C.: Cluster based wireless sensor network routing using artificial bee colony algorithm. Wirel. Netw. 18(7), 847–860 (2012)
Lin, H., Uster, H.: Exact and heuristic algorithms for data-gathering cluster-based wireless sensor network design problem. IEEE/ACM Trans. Netw. 22(3), 903–916 (2014)
Baziana, P.A., Pountourakis, I.E.: A channel reuse strategy with adaptive channel allocation for all-optical WDM networks. Opt. Switch. Netw. 10(3), 246–257 (2013)
Karaoglu, B., Heinzelman, W.: Cooperative load balancing and dynamic channel allocation for cluster-based mobile ad hoc networks. IEEE Trans. Mob. Comput. 14(5), 951–963 (2015)
Leem, I.T., Wu, M., Kim, C.: A MAC scheme for avoiding inter-cluster collisions in wireless sensor networks. In: 2010 the 12th International Conference on Advanced Communication Technology (ICACT), pp. 284–288, 7–10 February 2010
Wu, M., Leem, I., Jung, J.J., Kim, C.: A resource reuse method in cluster sensor networks in ad hoc networks. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ACIIDS 2012. LNCS, vol. 7197, pp. 40–50. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28490-8_5
Wu, M., Ahn, B., Kim, C.: A channel reuse procedure in clustering sensor networks. In: Applied Mechanics and Materials, vol. 284–287, pp. 1981–1985 (2012)
Wu, M., Ha, S., Abdullah, T., Kim, C.: Exclusive channel allocation methods based on four-color theorem in clustering sensor networks. In: Camacho, D., Kim, S.-W., Trawiński, B. (eds.) New Trends in Computational Collective Intelligence Studies in Computational Intelligence, vol. 572, pp. 107–116. Springer, Cham (2015)
Allaire, F., Swart, E.R.: A systematic approach to the determination of reducible configurations in the four-color conjecture. J. Comb. Theor. Ser. B 25, 339–362 (1978)
Robertson, N.: The four-colour theorem. J. Comb. Theor. Ser. B 70, 2–44 (1997)
Thomas, R.: An update on the four-color theorem. Not. Am. Math. Soc. 45, 848–859 (1998)
Eliahow, S.: Signed diagonal flips and the four color theorem. Eur. J. Comb. 20, 641–647 (1999)
Hodneland, E., Tai, X.-C., Gerdes, H.-H.: Four-color theorem and level set methods for watershed segmentation. Int. J. Comput. Vis. 82, 264–283 (2009)
Wu, M., Park, H., Zhu, W., Kim, C.: A solution for local channel collisions in sensor networks. Int. J. Control Autom. 9, 151–162 (2016)
Mary, W., Kim, C.: A cost matrix agent for shortest path routing in ad hoc networks. J. Netw. Comput. Appl. 33, 646–652 (2010)
Acknowledgements
This work was funded by the BK21+ program of the National Research Foundation of Korea (NRF). This research was also supported by The Leading Human Resource Training Program of the Regional Neo industry through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (216C000360).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Kim, C., Wu, M., Hong, J. (2017). Allocation Four Neighbor Exclusive Channels to Polyhedron Clusters in Sensor Networks. In: Jung, J., Kim, P. (eds) Big Data Technologies and Applications. BDTA 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 194. Springer, Cham. https://doi.org/10.1007/978-3-319-58967-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-58967-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58966-4
Online ISBN: 978-3-319-58967-1
eBook Packages: Computer ScienceComputer Science (R0)