48,070 Hits in 5.0 sec

Reliable Communication via Semilattice Properties of Partial Knowledge [chapter]

Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2017 Lecture Notes in Computer Science  
A fundamental communication primitive in distributed computing is Reliable Message Transmission (RMT), which refers to the task of correctly sending a message from a party to another, despite the presence  ...  This implies that RMT-PKA achieves reliable message transmission in every instance where this is possible, therefore it is a unique algorithm [13] .  ...  Here we focus on perfectly reliable transmission under a general adversary and the partial knowledge model.  ... 
doi:10.1007/978-3-662-55751-8_29 fatcat:7kow2q525re5fc7dtq27i7vpoa

Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems [article]

Brice Nédelec, Pascal Molli, Achour Mostéfaoui
2018 arXiv   pre-print
The proposed protocol outperforms state-of-the-art in size of messages, execution time complexity, and local space complexity.  ...  Most importantly, messages piggyback control information the size of which is constant. We prove that for both static and dynamic systems.  ...  They can build the partial order of event using this knowledge. Our approach cannot by default.  ... 
arXiv:1805.05201v1 fatcat:s2yu5djtbjc4rgpxlj2jqtnz4a

Joining Local Knowledge to Communicate Reliably (Extended Abstract) [article]

Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2017 arXiv   pre-print
A fundamental primitive in distributed computing is Reliable Message Transmission (RMT), which refers to the task of correctly sending a message from a party (or player) to another, in a network where  ...  We employ the General Adversary model of Hirt and Maurer and the recently introduced Partial Knowledge Model which subsume all known models for the adversary and local knowledge respectively.  ...  This task is captured by the Reliable Message Transmission problem (RMT), in which the goal is the correct delivery of message xS from a sender S to a receiver R even if some of the intermediate nodes-players  ... 
arXiv:1711.01725v1 fatcat:gdwoxxjz65dhzfd2gxy46bexpy

Receiver-Assisted Partial-Reliable Multimedia Multipathing Over Multi-Homed Wireless Networks

Yuanlong Cao, Li Zeng, Qinghua Liu, Gang Lei, Minghe Huang, Hao Wang
2019 IEEE Access  
However, the fully-reliable transmission nature of MPTCP can cause an unnecessary retransmission of expired multimedia data, block message from handing over to upper layer, and thus degrade the user-perceived  ...  In the recPR-MPTCP, a partial reliability extension is presented which runs at receiver side in order to offer a partial reliability multipathing service for multimedia applications.  ...  VOLUME 7, 2019 However, to the best of our knowledge, the existing partial reliable MPTCP extensions (i.e., the initiative PR-MPTCP [42] , the Message-Oriented Partial-Reliability MPTCP [43] , the QoS-oriented  ... 
doi:10.1109/access.2019.2958986 fatcat:wqpbvsolhrabhpwrm5sfmpvdye

To Transmit Now or Not to Transmit Now

Dacfey Dzung, Rachid Guerraoui, David Kozhaya, Yvonne-Anne Pignolet
2015 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)  
We perform a thorough analytic study under four Ack/Nack feedback mechanisms, which to our knowledge represent all Ack/Nack feedback variations.  ...  feedback relative to previous transmissions.  ...  To the best of our knowledge, our work is the first to study optimal transmission under lossy feedback.  ... 
doi:10.1109/srds.2015.26 dblp:conf/srds/DzungGKP15 fatcat:ixcnlxk72jevhhbgvpqnz2zvwm

A Cross-layer SCTP Scheme with Redundant Detection for Real-time Transmissions in IEEE 802.11 Wireless Networks

Wei Kuang Lai, Jyun-Jie Jhan, Jian-Wen Li
2019 IEEE Access  
In this paper, we propose a Cross-Layer Stream Control Transmission Protocol (CL-SCTP), which supports multi-streaming and partial reliability for real-time transmissions in IEEE 802.11 wireless networks  ...  INDEX TERMS SCTP, multi-streaming, partially reliable, scheduling.  ...  For SOME algorithm we only pre-process partially reliable messages, and for MORE algorithm we only process partially reliable frames and then schedule transmissions.  ... 
doi:10.1109/access.2019.2931779 fatcat:ssxff3zwhzalxj5tbo4zischyq

Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems

Brice Nedelec, Pascal Molli, Achour Mostefaoui
2018 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)  
The proposed protocol outperforms state-of-the-art in size of messages, execution time complexity, and local space complexity.  ...  Most importantly, messages piggyback control information the size of which is constant. We prove that for both static and dynamic systems.  ...  ACKNOWLEDGMENTS This work was partially funded by the French ANR projects O'Browser (ANR-16-CE25-0005-01), and Descartes (ANR-16-CE40-0023).  ... 
doi:10.1109/srds.2018.00016 dblp:conf/srds/NedelecMM18 fatcat:peqbs6d6svem7becgg73btag3e

An Information-Theoretic Characterization of Channels That Die

Lav R. Varshney, Sanjoy K. Mitter, Vivek K Goyal
2012 IEEE Transactions on Information Theory  
Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that optimize transmission volume communicated at fixed maximum message error probabilities.  ...  We provide a partial ordering of communication channels. A dynamic programming formulation is used to show the structural result that channel state feedback does not improve performance.  ...  Fix a transmission time and a level of reliability . Let be the best expected transmission volume for the first channel and be the best expected transmission volume for the second channel, under .  ... 
doi:10.1109/tit.2012.2199078 fatcat:yjgk4yeraza4rip74wyaf46vla

A probabilistic and opportunistic flooding algorithm in wireless sensor networks

Dukhyun Chang, Kideok Cho, Nakjung Choi, Ted "Taekyoung" Kwon, Yanghee Choi
2012 Computer Communications  
It seeks to achieve a target reliability required by an application. For this purpose, it makes a given node select only the subset of its one-hop neighbors to rebroadcast the same message.  ...  To achieve efficient flooding, most of the existing protocols try to reduce the number of transmissions, which is decided without considering any online transmission result.  ...  To the best of our knowledge, how to support flooding with a target reliability has been missing in the literature.  ... 
doi:10.1016/j.comcom.2011.11.016 fatcat:apzxvgeypjac5ofmlmupoo7o2u

A power-preserving broadcast protocol for wireless sensor networks

Chien Chun Ni, Tien Ruey Hsiang, J.D. Tygar
2009 International Journal of Sensor Networks (IJSNet)  
One solution to this problem is to limit the number of message-relaying nodes in the network, thus reduces the energy required to broadcast a message.  ...  In this paper, we present a power-preserving broadcast protocol (BOPP) that utilizes a packet reception reliability metric.  ...  Science Council under the grants NSC 96-3114-P-001-002-Y and NSC96-2219-E-009-013 respectively.  ... 
doi:10.1504/ijsnet.2009.029395 fatcat:k3ifsqhhqbbj5kqtfh3fk447om

Tradition as Transmission: A Partial Defense

John Schwenkler
2014 European Journal for Philosophy of Religion  
The elements of Reliable and High-Stakes that are missing from Telephone make it much less likely that any particular act of transmission will distort the original message, and so increase the reliability  ...  INSULARITY By my lights, the real problem with a pure model of Tradition as Transmission is not that testimonial transmission is too epistemically unreliable to extend religious knowledge to subsequent  ... 
doi:10.24204/ejpr.v6i4.149 fatcat:qhovquzpb5gadmbgofggti5eki

Relevance-based partial reliability in wireless sensor networks

Daniel G Costa, Luiz Affonso Guedes, Francisco Vasques, Paulo Portugal
2014 EURASIP Journal on Wireless Communications and Networking  
We propose a relevance-based partially reliable transmission approach to provide data delivery with different reliability guaranties, exploiting the relevancies of transmitted data when choosing the proper  ...  We expect that the proposed partially reliable transmission mechanism can save energy over the network while assuring acceptable quality for sensing monitoring.  ...  under a semi-reliable service.  ... 
doi:10.1186/1687-1499-2014-142 fatcat:wkh6s2ictrbffo6wzx54pibski

Underlay Cognitive Radio with Full or Partial Channel Quality Information

Na Yi, Yi Ma, Rahim Tafazolli
2010 International Journal of Navigation and Observation  
The aim of this work is to study two-user Gaussian UCR systems by assuming the full or partial knowledge of multiuser CQI.  ...  Numerical examples are provided to visually compare the performance of UCRs with full knowledge of multiuser CQI and the proposed approaches with partial knowledge of multiuser CQI.  ...  In order to ensure reliable communication of the Tx2-Rx2 pair, the secondary user's transmission rate is restricted by the second formula in (4) .  ... 
doi:10.1155/2010/105723 fatcat:3eajo23d4bgvvmls3h4byhn3se

Limits on communications in a cognitive radio channel

N. Devroye, P. Mitran, V. Tarokh
2006 IEEE Communications Magazine  
This channel models the simplest scenario in which a cognitive radio could be used and consists of a 2 Tx, 2 Rx wireless channel in which one transmitter knows the message of the other.  ...  Another interesting engineering aspect would be to see the intuitive tradeoff between (partial) message knowledge and achievable rates.  ...  The genie idealizes message knowledge, and non-causally gives the incumbent cognitive radio full, non-causal knowledge of the existing transmitters' messages.  ... 
doi:10.1109/mcom.2006.1668418 fatcat:hx56iu655jfspiychjhclhlbvq

Broadcasting and Activity Scheduling in AD HOC Networks [chapter]

Ivan Stojmenovic, Jie Wu
2005 Mobile Ad Hoc Networking  
In a multi-hop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius.  ...  In a flooding or broadcasting task, a source node sends the same message to all the nodes in the network.  ...  Experiments in [SSS] show that under 10% more messages are needed in that approach compared to RNG based one.  ... 
doi:10.1002/0471656895.ch7 fatcat:prpx3oe3njguhpdnc46oyfnefu
« Previous Showing results 1 — 15 out of 48,070 results