Market-Based Sensor Relocation by Robot Team in Wireless Sensor Networks

Randomly scattered sensors may cause sensing holes and redundant sensors. In carrier-based sensor relocation, mobile robots (with limited capacity to carry sensors) pick up additional or redundant sensors and relocate them at sensing holes. In the only known localized algorithm, robots randomly traverse field and act based on identified pair of spare sensor and coverage hole. We propose a Market-based Sensor Relocation (MSR) algorithm, which optimizes sensor deployment location, and introduces bidding and coordinating among neighboring robots. Sensors along the boundary of each hole elect one of them as the representative, which bids to neighboring robots for hole filling service. Each robot randomly explores by applying Least Recently Visited policy. It chooses the best bid according to Cost over Progress ratio and fetches a spare sensor nearby to cover the corresponding sensing hole. Robots within communication range share their tasks to search for better possible solutions. Simulation shows that MSR outperforms the existing competing algorithm G-R3S2 significantly on total robot traversed path and energy, and time to cover holes, slightly on number of sensors needed to cover the hole and number of sensor messages for bidding and deployment location sharing.

[1]  Wee Keong Ng,et al.  Prolonging Lifespan of Sensor Networks Using Redundant Nodes , 2013, Ad Hoc Sens. Wirel. Networks.

[2]  Ivan Stojmenovic,et al.  TOPICS IN AD HOC AND SENSOR NETWORKS , 2022 .

[3]  Y. Charlie Hu,et al.  Sensor replacement using mobile robots , 2007, Comput. Commun..

[4]  Ivan Stojmenovic,et al.  Placing Sensors for Area Coverage in a Complex Environment by a Team of Robots , 2014, TOSN.

[5]  Amiya Nayak,et al.  Carrier-Based Coverage Augmentation in Wireless Sensor and Robot Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops.

[6]  Ivan Stojmenovic,et al.  Randomized carrier-based sensor relocation in wireless sensor and robot networks , 2013, Ad Hoc Networks.

[7]  Weidong Hu,et al.  Sleep–wake up scheduling with probabilistic coverage model in sensor networks1 , 2014, Int. J. Parallel Emergent Distributed Syst..

[8]  Gaurav S. Sukhatme,et al.  Coverage, Exploration and Deployment by a Mobile Robot and Communication Network , 2004, Telecommun. Syst..

[9]  Ivan Stojmenovic,et al.  The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach , 2010, IEEE Congress on Evolutionary Computation.

[10]  Ibrahim Kamel,et al.  Energy-efficient distributed wireless sensor network scheme for cluster detection , 2013, Int. J. Parallel Emergent Distributed Syst..

[11]  Ridha Soua,et al.  Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks , 2010, 2010 Ninth International Conference on Networks.

[12]  Ivan Stojmenovic,et al.  Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage , 2011, IEEE Transactions on Mobile Computing.

[13]  Ivan Stojmenovic,et al.  Greedy Extension of Localized Auction Based Protocols for Wireless Actuator Task Assignment , 2012, Ad Hoc Sens. Wirel. Networks.

[14]  Ivan Stojmenovic,et al.  Localized Ant Colony of Robots for Redeployment in Wireless Sensor Networks , 2014, J. Multiple Valued Log. Soft Comput..

[15]  Ivan Stojmenovic,et al.  Localized Sensor Area Coverage with Low Communication Overhead , 2008, IEEE Trans. Mob. Comput..

[16]  Thomas F. La Porta,et al.  A bidding protocol for deploying mobile sensors , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..