Downloaded 12 times
JPN1414 Distributed Deployment Algorithms for Improved Coverage in a Network of Wireless Mobile Sensors
- 1. Distributed Deployment Algorithmsfor Improved Coverage in a Network of Wireless Mobile Sensors ABSTRACT: In this paper, efficient sensor deployment strategies are developed to increase coverage in wireless mobile sensor networks. The sensors find coverage holes within their Voronoi polygons and then move in an appropriate direction to minimize them. Novel edge-based and vertex-based strategies are introduced, and their performances are compared with existing techniques. The proposed movement strategies are based on the distances of each sensor and the points inside its Voronoi polygon from the edges or vertices of the polygon. Simulations confirm the effectiveness of the proposed deployment algorithms and their superiority to the techniques reported in the literature. EXISTING SYSTEM: The basic protocol approach is proposed, where the sensors find their final destination using an iterative procedure. An alternative technique, namely virtual movement protocol, is proposed in which does not require the sensors to move physically unless the communication cost is too high or the final destinations are determined. Three distributed self-deployment algorithms are subsequently
- 2. proposed to determinethe final destination of the sensors: 1) VOR (Voronoi-based algorithm); 2) VEC (vector-based algorithm); and 3) Minimax. In the VOR algorithm, the distance of each sensor from the vertices of its Voronoi polygon is obtained, and the desired location for the sensor is calculated accordingly. The VEC algorithm, on the other hand, is a “proactive” strategy under which the sensors are relocated to achieve an even distribution in the sensing field. DISADVANTAGES OF EXISTING SYSTEM: The above techniques are effective in terms of coverage, they suffer from a number of short-comings. Sensing coverage achieved by the VEC algorithm may not be satisfactory compared with other methods, when there is a relatively large number of sensors in the network. PROPOSED SYSTEM: In this paper, four new techniques are introduced to increase coverage in a mobile sensor network. The Maxmin-vertex and Maxmin-edge algorithms tend to maximize the minimum distance of every sensor from the vertices and edges,
- 3. respectively, of itsVoronoi polygon. The Minimax-edge algorithm, on the other hand, tends to minimize the maximum distance of every sensor from the edges of its Voronoi polygon. Finally, the VEDGE algorithm is a combination of the Maxmin-edge algorithm (as an edge-based technique) and the Minimax algorithm (as a vertex-based technique). The main characteristic of these algorithms is that the sensor movement is performed iteratively, and the coverage is guaranteed to increase after each iteration. ADVANTAGES OF PROPOSED SYSTEM: The proposed techniques are evaluated by simulation in terms of coverage performance, convergence rate, and energy-efficiency more when compared to previous approaches. This function assists in sending the bait address to entice the malicious nodes and to utilize the reverse tracing program of the CBDS to detect the exact addresses of malicious nodes.
- 4. SYSTEM REQUIREMENTS: HARDWAREREQUIREMENTS: System : Pentium IV 2.4 GHz. Hard Disk : 40 GB. Floppy Drive : 1.44 Mb. Monitor : 15 VGA Colour. Mouse : Logitech. Ram : 512 Mb. SOFTWARE REQUIREMENTS: Operating system : Windows XP/7/LINUX. Implementation : NS2 NS2 Version : NS2.2.28 Front End : OTCL (Object Oriented Tool Command Language) Tool : Cygwin (To simulate in Windows OS)
- 5. REFERENCE: Hamid Mahboubi,Member, IEEE, Kaveh Moezzi, Member, IEEE, Amir G. Aghdam, Senior Member, IEEE, Kamran Sayrafian-Pour, Senior Member, IEEE, and Vladimir Marbukh, Senior Member, IEEE, “Distributed Deployment Algorithms for Improved Coverage in a Network of Wireless Mobile Sensors”, IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 10, NO. 1, FEBRUARY 2014.