Serveur d'exploration sur l'opéra

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks

Identifieur interne : 000081 ( PascalFrancis/Corpus ); précédent : 000080; suivant : 000082

OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks

Auteurs : Marcello Caleffi ; Ian F. Akyildiz ; Luigi Paura

Source :

RBID : Pascal:12-0341345

Descripteurs français

English descriptors

Abstract

Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

pA  
A01 01  1    @0 1536-1276
A03   1    @0 IEEE trans. wirel. commun.
A05       @2 11
A06       @2 8
A08 01  1  ENG  @1 OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks
A11 01  1    @1 CALEFFI (Marcello)
A11 02  1    @1 AKYILDIZ (Ian F.)
A11 03  1    @1 PAURA (Luigi)
A14 01      @1 Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology @3 USA @Z 1 aut.
A14 02      @1 Dept. of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II @3 ITA @Z 1 aut.
A14 03      @1 Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology @3 USA @Z 2 aut.
A14 04      @1 Department of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II @3 ITA @Z 3 aut.
A20       @1 2884-2894
A21       @1 2012
A23 01      @0 ENG
A43 01      @1 INIST @2 27309 @5 354000504063220210
A44       @0 0000 @1 © 2012 INIST-CNRS. All rights reserved.
A45       @0 16 ref.
A47 01  1    @0 12-0341345
A60       @1 P
A61       @0 A
A64 01  1    @0 IEEE transactions on wireless communications
A66 01      @0 USA
C01 01    ENG  @0 Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.
C02 01  X    @0 001D04B02G
C02 02  X    @0 001D04B04F
C02 03  X    @0 001D04B04G2
C02 04  X    @0 001D04B03D2
C03 01  X  FRE  @0 Routage @5 01
C03 01  X  ENG  @0 Routing @5 01
C03 01  X  SPA  @0 Enrutamiento @5 01
C03 02  X  FRE  @0 Métrique @5 02
C03 02  X  ENG  @0 Metric @5 02
C03 02  X  SPA  @0 Métrico @5 02
C03 03  X  FRE  @0 Radio logicielle @5 03
C03 03  X  ENG  @0 Software radio @5 03
C03 03  X  SPA  @0 Radio logicial @5 03
C03 04  X  FRE  @0 Radiocommunication service mobile @5 04
C03 04  X  ENG  @0 Mobile radiocommunication @5 04
C03 04  X  SPA  @0 Radiocomunicación servicio móvil @5 04
C03 05  X  FRE  @0 Réseau ad hoc @5 05
C03 05  X  ENG  @0 Ad hoc network @5 05
C03 05  X  SPA  @0 Red ad hoc @5 05
C03 06  X  FRE  @0 Télécommunication sans fil @5 06
C03 06  X  ENG  @0 Wireless telecommunication @5 06
C03 06  X  SPA  @0 Telecomunicación sin hilo @5 06
C03 07  X  FRE  @0 Méthode heuristique @5 07
C03 07  X  ENG  @0 Heuristic method @5 07
C03 07  X  SPA  @0 Método heurístico @5 07
C03 08  3  FRE  @0 Protocole routage @5 08
C03 08  3  ENG  @0 Routing protocols @5 08
C03 09  X  FRE  @0 Précision @5 09
C03 09  X  ENG  @0 Accuracy @5 09
C03 09  X  SPA  @0 Precisión @5 09
C03 10  X  FRE  @0 Temps retard @5 10
C03 10  X  ENG  @0 Delay time @5 10
C03 10  X  SPA  @0 Tiempo retardo @5 10
C03 11  X  FRE  @0 Evaluation performance @5 11
C03 11  X  ENG  @0 Performance evaluation @5 11
C03 11  X  SPA  @0 Evaluación prestación @5 11
C03 12  X  FRE  @0 Simulation @5 12
C03 12  X  ENG  @0 Simulation @5 12
C03 12  X  SPA  @0 Simulación @5 12
C03 13  X  FRE  @0 Protocole transmission @5 46
C03 13  X  ENG  @0 Transmission protocol @5 46
C03 13  X  SPA  @0 Protocolo transmisión @5 46
N21       @1 261
N44 01      @1 OTO
N82       @1 OTO

Format Inist (serveur)

NO : PASCAL 12-0341345 INIST
ET : OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks
AU : CALEFFI (Marcello); AKYILDIZ (Ian F.); PAURA (Luigi)
AF : Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology/Etats-Unis (1 aut.); Dept. of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II/Italie (1 aut.); Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology/Etats-Unis (2 aut.); Department of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II/Italie (3 aut.)
DT : Publication en série; Niveau analytique
SO : IEEE transactions on wireless communications; ISSN 1536-1276; Etats-Unis; Da. 2012; Vol. 11; No. 8; Pp. 2884-2894; Bibl. 16 ref.
LA : Anglais
EA : Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.
CC : 001D04B02G; 001D04B04F; 001D04B04G2; 001D04B03D2
FD : Routage; Métrique; Radio logicielle; Radiocommunication service mobile; Réseau ad hoc; Télécommunication sans fil; Méthode heuristique; Protocole routage; Précision; Temps retard; Evaluation performance; Simulation; Protocole transmission
ED : Routing; Metric; Software radio; Mobile radiocommunication; Ad hoc network; Wireless telecommunication; Heuristic method; Routing protocols; Accuracy; Delay time; Performance evaluation; Simulation; Transmission protocol
SD : Enrutamiento; Métrico; Radio logicial; Radiocomunicación servicio móvil; Red ad hoc; Telecomunicación sin hilo; Método heurístico; Precisión; Tiempo retardo; Evaluación prestación; Simulación; Protocolo transmisión
LO : INIST-27309.354000504063220210
ID : 12-0341345

Links to Exploration step

Pascal:12-0341345

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks</title>
<author>
<name sortKey="Caleffi, Marcello" sort="Caleffi, Marcello" uniqKey="Caleffi M" first="Marcello" last="Caleffi">Marcello Caleffi</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology</s1>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="02">
<s1>Dept. of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II</s1>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Akyildiz, Ian F" sort="Akyildiz, Ian F" uniqKey="Akyildiz I" first="Ian F." last="Akyildiz">Ian F. Akyildiz</name>
<affiliation>
<inist:fA14 i1="03">
<s1>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Paura, Luigi" sort="Paura, Luigi" uniqKey="Paura L" first="Luigi" last="Paura">Luigi Paura</name>
<affiliation>
<inist:fA14 i1="04">
<s1>Department of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II</s1>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">12-0341345</idno>
<date when="2012">2012</date>
<idno type="stanalyst">PASCAL 12-0341345 INIST</idno>
<idno type="RBID">Pascal:12-0341345</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000081</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks</title>
<author>
<name sortKey="Caleffi, Marcello" sort="Caleffi, Marcello" uniqKey="Caleffi M" first="Marcello" last="Caleffi">Marcello Caleffi</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology</s1>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="02">
<s1>Dept. of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II</s1>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Akyildiz, Ian F" sort="Akyildiz, Ian F" uniqKey="Akyildiz I" first="Ian F." last="Akyildiz">Ian F. Akyildiz</name>
<affiliation>
<inist:fA14 i1="03">
<s1>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Paura, Luigi" sort="Paura, Luigi" uniqKey="Paura L" first="Luigi" last="Paura">Luigi Paura</name>
<affiliation>
<inist:fA14 i1="04">
<s1>Department of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II</s1>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">IEEE transactions on wireless communications</title>
<title level="j" type="abbreviated">IEEE trans. wirel. commun. </title>
<idno type="ISSN">1536-1276</idno>
<imprint>
<date when="2012">2012</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">IEEE transactions on wireless communications</title>
<title level="j" type="abbreviated">IEEE trans. wirel. commun. </title>
<idno type="ISSN">1536-1276</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Accuracy</term>
<term>Ad hoc network</term>
<term>Delay time</term>
<term>Heuristic method</term>
<term>Metric</term>
<term>Mobile radiocommunication</term>
<term>Performance evaluation</term>
<term>Routing</term>
<term>Routing protocols</term>
<term>Simulation</term>
<term>Software radio</term>
<term>Transmission protocol</term>
<term>Wireless telecommunication</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Routage</term>
<term>Métrique</term>
<term>Radio logicielle</term>
<term>Radiocommunication service mobile</term>
<term>Réseau ad hoc</term>
<term>Télécommunication sans fil</term>
<term>Méthode heuristique</term>
<term>Protocole routage</term>
<term>Précision</term>
<term>Temps retard</term>
<term>Evaluation performance</term>
<term>Simulation</term>
<term>Protocole transmission</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>1536-1276</s0>
</fA01>
<fA03 i2="1">
<s0>IEEE trans. wirel. commun. </s0>
</fA03>
<fA05>
<s2>11</s2>
</fA05>
<fA06>
<s2>8</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG">
<s1>OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks</s1>
</fA08>
<fA11 i1="01" i2="1">
<s1>CALEFFI (Marcello)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>AKYILDIZ (Ian F.)</s1>
</fA11>
<fA11 i1="03" i2="1">
<s1>PAURA (Luigi)</s1>
</fA11>
<fA14 i1="01">
<s1>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology</s1>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>Dept. of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II</s1>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="03">
<s1>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="04">
<s1>Department of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II</s1>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20>
<s1>2884-2894</s1>
</fA20>
<fA21>
<s1>2012</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA43 i1="01">
<s1>INIST</s1>
<s2>27309</s2>
<s5>354000504063220210</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2012 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>16 ref.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>12-0341345</s0>
</fA47>
<fA60>
<s1>P</s1>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>IEEE transactions on wireless communications</s0>
</fA64>
<fA66 i1="01">
<s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D04B02G</s0>
</fC02>
<fC02 i1="02" i2="X">
<s0>001D04B04F</s0>
</fC02>
<fC02 i1="03" i2="X">
<s0>001D04B04G2</s0>
</fC02>
<fC02 i1="04" i2="X">
<s0>001D04B03D2</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE">
<s0>Routage</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG">
<s0>Routing</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA">
<s0>Enrutamiento</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE">
<s0>Métrique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Metric</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>Métrico</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Radio logicielle</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Software radio</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Radio logicial</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Radiocommunication service mobile</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Mobile radiocommunication</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Radiocomunicación servicio móvil</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE">
<s0>Réseau ad hoc</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG">
<s0>Ad hoc network</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA">
<s0>Red ad hoc</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE">
<s0>Télécommunication sans fil</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG">
<s0>Wireless telecommunication</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA">
<s0>Telecomunicación sin hilo</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE">
<s0>Méthode heuristique</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG">
<s0>Heuristic method</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA">
<s0>Método heurístico</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="3" l="FRE">
<s0>Protocole routage</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="3" l="ENG">
<s0>Routing protocols</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE">
<s0>Précision</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG">
<s0>Accuracy</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA">
<s0>Precisión</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE">
<s0>Temps retard</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG">
<s0>Delay time</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA">
<s0>Tiempo retardo</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE">
<s0>Evaluation performance</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG">
<s0>Performance evaluation</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA">
<s0>Evaluación prestación</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE">
<s0>Simulation</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG">
<s0>Simulation</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA">
<s0>Simulación</s0>
<s5>12</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE">
<s0>Protocole transmission</s0>
<s5>46</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG">
<s0>Transmission protocol</s0>
<s5>46</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA">
<s0>Protocolo transmisión</s0>
<s5>46</s5>
</fC03>
<fN21>
<s1>261</s1>
</fN21>
<fN44 i1="01">
<s1>OTO</s1>
</fN44>
<fN82>
<s1>OTO</s1>
</fN82>
</pA>
</standard>
<server>
<NO>PASCAL 12-0341345 INIST</NO>
<ET>OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks</ET>
<AU>CALEFFI (Marcello); AKYILDIZ (Ian F.); PAURA (Luigi)</AU>
<AF>Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology/Etats-Unis (1 aut.); Dept. of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II/Italie (1 aut.); Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology/Etats-Unis (2 aut.); Department of Biomedical, Electronics and Telecommunications Engineering, University of Naples Federico II/Italie (3 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>IEEE transactions on wireless communications; ISSN 1536-1276; Etats-Unis; Da. 2012; Vol. 11; No. 8; Pp. 2884-2894; Bibl. 16 ref.</SO>
<LA>Anglais</LA>
<EA>Two main issues affect the existing routing metrics for cognitive radio ad hoc networks: i) they are often based on heuristics, and thus they have not been proved to be optimal; ii) they do not account for the route diversity effects, and thus they are not able to measure the actual cost of a route. In this paper, an optimal routing metric for cognitive radio ad hoc networks, referred to as OPERA, is proposed. OPERA is designed to achieve two features: i) Optimality: OPERA is optimal when combined with both Dijkstra and Bellman-Ford based routing protocols; ii) Accuracy: OPERA exploits the route diversity provided by the intermediate nodes to measure the actual end-to-end delay, by taking explicitly into account the unique characteristics of cognitive radio networks. A closed-form expression of the proposed routing metric is analytically derived for both static and mobile networks, and its optimality is proved rigorously. Performance evaluation is conducted through simulations, and the results reveal the benefits of adopting the proposed routing metric for cognitive radio ad hoc networks.</EA>
<CC>001D04B02G; 001D04B04F; 001D04B04G2; 001D04B03D2</CC>
<FD>Routage; Métrique; Radio logicielle; Radiocommunication service mobile; Réseau ad hoc; Télécommunication sans fil; Méthode heuristique; Protocole routage; Précision; Temps retard; Evaluation performance; Simulation; Protocole transmission</FD>
<ED>Routing; Metric; Software radio; Mobile radiocommunication; Ad hoc network; Wireless telecommunication; Heuristic method; Routing protocols; Accuracy; Delay time; Performance evaluation; Simulation; Transmission protocol</ED>
<SD>Enrutamiento; Métrico; Radio logicial; Radiocomunicación servicio móvil; Red ad hoc; Telecomunicación sin hilo; Método heurístico; Precisión; Tiempo retardo; Evaluación prestación; Simulación; Protocolo transmisión</SD>
<LO>INIST-27309.354000504063220210</LO>
<ID>12-0341345</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000081 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000081 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    OperaV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:12-0341345
   |texte=   OPERA: Optimal Routing Metric for Cognitive Radio Ad Hoc Networks
}}

Wicri

This area was generated with Dilib version V0.6.21.
Data generation: Thu Apr 14 14:59:05 2016. Site generation: Thu Oct 8 06:48:41 2020