Analytic performance comparison of routing protocols in master-slave PLC networks
Identifieur interne : 006030 ( Main/Merge ); précédent : 006029; suivant : 006031Analytic performance comparison of routing protocols in master-slave PLC networks
Auteurs : Gert Bumiller ; Liping Lu ; Ye Qiong SongSource :
Abstract
In the wide area master-slave PLC (powerline communication) system, the source node cannot reach the destination node without packet relay. Due to the time-variable attenuation in the powerline, the communication distance cannot be defined. Two kind of dynamic repeater algorithms are developed, dynamic source routing and flooding based routing. In this paper, we use analytic approach to compare the performance of those two routing protocols. We give formulas to calculate the average duration of a polling cycle for each protocols. Then we present simulation results to bolster the results of our analysis. We use three metrics, which are bandwidth consumed for routing signaling, normalized routing load and average duration of a polling cycle to evaluate those routing protocols.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 004401
- to stream Crin, to step Curation: 004401
- to stream Crin, to step Checkpoint: 000255
Links to Exploration step
CRIN:bumiller05aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="413">Analytic performance comparison of routing protocols in master-slave PLC networks</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:bumiller05a</idno>
<date when="2005" year="2005">2005</date>
<idno type="wicri:Area/Crin/Corpus">004401</idno>
<idno type="wicri:Area/Crin/Curation">004401</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004401</idno>
<idno type="wicri:Area/Crin/Checkpoint">000255</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000255</idno>
<idno type="wicri:Area/Main/Merge">006030</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Analytic performance comparison of routing protocols in master-slave PLC networks</title>
<author><name sortKey="Bumiller, Gert" sort="Bumiller, Gert" uniqKey="Bumiller G" first="Gert" last="Bumiller">Gert Bumiller</name>
</author>
<author><name sortKey="Lu, Liping" sort="Lu, Liping" uniqKey="Lu L" first="Liping" last="Lu">Liping Lu</name>
</author>
<author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye Qiong" last="Song">Ye Qiong Song</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2908">In the wide area master-slave PLC (powerline communication) system, the source node cannot reach the destination node without packet relay. Due to the time-variable attenuation in the powerline, the communication distance cannot be defined. Two kind of dynamic repeater algorithms are developed, dynamic source routing and flooding based routing. In this paper, we use analytic approach to compare the performance of those two routing protocols. We give formulas to calculate the average duration of a polling cycle for each protocols. Then we present simulation results to bolster the results of our analysis. We use three metrics, which are bandwidth consumed for routing signaling, normalized routing load and average duration of a polling cycle to evaluate those routing protocols.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006030 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006030 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= CRIN:bumiller05a |texte= Analytic performance comparison of routing protocols in master-slave PLC networks }}
This area was generated with Dilib version V0.6.33. |