The Ad Hoc On-Demand Distance Vector Protocol: An Analytical Model of the Route Acquisition Process View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2004

AUTHORS

Matthias Hollick , Jens B. Schmitt , Christian Seipl , Ralf Steinmetz

ABSTRACT

Ad hoc networking research suffers from the lack of meaningful and realistic models to describe the route acquisition process of ad hoc routing protocols. There is a strong need for such models to be able to perform realistic calculations supporting important yet difficult tasks, such as performance estimation and protocol scalability analysis. Based on existing work for ideal source routing we formulate and validate an analytical model to match the route acquisition process executed by the Ad Hoc On-Demand Distance Vector (AODV) protocol. This allows us to predict the probability density function of estimated route lengths, a powerful metric for characterization of the network behavior. We further extend our study to include multiple refinements to the basic AODV protocol. The instantiation and validation of the model is completed by means of an experimental analysis. More... »

PAGES

201-212

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-24643-5_18

DOI

http://dx.doi.org/10.1007/978-3-540-24643-5_18

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1015257279


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0104", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Statistics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6546.1", 
          "name": [
            "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hollick", 
        "givenName": "Matthias", 
        "id": "sg:person.010143067443.79", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010143067443.79"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6546.1", 
          "name": [
            "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Schmitt", 
        "givenName": "Jens B.", 
        "id": "sg:person.011536216101.63", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011536216101.63"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6546.1", 
          "name": [
            "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Seipl", 
        "givenName": "Christian", 
        "id": "sg:person.07431233455.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07431233455.27"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6546.1", 
          "name": [
            "Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Steinmetz", 
        "givenName": "Ralf", 
        "id": "sg:person.014350724672.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014350724672.43"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2004", 
    "datePublishedReg": "2004-01-01", 
    "description": "Ad hoc networking research suffers from the lack of meaningful and realistic models to describe the route acquisition process of ad hoc routing protocols. There is a strong need for such models to be able to perform realistic calculations supporting important yet difficult tasks, such as performance estimation and protocol scalability analysis. Based on existing work for ideal source routing we formulate and validate an analytical model to match the route acquisition process executed by the Ad Hoc On-Demand Distance Vector (AODV) protocol. This allows us to predict the probability density function of estimated route lengths, a powerful metric for characterization of the network behavior. We further extend our study to include multiple refinements to the basic AODV protocol. The instantiation and validation of the model is completed by means of an experimental analysis.", 
    "editor": [
      {
        "familyName": "Langendoerfer", 
        "givenName": "Peter", 
        "type": "Person"
      }, 
      {
        "familyName": "Liu", 
        "givenName": "Mingyan", 
        "type": "Person"
      }, 
      {
        "familyName": "Matta", 
        "givenName": "Ibrahim", 
        "type": "Person"
      }, 
      {
        "familyName": "Tsaoussidis", 
        "givenName": "Vassilis", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-24643-5_18", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-20954-6", 
        "978-3-540-24643-5"
      ], 
      "name": "Wired/Wireless Internet Communications", 
      "type": "Book"
    }, 
    "keywords": [
      "demand Distance Vector (AODV) protocol", 
      "Distance Vector (AODV) protocol", 
      "Ad Hoc", 
      "Vector (AODV) protocol", 
      "acquisition process", 
      "basic AODV protocol", 
      "scalability analysis", 
      "AODV protocol", 
      "network behavior", 
      "performance estimation", 
      "difficult task", 
      "route length", 
      "multiple refinements", 
      "Hoc", 
      "protocol", 
      "strong need", 
      "such models", 
      "experimental analysis", 
      "analytical model", 
      "powerful metric", 
      "instantiation", 
      "AD", 
      "realistic model", 
      "task", 
      "probability density function", 
      "metrics", 
      "model", 
      "estimation", 
      "density function", 
      "process", 
      "validation", 
      "need", 
      "work", 
      "refinement", 
      "research", 
      "analysis", 
      "means", 
      "lack", 
      "source", 
      "function", 
      "behavior", 
      "ideal source", 
      "calculations", 
      "realistic calculations", 
      "length", 
      "study", 
      "characterization", 
      "route acquisition process", 
      "protocol scalability analysis"
    ], 
    "name": "The Ad Hoc On-Demand Distance Vector Protocol: An Analytical Model of the Route Acquisition Process", 
    "pagination": "201-212", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1015257279"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-24643-5_18"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-24643-5_18", 
      "https://app.dimensions.ai/details/publication/pub.1015257279"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:11", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_449.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-24643-5_18"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24643-5_18'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24643-5_18'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24643-5_18'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24643-5_18'


 

This table displays all metadata directly associated to this object as RDF triples.

145 TRIPLES      23 PREDICATES      75 URIs      68 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-24643-5_18 schema:about anzsrc-for:01
2 anzsrc-for:0104
3 schema:author Ncb155e81d2ea40e0a5482cd54e1f2f85
4 schema:datePublished 2004
5 schema:datePublishedReg 2004-01-01
6 schema:description Ad hoc networking research suffers from the lack of meaningful and realistic models to describe the route acquisition process of ad hoc routing protocols. There is a strong need for such models to be able to perform realistic calculations supporting important yet difficult tasks, such as performance estimation and protocol scalability analysis. Based on existing work for ideal source routing we formulate and validate an analytical model to match the route acquisition process executed by the Ad Hoc On-Demand Distance Vector (AODV) protocol. This allows us to predict the probability density function of estimated route lengths, a powerful metric for characterization of the network behavior. We further extend our study to include multiple refinements to the basic AODV protocol. The instantiation and validation of the model is completed by means of an experimental analysis.
7 schema:editor Na8a1041c55a241b4b5763023c4635ce8
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N8204c1a8f1dd4b31b6219133e98b0dd9
12 schema:keywords AD
13 AODV protocol
14 Ad Hoc
15 Distance Vector (AODV) protocol
16 Hoc
17 Vector (AODV) protocol
18 acquisition process
19 analysis
20 analytical model
21 basic AODV protocol
22 behavior
23 calculations
24 characterization
25 demand Distance Vector (AODV) protocol
26 density function
27 difficult task
28 estimation
29 experimental analysis
30 function
31 ideal source
32 instantiation
33 lack
34 length
35 means
36 metrics
37 model
38 multiple refinements
39 need
40 network behavior
41 performance estimation
42 powerful metric
43 probability density function
44 process
45 protocol
46 protocol scalability analysis
47 realistic calculations
48 realistic model
49 refinement
50 research
51 route acquisition process
52 route length
53 scalability analysis
54 source
55 strong need
56 study
57 such models
58 task
59 validation
60 work
61 schema:name The Ad Hoc On-Demand Distance Vector Protocol: An Analytical Model of the Route Acquisition Process
62 schema:pagination 201-212
63 schema:productId N1bd758e3ef3d4942826fa992270873f7
64 N463971a2b7c24b12bf71a8293ae87c35
65 schema:publisher Ne2b779f4a0bd474cbdf5af939d7220b0
66 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015257279
67 https://doi.org/10.1007/978-3-540-24643-5_18
68 schema:sdDatePublished 2021-12-01T20:11
69 schema:sdLicense https://scigraph.springernature.com/explorer/license/
70 schema:sdPublisher N47277c04c48e44598e1540a4ea662487
71 schema:url https://doi.org/10.1007/978-3-540-24643-5_18
72 sgo:license sg:explorer/license/
73 sgo:sdDataset chapters
74 rdf:type schema:Chapter
75 N1bd758e3ef3d4942826fa992270873f7 schema:name doi
76 schema:value 10.1007/978-3-540-24643-5_18
77 rdf:type schema:PropertyValue
78 N2b1969f7ae114fccb6f6b504e5c33fc6 rdf:first sg:person.014350724672.43
79 rdf:rest rdf:nil
80 N2c3eb1104b8f4cdf8d0939f13e3a02f1 rdf:first sg:person.07431233455.27
81 rdf:rest N2b1969f7ae114fccb6f6b504e5c33fc6
82 N40943f5853954a729342655f6d5b607d rdf:first sg:person.011536216101.63
83 rdf:rest N2c3eb1104b8f4cdf8d0939f13e3a02f1
84 N463971a2b7c24b12bf71a8293ae87c35 schema:name dimensions_id
85 schema:value pub.1015257279
86 rdf:type schema:PropertyValue
87 N47277c04c48e44598e1540a4ea662487 schema:name Springer Nature - SN SciGraph project
88 rdf:type schema:Organization
89 N4d2fe7257fb64f02bb27c0a931deea96 schema:familyName Liu
90 schema:givenName Mingyan
91 rdf:type schema:Person
92 N5daef9bae01648cebeb7c1ae02ef1b8c schema:familyName Tsaoussidis
93 schema:givenName Vassilis
94 rdf:type schema:Person
95 N8204c1a8f1dd4b31b6219133e98b0dd9 schema:isbn 978-3-540-20954-6
96 978-3-540-24643-5
97 schema:name Wired/Wireless Internet Communications
98 rdf:type schema:Book
99 Na8a1041c55a241b4b5763023c4635ce8 rdf:first Ndbd96da2f91e46c8959772aca40421bf
100 rdf:rest Nb357b1db9ae04b6491af1978cbb1842f
101 Nab8a8eff99a64909979ef7f59c68129b rdf:first Nde1622877524423090fa0bf83ac78e59
102 rdf:rest Nb807296a0c604dc6bdd9c9567d483961
103 Nb357b1db9ae04b6491af1978cbb1842f rdf:first N4d2fe7257fb64f02bb27c0a931deea96
104 rdf:rest Nab8a8eff99a64909979ef7f59c68129b
105 Nb807296a0c604dc6bdd9c9567d483961 rdf:first N5daef9bae01648cebeb7c1ae02ef1b8c
106 rdf:rest rdf:nil
107 Ncb155e81d2ea40e0a5482cd54e1f2f85 rdf:first sg:person.010143067443.79
108 rdf:rest N40943f5853954a729342655f6d5b607d
109 Ndbd96da2f91e46c8959772aca40421bf schema:familyName Langendoerfer
110 schema:givenName Peter
111 rdf:type schema:Person
112 Nde1622877524423090fa0bf83ac78e59 schema:familyName Matta
113 schema:givenName Ibrahim
114 rdf:type schema:Person
115 Ne2b779f4a0bd474cbdf5af939d7220b0 schema:name Springer Nature
116 rdf:type schema:Organisation
117 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
118 schema:name Mathematical Sciences
119 rdf:type schema:DefinedTerm
120 anzsrc-for:0104 schema:inDefinedTermSet anzsrc-for:
121 schema:name Statistics
122 rdf:type schema:DefinedTerm
123 sg:person.010143067443.79 schema:affiliation grid-institutes:grid.6546.1
124 schema:familyName Hollick
125 schema:givenName Matthias
126 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010143067443.79
127 rdf:type schema:Person
128 sg:person.011536216101.63 schema:affiliation grid-institutes:grid.6546.1
129 schema:familyName Schmitt
130 schema:givenName Jens B.
131 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011536216101.63
132 rdf:type schema:Person
133 sg:person.014350724672.43 schema:affiliation grid-institutes:grid.6546.1
134 schema:familyName Steinmetz
135 schema:givenName Ralf
136 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014350724672.43
137 rdf:type schema:Person
138 sg:person.07431233455.27 schema:affiliation grid-institutes:grid.6546.1
139 schema:familyName Seipl
140 schema:givenName Christian
141 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07431233455.27
142 rdf:type schema:Person
143 grid-institutes:grid.6546.1 schema:alternateName Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany
144 schema:name Multimedia Communications Lab (KOM), Department of Electrical Engineering and Information Technology, Darmstadt University of Technology, Merckstrasse 25, D-64289, Darmstadt, Germany
145 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...