PROJECT TITLE :

Dynamic Coverage of Mobile Sensor Networks - 2013

ABSTRACT:

We study the dynamic aspects of the coverage of a mobile sensor network resulting from continuous movement of sensors. As sensors move around, initially uncovered locations may be covered at a later time, and intruders that might never be detected in a stationary sensor network can now be detected by moving sensors. However, this improvement in coverage is achieved at the cost that a location is covered only part of the time, alternating between covered and not covered. We characterize area coverage at specific time instants and during time intervals, as well as the time durations that a location is covered and uncovered. We further consider the time it takes to detect a randomly located intruder and prove that the detection time is exponentially distributed with parameter 2λrv̅s where λ represents the sensor density, r represents the sensor's sensing range, and v̅s denotes the average sensor speed. For mobile intruders, we take a game theoretic approach and derive optimal mobility strategies for both sensors and intruders. We prove that the optimal sensor strategy is to choose their directions uniformly at random between (0, 2π). The optimal intruder strategy is to remain stationary. This solution represents a mixed strategy which is a Nash equilibrium of the zero-sum game between mobile sensors and intruders.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE : Unsupervised Spectral Feature Selection with Dynamic Hyper-graph Learning ABSTRACT: In order to produce interpretable and discriminative results from unsupervised spectral feature selection (USFS) methods, an embedding
PROJECT TITLE : GloDyNE: Global Topology Preserving Dynamic Network Embedding ABSTRACT: Due to the time-evolving nature of many real-world networks, learning low-dimensional topological representations of networks in dynamic environments
PROJECT TITLE : Fully Dynamic kk-Center Clustering With Improved Memory Efficiency ABSTRACT: Any machine learning library worth its salt will include both static and dynamic clustering algorithms as core components. The sliding
PROJECT TITLE : Exploring Temporal Information for Dynamic Network Embedding ABSTRACT: The task of analyzing complex networks is a challenging one that is attracting an increasing amount of attention. One way to make the analysis
PROJECT TITLE : MAGNETIC: Multi-Agent Machine Learning-Based Approach for Energy Efficient Dynamic Consolidation in Data Centers ABSTRACT: Two of the most significant challenges for effective resource management in large-scale

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry