Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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
Efficient location-based topology control algorithms for wireless ad hoc and sensor networks
Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing.
Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing.
Electrical and Computer Engineering, Faculty of Engineering and Applied Science, Memorial University of Newfoundland, St. John's.
Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing.
Vise andre og tillknytning
Rekke forfattare: 52016 (engelsk)Inngår i: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, Vol. 16, nr 14, s. 1943-1955Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Topology control is an efficient strategy for improving the performance of wireless ad hoc and sensor networks by building network topologies with desirable features. In this process, location information of nodes can be used to improve the performance of a topology control algorithm and also ease its operations. Many location-based topology control algorithms have been proposed. In this paper, we propose two location-assisted grid-based topology control (GBP) algorithms. The design objective of our algorithm is to effectively reduce the number of active nodes required to keep global network connectivity. In grid-based topology control, a network is divided into equally spaced squares (called grids). We accordingly design cross-sectional topology control algorithm and diagonal topology control algorithm based on different network parameter settings. The key idea is to build near-minimal connected dominating set for the network at the grid level. Analytical and simulation results demonstrate that our designed algorithms outperform existing work. Furthermore, the diagonal algorithm outperforms the cross-sectional algorithm

sted, utgiver, år, opplag, sider
2016. Vol. 16, nr 14, s. 1943-1955
HSV kategori
Forskningsprogram
Distribuerade datorsystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-11927DOI: 10.1002/wcm.2660ISI: 000384105900004Scopus ID: 2-s2.0-84958280921Lokal ID: af5bacee-847b-41fa-beb1-fefc21cf2a6fOAI: oai:DiVA.org:ltu-11927DiVA, id: diva2:984877
Merknad

Validerad; 2016; Nivå 2; 2016-11-10 (rokbeg) 

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
Wireless Communications & Mobile Computing

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

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

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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