White Papers

Robust Rendezvous for Mobile Autonomous Agents Via Proximity Graphs in Arbitrary Dimensions

Category: Software and Web Development, Networking and Communications

Overview This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. The paper provides analysis and design results for multi-agent networks in arbitrary dimensions under weak requirements on the switching and failing communication topology. The novel correctness proof relies on proximity graphs and their properties and on a general LaSalle Invariance Principle for nondeterministic discrete-time dynamical systems.

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

Publisher: University of California
File Format: PDF
Date Published: Sep 3, 2007
Format: White Papers
Topics: Software Engineering, Mobile - Wireless Communications

Similiar White Papers

AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in Mobile Ad Hoc Networks

This paper describes AntHocNet, an algorithm for routing in mobile ad hoc networks. It is a hybrid algorithm, which comb

Publisher: IDSIA | Tags: mobile networks, network

Energy Efficient Connected Clusters for Mobile Ad Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a wireless infrastuctureless network with mobile nodes. Clustering is a common basis

Publisher: Massachusetts Institute of Technology | Tags: applications, network

Cooperation, Competition and Cognition in Wireless Networks

Nodes and/or clusters of a wireless network operating on the same frequency can operate using three different paradigms:

Publisher: Harvard University | Tags: network

The Fundamental Capacity-Delay Tradeoff in Large Mobile Wireless Networks

The paper establishes the fundamental tradeoff between the achievable capacity and delay in large mobile wireless networ

Publisher: Purdue University | Tags: mobile wireless, mobility, wireless networks

Opportunistic Scheduling for Wireless Network Coding

This paper addresses a scheduling problem for wireless network coding which has been recently proposed as a novel method

Publisher: Aalborg University | Tags: data, network, unicast, wireless networks

University of California White Papers

Stateless Load Balancing Over Multiple MPLS Paths

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 »