Results 1 - 10 of 14,711

Performance Analysis of the IEEE 802.11 Distributed Coordination Function

by Giuseppe Bianchi , 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract - Cited by 1869 (1 self) - Add to MetaCart
Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary

Distributed Coordination in Dynamic Spectrum

by Allocation Networks Jun, Jun Zhao - IEEE DySPAN , 2005
"... Device coordination in open spectrum systems is a challenging problem, particularly since users experience varying spectrum availability over time and location. We propose a distributed coordination approach that handles spectrum heterogeneity without relying on the existence of a preassigned common ..."
Abstract - Add to MetaCart
Device coordination in open spectrum systems is a challenging problem, particularly since users experience varying spectrum availability over time and location. We propose a distributed coordination approach that handles spectrum heterogeneity without relying on the existence of a preassigned

distributed coordination algorithms

by Craig L. Robinson, Daniel Block, Sean Brennan, Francesco Bullo, Jorge Cortés
"... Abstract — This paper investigates the behavior of a group of autonomous robots evolving in a polygonal environment according to a “move away from the closest neighbor ” heuristic. We demonstrate that this distributed coordination algorithm optimizes an aggregate cost function that measures how unif ..."
Abstract - Add to MetaCart
Abstract — This paper investigates the behavior of a group of autonomous robots evolving in a polygonal environment according to a “move away from the closest neighbor ” heuristic. We demonstrate that this distributed coordination algorithm optimizes an aggregate cost function that measures how

Dissecting Distributed Coordination

by Aleta Ricciardi - In 9th WDAG. Springer Verlag (LNCS 972 , 1995
"... . This paper derives necessary and sufficient communication for distributed applications that perform certain actions uniformly in asynchronous systems. We show there is an essential structure of information flow in any solution to Uniform Coordination, suggesting message-minimal solutions. We show ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
. This paper derives necessary and sufficient communication for distributed applications that perform certain actions uniformly in asynchronous systems. We show there is an essential structure of information flow in any solution to Uniform Coordination, suggesting message-minimal solutions. We show

Distributed Coordination with MESSENGERS

by Munehiro Fukuda, Lubomir F. Bic, Michael B. Dillencourt, Fehmina Merchant - Science of Computer Programming , 1997
"... Messengers is a paradigm for the programming of distributed systems. It is based on the principles of autonomous messages, called Messengers, which carry their own behavior in the form of a program. This enables them to navigate freely in the underlying computational network, communicate with one an ..."
Abstract - Cited by 18 (14 self) - Add to MetaCart
and the interactive and incremental development and use of distributed applications. 1 Coordination and the...

Distributed coordination algorithms for multiple fractional-order systems

by Yongcan Cao, Yan Li, Yangquan Chen - in: Proceedings of the IEEE Conference on Decision and Control, Cancun , 2008
"... Distributed coordination algorithms for multiple fractional-order systems ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Distributed coordination algorithms for multiple fractional-order systems

Ethernet: Distributed packet switching for local computer networks

by Robert M. Metcalfe, David R. Boggs - COMMUN. ACM , 1976
"... Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled multipr ..."
Abstract - Cited by 468 (2 self) - Add to MetaCart
multiprocessors. An Ethernet's shared communication facility, its Ether, is a passive broadcast medium with no central control. Coordination of access to the Ether for packet broadcasts is distributed among the contending transmitting stations using controlled statistical arbitration. Switching of packets

Coverage Control for Mobile Sensing Networks

by Jorge Cortes, Sonia Martínez, Timur Karatas, Francesco Bullo , 2002
"... This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functio ..."
Abstract - Cited by 582 (49 self) - Add to MetaCart
This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility

Open, Distributed Coordination with Finesse

by Andrew Berry, Simon Kaplan - ACM Symposium on Applied Computing
"... This paper presents Finesse, a language for describing the interaction of components in open distributed systems. Finesse has evolved out of research in open distributed processing, beginning with the A1 ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
This paper presents Finesse, a language for describing the interaction of components in open distributed systems. Finesse has evolved out of research in open distributed processing, beginning with the A1

Extensible Distributed Coordination

by Tobias Distler, Christopher Bahn, Alysson Bessani, Frank Fischer, Flavio Junqueira
"... Most services inside a data center are distributed systems requiring coordination and synchronization in the form of primitives like distributed locks and message queues. We argue that extensibility is a crucial feature of the coordina-tion infrastructures used in these systems. Without the abil-ity ..."
Abstract - Add to MetaCart
Most services inside a data center are distributed systems requiring coordination and synchronization in the form of primitives like distributed locks and message queues. We argue that extensibility is a crucial feature of the coordina-tion infrastructures used in these systems. Without the abil
Results 1 - 10 of 14,711