A greedy approach to beacon placement for localization
01 Nov 2008-pp 1-5
TL;DR: A novel beacon placement algorithm is presented which uses greedy approach, to achieve threshold degree condition at all points and observed an improvement in accuracy over uniform placement.
Abstract: The need for location aware applications is increasing with the popularity of ubiquitous computing. Localization which is the process of estimating the location of a node is an important building block in these location aware applications. In a typical localization technique, beacons whose locations are known a priori, acts as reference in estimating the location of user nodes. It has been observed that the placement and density of these beacons have strong impact on the accuracy of localization. The intuitive approaches - uniform and dense beacon placement will not suffice in practical situations due to the presence of nonuniform obstructions and self interference of beacons which results in non-uniform signal propagation error. The effect of beacon density on localization error is characterized as decrease in error with increase in beacon density up to a point termed as threshold density and there after the effect is minimal. The number of beacons that will be in range at this threshold density is threshold degree muthresh. To address the problems of uniform and dense placement, we will present a novel beacon placement algorithm in this paper which uses greedy approach, to achieve threshold degree condition at all points and observed an improvement in accuracy over uniform placement.
Citations
More filters
Journal Article•
TL;DR: This paper describes the motivation, design, implementation, and experimental evaluation (on sharply resource-constrained devices) of a self-configuring localization system using radio beacons, and develops algorithms to improve localization quality.
Abstract: Embedded networked sensors promise to revolutionize the way we interact with our physical environment and require scalable, ad hoc deployable and energy-efficient node localization/positioning.This paper describes the motivation, design, implementation, and experimental evaluation (on sharply resource-constrained devices) of a self-configuring localization system using radio beacons. We identify beacon density as an important parameter in determining localization quality, which saturates at a transition density. We develop algorithms to improve localization quality by (i) automating placement of new beacons at low densities (HEAP) and (ii) rotating functionality among redundant beacons while increasing system lifetime at high densities (STROBE).
10 citations
6 citations
01 Dec 2017
TL;DR: This paper tries to answer two fundamental questions that find little response in the scientific literature, how many beacons should be deployed, regardless of their placement, to reach a given location performance in a fingerprinting localization architecture and how a given level of performance can be maintained as the number of beacons is further decreased.
Abstract: In this paper, we try to answer two questions. First, how many beacons should be deployed, regardless of their placement, to reach a given location performance in a fingerprinting localization architecture? Second, where should the beacons be deployed to enhance location performances, yet with a reduced number of beacons? Finally, hints are given on how a given level of performance can be maintained as the number of beacons is further decreased. To answer those two questions, almost 30 433MHz/868MHZ-UHF-RFID active tags have been deployed both in a corridor and in a hall environment. An electromagnetic mapping of these two environments is recorded by a reader and a post-processing is carried out to answer these two fundamental questions that find little response in the scientific literature.
4 citations
Dissertation•
28 Nov 2019
TL;DR: This paper aims to provide a history of statistical analysis of the determinants of infectious disease in the context of vaccination and its role in the immune system.
Abstract: ....................................................................................................................................ii Lay Summary of Thesis ............................................................................................................. iv Acknowledgement .................................................................................................................... v List of figures ............................................................................................................................ vi List of tables .............................................................................................................................. x List of equation ........................................................................................................................ xi Content .................................................................................................................................. xiii
1 citations
Cites background from "A greedy approach to beacon placeme..."
...Several beacon placement strategies have been proposed, such as in [83], [84], [85], [86], and [87]....
[...]
01 Oct 2012
TL;DR: A Distribution-Adapted Grid (DAG) measurement is proposed to adapt the non-uniform distribution impact observed by real WSN nodes to precisely measure the effectiveness of beacon location.
Abstract: Previous studies show that the placement layout of beacons has a strong impact on localization performance. Therefore, the effectiveness of beacon location should be considered in designing the deployment or the sleeping scheduling of beacons. We propose a Distribution-Adapted Grid (DAG) measurement to adapt the non-uniform distribution impact observed by real WSN nodes to precisely measure the effectiveness of beacon location. Comparing to the previous methods, DAG can reduce 30% beacon usage under the same localization error. When only half of these beacons at saturated state were placed, DAG can reduce 76% localization error.
1 citations
Cites background or methods from "A greedy approach to beacon placeme..."
...The performance of DAG is compared with Max, Grid, and Greedy via simulations and presented in next section....
[...]
...Not only referred works, but also a recent empirical method namely Greedy [8], which allows adaptation to terrain conditions and incrementally place beacons to design beacon deployment, was carried out in simulations and compared with proposed DAG....
[...]
...DAG, Max, Grid, and Greedy were evaluated in the simulations carried out in MATLAB to incrementally place beacons (by the steps described in Section II) respectively....
[...]
...To evaluate DAG, we compare it with the conventional methods such as Max, Grid, and Greedy....
[...]
...In [8], Greedy addresses the beacon placement as a set cover problem, and takes coverage degree as the measurement to the effectiveness of a beacon location....
[...]
References
More filters
Book•
01 Jan 1990TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Abstract: From the Publisher:
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition,this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
In its new edition,Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity,and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
As in the classic first edition,this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further,the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.
Each chapter presents an algorithm,a design technique,an application area,or a related topic. The chapters are not dependent on one another,so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally,the new edition offers a 25% increase over the first edition in the number of problems,giving the book 155 problems and over 900 exercises thatreinforcethe concepts the students are learning.
21,651 citations
"A greedy approach to beacon placeme..." refers methods in this paper
...To ensure threshold degree condition at these points also, additional beacons are added in the augmentation phase using Greedy approach of the Set Cover problem [ 4 ]....
[...]
Book•
15 Jan 1996
TL;DR: WireWireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications technology and system design as discussed by the authors, which covers the fundamental issues impacting all wireless networks and reviews virtually every important new wireless standard and technological development, offering especially comprehensive coverage of the 3G systems and wireless local area networks (WLANs).
Abstract: From the Publisher:
The indispensable guide to wireless communicationsnow fully revised and updated!
Wireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications technology and system design. Building on his classic first edition, Theodore S. Rappaport covers the fundamental issues impacting all wireless networks and reviews virtually every important new wireless standard and technological development, offering especially comprehensive coverage of the 3G systems and wireless local area networks (WLANs) that will transform communications in the coming years. Rappaport illustrates each key concept with practical examples, thoroughly explained and solved step by step.
Coverage includes:
An overview of key wireless technologies: voice, data, cordless, paging, fixed and mobile broadband wireless systems, and beyond
Wireless system design fundamentals: channel assignment, handoffs, trunking efficiency, interference, frequency reuse, capacity planning, large-scale fading, and more
Path loss, small-scale fading, multipath, reflection, diffraction, scattering, shadowing, spatial-temporal channel modeling, and microcell/indoor propagation
Modulation, equalization, diversity, channel coding, and speech coding
New wireless LAN technologies: IEEE 802.11a/b, HIPERLAN, BRAN, and other alternatives
New 3G air interface standards, including W-CDMA, cdma2000, GPRS, UMTS, and EDGE
Bluetooth wearable computers, fixed wireless and Local Multipoint Distribution Service (LMDS), and other advanced technologies
Updated glossary of abbreviations and acronyms, and a thorolist of references
Dozens of new examples and end-of-chapter problems
Whether you're a communications/network professional, manager, researcher, or student, Wireless Communications: Principles and Practice, Second Edition gives you an in-depth understanding of the state of the art in wireless technologytoday's and tomorrow's.
17,102 citations
01 Aug 2000
TL;DR: The randomized algorithm used by beacons to transmit information, the use of concurrent radio and ultrasonic signals to infer distance, the listener inference algorithms to overcome multipath and interference, and practical beacon configuration and positioning techniques that improve accuracy are described.
Abstract: This paper presents the design, implementation, and evaluation of Cricket, a location-support system for in-building, mobile, location-dependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze information from beacons spread throughout the building. Cricket is the result of several design goals, including user privacy, decentralized administration, network heterogeneity, and low cost. Rather than explicitly tracking user location, Cricket helps devices learn where they are and lets them decide whom to advertise this information to; it does not rely on any centralized management or control and there is no explicit coordination between beacons; it provides information to devices regardless of their type of network connectivity; and each Cricket device is made from off-the-shelf components and costs less than U.S. $10. We describe the randomized algorithm used by beacons to transmit information, the use of concurrent radio and ultrasonic signals to infer distance, the listener inference algorithms to overcome multipath and interference, and practical beacon configuration and positioning techniques that improve accuracy. Our experience with Cricket shows that several location-dependent applications such as in-building active maps and device control can be developed with little effort or manual configuration.
4,123 citations
"A greedy approach to beacon placeme..." refers background in this paper
...Many indoor localization techniques have been proposed so far [ 1 ], [2], and [3]....
[...]
09 Jul 2003
TL;DR: This paper proposes a method for all nodes to determine their orientation and position in an ad-hoc network where only a fraction of the nodes have positioning capabilities, under the assumption that each node has the AOA capability.
Abstract: Position information of individual nodes is useful in implementing functions such as routing and querying in ad-hoc networks. Deriving position information by using the capability of the nodes to measure time of arrival (TOA), time difference of arrival (TDOA), angle of arrival (AOA) and signal strength have been used to localize nodes relative to a frame of reference. The nodes in an ad-hoc network can have multiple capabilities and exploiting one or more of the capabilities can improve the quality of positioning. In this paper, we show how AOA capability of the nodes can be used to derive position information. We propose a method for all nodes to determine their orientation and position in an ad-hoc network where only a fraction of the nodes have positioning capabilities, under the assumption that each node has the AOA capability.
2,285 citations
TL;DR: This work is proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
Abstract: Many ad hoc network protocols and applications assume the knowledge of geographic location of nodes. The absolute position of each networked node is an assumed fact by most sensor networks which can then present the sensed information on a geographical map. Finding position without the aid of GPS in each node of an ad hoc network is important in cases where GPS is either not accessible, or not practical to use due to power, form factor or line of sight conditions. Position would also enable routing in sufficiently isotropic large networks, without the use of large routing tables. We are proposing APS --- a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
1,700 citations
"A greedy approach to beacon placeme..." refers background in this paper
...Many indoor localization techniques have been proposed so far [1], [2], and [ 3 ]....
[...]