Flexible Congestion Management for Error Reduction in Wireless Sensor Networks

The dissertation is concerned with the efficient resolution of data congestion on wireless sensor networks (WSNs). WSNs are of increasing relevance due to their applications in automation, industrial processes, natural-disaster detection, weather prediction, and climate monitoring. In large WSNs where measurements are periodically made at each node in the network and sent in a multi-hop fashion via the network tree to a single base-station node, the volume of data at a node may exceed the transmission capabilities of the node. This type of congestion can negatively impact data accuracy when packets are lost in transmission. We propose flexible congestion management for sensor networks (FCM) as a data-collection scheme to reduce network traffic and minimize the error resulting from data-volume reduction. FCM alleviates all congestion by lossy data fusion, encourages opportunistic fusion with an application-specific distortion tolerance, and balances network traffic. We consider several data-fusion methods including the k-means algorithm and two forms of adaptive summarization. Additional fusion is allowed when like data may be fused with low error up to some limit set by the user of the data-collection application on the network. Increasing the error limit tends to reduce the overall traffic on the network at the cost of data accuracy. When a node fuses more data than is required to alleviate congestion, its siblings are notified that they may increase the sizes of their transmissions accordingly. FCM is further improved to re-balance the network

[1]  Michael R. Lyu,et al.  PORT: a price-oriented reliable transport protocol for wireless sensor networks , 2005, 16th IEEE International Symposium on Software Reliability Engineering (ISSRE'05).

[2]  Kai Han,et al.  Energy-efficient reliable data dissemination in duty-cycled wireless sensor networks , 2013, MobiHoc.

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

[4]  Lei Yu,et al.  Congestion-adaptive data collection with accuracy guarantee in cyber-physical systems , 2015, 2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

[5]  Jun Sun,et al.  Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.

[6]  Alan M. Frieze,et al.  Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.

[7]  Frederick R. Forst,et al.  On robust estimation of the location parameter , 1980 .

[8]  Jun Yang,et al.  Constraint chaining: on energy-efficient continuous monitoring in sensor networks , 2006, SIGMOD Conference.

[9]  Ramesh Govindan,et al.  Quasi-static Centralized Rate Allocation for Sensor Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[10]  Baltasar Beferull-Lozano,et al.  On network correlated data gathering , 2004, IEEE INFOCOM 2004.

[11]  A. P. Williams,et al.  Impact of anthropogenic climate change on wildfire across western US forests , 2016, Proceedings of the National Academy of Sciences.

[12]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[13]  Yan Gao,et al.  Towards optimal rate allocation for data aggregation in wireless sensor networks , 2011, MobiHoc '11.

[14]  Haizhou Wang,et al.  Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming , 2011, R J..

[15]  Lei Yu,et al.  Data Collection with Accuracy-Aware Congestion Control in Sensor Networks , 2019, IEEE Transactions on Mobile Computing.

[16]  Özgür B. Akan,et al.  ESRT: event-to-sink reliable transport in wireless sensor networks , 2003, MobiHoc '03.

[17]  Huang Lee,et al.  Towards Energy-Optimal and Reliable Data Collection via Collision-Free Scheduling in Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Sartaj Sahni,et al.  An online heuristic for maximum lifetime routing in wireless sensor networks , 2006, IEEE Transactions on Computers.

[19]  Sariel Har-Peled,et al.  How Fast Is the k-Means Method? , 2005, SODA '05.

[20]  Christos G. Cassandras,et al.  On maximum lifetime routing in Wireless Sensor Networks , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[21]  Xiaohua Jia,et al.  Minimum-latency aggregation scheduling in multihop wireless networks , 2009, MobiHoc '09.

[22]  Yuan He,et al.  Adaptive Approximate Data Collection for Wireless Sensor Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[23]  Ramesh Govindan,et al.  RCRT: Rate-controlled reliable transport protocol for wireless sensor networks , 2010, TOSN.

[24]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[25]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2002, SCG '02.

[26]  Vishnu Navda,et al.  Efficient gathering of correlated data in sensor networks , 2008, TOSN.