2011
DOI: 10.1007/978-3-642-19953-0_11
|View full text |Cite
|
Sign up to set email alerts
|

A Central Leader Election Method Using the Distance Matrix in Ad Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Intra-cluster routing is the process to find out the efficient path to forward network traffic (or data) towards the cluster head within the cluster. We consider the link throughput, delay, packet loss ratio, interference, residual energy [14][15][16][17] and node distance to select the links and corresponding sensor node to establish path of the intra-cluster communication. We also use the penalty functions, which helps the sensor nodes not to select the path with lower than the required or expected throughput and delay.…”
Section: Introductionmentioning
confidence: 99%
“…Intra-cluster routing is the process to find out the efficient path to forward network traffic (or data) towards the cluster head within the cluster. We consider the link throughput, delay, packet loss ratio, interference, residual energy [14][15][16][17] and node distance to select the links and corresponding sensor node to establish path of the intra-cluster communication. We also use the penalty functions, which helps the sensor nodes not to select the path with lower than the required or expected throughput and delay.…”
Section: Introductionmentioning
confidence: 99%