Filters








4,280 Hits in 2.5 sec

Broadcast in the rendezvous model

Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
2006 Information and Computation  
In this paper, we propose a new model of communication based on rendezvous and analyze a multi-hop distributed algorithm to broadcast a message in a synchronous setting.  ...  In the rendezvous model, two neighbors u and v can communicate if and only if u calls v and v calls u simultaneously. Thus, nodes u and v obtain a rendezvous at a meeting point.  ...  In the rendezvous model, the expected broadcast time is (n 2 ) whereas in [8] 's model, it will be (n ln(n)) on expectation and with high probability.  ... 
doi:10.1016/j.ic.2006.01.002 fatcat:ye4d3pmp5favfchlryefig2fuq

Broadcast in the Rendezvous Model [chapter]

Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
2004 Lecture Notes in Computer Science  
In this paper, we propose a new model of communication based on rendezvous and analyze a multi-hop distributed algorithm to broadcast a message in a synchronous setting.  ...  In the rendezvous model, two neighbors u and v can communicate if and only if u calls v and v calls u simultaneously. Thus nodes u and v obtain a rendezvous at a meeting point.  ...  log n) in the rendezvous model.  ... 
doi:10.1007/978-3-540-24749-4_49 fatcat:ltr5kcsebzdh7oqo2kikuw4g44

Liveness of Parameterized Timed Networks [article]

Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger
2016 arXiv   pre-print
Our results are obtained by modeling the passage of time using symmetric broadcast, and by solving the model checking problem of parameterized systems of un-timed processes communicating using k-wise rendezvous  ...  We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks.  ...  In the rest of the paper, fix k (the number of processes participating in a rendezvous), a finite set Σ actn of rendezvous actions, the rendezvous alphabet Σ rdz = ∪ a∈Σactn {a 1 , . . . , a k }, and the  ... 
arXiv:1609.04176v1 fatcat:rvkdeu6t3zelnjrmvggamn7pry

Spectrum sharing with rotating radar: Implications for cognitive radio rendezvous

Jeffrey D. Poston, R. Michael Buehrer
2014 2014 IEEE Antennas and Propagation Society International Symposium (APSURSI)  
An opportunity exists for a more comprehensive reuse of spectrum in the space & time dimensions in the case of rotating radars.  ...  Drawing from measurements of an actual radar system, this paper studies how an ad hoc network of cognitive radios lacking a common control channel can discover one another-the rendezvous problem-while  ...  The common time reference permits a simple form of rendezvous known as the synchronous model and, post rendezvous, facilitates timeslotted channel access among the CRs.  ... 
doi:10.1109/aps.2014.6904929 fatcat:pncfhzgumbailgefnqyzvzlumm

Implementation of Distributed Systems described with LOTOS Multi-rendezvous on Bus Topology Networks [chapter]

Keiichi Yasumoto, Kazuhiro Gotoh, Hiroki Tatsumoto, Teruo Higashino, Kenichi Taniguchi
1997 Formal Description Techniques and Protocol Specification, Testing and Verification  
Here, we focus on bus topology networks where broadcasted messages are received at all nodes in the same order, and propose a technique to implement multi-rendezvous among remote processes located on different  ...  multi-rendezvous among remote processes.  ...  our model, each server process is invoked at the node with the lowest load.  ... 
doi:10.1007/978-0-387-35271-8_10 fatcat:jdqamabvmjgsnbman2x6cv54va

Rendezvous mac protocols for use in cognitive radio networks

Mark D. Silvius, Allen B. MacKenzie, Charles W. Bostian
2009 MILCOM 2009 - 2009 IEEE Military Communications Conference  
This paper examines rendezvous protocols for ad hoc network establishment in cognitive radio networks.  ...  We start our research by first considering the analytical models for the single-channel and multiple-channel synchronous problems.  ...  In [6] , Alonso also analyzes the problem of rendezvous for a single broadcast channel with synchronized time slots.  ... 
doi:10.1109/milcom.2009.5380124 fatcat:o5prqwggrbfgbanb4lhohk26zu

Cache coherence requirements for interprocess rendezvous

Russell M. Clapp, Trevor N. Mudge, Donald C. Winsor
1990 International journal of parallel programming  
A language construct that is found in a number of parallel programming languages to support synchronization and communication in the interprocess rendezvous.  ...  Shared-bus multiprocessors require a protocol to keep the date in their caches coherent. There are two major categories of these protocols: invalidation and write-broadcast.  ...  Basic Model . Model The basic rendezvous is summarized in Figs. 2 and 3. Both figures show execution time with solid lines and blocked time with dashed lines.  ... 
doi:10.1007/bf01407863 fatcat:y4haqyuxjjh35ekizislt3eu24

A Hybrid MAC with Dynamic Sleep Scheduling for Wireless Sensor Networks

Mohammad Arifuzzaman, Mitsuji Matsumoto
2013 The Journal of the Institute of Image Electronics Engineers of Japan  
Depending on the network loads the H-MAC protocol dynamically switches from broadcast scheduling to link scheduling and vice-versa in order to achieve better efficiency.  ...  H-MAC does it by using the strength of CSMA and TDMA approach with intelligence. The novel idea behind the H-MAC is that, it uses both the broadcast scheduling and link scheduling.  ...  Acknowledgement This research was supported by a grant-in-aid from the High-Tech Research Center Project of the Ministry of Education, Culture, Sports, Science and Technology (MEXT), Japan.  ... 
doi:10.11371/iieej.42.197 fatcat:5c27rz53lrdqfiusxbvq6ju2pq

Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

Bo Yang, Wei Liang, Meng Zheng, Ying-Chang Liang
2016 IEEE Transactions on Vehicular Technology  
We also propose a Multi-radio Sunflower-Sets-based (MSS) pairwise rendezvous algorithm in order to bring additional rendezvous diversity and accelerate the rendezvous process.  ...  In this paper, we exploit the mathematical construction of sunflower sets to develop a Single-radio Sunflower-Sets-based (SSS) pairwise rendezvous algorithm.  ...  MODEL AND PROBLEM DEFINITION In this section, we present the network model and rendezvous problem definition in heterogeneous CRNs. A.  ... 
doi:10.1109/tvt.2015.2510359 fatcat:y4hu7w3l2zay7bns7dsjxqfs2y

Parameterized Systems in BIP: Design and Model Checking

Igor Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, Joseph Sifakis, Marc Herbstritt
2016 International Conference on Concurrency Theory  
FOIL is powerful enough to express architectures found in distributed systems, including the classical architectures: token-passing rings, rendezvous cliques, broadcast cliques, and rendezvous stars.  ...  We show that FOIL captures classical parameterized architectures such as token-passing rings, cliques of identical components communicating with rendezvous or broadcast, and client-server systems.  ...  This prototype uses the following architecture templates: (a) pairwise rendezvous and broadcast in cliques, (b) token rings, (c) and pairwise rendezvous in stars.  ... 
doi:10.4230/lipics.concur.2016.30 dblp:conf/concur/KonnovKWVBS16 fatcat:hdlbv6jlqnbrhgx6rgarvyhxsm

Interplay between TVWS and DSRC: Optimal strategy for QoS of safety message dissemination in VANET

Jae-Han Lim, Wooseong Kim, K. Naito, M. Gerla
2013 2013 International Conference on Computing, Networking and Communications (ICNC)  
rendezvous.  ...  Our scheme employs TVWS Channel Rendezvous Algorithm (TCRA) that is based on available TVWS channel map, ensuring that vehicles within a dissemination area select the same channel with the ESM sender.  ...  In section 2, we explain system model.  ... 
doi:10.1109/iccnc.2013.6504256 dblp:conf/iccnc/LimKNG13 fatcat:dnlkqs777jfirhzbn5ws3fsiqq

Hardware implementation of communication protocols modeled by concurrent EFSMs with multi-way synchronization

Hisaaki Katagiri, Keiichi Yasumoto, Akira Kitajima, Teruo Higashino, Kenichi Taniguchi
2000 Proceedings of the 37th conference on Design automation - DAC '00  
We implement specifications described in the model so that EFSMs work synchronously with the same clock, and that the synchronization mechanism for checking executability of each tuple of synchronizing  ...  proposed model is expected to reduce development cost in designing/developing such protocols.  ...  Although m is used in the same way as qo, it is dedicated to the purpose of broadcast.  ... 
doi:10.1145/337292.337771 dblp:conf/dac/KatagiriYKHT00 fatcat:irphmfpvcnfgheymrtfyor7aa4

Efficient Communication in Cognitive Radio Networks

Seth Gilbert, Fabian Kuhn, Calvin Newport, Chaodong Zheng
2015 Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15  
A core challenge in designing algorithms for this model is that different devices might have different views of the network.  ...  In this paper, we study two problems for this setting that are well-motivated but not yet wellunderstood: local broadcast and data aggregation.  ...  Rendezvous and Beyond The majority of algorithmic results for cognitive radio network models focus on the problem of deterministic rendezvous.  ... 
doi:10.1145/2767386.2767422 dblp:conf/podc/GilbertKNZ15 fatcat:hsge2b6ob5azldsryksajwry3y

Broadcast Event-Triggered Control Scheme for Multi-Agent Rendezvous Problem in a Mixed Communication Environment

Nohaidda Sariff, Zool Hilmi Ismail
2021 Applied Sciences  
This paper addresses the communication issue encountered by a hybrid controller when finding consensus in terms of the rendezvous target point in a broadcast and communication environment.  ...  As a result, in our model, the number of channel utilizations was lower and the agents' performances were preserved.  ...  Conflicts of Interest: The authors declare no competing interests.  ... 
doi:10.3390/app11093785 doaj:3cc096b4ba34499bac7d8db264d12df5 fatcat:v54gpkedubaovjbwp6ag634uyq

An automated device for provoking and capturing wildlife calls

David E. Ausband, Jesse Skrivseth, Michael S. Mitchell
2011 Wildlife Society bulletin  
Our device was able to broadcast and record twice daily for 6-7 days using the internal computer battery and surveyed an area of 3.3-17.5 km 2 in relatively open habitat depending on the hardware components  ...  Our device can broadcast and record animal calls and the computer software is freely downloadable.  ...  Any use of trade names is for descriptive purposes only and does not imply endorsement by the U.S. Government.  ... 
doi:10.1002/wsb.80 fatcat:h27ljn5v6jg4pi3vndmmtxpfnm
« Previous Showing results 1 — 15 out of 4,280 results