Presentation on theme: "Optimized area coverage and data routing strategy in Mobile WSN Mudit Raj Gupta (2008B2A8585G) Ravi Prakash Lakhotia (2008A7PS021G)"— Presentation transcript:
Optimized area coverage and data routing strategy in Mobile WSN Mudit Raj Gupta (2008B2A8585G) Ravi Prakash Lakhotia (2008A7PS021G)
Problem Statement Motes have to cover a specified area (green) and report mines (yellow), as and when detected (Considering probability of detecting the mines <1).
Assumptions Sensing Range(pink) < Coverage Range(blue+pink) Base Station is in the center(red) All robots are identical(black) 2 Dimensional Area(green) All robots have advance positioning device Base station has good processing power
Constrains Motes (or robots) not in Base station Coverage area(light blue) Motes have limited resources
Objective Complete Area Coverage Avoiding or reducing re – coverage Minimizing Covering Time Energy Efficiency N-Hop connection between all nodes and base station at all times
Approach Dividing the area into Sensing squares (s)  Making a Coverage Super square of each bot (c)  Mark and Walk Algorithm  Optimization using Base station Global Map ACO based routing with reduces Overhead