In today’s world wireless sensor networks have most common application of area monitoring. The deployment of Wireless sensor network is concerned with several issues like coverage, connectivity and life time. However coverage is the basic issue when the sensors are deployed in a monitoring field. Here we propose an algorithm in which the sensors are deployed in a field in which the monitoring region does not overlap with other sensor. Also the sensors are deployed within the boundary of the given field. The experiment was done to compare coverage and number of sensors deployed for the sensors having same communication field.

 

Published In : IJCSN Journal Volume 3, Issue 3

Date of Publication : 01 June 2014

Pages : 61 - 65

Figures : 05

Tables : --

Publication Link : An Algorithm for Deployment of Homogeneous Sensors

 

 

 

Amol Lachake : Post Graduate Student, Computer Engg Department, Pune Institute Of Computer Technology Pune. University of Pune.

Girish Potdar : Head of Department, Computer Engg Department, Pune Institute Of Computer Technology Pune. University of Pune.

 

 

 

 

 

 

 

Sensor networks

Connectivity

circle packing

deployment

Here we have compared the two variants of homogeneous sensor deployment. The algorithm deploys all the sensors in a hexagonal pattern. When sensors are placed from corner the coverage is maximum as compared to the centre one. Hence corner placement gives better performance than the centre one. Lesser the range of sensor more is the coverage obtained, but the number of sensors required increases. The number of sensors required increases exponentially as the range decreases. Using this approach we can predict the number of sensors required to cover a given field.

 

 

 

 

 

 

 

 

 

[1] Tao Yea,b, Wenqi Huanga, Zhipeng L¨ua,Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle June 2013.

[2] 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.

[3] 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.

[4] M. Yu, M. H., and M. M., “A survey of network management architecture in wirelesssensor network,” Proceeding of PGNET 2006, pp. 201–206, 2006.

[5] 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.

[6] Hifi M. and M’Hallah R. Approximate algorithms for constrained circular cutting problems.Computers and Operations Research 31: 675-694, 2004.

[7] Stoyan Yu G. and Yoskov G. A mathematical model and a solution method for the problem of placing varioussized circles into a strip. European Journal of Operational Research, In Press, Corrected Proof, Available online 15 May 2003.

[8] 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 ’03, vol. 1, pp. 537– 544, 2003.

[9] 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.

[10] 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: 45- 57,1998.

[11] V Chavtal “A combinatorial theorem in Plane Geomerty”, Journal of Computorial Theory(B) vol 18,pp 39-41,1975.