Reducing Idle Listening during Data Collection in Wireless Sensor Networks

Data collection is one of the predominant operations in wireless sensor networks. This paper focuses on the problem of efficient data collection in a setting where some nodes may not possess data each time data is collected. In that case, idle listening slots may occur, which lead to a waste of energy and an increase in latency. To alleviate these problems, successive-slot schedules were proposed by Zhao and Tang (Infocom 2011). In this paper, we introduce a so-called extra-bit technique to reduce idle listening further. Each packet includes an extra bit that informs the receiver whether further data packets will follow or not. The extra-bit technique leads to significantly reduced idle listening and improved latency in many cases. We prove that every successive-slot schedule is also an extra-bit schedule. We then consider the special case of linear networks and prove that the optimal length of a successive-slot schedule (or extra-bit schedule) is 4N - 6 time slots, where N ≥ 3 is the number of nodes excluding the sink. Then the proposed extra-bit technique is compared with the successive-slot technique with respect to the expected amount of idle listening, and it is shown that the extra-bit technique reduces idle listening substantially.

[1]  Xiao-Dong Hu,et al.  Minimum Data Aggregation Time Problem in Wireless Sensor Networks , 2005, MSN.

[2]  Pramod K. Varshney,et al.  Data-aggregation techniques in sensor networks: a survey , 2006, IEEE Communications Surveys & Tutorials.

[3]  Ying Zhang,et al.  Distributed time-optimal scheduling for convergecast in wireless sensor networks , 2008, Comput. Networks.

[4]  Bhaskar Krishnamachari,et al.  Fast Data Collection in Tree-Based Wireless Sensor Networks , 2012, IEEE Transactions on Mobile Computing.

[5]  Stephan Olariu,et al.  Training a Wireless Sensor Network , 2005, Mob. Networks Appl..

[6]  Siddhartha Chauhan,et al.  A Survey on Scheduling Algorithms for Wireless Sensor Networks , 2011 .

[7]  Xueyan Tang,et al.  Scheduling data collection with dynamic traffic patterns in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[8]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[9]  Ju Wang,et al.  Scheduling for information gathering on sensor network , 2009, Wirel. Networks.

[10]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[11]  Archana Bharathidasan,et al.  Sensor Networks : An Overview , 2002 .

[12]  Xueyan Tang,et al.  Scheduling Sensor Data Collection with Dynamic Traffic Patterns , 2013, IEEE Transactions on Parallel and Distributed Systems.

[13]  Daniel Minoli,et al.  Wireless Sensor Networks: Technology, Protocols, and Applications , 2007 .

[14]  Haibo Zhang,et al.  Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks , 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[15]  Yang Yang,et al.  Interference-aware convergecast scheduling in wireless sensor/actuator networks for active airflow control applications , 2014, Wirel. Commun. Mob. Comput..