Abstract
Machine-to-machine (M2M) communication aims to exchange information among a large number of devices without human interference. When more and more devices are connected, nevertheless, serious delay and energy efficiency problems may emerge due to massive access. In this paper, we apply a multi-channel Carrier Sense Multiple Access (CSMA) protocol for M2M communications where the frequency band is divided into several sub-bands. It is found that whether the band partitioning offers performance gains in terms of the delay and energy efficiency performance is critically determined by the traffic load. When the traffic load exceeds certain thresholds, a larger number of sub-channels is preferable. Moreover, it is found that the packet size and the signal-to-noise ratio (SNR) have a crucial effect on the thresholds. Based on this, the number of sub-channels can be optimally chosen accordingly to make sure that the system operates in the optimum working zone.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Rajandekar, A., Sikdar, B.: A survey of MAC layer issues and protocols for machine-to-machine communications. IEEE Internet Things J. 2, 175–186 (2015)
Park, I.S., Shitiri, E., Cho, H.S.: An orthogonal coded hybrid MAC protocol with received power based prioritization for M2M networks. In: IEEE International Conference on Ubiquitous Future Network, pp. 733–735. IEEE Press (2016)
Jang, H.S., Kim, S.M., Ko, K.S., Cha, J., Sung, D.K.: Spatial group based random access for M2M communications. IEEE Commun. Lett. 18, 961–964 (2014)
Ericsson: Cellular networks for massive IoT, Janurary 2016. https://www.ericsson.com
Ergen, S.C., Varaiya, P.: TDMA scheduling algorithms for wireless sensor networks. Wirel. Netw. 16, 985–997 (2010)
Ko, K.S., Min, J.K., Bae, K.Y., Dan, K.S.: A novel random access for fixed-location machine-to-machine communications in OFDMA based systems. IEEE Commun. Lett. 16, 1428–1431 (2012)
Karaoglu, B., Heinzelman, W.: Cooperative load balancing and dynamic channel allocation for cluster-based mobile ad hoc networks. IEEE Trans. Mobile Comput. 14, 951–963 (2015)
Kwon, H., Seo, H., Kim, S., Lee, B.G.: Generalized CSMA/CA for OFDMA systems: protocol design, throughput analysis, and implementation issues. IEEE Trans. Wirel. Commun. 8, 4176–4187 (2009)
Wang, G., Zhong, X.F., Mei, S.L., Wang, J.: An adaptive medium access control mechanism for cellular based machine to machine (M2M) communication. In: 2010 IEEE International Conference on Wireless Information Technology and Systems, pp. 1–4. IEEE Press (2010)
Rom, R., Sidi, M.: Multiple Access Protocols: Performance and Analysis. Springer Science & Business Media, Heidelberg (2012). https://doi.org/10.1007/978-1-4612-3402-9
Miao, G.W., Azari, A., Hwang, T.: \( E^{2} \)-MAC: energy efficient medium access for massive M2M communications. IEEE Trans. Commun. 64, 4720–4735 (2016)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (NSFC) under Grants 61427801, 61401224, and 61671251, the Natural Science Foundation Program through Jiangsu Province of China under Grant BK20140882 and BK20150852, and the open research fund of National Mobile Communications Research Laboratory, Southeast University under Grant 2017D05.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix: Proof of Lemmas 1 and 2
Appendix: Proof of Lemmas 1 and 2
Let \(f_{n_{1},n_{2}}^{D}(g)=D(\frac{g}{n_{1}})-D(\frac{g}{n_{2}}), {n_{1}<n_{2}}\), we have
It can be seen when \({g=0}\), \(f_{n_{1},n_{2}}^{D}(g)<0\), and when g goes to infinite, \(f_{n_{1},n_{2}}^{D}(g)>0\), so there exist at least a value of g makes \({f_{n_{1},n_{2}}^{D}(g)=0}\). Moreover, we have
where \(T_{n_1}=\frac{{D{n_1}}}{{W\log (1 + {n_1}\rho )}} + \delta + {\delta _d}\) and \(T_{n_2}=\frac{{D{n_2}}}{{W\log (1 + {n_2}\rho )}} + \delta + {\delta _d}\), which can be treated as two constants in this expression. When \({\delta _d}\) and \({\delta }\) in \({\mathrm{{T}}_{{n_1}}}\) and \({\mathrm{{T}}_{{n_2}}}\) is negligible, this equation can be rewritten as
When \(g>0\) and \(n_1<n_2\), we have \(\frac{d}{dg}f_{n_{1},n_{2}}^{D}(g)>0\), so \(f_{n_{1},n_{2}}^{D}(g)\) monotonically increases with g. Therefore, there exists a threshold of \(g_{n_{1},n_{2}}^D\), such that if \(g>g_{n_{1},n_{2}}^D\), \({f_{n_{1}, n_{2}}^{D}(g)>0}\), i.e., \(D(\frac{g}{n_{1}})>D(\frac{g}{n_{2}})\), otherwise, \({f_{n_{1},n_{2}}^{D}(g)<0}\), i.e., \(D(\frac{g}{n_{1}})<D(\frac{g}{n_{2}})\).
Similarly, we can obtain \(f_{n_{1},n_{2}}^{E}(g)\) as
When \({g=0}\), \(f_{n_{1},n_{2}}^{E}(g)>0\), and when g goes to infinite, \(f_{n_{1},n_{2}}^{E}(g)<0\). Moreover, it can be proved that when \(g>0\) and \(n_1<n_2\), \(\frac{d}{dg}f_{n_{1},n_{2}}^{E}(g)<0\), so \(f_{n_{1},n_{2}}^{E}(g)\) monotonically decreases with g. Therefore, there exist a threshold \(g_{n_{1},n_{2}}^E\), such that if \(g>g_{n_{1},n_{2}}^E\), \({f_{n_{1}, n_{2}}^{E}(g)<0}\), i.e., \(E(\frac{g}{n_{1}})<E(\frac{g}{n_{2}})\), otherwise, \({f_{n_{1},n_{2}}^{E}(g)>0}\), i.e., \(E(\frac{g}{n_{1}})>E(\frac{g}{n_{2}})\).
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Zhang, C., Sun, X., Zhang, J., Zhu, H. (2018). Performance Evaluation of Multi-channel CSMA for Machine-to-Machine Communication. In: Li, C., Mao, S. (eds) Wireless Internet. WiCON 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 230. Springer, Cham. https://doi.org/10.1007/978-3-319-90802-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-90802-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90801-4
Online ISBN: 978-3-319-90802-1
eBook Packages: Computer ScienceComputer Science (R0)