Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Game Balanced Multi-factor Multicast Routing in Sensor Grid Networks
Laboratoire DAVID, University of Versailles-Saint-Quentin.
School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Department of Business and Computer Science, Southwestern Oklahoma State University.
Laboratoire DAVID, University of Versailles-Saint-Quentin.
Laboratory Applied Mathematics and Systems, Ecole Centrale de Paris.
Vise andre og tillknytning
Rekke forfattare: 62016 (engelsk)Inngår i: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 367-368, s. 550-572Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

In increasingly important sensor grid networks, multicast routing is widely used in date aggregation and distributed query processing. It requires multicast trees for efficient data transmissions. However, sensor nodes in such networks typically have limited resources and computing power. Efforts have been made to consider the space, energy and data factors separately to optimize the network performance. Considering these factors simultaneously, this paper presents a game balance based multi-factor multicast routing approach for sensor grid networks. It integrates the three factors into a unified model through a linear combination. The model is standardized and then solved theoretically by using the concept of game balance from game theory. The solution gives Nash equilibrium, implying a well balanced result for all the three factors. The theoretic results are implemented in algorithms for cluster formation, cluster core selection, cluster tree construction, and multicast routing. Extensive simulation experiments show that the presented approach gives mostly better overall performance than benchmark methods

sted, utgiver, år, opplag, sider
2016. Vol. 367-368, s. 550-572
HSV kategori
Forskningsprogram
Distribuerade datorsystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-11187DOI: 10.1016/j.ins.2016.06.049ISI: 000382794400034Scopus ID: 2-s2.0-84978986091Lokal ID: a17afbf1-0492-4ddf-b4b6-a2c584780bcdOAI: oai:DiVA.org:ltu-11187DiVA, id: diva2:984136
Merknad

Validerad; 2016; Nivå 2; 20160630 (andbra)

Tilgjengelig fra: 2016-09-29 Laget: 2016-09-29 Sist oppdatert: 2018-07-10bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Vasilakos, Athanasios

Søk i DiVA

Av forfatter/redaktør
Vasilakos, Athanasios
Av organisasjonen
I samme tidsskrift
Information Sciences

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 18 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf