An Energy-Balanced Data Gathering Algorithm for Linear Wireless Sensor Networks View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2010-06

AUTHORS

An-Feng Liu, Xian-You Wu, Zhi-Gang Chen, Wei-Hua Gui

ABSTRACT

Aiming at the data unbalance of sensor nodes in the wireless sensor networks (WSN), this paper mainly studies the data gathering algorithm for linear WSNs. As the data amount varies from the time spent on data gathering of entire network minimal, it is a key factor to balance energy consumption and further prolong the network lifetime. Therefore, this paper proposes a TDMA scheduling algorithm for general k-hop networks, and takes detail performance analysis on the algorithm. Furthermore, we present the method of selecting the optimal hop-count and its formula as well as the formula of the number of timeslots required for converge-cast in order to maximize network lifetime. Finally, we obtain some general conclusions of network optimization based on the theoretical analysis and simulations. Compared with the 1-hop algorithm in (C. Florens and R. McEliece, Packets Distribution Algorithms for Sensor Networks, IEEE INFOCOM, San Diego, pp. 1063–1072, 2003), the TDMA scheduling algorithm for the general k-hop network proposed in our paper is more universal and has more practical application value. More... »

PAGES

42-53

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10776-010-0113-1

DOI

http://dx.doi.org/10.1007/s10776-010-0113-1

DIMENSIONS

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


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": "Central South University", 
          "id": "https://www.grid.ac/institutes/grid.216417.7", 
          "name": [
            "College of Information Science and Engineering, Central South University, 410083, Changsha, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Liu", 
        "givenName": "An-Feng", 
        "id": "sg:person.01173003135.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01173003135.21"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Central South University", 
          "id": "https://www.grid.ac/institutes/grid.216417.7", 
          "name": [
            "College of Information Science and Engineering, Central South University, 410083, Changsha, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wu", 
        "givenName": "Xian-You", 
        "id": "sg:person.013362643723.22", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013362643723.22"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Central South University", 
          "id": "https://www.grid.ac/institutes/grid.216417.7", 
          "name": [
            "College of Information Science and Engineering, Central South University, 410083, Changsha, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chen", 
        "givenName": "Zhi-Gang", 
        "id": "sg:person.011063416745.10", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011063416745.10"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Central South University", 
          "id": "https://www.grid.ac/institutes/grid.216417.7", 
          "name": [
            "College of Information Science and Engineering, Central South University, 410083, Changsha, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gui", 
        "givenName": "Wei-Hua", 
        "id": "sg:person.014564074022.19", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014564074022.19"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2010-06", 
    "datePublishedReg": "2010-06-01", 
    "description": "Aiming at the data unbalance of sensor nodes in the wireless sensor networks (WSN), this paper mainly studies the data gathering algorithm for linear WSNs. As the data amount varies from the time spent on data gathering of entire network minimal, it is a key factor to balance energy consumption and further prolong the network lifetime. Therefore, this paper proposes a TDMA scheduling algorithm for general k-hop networks, and takes detail performance analysis on the algorithm. Furthermore, we present the method of selecting the optimal hop-count and its formula as well as the formula of the number of timeslots required for converge-cast in order to maximize network lifetime. Finally, we obtain some general conclusions of network optimization based on the theoretical analysis and simulations. Compared with the 1-hop algorithm in (C. Florens and R. McEliece, Packets Distribution Algorithms for Sensor Networks, IEEE INFOCOM, San Diego, pp. 1063\u20131072, 2003), the TDMA scheduling algorithm for the general k-hop network proposed in our paper is more universal and has more practical application value.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10776-010-0113-1", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136830", 
        "issn": [
          "1068-9605", 
          "1572-8129"
        ], 
        "name": "International Journal of Wireless Information Networks", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1-2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "17"
      }
    ], 
    "name": "An Energy-Balanced Data Gathering Algorithm for Linear Wireless Sensor Networks", 
    "pagination": "42-53", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "66d94eed63fcd98e14659114f51ef4b5ebb4257be829763b81f0b61126664305"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10776-010-0113-1"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1021586398"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10776-010-0113-1", 
      "https://app.dimensions.ai/details/publication/pub.1021586398"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T16:42", 
    "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_8669_00000512.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs10776-010-0113-1"
  }
]
 

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/s10776-010-0113-1'

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/s10776-010-0113-1'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10776-010-0113-1'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10776-010-0113-1'


 

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

82 TRIPLES      20 PREDICATES      27 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10776-010-0113-1 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author Nc15cccdab40f4ebebb9d93d01a8874e5
4 schema:datePublished 2010-06
5 schema:datePublishedReg 2010-06-01
6 schema:description Aiming at the data unbalance of sensor nodes in the wireless sensor networks (WSN), this paper mainly studies the data gathering algorithm for linear WSNs. As the data amount varies from the time spent on data gathering of entire network minimal, it is a key factor to balance energy consumption and further prolong the network lifetime. Therefore, this paper proposes a TDMA scheduling algorithm for general k-hop networks, and takes detail performance analysis on the algorithm. Furthermore, we present the method of selecting the optimal hop-count and its formula as well as the formula of the number of timeslots required for converge-cast in order to maximize network lifetime. Finally, we obtain some general conclusions of network optimization based on the theoretical analysis and simulations. Compared with the 1-hop algorithm in (C. Florens and R. McEliece, Packets Distribution Algorithms for Sensor Networks, IEEE INFOCOM, San Diego, pp. 1063–1072, 2003), the TDMA scheduling algorithm for the general k-hop network proposed in our paper is more universal and has more practical application value.
7 schema:genre research_article
8 schema:inLanguage en
9 schema:isAccessibleForFree false
10 schema:isPartOf N7dd8c822cff847d493c2f6592f36ec40
11 Nd6f0cea096a5414a9ea3118d03e037cb
12 sg:journal.1136830
13 schema:name An Energy-Balanced Data Gathering Algorithm for Linear Wireless Sensor Networks
14 schema:pagination 42-53
15 schema:productId N14ef666179a448b5bc0739052e9783f8
16 N8dfc737605684bb19acd4b31ce13408f
17 Nfbe58a72dfeb4db99af06f6928b836ee
18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021586398
19 https://doi.org/10.1007/s10776-010-0113-1
20 schema:sdDatePublished 2019-04-10T16:42
21 schema:sdLicense https://scigraph.springernature.com/explorer/license/
22 schema:sdPublisher N0f6c4e7112004923aec37186e58cdccf
23 schema:url http://link.springer.com/10.1007%2Fs10776-010-0113-1
24 sgo:license sg:explorer/license/
25 sgo:sdDataset articles
26 rdf:type schema:ScholarlyArticle
27 N0f6c4e7112004923aec37186e58cdccf schema:name Springer Nature - SN SciGraph project
28 rdf:type schema:Organization
29 N14ef666179a448b5bc0739052e9783f8 schema:name readcube_id
30 schema:value 66d94eed63fcd98e14659114f51ef4b5ebb4257be829763b81f0b61126664305
31 rdf:type schema:PropertyValue
32 N4e7fa58cf49349ddb409146abca3bfab rdf:first sg:person.013362643723.22
33 rdf:rest Nb1a4e2b2423b47afb1c4ff0912b32829
34 N7dd8c822cff847d493c2f6592f36ec40 schema:issueNumber 1-2
35 rdf:type schema:PublicationIssue
36 N8dfc737605684bb19acd4b31ce13408f schema:name doi
37 schema:value 10.1007/s10776-010-0113-1
38 rdf:type schema:PropertyValue
39 Nb1a4e2b2423b47afb1c4ff0912b32829 rdf:first sg:person.011063416745.10
40 rdf:rest Nfe93aeb8edfc490e950e9c66187fabe6
41 Nc15cccdab40f4ebebb9d93d01a8874e5 rdf:first sg:person.01173003135.21
42 rdf:rest N4e7fa58cf49349ddb409146abca3bfab
43 Nd6f0cea096a5414a9ea3118d03e037cb schema:volumeNumber 17
44 rdf:type schema:PublicationVolume
45 Nfbe58a72dfeb4db99af06f6928b836ee schema:name dimensions_id
46 schema:value pub.1021586398
47 rdf:type schema:PropertyValue
48 Nfe93aeb8edfc490e950e9c66187fabe6 rdf:first sg:person.014564074022.19
49 rdf:rest rdf:nil
50 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
51 schema:name Technology
52 rdf:type schema:DefinedTerm
53 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
54 schema:name Communications Technologies
55 rdf:type schema:DefinedTerm
56 sg:journal.1136830 schema:issn 1068-9605
57 1572-8129
58 schema:name International Journal of Wireless Information Networks
59 rdf:type schema:Periodical
60 sg:person.011063416745.10 schema:affiliation https://www.grid.ac/institutes/grid.216417.7
61 schema:familyName Chen
62 schema:givenName Zhi-Gang
63 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011063416745.10
64 rdf:type schema:Person
65 sg:person.01173003135.21 schema:affiliation https://www.grid.ac/institutes/grid.216417.7
66 schema:familyName Liu
67 schema:givenName An-Feng
68 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01173003135.21
69 rdf:type schema:Person
70 sg:person.013362643723.22 schema:affiliation https://www.grid.ac/institutes/grid.216417.7
71 schema:familyName Wu
72 schema:givenName Xian-You
73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013362643723.22
74 rdf:type schema:Person
75 sg:person.014564074022.19 schema:affiliation https://www.grid.ac/institutes/grid.216417.7
76 schema:familyName Gui
77 schema:givenName Wei-Hua
78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014564074022.19
79 rdf:type schema:Person
80 https://www.grid.ac/institutes/grid.216417.7 schema:alternateName Central South University
81 schema:name College of Information Science and Engineering, Central South University, 410083, Changsha, China
82 rdf:type schema:Organization
 




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


...