Clustering in Wireless Multimedia Sensor Networks Using Spectral Graph Partitioning

Pushpender Kumar, Narottam Chand

Department of Computer Science and Engineering, National Institute of Technology, Hamirpur, India.

DOI: 10.4236/ijcns.2013.63015                

Abstract

Wireless multimedia sensor network (WMSN) consists of sensors that can monitor multimedia data from its surrounding, such as capturing image, video and audio. To transmit multimedia information, large energy is required which decreases the lifetime of the network. In this paper we present a clustering approach based on spectral graph partitioning (SGP) for WMSN that increases the lifetime of the network. The efficient strategies for cluster head selection and rotation are also proposed.

Keywords

Wireless Multimedia Sensor Network; Eigenvector; Spectral Graph Partitioning

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	F. Akyldiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, Vol. 38, No. 4, 2002, pp. 393-422. doi:10.1016/S1389-1286(01)00302-4
[2]	B. Elbhiri, S. El Fkihi, R. Saadane and D. Aboutajdine, “Clustering in Wireless Sensor Network Based on Near Optimal Bi-Partitions,” EURO-NF Conference on Next Generation Internet (NGI), 2-4 June 2010, pp. 1-6.
[3]	Y. Wang and G. H. Cao, “On Full-View Coverage in Camera Sensor Networks,” IEEE International Conference on Computer Communications (INFOCOM), 10-15 April 2011, pp. 1781-1789.
[4]	I. F. Akyildiz, T. Melodia and K. R. Chowdhury, “A Survey on Wireless Multimedia Sensor Networks,” Computer Networks, Vol. 51, No. 4, 2007, pp. 921-960. doi:10.1016/j.comnet.2006.10.002
[5]	A. Newell and K. Akkaya, “Self-Actuation of Camera Sensors for Redundant Data Elimination in Wireless Multimedia Sensor Networks,” IEEE International Conference on Communication, 14-15 June 2009, pp. 1-5.
[6]	C. Intanagonwiwat, R. Govindan and D. Estrin, “Directed Diffusion for Wireless Sensor Network,” ACM/IEEE Transactions on Networking (TON), Vol. 11, No. 1, 2003, pp. 2-16. doi:10.1109/TNET.2002. 808417
[7]	M. Chatterjee, S. K. Das and D. Turgut, “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks,” Journal of Cluster Computing, Vol. 5, No. 2, 2002, pp. 193-204. doi:10.1023/A:101 3941929408
[8]	S. Banerjee and S. Khuller, “A Clustering Scheme for Hierarchical Control in Multi-Hop Wireless Networks,” IEEE International Conference on Computer Communications (INFOCOM), 16-21 July 2001, pp. 1028-1037.
[9]	A. Garg and M. Hanmandlu, “An Energy-Aware Adaptive Clustering Protocol for Sensor Networks,” International Conference on Intelligent Sensing and Information Processing (ICISIP), 2006, pp. 13-30.
[10]	D. Lu, N. Jie and X.-X. Huang, “Clustering Based Spectrum Allocation Scheme in Mobile Ad Hoc Networks,” Bulletin of Advanced Technology Research (BATR), Vol. 5, No. 12, 2011, pp. 37-41.
[11]	B. Auffarth, “Spectral Graph Clustering,” Course Report. http://www-lehre.inf.uos.de/~bauffart/ spectral.pdf
[12]	Adjacency Matrix Wikipedia. http://en.wikipedia.org/wiki/Adjacency_matrix
[13]	A. Bertrand and M. Moonen, “Distributed Computation of the Fiedler Vector with Application to Topology Inference in Ad Hoc Networks,” Signal Processing, Vol. 93, No. 5, 2013, pp. 1106-1117.
[14]	A. Savvides, C. Han and M. B. Srivastva, “Dynamic Fine-Grained Localization in Ad Hoc Networks of Sensors,” International Conference on Mobile Computing and Networking (MOBICOM), 16-21 July 2001, pp. 166-179. doi:10.1145/381677.381693
[15]	N. Bulusu, J. Heidemann and D. Estrin, “GPS-Less Low Cost Outdoor Localization for Very Small Devices,” IEEE Personal Communication Magazine, Vol. 7, No. 5, 2000, pp. 28-34.