Filters








33,496 Hits in 4.8 sec

Brief announcement

Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Jun Pang
2010 Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10  
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay.  ...  To this end we introduce a novel probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay.  ...  Surprisingly, this assumption suffices for the development of efficient algorithms. For asynchronous rings, the lower bound on the message complexity for leader election is known to be Ω(n · log n).  ... 
doi:10.1145/1835698.1835787 dblp:conf/podc/BakhshiEFP10 fatcat:wqtayqx4mbcktk3tiyknllh7ii

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  ...  The objective for a safety protocol is to relay messages across multiple vehicles within a 1.5-2km distance to alert approaching vehicles within a bounded end-to-end delay (e.g. 1.5 sec).  ...  As most traffic events are locally relevant, multi-hop messaging between vehicles may achieve lower latencies and utilize network resources more efficiently than cellular-based centralized schemes.  ... 
doi:10.1109/move.2007.4300804 fatcat:lmnw5xp5mzgjfljhznijorhzzq

Implementation of a MAC protocol for QoS support in wireless sensor networks

Petcharat Suriyachai, Utz Roedig, Andrew Scott
2009 2009 IEEE International Conference on Pervasive Computing and Communications  
In this paper, we present the implementation of a new WSN MAC protocol that is able to give deterministic bounds for message transfer delay and reliability.  ...  Future application areas of wireless sensor networks (WSNs) may include industrial process automation, aircraft control systems or patient monitoring in hospitals.  ...  Moreover, the network should be dimensioned such that a lower bound for the end-to-end data delivery reliability R can be given too.  ... 
doi:10.1109/percom.2009.4912839 dblp:conf/percom/SuriyachaiRS09 fatcat:qphgydszfndvnjl2bm4f43hquu

A Survey of V2X Communication Technique for Supporting Platooning

Seungwoo Park, Jaehwan Lee, Ka Lok Man, Sangoh Park
2020 ICIC Express Letters  
In the result, we present important factors to efficiently utilize the bandwidth and considerations to support platooning.  ...  For safe driving between vehicles, bounded transmission delay of lower than 100ms is recommended [7] , and low latency of DSRC is mainly used.  ...  This technique can reduce the channel contention and the synchronization overhead is lower than TDMA scheme. As we mentioned, lots of communication techniques are on research to support platooning.  ... 
doi:10.24507/icicel.14.05.521 fatcat:lce4kcdwfbeqfcv6u3gdknyzqu

Adaptive Synchronization of Robotic Sensor Networks [article]

Kasım Sinan Yıldırım, Önder Gürcan
2014 arXiv   pre-print
The main focus of recent time synchronization research is developing power-efficient synchronization methods that meet pre-defined accuracy requirements.  ...  We show through simulations that Adaptive Value Tracking synchronization is robust and efficient under mobility.  ...  Since the hardware clocks of sensor nodes are reported to have a drift of ± 100 parts per million, we defined the upper bound and lower bounds of the searched logical clock speed as v min = −10 −4 and  ... 
arXiv:1410.7582v1 fatcat:hiyodoziy5czle54vofx6uccwu

Information transfer based on precision time synchronization via wireless interferometry [article]

Daijiro Koyama, Yunzhuo Wang, Nobuyasu Shiga, Satoshi Yasuda, Nicolas Chauvet, Makoto Naruse
2020 arXiv   pre-print
Herein, we propose an arbitration protocol based on precision time synchronization via wireless two-way interferometry (Wi-Wi), and numerically validate its efficiency including the ability to impose a  ...  strict upper bound on the latency of data transfer.  ...  In particular, we have proposed a simple arbitration method for a ring network in which all the nodes are time synchronized via Wi-Wi, and demonstrate its efficiency including the ability to impose a strict  ... 
arXiv:2005.12517v1 fatcat:a5cmfeokivadxhhqhqs7n2cb6y

Lower bounds on messages and rounds for network authentication protocols

Li Gong
1993 Proceedings of the 1st ACM conference on Computer and communications security - CCS '93  
There is little and only scattered discussion on protocol efficiency. This paper presents results on the lower bounds on the numbers of messages and rounds required for network authentication.  ...  For each proven lower bound, an authentication protocol achieving the bound is also given, thus proving that the bound is a tight bound if the given optimal protocol is secure.  ...  Acknowledgments I started working on these lower bounds as a research student under Professors D.J. Wheeler and R.M.  ... 
doi:10.1145/168588.168592 dblp:conf/ccs/Gong93 fatcat:5lnoc352zfgrtmejrpw2ja666y

Fast leader election in anonymous rings with bounded expected delay

Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Jun Pang
2011 Information Processing Letters  
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay.  ...  At the example of an election algorithm, we show that the minimal assumptions of ABE networks are sufficient for the development of efficient algorithms.  ...  Such a lower bound on p is sufficient to derive an upper bound on the expected message delay, and this suffices for ABE networks.  ... 
doi:10.1016/j.ipl.2011.06.003 fatcat:x3apck4pszctjbetcmiw3gdini

Mobi-Sync: Configurable Time Synchronization for Mobile Multihop Networks

Jun Yi, Christian Poellabauer, Liqiang Zhang
2011 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)  
Achieving both synchronization accuracy and efficiency (in terms of communication and energy overheads) are important goals of a time synchronization mechanism.  ...  are not optimal when applied in networks that are mobile or where synchronization accuracies and clock drift rates differ among nodes.  ...  Since the focus of Mobi-Sync is on efficient synchronization in mobile networks, we will leverage existing work by assuming that a certain single-hop communication uncertainty bound is available.  ... 
doi:10.1109/icccn.2011.6006066 dblp:conf/icccn/YiPZ11 fatcat:renzn7l6jvg6tkgqi5a5eh4xwu

A Self-adaptive Communication Protocol with Application to High Performance Peer to Peer Distributed Computing

Didier El Baz, The Tung Nguyen
2010 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing  
A first set of computational experiments is also presented and analyzed for an optimization application, i.e. nonlinear network flow problems.  ...  In the Cactus framework, when a message is passed to upper or lower layers, Cactus runtime creates a new message and pass it to upper or lower layer.  ...  When a message is passed to a lower-level protocol, a pack routine combines message attributes with the message body; while an analogous unpack routine extracts message attributes when a message is passed  ... 
doi:10.1109/pdp.2010.32 dblp:conf/pdp/BazN10 fatcat:c7nzvv5dh5epthoabti3cljyzm

A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs [article]

Thaddeus Dryja, Quanquan C. Liu, Neha Narula
2020 arXiv   pre-print
Considering these impossibility results, we describe a new communication-efficient BBA protocol in a modified partially synchronous network model which is secure against adaptive adversaries with high  ...  choose to multicast its messages.  ...  Dropped Messages O(poly(log n)) BBA, PKI Table Table 2 : 2 Comparison to related work on BBA lower bounds.  ... 
arXiv:2004.01939v1 fatcat:e242xknijfhnfff4ansndwlbme

Asynchronous Bounded Expected Delay Networks [article]

Rena Bakhshi and Jörg Endrullis and Wan Fokkink and Jun Pang
2011 arXiv   pre-print
The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay.  ...  In contrast to ABD networks, ABE networks cannot be synchronised efficiently.  ...  Such a lower bound on p is sufficient to derive an upper bound on the expected message delay, and this suffices for ABE networks.  ... 
arXiv:1003.2084v3 fatcat:d4lram3btjhklf6waagw2cmm2i

The FTT-CAN protocol: why and how

L. Almeida, P. Pedreiras, J.A.G. Fonseca
2002 IEEE transactions on industrial electronics (1982. Print)  
These types of traffic are handled by two complementary subsystems, the Synchronous and the Asynchronous Messaging Systems, respectively.  ...  as being an efficient combination of both time- and event-triggered traffic with temporal isolation.  ...  high efficiency under worst case requirements and low efficiency under average-case requirements whenever these are substantially lower than the former ones.  ... 
doi:10.1109/tie.2002.804967 fatcat:yfujc26xuzemvoesrqu3bqkbw4

Formal Verification and Simulation for Performance Analysis for Probabilistic Broadcast Protocols [chapter]

Ansgar Fehnker, Peng Gao
2006 Lecture Notes in Computer Science  
This analysis can explain why the performance result of gossiping for a perfectly synchronized network without collision, are similar to the result on a network with randomized delay and collision, although  ...  The results of the simulators say as much about the protocol, as about the particular the lower level implementation of the simulator.  ...  The lower bound of gossiping with psend of 0.6, for example, is higher than the lower bound for psend=0.8.  ... 
doi:10.1007/11814764_12 fatcat:3grltya7jfexfnv54icbkx57ri

A Primer on Energy-Efficient Synchronization of WSN Nodes over Correlated Rayleigh Fading Channels

Pablo Briff, Ariel Lutenberg, Leonardo Rey Vega, Fabian Vargas, Mohammad Patwary
2014 IEEE Wireless Communications Letters  
In this paper we propose a lower bound on the energy required for synchronizing nodes in a Wireless Sensor Network (WSN) by using statistical estimation techniques.  ...  The energy required to synchronize a pair of nodes within a network with predefined synchronization accuracy is modelled as function of the transceivers power and the number of transmitted messages.  ...  synchronization energy A(S, m, δ) between [5] and the proposed lower bound, as a function of S.  ... 
doi:10.1109/wcl.2013.110713.130668 fatcat:2t7m4bs4f5dapmuujfeai7bmrq
« Previous Showing results 1 — 15 out of 33,496 results