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

Nooshin Tavakkoli

dblp:211/7345 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—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
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › relaying
cooperative relaying
0.312017
Optimal Positioning of Relay Node in Cooperative Molecular Communication Networks · IEEE Trans. Commun. 2017
Physical-layer communications
molecular communication
0.312017
Optimal Positioning of Relay Node in Cooperative Molecular Communication Networks · IEEE Trans. Commun. 2017
Physical-layer communications › relaying
relay position optimization
0.312017
Optimal Positioning of Relay Node in Cooperative Molecular Communication Networks · IEEE Trans. Commun. 2017
Physical-layer communications › error probability analysis
bit error probability analysis
0.112017
Optimal Positioning of Relay Node in Cooperative Molecular Communication Networks · IEEE Trans. Commun. 2017

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

block coordinate descent · 0.3
YearPublicationVenuePosition
2017 Optimal Positioning of Relay Node in Cooperative Molecular Communication Networks
abstract
In this paper, we consider a cooperative diffusion-based molecular communication (MC) network consisting of single source, single decode-and-forward relay, and single destination. The source and the relay nodes use different types of molecules for information transmission. Considering both the relay and the direct links at the destination node, we have two different received signals that can be used by the destination node to retrieve the data transmitted by the source node. Therefore, diversity arises at the destination node. For detection, we adopt the energy detector applying the diversity combining technique. Since the optimum relay position in relay-aided networks plays a crucial role to enhance their performance, we study the relay location optimization problem. We first derive a closed-form expression for the bit error probability of the proposed detection scheme in which the received energy from the source and the relay nodes are linearly combined at the destination node. Then, in order to find the optimum relay position as well as the optimal destination decision threshold for a given number of molecules released by the source and the relay nodes, we formulate a joint optimization problem whose objective is to minimize the bit error probability of the network. To solve this optimization problem, we propose an iterative algorithm based on the block coordinate descent algorithm and study its convergence behavior. Numerical results show that the error performance can be improved by optimizing the position of the relay node. Our analyses help us in designing a reliable cooperative diffusion-based MC network.
Nooshin Tavakkoli, Paeiz Azmi, Nader Mokari
IEEE Trans. Commun.1