Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • 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.
Show others and affiliations
Number of Authors: 52016 (English)In: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, Vol. 16, no 14, p. 1943-1955Article in journal (Refereed) 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

Place, publisher, year, edition, pages
2016. Vol. 16, no 14, p. 1943-1955
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
URN: urn:nbn:se:ltu:diva-11927DOI: 10.1002/wcm.2660ISI: 000384105900004Scopus ID: 2-s2.0-84958280921Local ID: af5bacee-847b-41fa-beb1-fefc21cf2a6fOAI: oai:DiVA.org:ltu-11927DiVA, id: diva2:984877
Note

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

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Vasilakos, Athanasios

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
In the same journal
Wireless Communications & Mobile Computing
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 54 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf