Allocation four neighbor exclusive channels to polyhedron clusters in sensor networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Kim, C. G., Wu, M., & Hong, J. (2017). Allocation four neighbor exclusive channels to polyhedron clusters in sensor networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 194 LNICST, pp. 29–39). Springer Verlag. https://doi.org/10.1007/978-3-319-58967-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free