Abstract
The internet of things (IoT) enables physical objects to sense the world and hence perform specific tasks, winning a great market success. Routing bears significant importance to IoT since punctual and reliable information delivery is indispensable for most IoT applications. The start-of-the-art work on IoT routing mainly focuses on designing algorithms to select efficient relays according to a given topology for improving routing performance. In this paper, we take a dramatically different viewpoint to study the routing in IoT. In detail, we figure out the best IoT network structure to attain the best message transmission. We have proved that IoT with small-world properties can achieve better routing performance when the probability of long-range connections obeys Lévy distribution. Furthermore, we deduce the upper and lower bound of the average number of message transmission steps respectively. Finally, we do extensive experiments to validate our analysis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chen, S., et al.: Mobility-driven networks (MDN): from evolution to visions of mobility management. IEEE Netw. 28(4), 66–73 (2014)
Atzori, L., Iera, A., Morabito, G.: The internet of things: a survey. Comput. Netw. J. 54, 2787–2805 (2010)
Zheng, X., Cai, Z., Li, Y.: Data linkage in smart IoT systems: a consideration from privacy perspective. IEEE Commun. Mag. 56(9), 55–61 (2018)
Cai, Z., He, Z.: Trading private range counting over big IoT data. In: The 39th IEEE International Conference on Distributed Computing Systems (ICDCS) (2019)
Gantz, J., Reinsel, D.: The digital universe in 2020: big data, bigger digital shadows, and biggest growth in the far east. IDC iView: IDC Anal. Future 2007, 1–16 (2012)
Bakshi, A., et al.: EMIT: an efficient MAC paradigm for the Internet of Things. In: The 36th IEEE Conference on Computer Communications (INFOCOM) (2016)
Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: The 32nd Annual ACM Symposium on Theory of Computing (STOC) (2000)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Wang, S., et al.: Analyzing the potential of mobile opportunistic networks for big data applications. IEEE Netw. 29(5), 57–63 (2015)
Wang, S., et al.: Opportunistic routing in intermittently connected mobile P2P networks. IEEE J. Sel. Areas Commun. 31(9), 369–378 (2013)
Wang, S., Liu, M., Cheng, X., Song, M.: Routing in pocket switched networks. IEEE Wirel. Commun. 19(2), 67–73 (2012)
Rushmore, J., Caillaud, D., Matamba, L., et al.: Social network analysis of wild chimpanzees provides insights for predicting infectious disease risk. J. Anim. Ecol. 82(5), 976–986 (2013)
Wang, S., et al.: The tempo-spatial information dissemination properties of mobile opportunistic networks with levy mobility. In: The 34th International Conference Distributed Computing Systems (ICDCS) (2014)
Hu, C., et al.: A multi-verse optimizer with levy flights for numerical optimization and its application in test scheduling for network-on-chip. PloS ONE 11(12), e0167341 (2016)
Acknowledgment
This work has been supported by the National Natural Science Foundation of China (No. 61772080).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chen, S., Wang, S., Huang, J. (2019). Analysis of Best Network Routing Structure for IoT. In: Biagioni, E., Zheng, Y., Cheng, S. (eds) Wireless Algorithms, Systems, and Applications. WASA 2019. Lecture Notes in Computer Science(), vol 11604. Springer, Cham. https://doi.org/10.1007/978-3-030-23597-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-030-23597-0_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-23596-3
Online ISBN: 978-3-030-23597-0
eBook Packages: Computer ScienceComputer Science (R0)