Literature Database Entry


Florian Klingler, Shaojie Tang, Xuefeng Liu, Falko Dressler, Christoph Sommer and Jiannong Cao, "Faster Distributed Localization of Large Numbers of Nodes Using Clustering," Proceedings of 38th IEEE Conference on Local Computer Networks (LCN 2013), Sydney, Australia, October 2013, pp. 728–731.


Chirp Spread Spectrum (CSS) based localization techniques are becoming more attractive as they provide improved localization accuracy and robustness compared to WiFi or ZigBee based approaches. However, a remaining problem is the necessary update frequency: In existing CSS based localization systems, the positions of the objects are determined one by one via unicast with nearby anchors instead of using broadcasts. We propose a faster distributed localization scheme for CSS based systems. A portion of nodes are considered cluster heads; they determine the locations of un-localized nodes by dynamically increasing the transmission power. Our novel scheme not only fully utilizes the spatial redundancy, which is crucial for speeding up the localization process. By also allowing to establish new anchors in a two-hop range, we can further increase speed without significantly influencing localization error. The performance of the proposed method is demonstrated through simulation.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Florian Klingler
Shaojie Tang
Xuefeng Liu
Falko Dressler
Christoph Sommer
Jiannong Cao

BibTeX reference

    author = {Klingler, Florian and Tang, Shaojie and Liu, Xuefeng and Dressler, Falko and Sommer, Christoph and Cao, Jiannong},
    doi = {10.1109/LCN.2013.6761317},
    title = {{Faster Distributed Localization of Large Numbers of Nodes Using Clustering}},
    pages = {728--731},
    publisher = {IEEE},
    address = {Sydney, Australia},
    booktitle = {38th IEEE Conference on Local Computer Networks (LCN 2013)},
    month = {10},
    year = {2013},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-07-21