Filters








4,107 Hits in 5.6 sec

Probabilistic event resolution with the pairwise random protocol

John L. Miller, Jon Crowcroft
2009 Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video - NOSSDAV '09  
This paper proposes the Pairwise Random Protocol (PRP), which uses secure coin flipping to enable adversaries to fairly determine the result of a probabilistic event without a trusted third party.  ...  We conclude that PRP enables DVE's to distribute the work of determining probabilistic events between adversaries without loss of security or fairness, and with acceptable overhead.  ...  PAIRWISE RANDOM PROTOCOL (PRP) The pairwise random protocol (PRP) provides a way for two competing nodes in a DVE to fairly resolve probabilistic events. Consider a DVE with nodes, Alice and Bob.  ... 
doi:10.1145/1542245.1542261 dblp:conf/nossdav/MillerC09 fatcat:ygmdhyfbnjaexal3diwlf6clxm

Automated Conflict Resolution in Air Traffic Management
English

STROE Gabriela, ANDREI Irina-Carmen
2017 INCAS Bulletin  
the conflict detection, conflict resolution and resolution trajectory optimization are the key technology.  ...  This paper describes thoroughly the decisionmaking procedure of ATC, establishes the optimized target for ATC's decision-making, and puts forward an optimization of conflict detection and conflict resolution  ...  pairwise resolution does not guarantee safety for multiple-aircraft conflicts  ... 
doi:10.13111/2066-8201.2017.9.1.10 fatcat:h76e5eomozh67cd6vnuhoa5vaa

Bounded-Latency Alerts in Vehicular Networks

Rahul Mangharam, Raj Rajkumar, Mark Hamilton, Priyantha Mudaliget, Fan Bait
2007 2007 Mobile Networking for Vehicular Environments  
This scheme requires participating vehicles to time synchronize with the GPS time and receive the regional map definitions consisting of spatial cell resolutions and temporal slot schedules via an out-of-band  ...  Due to high mobility and ephemeral connectivity we must employ broadcast protocols, as well as mitigation strategies to curtail inherent issues associated with broadcast protocols, such as broadcast storm  ...  With the use of GPS PPS signal, we are able to achieve a pairwise synchronization accuracy of sub-2ms.  ... 
doi:10.1109/move.2007.4300804 fatcat:lmnw5xp5mzgjfljhznijorhzzq

On the capacity of infinite population multiple access protocols

M. Molle
1982 IEEE Transactions on Information Theory  
We present bounds on the maximum channel utilization (with finite average delay) of synchronous multiple access communications protocols serving an infinite population of homogeneous stations.  ...  Messages arrive to the system as a series of independent Bernoulli trials in discrete time, with probability p of an arrival at each arrival point (the Poisson limit is explicitly included) and are then  ...  ACKNOWLEDGMENT In appreciation for their inspiration and many helpful suggestions, the author would like to thank Professors James L. Massey and Leonard Kleinrock.  ... 
doi:10.1109/tit.1982.1056509 fatcat:kpohhskczraitjiw4qpuu6yg3e

Timestamp-free network synchronization with random pairwise message exchanges

D. Richard Brown, Andrew G. Klein
2014 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Each node in the network has a clock with independent stochastic delay and drift.  ...  Numerical results for two different connectivity scenarios show that synchronization among the nodes can be achieved without the overhead of digital timestamps, a dedicated synchronization protocol, or  ...  delay through pairwise message exchanges with random neighbors.  ... 
doi:10.1109/icassp.2014.6854706 dblp:conf/icassp/BrownK14 fatcat:v4xktqqs3fcprk3b2syps7dqru

A Secure Key Management Scheme for Sensor Networks

John Wynne, Kristie Kosaka, Samir Chatterjee
2004 Americas Conference on Information Systems  
We describe the details of our algorithm and briefly compare it with other proposed schemes.  ...  one set of protocols.  ...  Eschenauer and Gilgor's Random Key Pre-Distribution Scheme Eschenauer and Gilgor (Eschenauer and Gilgor, 2002) proposed a random key pre-distribution scheme based on probabilistic key sharing and utilization  ... 
dblp:conf/amcis/WynneKC04 fatcat:7vje3ihbjvhzvlrknb6cqpcx3e

QUANTITATIVE BIOSTRATIGRAPHY—ACHIEVING FINER RESOLUTION IN GLOBAL CORRELATION

Peter M. Sadler
2004 Annual Review of Earth and Planetary Science  
A+ and A− are, respectively, the first- and last-appearance events of taxon A. Small mutation (a) switches a random event with its younger neighbor.  ...  Big mutation (b) moves one random event to a new position at random; all intervening events shift one position in opposite direction.  ... 
doi:10.1146/annurev.earth.32.101802.120428 fatcat:m6cgbxqtingd3cff7d7tvzbk2u

DynTunKey: a dynamic distributed group key tunneling management protocol for heterogeneous wireless sensor networks

Ramzi Bellazreg, Noureddine Boudriga
2014 EURASIP Journal on Wireless Communications and Networking  
We tested the proposed protocol considering two models of mobility of the targets which are respectively the Random Walk model and the Gauss Markov model.  ...  A set of experiments has been conducted to assess the performance of the proposed scheme with regard to recent key management protocol and to traditional tunnels built using the IPSec protocol.  ...  They are able to acquire and exchange voluminous high-resolution data related to the events detected by the low-level sensors.  ... 
doi:10.1186/1687-1499-2014-9 fatcat:co2to3voc5bsrl2pklkkzfdczi

A Key Management Techniques in Wireless Sensor Networks

Ahmed S., Salah E., Ayman El-Sayed
2017 Communications on Applied Electronics  
Since the nodes in a WSN have computational and control imperatives, the key management protocol for these networks must be to a great degree lightweight.  ...  Dealing with the keys in the system incorporates node validation, key understanding and key refresh stages which represents an extra overhead on system assets.  ...  In the event that client can effectively confirm with any subset of sensors out of an arrangement of n sensors, the n-verification succeed.  ... 
doi:10.5120/cae2017652600 fatcat:bx6hmnwwvzaydb5cb5ol5napte

Discrete Partitioning and Coverage Control for Gossiping Robots

Joseph W. Durham, Ruggero Carli, Paolo Frasca, Francesco Bullo
2012 IEEE Transactions on robotics  
The algorithm has two components: (1) a motion protocol to ensure that neighboring robots communicate at least sporadically, and (2) a pairwise partitioning rule to update territory ownership when two  ...  Additionally, we detail how our algorithm scales well for large teams in large environments and how the computation can run in anytime with limited resources.  ...  We start with the Random Destination & Wait Motion Protocol.  ... 
doi:10.1109/tro.2011.2170753 fatcat:mn5zdcogove7ppunfzrygz3cva

Time and Space Optimal Exact Majority Population Protocols [article]

Leszek Gąsieniec, Grzegorz Stachowiak, Przemysław Uznański
2021 arXiv   pre-print
In this paper we study population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions between n agents.  ...  The main result of this paper is the first time and space optimal exact majority population protocol which also works with high probability.  ...  In the probabilistic variant of population protocols, considered in [1] and adopted in this paper, the random scheduler selects for each interaction a pair of agents uniformly at random.  ... 
arXiv:2011.07392v2 fatcat:ihrqbqlfdndtfoi7g3klwye5nm

The Essence of Coin Lemmas

Roberto Segala
1999 Electronical Notes in Theoretical Computer Science  
Coin lemmas are a tool for the analysis of randomized distributed algorithms.  ...  Their principal role is to reduce the analysis of a randomized system to the analysis of an ordinary nondeterministic system.  ...  Acknowledgments I w ould like to thank the organizers of Probmiv '98 for inviting me to the workshop and the anonymous referees for several useful comments on a draft of this paper.  ... 
doi:10.1016/s1571-0661(05)80603-6 fatcat:kecofmc4ojgjthfihkvpqanygi

Introduction to probabilistic automata

1972 Discrete Mathematics  
Examples of such systems are randomized, distributed algorithms (such as the randomized dining philosophers [LR81]), probabilistic communication protocols (such as the IEEE 1394 Root Contention protocol  ...  They have been developed by Segala [Seg95b, SL95, Seg95a] and serve the purpose of modeling and analyzing asynchronous, concurrent systems with discrete probabilistic choice in a formal and precise way  ...  This allows us to define an asynchronous parallel composition operator and makes the model suitable for reasoning about randomized distributed algorithms, probabilistic communication protocols and systems  ... 
doi:10.1016/0012-365x(72)90124-0 fatcat:23vh6ok5vrdy7itfc6m47ccrnq

A probabilistic approach to aircraft conflict detection

M. Prandini, J. Hu, J. Lygeros, S. Sastry
2000 IEEE transactions on intelligent transportation systems (Print)  
Probabilistic models for predicting the aircraft position in the near-term and mid-term future are developed.  ...  Conflict detection and resolution schemes operating at the mid-range and short-range level of the air traffic management process are discussed.  ...  ACKNOWLEDGMENT The authors would like to thank A. Nilim for his help with the simulations. They would also like to thank C. Tomlin, G. Pappas, and J. Kosecka for the stimulating discussions.  ... 
doi:10.1109/6979.898224 fatcat:3niisdalujc4xkrjwhp5jdp6mu

A Probabilistic Protocol for Multihop Routing in VANETs

Junichiro Fukuyama
2010 Journal of Electrical and Computer Engineering  
The proposed new protocol for multihop communication refers to a lookup table containing the precomputed data to decide a good packet forwarder quickly.  ...  There have been quite a few results in the area seeking for a fast and reliable communication protocol due to their potential.  ...  With the coarse resolutions, the probabilistic protocol will successfully capture the tendency of the vehicle mobility to contribute to good communication performances. The Basic Algorithm.  ... 
doi:10.1155/2010/185791 fatcat:crc3oyhqsfamvio3s6cywoz4nm
« Previous Showing results 1 — 15 out of 4,107 results