Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Catalin Drula

dblp:78/4089 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 60% Wireless networking · 40%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › wireless personal area network › bluetooth network
bluetooth ad hoc networks
0.112007
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks · IEEE J. Sel. Areas Commun. 2007
Internet of things and sensor networks › neighbor discovery
energy-efficient neighbor discovery
0.112007
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks · IEEE J. Sel. Areas Commun. 2007
Internet of things and sensor networks
neighbor discovery
0.112007
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks · IEEE J. Sel. Areas Commun. 2007
Wireless networking
parameter tuning
0.112007
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks · IEEE J. Sel. Areas Commun. 2007
Internet of things and sensor networks
wireless sensor network
0.112007
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks · IEEE J. Sel. Areas Commun. 2007
Energy-efficient computing
power management
0.012007
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks · IEEE J. Sel. Areas Commun. 2007

Methods — techniques the papers use, named apart from their topics

simulation · 0.1mobility modeling · 0.1
YearPublicationVenuePosition
2007 Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks
abstract
In this paper, we introduce and evaluate novel adaptive schemes for neighbor discovery in Bluetooth-enabled ad-hoc networks. In an ad-hoc peer-to-peer setting, neighbor search is a continuous, hence battery draining process. In order to save energy when the device is unlikely to encounter a neighbor, we adaptively choose parameter settings depending on a mobility context to decrease the expected power consumption of Bluetooth-enabled devices. For this purpose, we first determine the mean discovery time and power consumption values for In different Bluetooth parameter settings through a comprehensive exploration of the parameter space by means of simulation validated by experiments on real devices. The fastest average discovery time obtained is 0.2 s, while at an average discovery time of I s the power consumption is just 1.5 times that of the idle mode on our devices. We then introduce two adaptive algorithms for dynamically adjusting the Bluetooth parameters based on past perceived activity in the ad-hoc network. Both adaptive schemes for selecting the discovery mode are based only on locally-available information. We evaluate these algorithms in a node mobility simulation. Our adaptive algorithms reduce energy consumption by 50% and have up to 8% better performance over a static power-con serving scheme
Catalin Drula, Cristiana Amza, Franck Rousseau, Andrzej Duda
IEEE J. Sel. Areas Commun.1