EECR: Energy-Efficient Cooperative Routing for EM-Based Nanonetworks

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nanonetworks, which are composed of interacting nanonodes, have significant potential in many areas and applications. However, reliable communication is extremely challenging in electromagnetic (EM) nanonetworks as a result of limited transmission power, constrained nanonode capabilities, and severe path losses in terahertz band communications. In this paper, we propose a cooperative communication model for hierarchical cluster-based nanonetworks. In each cluster, there is a nano-controller that acts as a cluster head and several nanonodes that cooperatively forward packets to the nano-controller. Based on the cooperative communication model, an energy-efficient cooperative routing algorithm with optimal link cost is proposed for the nanonetworks. We first formulate the energy cost of cooperative communication between two nanonodes with a two-stage transmission strategy, as only statistical knowledge about the channel is currently available. Using the energy cost formulation, we can then establish cooperative communication transmission with optimal energy consumption. The results of the study show that the cooperative routing scheme can effectively reduce energy consumption compared to noncooperative routing schemes, thus showing great potential for use in cooperative communication schemes to enhance the performance of the nanonetwork.

Cite

CITATION STYLE

APA

Yao, X. W., Wu, Y. C. G., Yao, Y., Qi, C. F., & Huang, W. (2019). EECR: Energy-Efficient Cooperative Routing for EM-Based Nanonetworks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11792 LNCS, pp. 30–38). Springer. https://doi.org/10.1007/978-3-030-30949-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free