Dynamic Service Execution in Sensor Networks

Sensor networks face a number of challenges when deployed in unpredictable environments under dynamic, quickly changeable demands, and when shared by many partners, which is often the case in military and security applications. To partially address these challenges, we present a novel target tracking algorithm that can be deployed on various sensor nodes and invoked dynamically when needed by the presence of targets. We also demonstrate that an auction-based mechanism can be used to provide efficient and localized wireless sensor network congestion management for bursty traffic of abstract services based just on user-assigned priorities to different services and the quality of information provided by the services. We present results from using this auction mechanism to resolve congestion caused by packets from competing target tracking missions.

[1]  Srikanth V. Krishnamurthy,et al.  A rate control framework for supporting multiple classes of traffic in sensor networks , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[2]  P.M. Djuric,et al.  Signal processing by particle filtering for binary sensor networks , 2004, 3rd IEEE Signal Processing Education Workshop. 2004 IEEE 11th Digital Signal Processing Workshop, 2004..

[3]  Chatschik Bisdikian,et al.  On Sensor Sampling and Quality of Information: A Starting Point , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[4]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[5]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.

[6]  David Evans,et al.  Localization for mobile sensor networks , 2004, MobiCom '04.

[7]  H. Balakrishnan,et al.  Mitigating congestion in wireless sensor networks , 2004, SenSys '04.

[8]  Hichem Snoussi,et al.  Binary Variational Filtering for Target Tracking in Sensor Networks , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[9]  Nisheeth Shrivastava,et al.  Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms , 2006, SenSys '06.

[10]  Boleslaw K. Szymanski,et al.  Distributed Target Tracking with Imperfect Binary Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[11]  Zijian Wang,et al.  A Distributed Cooperative Target Tracking with Binary Sensor Networks , 2008, ICC Workshops - 2008 IEEE International Conference on Communications Workshops.

[12]  Jeung-Yoon Choi,et al.  On target tracking with binary proximity sensors , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[13]  Ronaldo M. Salles,et al.  Lexicographic maximin optimisation for fair bandwidth allocation in computer networks , 2008, Eur. J. Oper. Res..

[14]  Boleslaw K. Szymanski,et al.  A novel auction mechanism for selling time-sensitive e-services , 2005, Seventh IEEE International Conference on E-Commerce Technology (CEC'05).

[15]  Ruzena Bajcsy,et al.  Congestion control and fairness for many-to-one routing in sensor networks , 2004, SenSys '04.

[16]  Chieh-Yih Wan,et al.  CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.

[17]  Gul Agha,et al.  Cooperative tracking with binary-detection sensor networks. , 2003 .

[18]  Juong-Sik Lee,et al.  Auctions as a Dynamic Pricing Mechanism for E-Services , 2007 .

[19]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..