Abstract

Over the past few years, Wireless HART (WHART) is a fast growing wireless sensor network protocol. In this study, we propose a novel Power predicting, Association and Transmission (PpAT) algorithm for improving the overall power consumption in wireless sensor network. This objective is achieved by means of maintaining, equilibrium among the overall throughput required by the system and the power consumed for receiving and transmitting the information. Here, the power required for transmission is selected by the novel algorithm without the influence of repeated power level measurement in the received signal. This power management is designed in three levels, (i) Cluster Scanning, (ii) Sub-node Association and (iii) Beacon Transmission. Cluster scanning is the process of discovering a new neighborhood cluster for the association of nodes and data transfer. During the association process for achieving robustness, a sub node is associated with the head node. PpAT algorithm gives an opportunity to transmit beacon signals at two different power levels (0 and -20 dBm), so that when both the signals are received successfully a node estimates that it is nearest region of the head node and selects low transmission power. In the other case conventional techniques choose the high transmission power. But, PpAT selects high transmission power only if no near head node is visited by the sub node. Beacon transmission is done based on time-stamp synchronization between master and slave nodes. Simulation results show that the proposed algorithm extends the network lifetime. With these proposals there is scope for increasing their autonomy in wireless sensor networks.

Keywords:

Beacon, cluster scanning, lifetime, power, wireless HART,

References

1. Dust Networks, 2007. Wirelesshart Technical Data Sheet. White Paper, Dust Networks.
   
2. El-Hoiydi, A., J.D. Decotignie, C. Enz and E.L. Roux, 2003. Poster abstract: Wisemac, an ultra low power mac protocol for the wisenet wireless sensor network. Proceeding of the ACM SenSys 03. Los Angeles, California, Poster Abstract.
   
3. Elson, J., L. Girod and D. Estrin, 2002. Fine-grained network time synchronization using reference broadcasts [C]. Proceeding of the 5th Symposium on Operating Systems Design and Implementation (OSDI, 2002), pp: 147-163.
   CrossRef    
4. Ganeriwal, S., R. Kumar and M.B. Srivastava, 2003. Timing-sync protocol for sensor networks. Proceeding of the 1st International Conference on Embedded Networked Sensor Systems (SenSys, 2003).
   CrossRef    
5. Kunzel, G., J.M. Winter, I. Muller, C.E. Pereira and J.C. Netto, 2013. A passive monitoring tool for evaluation of routing in WirelessHART networks. In: Schirner, G. et al. (Eds.), IESS, 2013. IFIP AICT, Springer, Berlin, Heidelberg, 403: 159-170.
   CrossRef    
6. Maróti, M., B. Kusy, G. Simon and A. Lédeczi, 2004. The flooding time synchronization protocol. Proceeding of the ACM 2nd International Conference on Embedded Networked Sensor System (SenSys’s04). NY, USA, pp: 39-49.
   
7. Muller, I., C.E. Pereira and J.C. Netto, 2011. Wireless HART field devices. IEEE Instru. Meas. Mag., 14(6): 20-25.
   CrossRef    
8. Muller, I., J.M. Winter, E.P. De Freitas, J.C. Netto and C.E. Pereira, 2012. Towards Wireless HART protocol decentralization: A proposal overview. In: Andreev, S. et al. (Eds.), NEW2AN/ruSMART, 2012. LNCS 7469, Springer-Verlag, Berlin, Heidelberg, 7469: 248-259.
   CrossRef    
9. Samanta, A.K., A. Mukherjee and S.M. Hossein, 2010. Efficient time synchronization by KD tree in WSN. Proceeding of the 2nd International Conference on. Computer and Automation Engineering (ICCAE, 2010), pp: 655-659.
   
10. Wang, Y., Z. Qian, G. Wang and X. Zhang, 2012. Research on energy efficient time synchronization algorithm for wireless sensor networks. J. Electron. Inform. Technol., 34(9): 2174-2179.
    CrossRef    
11. Yun, Z., L. Zhihao and L. Luming, 2010. Network management in WirelessHART network for industry application. Proceedings of the 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM ’10).
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.