A Comparison of Algorithms for Deployment of Heterogeneous Sensors

Abstract
Authors
Keywords
Conclusion
References

Wireless Sensor Networks are most commonly used networks. The deployment of sensors has several issues like connectivity, coverage and life time. In this work we propose an algorithm for heterogeneous deployment of the sensors so that th study e range of sensors do not overlap. Also the sensors are within the boundary of the region. Here we deploy sensors having different radii and study the various types of deployment in terms of number of sensors deployed and are covered.

Published In : IJCSN Journal Volume 6, Issue 5

Date of Publication : October2017

Pages : 594-598

Figures :03

Tables : --

Amol A Lachake : working in Dr. D Y.Patil SOET,Lohegoan Pune, has Completed ME in Computer Engg from PICT Pune. He has interest in research area of Algorithm and Heuristic search techniques.

Sensor networks, Connectivity, circle packing, deployment

Here we have compared the variants of sensor deployment. The variants used corner and centre placing of the sensors. Corner placed deployment gives a better coverage then centre one.

[1] A. A. Lachake , and G.P. Potdar, “An Algorithm for Deployment of Homogeneous Sensors” IJCSN International Journal of Computer Science and Network, Volume 3, Issue 3,June 2014 ISSN (Online) : 2277-5420. [2] Tao Yea,b, Wenqi Huanga, Zhipeng L¨ua, “Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle” June 2013. [3] Ramadan, Rabie A.,Salah Abdel-Mageid ,”Efficiient Deployment of Connected Sensing Devices Using Circle Packing Algorithm” in the proceedings of First International Conference, AIS 2010, Povoa de Varzim, Portugal, June 21-23, 2010. [4] X. Bai, S. Kumar, Z. Yun, D. Xuan, and T. Lai., “Deploying wireless sensors to achieve both coverage and connectivity,” In Proceedings of the Seventh International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc), pp. 131 - 142 , 2006. [5] M. Yu, M. H., and M. M., “A survey of network management architecture in wirelesssensor network,” Proceeding of PGNET 2006, pp. 201–206, 2006. [6] W. Huang, Y. LI, K. Akeb, and C. Min, ``Greedy algorithms for packing unequal circles into a rectangular container'', in Journal of the Operational Research Society (JORS), Vol. 6, No. 5, pp. 539-548, 2005. [7] Hifi M. and M’Hallah R. Approximate algorithms for constrained circular cutting problems.Computers and Operations Research 31: 675-694, 2004. [8] Stoyan Yu G. and Yoskov G. A mathematical model and a solution method for the problem of placing varioussized circle into a strip. European Journal of Operational Research, In Press, Corrected Proof, Available online 15 May 2003. [9] V. M.A.M., C. C.N.Jr., da Silva D.C., and J. da Mata, “Survey on wireless sensor network devices,” IEEE Conference Emerging Technologies and Factory Automation, Proceedings. ETFA ’2003, vol. 1, pp. 537– 544. [10] A. Howard, J. Mataric, and G. Sukhatme, “An incremental self-deployment algorithm for mobile sensor networks, ” in Autonomous Robots, Special Issue on Intelligent Embedded Systems, vol. 13 , pp. 113– 126, 2002. [11] Stoyan Yu G. and Yaskov G. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int. Trans. Operational Research 5 1998: 45- 57. [12] V Chavtal “A combinatorial theorem in Plane Geomerty”, Journal of Computorial Theory (B) vol 18 1975,pp 39-41.