Secure positioning of wireless devices with application to sensor networks

Čapkun, Srđjan; Hubaux, Jean-Pierre

doi:10.1109/infcom.2005.1498470

Cited by 343 publications

(309 citation statements)

References 32 publications

(35 reference statements)

Supporting

Mentioning

309

Contrasting

Order By: Relevance

“…Sastry et al [18] presented an early version of a protocol that verifies node locations and bases node identities on their location information. Similar ideas were also proposed by Waters and Felten [20], Bazzi and Konjevod [2] andČapkun and Hubaux [4,5]. In the most general form, these works are based on measuring the delays incurred by communications between nodes and imposing a geometric structure on the "distance space" to determine node locations.…”

Section: Existing Workmentioning

confidence: 93%

Detecting Sybil Nodes in Static and Dynamic Networks

Cardenas-Haro

Konjevod

2010

On the Move to Meaningful Internet Systems, OTM 2010

View full text Add to dashboard Cite

Peer-to-peer systems are known to be vulnerable to the Sybil attack. The lack of a central authority allows a malicious user to create many fake identities (called Sybil nodes) pretending to be independent honest nodes. The goal of the malicious user is to influence the system on his/her behalf. In order to detect the Sybil nodes and prevent the attack, a reputation system is used for the nodes, built through observing its interactions with its peers. The construction makes every node a part of a distributed authority that keeps records on the reputation and behavior of the nodes. Records of interactions between nodes are broadcast by the interacting nodes and honest reporting proves to be a Nash Equilibrium for correct (non-Sybil) nodes.In this research is argued that in realistic communication schedule scenarios, simple graph-theoretic queries such as the computation of Strongly Connected Components and Densest Subgraphs, help in exposing those nodes most likely to be Sybil, which are then proved to be Sybil or not through a direct test executed by some peers.

show abstract

Section: Existing Workmentioning

confidence: 93%

Detecting Sybil Nodes in Static and Dynamic Networks

Cardenas-Haro

Konjevod

2010

On the Move to Meaningful Internet Systems, OTM 2010

View full text Add to dashboard Cite

show abstract

“…These are typically based on verifying whether estimates of the same parameter are sufficiently close [74], [75], [76] and/or consistent with prior knowledge [77]. Most such approaches are well-suited for sensors that measure a scalar quantity such as temperature or pressure.…”

Section: B Refining the Calibrationmentioning

confidence: 99%

Calibrating Distributed Camera Networks

Devarajan¹,

Cheng²,

Radke

2008

Proc. IEEE

View full text Add to dashboard Cite

Recent developments in wireless sensor networks have made feasible distributed camera networks, in which cameras and processing nodes may be spread over a wide geographical area, with no centralized processor and limited ability to communicate a large amount of information over long distances. This paper overviews distributed algorithms for the calibration of such camera networks-that is, the automatic estimation of each camera's position, orientation, and focal length. In particular, we discuss a decentralized method for obtaining the vision graph for a distributed camera network, in which each edge of the graph represents two cameras that image a sufficiently large part of the same environment. We next describe a distributed algorithm in which each camera performs a local, robust nonlinear optimization over the camera parameters and scene points of its vision graph neighbors to obtain an initial calibration estimate.We then show how a distributed inference algorithm based on belief propagation can refine the initial estimate to be both accurate and globally consistent.

show abstract

“…A robust localization algorithm delivers correct location estimates even in the presence of well-defined, accidental failures. Another aspect is secure verification of location estimates, where spoofed locations can be detected (see, e.g., [4]). …”

Section: Other Quality-of-service Aspectsmentioning

confidence: 99%

Towards a unified view on space and time in sensor networks

Römer

Mattern

2005

Computer Communications

View full text Add to dashboard Cite

In wireless sensor networks, many applications rely on the ability of sensor nodes to estimate their physical location and time with respect to a common reference scale. This necessity is reflected by the development of a significant number of algorithms for localization and time synchronization for sensor networks in the recent past. However, research on location estimation on the one hand and on time synchronization on the other hand has been largely separated. Despite this, models, requirements, techniques, and algorithms of the two domains are rather similar and in some respects closely related. The purpose of this paper is to make this affinity explicit, with the hope of stimulating a mutual fertilization and enabling a better understanding of both domains.

show abstract

Secure positioning of wireless devices with application to sensor networks

Cited by 343 publications

References 32 publications

Detecting Sybil Nodes in Static and Dynamic Networks

Detecting Sybil Nodes in Static and Dynamic Networks

Calibrating Distributed Camera Networks

Towards a unified view on space and time in sensor networks

Contact Info

Product

Resources

About