Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2002-09

AUTHORS

Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris

ABSTRACT

This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity. More... »

PAGES

481-494

Identifiers

URI

http://scigraph.springernature.com/pub.10.1023/a:1016542229220

DOI

http://dx.doi.org/10.1023/a:1016542229220

DIMENSIONS

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


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/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Massachusetts Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chen", 
        "givenName": "Benjie", 
        "id": "sg:person.015004227263.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015004227263.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Massachusetts Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jamieson", 
        "givenName": "Kyle", 
        "id": "sg:person.011500023741.90", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011500023741.90"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Massachusetts Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Balakrishnan", 
        "givenName": "Hari", 
        "id": "sg:person.013645142503.09", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013645142503.09"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Massachusetts Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.116068.8", 
          "name": [
            "Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Morris", 
        "givenName": "Robert", 
        "id": "sg:person.01106062524.61", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01106062524.61"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/248157.248176", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041192104"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icc.1998.683107", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093584756"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2002-09", 
    "datePublishedReg": "2002-09-01", 
    "description": "This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1023/a:1016542229220", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1327893", 
        "issn": [
          "1022-0038", 
          "1572-8196"
        ], 
        "name": "Wireless Networks", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "5", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "8"
      }
    ], 
    "name": "Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks", 
    "pagination": "481-494", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "6909ffb1ef6dc6c6f4b456d7e382042326ba764bfbee739819d5bed3dd985d5b"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1023/a:1016542229220"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1022047248"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1023/a:1016542229220", 
      "https://app.dimensions.ai/details/publication/pub.1022047248"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T01:58", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8700_00000505.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1023/A:1016542229220"
  }
]
 

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.1023/a:1016542229220'

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.1023/a:1016542229220'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1023/a:1016542229220'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1023/a:1016542229220'


 

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

88 TRIPLES      21 PREDICATES      29 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1023/a:1016542229220 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author N64a5d4ec55fb49fea80b85ceec3659d0
4 schema:citation https://doi.org/10.1109/icc.1998.683107
5 https://doi.org/10.1145/248157.248176
6 schema:datePublished 2002-09
7 schema:datePublishedReg 2002-09-01
8 schema:description This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.
9 schema:genre research_article
10 schema:inLanguage en
11 schema:isAccessibleForFree false
12 schema:isPartOf N3e91993199144881ad7fdf6f15b0e62a
13 N4242b4ac6cf745719643b2dcda907c88
14 sg:journal.1327893
15 schema:name Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
16 schema:pagination 481-494
17 schema:productId N0af9ea11a5934fd0888392006524a300
18 N773a5bc6000b4e7fbca70327fcc71fbe
19 Nd390ff9a0b714479af7a4a3bc751c9af
20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022047248
21 https://doi.org/10.1023/a:1016542229220
22 schema:sdDatePublished 2019-04-11T01:58
23 schema:sdLicense https://scigraph.springernature.com/explorer/license/
24 schema:sdPublisher Naf56cb1c5e4b4211b343334cca204ca4
25 schema:url http://link.springer.com/10.1023/A:1016542229220
26 sgo:license sg:explorer/license/
27 sgo:sdDataset articles
28 rdf:type schema:ScholarlyArticle
29 N0af9ea11a5934fd0888392006524a300 schema:name doi
30 schema:value 10.1023/a:1016542229220
31 rdf:type schema:PropertyValue
32 N3e91993199144881ad7fdf6f15b0e62a schema:issueNumber 5
33 rdf:type schema:PublicationIssue
34 N4242b4ac6cf745719643b2dcda907c88 schema:volumeNumber 8
35 rdf:type schema:PublicationVolume
36 N64a5d4ec55fb49fea80b85ceec3659d0 rdf:first sg:person.015004227263.38
37 rdf:rest Ncb0796e452834fd3ac70a7958a097697
38 N773a5bc6000b4e7fbca70327fcc71fbe schema:name dimensions_id
39 schema:value pub.1022047248
40 rdf:type schema:PropertyValue
41 N8f1466a2c0994a7da92be31dac7e47ea rdf:first sg:person.01106062524.61
42 rdf:rest rdf:nil
43 Naf56cb1c5e4b4211b343334cca204ca4 schema:name Springer Nature - SN SciGraph project
44 rdf:type schema:Organization
45 Ncb0796e452834fd3ac70a7958a097697 rdf:first sg:person.011500023741.90
46 rdf:rest Ne132e02cb318444b86251157671d9822
47 Nd390ff9a0b714479af7a4a3bc751c9af schema:name readcube_id
48 schema:value 6909ffb1ef6dc6c6f4b456d7e382042326ba764bfbee739819d5bed3dd985d5b
49 rdf:type schema:PropertyValue
50 Ne132e02cb318444b86251157671d9822 rdf:first sg:person.013645142503.09
51 rdf:rest N8f1466a2c0994a7da92be31dac7e47ea
52 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
53 schema:name Technology
54 rdf:type schema:DefinedTerm
55 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
56 schema:name Communications Technologies
57 rdf:type schema:DefinedTerm
58 sg:journal.1327893 schema:issn 1022-0038
59 1572-8196
60 schema:name Wireless Networks
61 rdf:type schema:Periodical
62 sg:person.01106062524.61 schema:affiliation https://www.grid.ac/institutes/grid.116068.8
63 schema:familyName Morris
64 schema:givenName Robert
65 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01106062524.61
66 rdf:type schema:Person
67 sg:person.011500023741.90 schema:affiliation https://www.grid.ac/institutes/grid.116068.8
68 schema:familyName Jamieson
69 schema:givenName Kyle
70 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011500023741.90
71 rdf:type schema:Person
72 sg:person.013645142503.09 schema:affiliation https://www.grid.ac/institutes/grid.116068.8
73 schema:familyName Balakrishnan
74 schema:givenName Hari
75 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013645142503.09
76 rdf:type schema:Person
77 sg:person.015004227263.38 schema:affiliation https://www.grid.ac/institutes/grid.116068.8
78 schema:familyName Chen
79 schema:givenName Benjie
80 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015004227263.38
81 rdf:type schema:Person
82 https://doi.org/10.1109/icc.1998.683107 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093584756
83 rdf:type schema:CreativeWork
84 https://doi.org/10.1145/248157.248176 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041192104
85 rdf:type schema:CreativeWork
86 https://www.grid.ac/institutes/grid.116068.8 schema:alternateName Massachusetts Institute of Technology
87 schema:name Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA
88 rdf:type schema:Organization
 




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


...