Home > Academic & Technology > Information-Driven Distributed Coverage Algorithms for Mobile Sensor Networks

Information-Driven Distributed Coverage Algorithms for Mobile Sensor Networks

This paper has been published in the 8th IEEE International Conference on Networking, Sensing and Control (ICNSC) in Delft, The Netherland. This paper is one of the three researches I did during my spare time in last semester of my bachelor study.

I worked with Mas Iman who works in Prof. Sandra Hirce’s lab in TU Munich, Germany. The idea of this research is mainly to develop an algorithm for isolated agent(s) i.e. robot or other autonomous vehicles in a networks. We consider the communication capability as the weapon of the solution. More/less this paper has kind of relation with Finite Energy Coverage Control with Limited Range Anisotropic Sensor for Mobile Sensor Networks (extended).

Unfortunately, I couldn’t join the conference in Delft. Since, I just join a company where vacation is not allowed for the first year and they didn’t want to put it as business trip. However, doing a research is a fun. The following is the abstract of this research:

When mobile sensors are initially deployed, some sensors may be located far away from the region of interest and due to the sensor’s limited sensing of range, some sensors may not be able to participate in the coverage task. This paper proposes a new algorithm on the coverage problem for mobile sensor networks which guarantees all sensors to participate in the coverage task. The algorithm is a combination of the standard gradient-based coverage algorithm and leader following algorithm and is designed to maximize the joint detection probabilities of the events in the region of interest. First, leader sensors are selected based on the information which each sensor has gathered. The rest of the sensors will follow the leaders until they have sufficient information on the region of interest and then switch to the standard coverage algorithm. The proposed algorithm can be performed in a distributed manner. Moreover, the proposed algorithm could also improve the convergence speed of the coverage task. The results are validated through numerical simulations.

In my opinion, there are at least, 3 future actions of this paper that we can do:

  1. Consider the dynamic communication graph (paper has been submitted)
  2. Consider the optimization of communication cost (still no follow up)
  3. Consider the energy consumption and sensing area (has been written in my thesis, but has not published yet)

Thus, ideas have been developed. Just need to conduct the research if there is a time. I guess I need a partner since I start working.

To see/download the paper click here.

Happy to discuss

Best Regards,

Risvan Dirza

Categories: Academic & Technology
  1. soni
    August 7, 2011 at 5:21 pm

    Wow, you are so productive 🙂
    How about if students of EE help you in your research, as their final project topics?
    And you are the supervisor 😉

    • August 7, 2011 at 5:52 pm

      To be honest, sometimes jobs take my weekend, Pak. As a result, some researches left behind.
      With my pleasure. That would be an honor, Pak 🙂
      Let me know, if there are any of them find this interesting. 🙂

  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: