White Papers

Localization and Routing in Sensor Networks by Local Angle Information

Overview Location information is very useful in the design of sensor network infrastructures. This paper studies the anchor-free 2D localization problem by using local angle measurements in a sensor network. They prove that given a unit disk graph and the angles between adjacent edges, it is NP-hard to find a valid embedding in the plane such that neighboring nodes are within distance 1 from each other and non-neighboring nodes are at least distance 1 away. Despite the negative results, however, one can find a planar spanner of a unit disk graph by using only local angles.

By downloading you agree to our Terms and Conditions. These include information regarding use of your personal data.

Publisher: California Institute of Technology
File Format: PDF
Date Published: Sep 11, 2008
Format: White Papers
Topics: Monitoring Systems, Switching, Mobile - Wireless Communications

Similiar White Papers

Lifetime-Optimal Data Routing in Wireless Sensor Networks Without Flow Splitting

This paper considers two-tiered wireless sensor networks, and addresses the network lifetime problem for upper-tier Aggr

Publisher: University of Waterloo | Tags: network

The Monitoring of Ad Hoc Networks Based on Routing

An ad hoc network is a collection of mobiles nodes that communicate via multihop wireless link. In this environment, it

Publisher: University of Paris | Tags: data, management, network, network management, qos

Constructing Wireless Sensor Networks Via Effective Topology Maintenance and Querying

The ability of properly covering the terrain under investigation and collecting measurements from redundantly sensed por

Publisher: Yeditepe University | Tags: applications, network, robots

Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks

Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to all

Publisher: University of California | Tags: data, network

A Distributed Algorithm With Linear Convergence for Maximum Lifetime Routing in Wireless Networks

A wireless sensor network of nodes with limited energy is considered. The problem of computing a routing flow that maxim

Publisher: Stanford University | Tags: computing, network

California Institute of Technology White Papers

Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks

Featured white papers

The Value of Location Intelligence in the Communications Industry

Pitney Bowes

Public Services are under pressure, the challenge is to do more with less. How do you improve citizen satisfaction, increase cost efficiencies and improve service delivery? The power of location intelligence is helping many local authorities...

Download now »
Best Practices for Translating Customer Satisfaction into Revenue

Citrix Online

Today's support organisations are focused on two top-level metrics: financial results and customer satisfaction. For most, it's easy to track financial performance, but customer satisfaction is akin to speaking a foreign language...

Download now »
HP print solutions and 3M

Hewlett-Packard (HP)

The objective for 3M was to optimize office printing infrastructure at 3M locations worldwide, reduce total cost and environmental footprint. Some of the business benefits acheived by switching to HP print solutions...

Download now »