Abstract
It is critical to improve throughput in real-time wireless sensor networks in order to reduce delay in data gathering and satisfy more real-time applications with tighter deadlines. One approach to achieving this is to construct a tree, such that the sizes of sub-trees of a root are well balanced, and to then assign a unique channel to each sub-tree. However, it is not easy to construct a balanced tree, because each node has to know the current connectivity status of other nodes in the network, which is not reasonable due to the increase in control overhead. We prove that building an optimal balanced tree is NP-Complete. Thus, we devise a heuristic algorithm to efficiently construct a balanced tree that is almost comparable to an optimally balanced tree. Furthermore, we suggest a way that each sub-tree is constructed to increase parallel transmission within itself. We apply the slotted sense multiple access (SSMA) protocol to each sub-tree, and evaluate the new approach with SSMA using a single channel and multi-channel lightweight medium access control. According to simulation results, SSMA using a balanced tree significantly outperforms other protocols in terms of packet delivery ratio and energy consumption.
Similar content being viewed by others
Notes
Irregular interference occurs since the interference range of a wireless signal is always farther than the communications range.
Opportunistic slot reuse: Suppose that there are multiple (sender and receiver) pairs that need data transmission using CSMA. If senders and receivers are not blocked by RTS’s of the other senders or CTS’s of the other receivers, the senders can transmit data simultaneously, thus reusing a sharable slot opportunistically.
Abbreviations
- T(i):
-
{i} + {j|j is a descendant of node i}
- level(i):
-
The level of node i
- R:
-
The transmission range of a node
- d(i,j):
-
The distance of node i and j
- P(i):
-
The parent of node i
- PCL(i):
-
Parent candidate list: the list of parent candidates of node i: \(PCL\left( i \right) = \{ k|d\left( {k,i} \right) \le R,level\left( k \right) = level\left( i \right) - 1)\}\)
- CH(i):
-
Channel: the channel number of node i
- PCCL(i):
-
Parent candidate channel list: the list of channels that the parent candidates of node i hold
- ACL(i):
-
Allocated channel list: the list of channels allocated to the nodes at level i
- NCL(i):
-
Neighbor channel list: the list of channels allocated to the neighbors at the same level
- G(l):
-
The set of nodes located at level l
- S(i):
-
The set of siblings of node i, including itself
- C(i):
-
The list of children for node i
- d(x):
-
Degree of node x: the number of edges outgoing from node x
- TCR(S):
-
The tree construction request message issued by a sink: \(TCR\left( S \right) = \left( {level\left( S \right),\left( {a,b,c, \ldots } \right)} \right)\)
- JREQ:
-
A join request message: JREQ(v) = (v, level(v), CH(v))
- JRES:
-
A join response message: JRES(v) = (v, level(v), CH(v))
- ACK:
-
An acknowledgment message: ACK(v) = (v, level(v), CH(v))
References
Oh, H., & Van Vinh, P. (2013). Design and implementation of a MAC protocol for timely and reliable delivery of command and data in dynamic wireless sensor networks. Sensors, 13(10), 13228.
Wen-Zhan, S., Renjie, H., Shirazi, B., & Lahusen, R. (2009). TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks. In IEEE international conference on pervasive computing and communications, 2009. PerCom 2009, 9–13 March 2009 (pp. 1–10). doi:10.1109/PERCOM.2009.4912757.
Suriyachai, P., Brown, J., & Roedig, U. (2010). Time-critical data delivery in wireless sensor networks. In R. Rajaraman, T. Moscibroda, A. Dunkels, & A. Scaglione (Eds.), Distributed computing in sensor systems: Proceedings of the 6th IEEE international conference, DCOSS 2010, Santa Barbara, June 21–23, 2010 (pp. 216–229). Berlin: Springer.
Petersen, S., & Carlsen, S. (2011). WirelessHART versus ISA100.11a: The format war hits the factory floor. Industrial Electronics Magazine, IEEE, 5(4), 23–34. doi:10.1109/MIE.2011.943023.
Singh, B. K., & Tepe, K. E. (2009). Feedback based real-time MAC (RT-MAC) protocol for wireless sensor networks. In Global telecommunications conference, 2009. GLOBECOM 2009. IEEE, Nov. 30 2009–Dec. 4 2009 (pp. 1–6). doi:10.1109/GLOCOM.2009.5425620.
Hoesel, L. F., & Havinga, P. J. M. (2004). A lightweight medium access protocol (LMAC) for wireless sensor networks: Reducing preamble transmissions and transceiver state switches. In Paper presented at the 1st international workshop on networked sensing systems, INSS 2004, Tokio.
Jungsook, K., Jaehan, L., Pelczar, C., & Byungtae, J. (2008). RRMAC: A sensor network MAC for real time and reliable packet transmission. In IEEE international symposium on consumer electronics, 2008. ISCE 2008, 14–16 April 2008 (pp. 1–4). doi:10.1109/ISCE.2008.4559491.
Vinh, P., & Oh, H. (2012). RSBP: A reliable slotted broadcast protocol in wireless sensor networks. Sensors, 12(11), 14630.
Malhotra, B., Nikolaidis, I., & Nascimento, M. A. (2010). Aggregation convergecast scheduling in wireless sensor networks. Wireless Networks, 17(2), 319–335. doi:10.1007/s11276-010-0282-y.
Chaudhary, M. H., & Scheers, B. (2012). High spatial-reuse distributed slot assignment protocol for wireless ad hoc networks. In Communications and information systems conference (MCC), 2012 Military, 8–9 Oct. 2012 (pp. 1–8).
Jovanovic, M. D., & Djordjevic, G. L. (2007). TFMAC: Multi-channel MAC protocol for wireless sensor networks. In Proceedings of the 8th international conference on telecommunications in modern satellite, cable and broadcasting services, 2007. TELSIKS 2007, 26–28 Sept. 2007 (pp. 23–26). doi:10.1109/TELSKS.2007.4375929.
Seungku, K., & Doo-Seop, E. (2014). Link-state-estimation-based transmission power control in wireless body area networks. IEEE Journal of Biomedical and Health Informatics, 18(4), 1294–1302. doi:10.1109/JBHI.2013.2282864.
Incel, O. D., van Hoesel, L., Jansen, P., & Havinga, P. (2011). MC-LMAC: A multi-channel MAC protocol for wireless sensor networks. Ad Hoc Networks, 9(1), 73–94. doi:10.1016/j.adhoc.2010.05.003.
Borms, J., Steenhaut, K., & Lemmens, B. (2010). Low-overhead dynamic multi-channel MAC for wireless sensor networks. In J. S. Silva, B. Krishnamachari, & F. Boavida (Eds.), Proceedings of the wireless sensor networks: 7th European conference, EWSN 2010, Coimbra, February 17–19, 2010 (pp. 81–96). Berlin: Springer.
Oh, H., & Azad, K. M. A. (2016). A big slot scheduling algorithm for the reliable delivery of real-time data packets in wireless sensor networks. In Q.-A. Zeng (Ed.), Wireless communications, networking and applications: Proceedings of WCNA 2014 (pp. 13–25). New Delhi: Springer.
Van Vinh, P., & Oh, H. (2015). O-MAC: An optimized MAC protocol for concurrent data transmission in real-time wireless sensor networks. Wireless Networks, 21(6), 1847–1861. doi:10.1007/s11276-015-0887-2.
Yafeng, W., Stankovic, J. A., Tian, H., & Shan, L. (2008). Realistic and efficient multi-channel communications in wireless sensor networks. In INFOCOM 2008. The 27th conference on computer communications. IEEE, 13–18 April 2008. doi:10.1109/INFOCOM.2008.175.
Avokh, A., & Mirjalily, G. (2010). Dynamic balanced spanning tree (DBST) for data aggregation in wireless sensor networks. In Proceedings of the 2010 5th international symposium on telecommunications (IST), 4–6 Dec. 2010 (pp. 391–396). doi:10.1109/ISTEL.2010.5734058.
Chung-Kuo, H., Guey Yun, C., & Jang-Ping, S. (2012). Load-balanced trees for data collection in wireless sensor networks. In Proceedings of the 41st international conference on parallel processing workshops (ICPPW), 2012, 10–13 Sept 2012 (pp. 474–479). doi:10.1109/ICPPW.2012.65.
Garey, M. R., & Johnson, D. S. (1990). Computers and intractability: A guide to the theory of NP-completeness. London: W. H. Freeman & Co.
Maroti, M., Kusy, B., Simon, G., & Ledeczi, A. (2004). The flooding time synchronization protocol. In Paper presented at the proceedings of the 2nd international conference on embedded networked sensor systems. Baltimore.
QualNet 5.0.2 network simulator. http://web.scalable-networks.com/qualnet.
GPLK for windows. http://winglpk.sourceforge.net/.
Acknowledgement
This research was supported by the 2015 Research Fund of University of Ulsan.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nguyen, T.T., Oh, H. Constructing an optimally balanced tree to maximize data throughput with multiple channels. Wireless Netw 24, 993–1005 (2018). https://doi.org/10.1007/s11276-017-1550-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-017-1550-x