A Heuristic for Fast Convergence in Interference-free Channel Assignment Using D1EC Coloring View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2010-08-18

AUTHORS

Fabio Campoccia , Vincenzo Mancuso

ABSTRACT

This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a suboptimal coloring scheme. Furthermore, a stateful implementation of the D1EC scheme is proposed, in which network coloring is executed upon topology changes. The stateful D1EC reduces the algorithm’s convergence time by one order of magnitude in comparison to stateless algorithms. More... »

PAGES

183-186

Book

TITLE

Computer and Information Sciences

ISBN

978-90-481-9793-4
978-90-481-9794-1

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-90-481-9794-1_36

DOI

http://dx.doi.org/10.1007/978-90-481-9794-1_36

DIMENSIONS

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


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/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Palermo", 
          "id": "https://www.grid.ac/institutes/grid.10776.37", 
          "name": [
            "Universit\u00e0 degli studi di Palermo, Palermo, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Campoccia", 
        "givenName": "Fabio", 
        "id": "sg:person.015323537075.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015323537075.07"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "INRIA Sophia Antipolis, Nice, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mancuso", 
        "givenName": "Vincenzo", 
        "id": "sg:person.011100564547.29", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011100564547.29"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf00940812", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051937309", 
          "https://doi.org/10.1007/bf00940812"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1063/1.1699114", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1057769646"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/25.923049", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061135544"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/proc.1980.11899", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061444670"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1126/science.220.4598.671", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062526985"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/percomw.2006.129", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093422949"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/wons.2005.19", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094155397"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/infocom.2008.127", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094730154"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tencon.2004.1414649", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095180715"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2010-08-18", 
    "datePublishedReg": "2010-08-18", 
    "description": "This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a suboptimal coloring scheme. Furthermore, a stateful implementation of the D1EC scheme is proposed, in which network coloring is executed upon topology changes. The stateful D1EC reduces the algorithm\u2019s convergence time by one order of magnitude in comparison to stateless algorithms.", 
    "editor": [
      {
        "familyName": "Gelenbe", 
        "givenName": "Erol", 
        "type": "Person"
      }, 
      {
        "familyName": "Lent", 
        "givenName": "Ricardo", 
        "type": "Person"
      }, 
      {
        "familyName": "Sakellari", 
        "givenName": "Georgia", 
        "type": "Person"
      }, 
      {
        "familyName": "Sacan", 
        "givenName": "Ahmet", 
        "type": "Person"
      }, 
      {
        "familyName": "Toroslu", 
        "givenName": "Hakki", 
        "type": "Person"
      }, 
      {
        "familyName": "Yazici", 
        "givenName": "Adnan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-90-481-9794-1_36", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-90-481-9793-4", 
        "978-90-481-9794-1"
      ], 
      "name": "Computer and Information Sciences", 
      "type": "Book"
    }, 
    "name": "A Heuristic for Fast Convergence in Interference-free Channel Assignment Using D1EC Coloring", 
    "pagination": "183-186", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1041924258"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-90-481-9794-1_36"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "c7b57b57cbc8e39ea4073614fa1dd7dafc92a4fbae402a2c82d3dd366daa88ad"
        ]
      }
    ], 
    "publisher": {
      "location": "Dordrecht", 
      "name": "Springer Netherlands", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-90-481-9794-1_36", 
      "https://app.dimensions.ai/details/publication/pub.1041924258"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T08:21", 
    "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/0000000363_0000000363/records_70027_00000001.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F978-90-481-9794-1_36"
  }
]
 

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-90-481-9794-1_36'

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-90-481-9794-1_36'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-90-481-9794-1_36'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-90-481-9794-1_36'


 

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

127 TRIPLES      23 PREDICATES      35 URIs      19 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-90-481-9794-1_36 schema:about anzsrc-for:01
2 anzsrc-for:0103
3 schema:author N582694933fb94cba86ebf55d53b952ce
4 schema:citation sg:pub.10.1007/bf00940812
5 https://doi.org/10.1063/1.1699114
6 https://doi.org/10.1109/25.923049
7 https://doi.org/10.1109/infocom.2008.127
8 https://doi.org/10.1109/percomw.2006.129
9 https://doi.org/10.1109/proc.1980.11899
10 https://doi.org/10.1109/tencon.2004.1414649
11 https://doi.org/10.1109/wons.2005.19
12 https://doi.org/10.1126/science.220.4598.671
13 schema:datePublished 2010-08-18
14 schema:datePublishedReg 2010-08-18
15 schema:description This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a suboptimal coloring scheme. Furthermore, a stateful implementation of the D1EC scheme is proposed, in which network coloring is executed upon topology changes. The stateful D1EC reduces the algorithm’s convergence time by one order of magnitude in comparison to stateless algorithms.
16 schema:editor N2df88e9a85a24e7ea531288cf652208a
17 schema:genre chapter
18 schema:inLanguage en
19 schema:isAccessibleForFree false
20 schema:isPartOf N6ccac8a5ce9e47baa6757cd0fc7c700a
21 schema:name A Heuristic for Fast Convergence in Interference-free Channel Assignment Using D1EC Coloring
22 schema:pagination 183-186
23 schema:productId N01df6132fe8a48d6a7abf527b8a0efc7
24 N767babb22397473f9a4a4f1d412ff5e7
25 N996f274d9780406bb8238e48778f36c0
26 schema:publisher N9b33f88592624b6cb261ff802e02be0d
27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041924258
28 https://doi.org/10.1007/978-90-481-9794-1_36
29 schema:sdDatePublished 2019-04-16T08:21
30 schema:sdLicense https://scigraph.springernature.com/explorer/license/
31 schema:sdPublisher Nbb3f705f4d144ac2a98c4ab64afc6435
32 schema:url https://link.springer.com/10.1007%2F978-90-481-9794-1_36
33 sgo:license sg:explorer/license/
34 sgo:sdDataset chapters
35 rdf:type schema:Chapter
36 N01df6132fe8a48d6a7abf527b8a0efc7 schema:name dimensions_id
37 schema:value pub.1041924258
38 rdf:type schema:PropertyValue
39 N1b82c178d84648e6a3e9592849b2b170 schema:familyName Sacan
40 schema:givenName Ahmet
41 rdf:type schema:Person
42 N2bace4ee57584be7b55fa2db0f11e725 rdf:first Nb4706bfff4a04225a9d6b3fa45627cc0
43 rdf:rest N6262ca080ca34599840ffc4943032113
44 N2df88e9a85a24e7ea531288cf652208a rdf:first Nb55e2c8b04134aa997a655d546b81b91
45 rdf:rest Nef4659966add468782c0659744e6a4c2
46 N582694933fb94cba86ebf55d53b952ce rdf:first sg:person.015323537075.07
47 rdf:rest N6fa8297e60314c728d2b467aa74a2f66
48 N6262ca080ca34599840ffc4943032113 rdf:first Neca4c15c049646ceb21b6c0a7abd3f48
49 rdf:rest rdf:nil
50 N6ccac8a5ce9e47baa6757cd0fc7c700a schema:isbn 978-90-481-9793-4
51 978-90-481-9794-1
52 schema:name Computer and Information Sciences
53 rdf:type schema:Book
54 N6fa8297e60314c728d2b467aa74a2f66 rdf:first sg:person.011100564547.29
55 rdf:rest rdf:nil
56 N767babb22397473f9a4a4f1d412ff5e7 schema:name doi
57 schema:value 10.1007/978-90-481-9794-1_36
58 rdf:type schema:PropertyValue
59 N80bc2355cc5b40bba6b1f341d60d235c schema:name INRIA Sophia Antipolis, Nice, France
60 rdf:type schema:Organization
61 N88050ea54b83471a9495449ea8c8e35c schema:familyName Sakellari
62 schema:givenName Georgia
63 rdf:type schema:Person
64 N88be23ba720244f89f933d9889415d50 rdf:first N1b82c178d84648e6a3e9592849b2b170
65 rdf:rest N2bace4ee57584be7b55fa2db0f11e725
66 N996f274d9780406bb8238e48778f36c0 schema:name readcube_id
67 schema:value c7b57b57cbc8e39ea4073614fa1dd7dafc92a4fbae402a2c82d3dd366daa88ad
68 rdf:type schema:PropertyValue
69 N9b33f88592624b6cb261ff802e02be0d schema:location Dordrecht
70 schema:name Springer Netherlands
71 rdf:type schema:Organisation
72 N9cb2c7f64f11442fa642be169f5d809f rdf:first N88050ea54b83471a9495449ea8c8e35c
73 rdf:rest N88be23ba720244f89f933d9889415d50
74 Nb4706bfff4a04225a9d6b3fa45627cc0 schema:familyName Toroslu
75 schema:givenName Hakki
76 rdf:type schema:Person
77 Nb55e2c8b04134aa997a655d546b81b91 schema:familyName Gelenbe
78 schema:givenName Erol
79 rdf:type schema:Person
80 Nbb3f705f4d144ac2a98c4ab64afc6435 schema:name Springer Nature - SN SciGraph project
81 rdf:type schema:Organization
82 Ndfa8f5c6bd064b24a71f0a32810768ae schema:familyName Lent
83 schema:givenName Ricardo
84 rdf:type schema:Person
85 Neca4c15c049646ceb21b6c0a7abd3f48 schema:familyName Yazici
86 schema:givenName Adnan
87 rdf:type schema:Person
88 Nef4659966add468782c0659744e6a4c2 rdf:first Ndfa8f5c6bd064b24a71f0a32810768ae
89 rdf:rest N9cb2c7f64f11442fa642be169f5d809f
90 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
91 schema:name Mathematical Sciences
92 rdf:type schema:DefinedTerm
93 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
94 schema:name Numerical and Computational Mathematics
95 rdf:type schema:DefinedTerm
96 sg:person.011100564547.29 schema:affiliation N80bc2355cc5b40bba6b1f341d60d235c
97 schema:familyName Mancuso
98 schema:givenName Vincenzo
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011100564547.29
100 rdf:type schema:Person
101 sg:person.015323537075.07 schema:affiliation https://www.grid.ac/institutes/grid.10776.37
102 schema:familyName Campoccia
103 schema:givenName Fabio
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015323537075.07
105 rdf:type schema:Person
106 sg:pub.10.1007/bf00940812 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051937309
107 https://doi.org/10.1007/bf00940812
108 rdf:type schema:CreativeWork
109 https://doi.org/10.1063/1.1699114 schema:sameAs https://app.dimensions.ai/details/publication/pub.1057769646
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1109/25.923049 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061135544
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1109/infocom.2008.127 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094730154
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1109/percomw.2006.129 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093422949
116 rdf:type schema:CreativeWork
117 https://doi.org/10.1109/proc.1980.11899 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061444670
118 rdf:type schema:CreativeWork
119 https://doi.org/10.1109/tencon.2004.1414649 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095180715
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1109/wons.2005.19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094155397
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1126/science.220.4598.671 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062526985
124 rdf:type schema:CreativeWork
125 https://www.grid.ac/institutes/grid.10776.37 schema:alternateName University of Palermo
126 schema:name Università degli studi di Palermo, Palermo, Italy
127 rdf:type schema:Organization
 




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


...