Priority-aware hybrid scheduling for fast, energy-efficient max function computation in single-hop networks

In recent years, to efficiently deliver a specific function value is of great importance in sensing and monitoring wireless sensor networks. In this study, a priority-aware hybrid scheduling scheme is proposed to achieve fast decentralised energy-efficient max function computation in a single-hop network. In the authors’ proposed scheme, priority-aware time division multiple access (TDMA) scheme is used to first schedule the transmission. In contrast to traditional TDMA, where all the nodes in a network take turns to transmit, in the authors’ proposed scheme, the node with the maximum value is given the priority to transmit. However, the problem of collision exists and this still limits the performance of TDMA-based scheme. Therefore, in order to improve the performance with the influence of collision, code division multiple access (CDMA) is introduced to recover information whenever collision occurs. To solve this, an optimisation problem is formulated to minimise average computation time subjected to the constraints on failure probability. The synergy of CDMA and TDMA contributes to reduction of computation failure probability as well as average computation delay. Moreover, when compared with the traditional round-robin TDMA transmission, the scheduling rule in the proposed scheme helps to reduce number of transmissions for a single computation. Therefore, a reduction in energy consumption occurs as well. Numerical results show that our algorithm reduces average computation time and energy consumption for one-shot max function computation, and with the advantage of better scalability.

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[3]  Shaojie Tang,et al.  Efficient data aggregation in multi-hop wireless sensor networks under physical interference model , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[4]  Michael Gastpar,et al.  Multi-round computation of type-threshold functions in collocated Gaussian networks , 2013, 2013 IEEE International Symposium on Information Theory.

[5]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[6]  Xinbing Wang,et al.  Function Computation over Heterogeneous Wireless Sensor Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[7]  Panganamala Ramana Kumar,et al.  Toward a theory of in-network computation in wireless sensor networks , 2006, IEEE Communications Magazine.

[8]  Siba K. Udgata,et al.  A novel architecture for intelligent and adaptive wireless sensor network based alarming system , 2009, 2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN).

[9]  Neelesh B. Mehta,et al.  Quick, Decentralized, Energy-Efficient One-Shot Max Function Computation Using Timer-Based Selection , 2015, IEEE Transactions on Communications.

[10]  Weidong Xiao,et al.  Minimum-latency data aggregation in duty-cycled wireless sensor networks under physical interference model , 2013, 2013 22nd Wireless and Optical Communication Conference.

[11]  Li Xiao,et al.  The Evolution of MAC Protocols in Wireless Sensor Networks: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[12]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[13]  Panganamala Ramana Kumar,et al.  Optimal Computation of Symmetric Boolean Functions in Collocated Networks , 2013, IEEE Journal on Selected Areas in Communications.

[14]  Jorge M. Finochietto,et al.  In-Network Filtering Schemes for Type-Threshold Function Computation in Wireless Sensor Networks , 2014, Int. J. Distributed Sens. Networks.

[15]  Jiajia Huang,et al.  Fast timer-based maximum function computation over noisy multiple access channels , 2016, 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[16]  Jie Wu,et al.  EECS: an energy efficient clustering scheme in wireless sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[17]  Piyush Gupta,et al.  Information-theoretic bounds for multiround function computation in collocated networks , 2009, 2009 IEEE International Symposium on Information Theory.

[18]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[19]  Slawomir Stanczak,et al.  Robust Analog Function Computation via Wireless Multiple-Access Channels , 2012, IEEE Transactions on Communications.

[20]  Bhaskar Krishnamachari,et al.  Experimental study of concurrent transmission in wireless sensor networks , 2006, SenSys '06.

[21]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[22]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[23]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[24]  Anurag Kumar,et al.  Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[25]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.

[26]  D. Manjunath,et al.  On Distributed Function Computation in Structure-Free Random Wireless Networks , 2014, IEEE Transactions on Information Theory.