| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Fed Fluminense, Dept Comp Sci, BR-24210346 Niteroi, RJ - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | IEEE WIRELESS COMMUNICATIONS LETTERS; v. 9, n. 12, p. 2116-2120, DEC 2020. |
| Web of Science Citations: | 0 |
| Abstract | |
Reducing energy consumption is of paramount importance in wireless networks, particularly now with the increasing popularity of the Internet of Things. One of the most effective tools for that is duty cycling the radio. In particular, asynchronous methods have been repeatedly studied in the literature. In this letter, we consider the asymmetrical case of asynchronous duty cycling, i.e., when nodes operate under different duty cycles because of different energy requirements. More specifically, we derive upper and lower bounds, as well as an approximate model for the neighbor discovery time of nodes operating under asymmetrical block designs. We further validate our model by comparing it to empirical data. (AU) | |
| FAPESP's process: | 18/23062-5 - MEGACHAIN: Blockchain for Integration, Privacy and Audit of Megacity Systems |
| Grantee: | Célio Vinicius Neves de Albuquerque |
| Support type: | Regular Research Grants |