Filters








84,455 Hits in 4.7 sec

Time-Message Trade-Offs in Distributed Algorithms [article]

Robert Gmyr, Gopal Pandurangan
2018 arXiv   pre-print
The situation is less clear in the KT1 model. In this paper, we present several new distributed algorithms in the KT1 model that trade off between time and message complexity.  ...  This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut  ...  Conclusion This work is a step towards understanding time-message trade-offs for distributed algorithms in the KT 1 model.  ... 
arXiv:1810.03513v1 fatcat:nesei2goxnhzfdfv5rlqfs3mmu

Time-Message Trade-Offs in Distributed Algorithms

Robert Gmyr, Gopal Pandurangan, Michael Wagner
2018 International Symposium on Distributed Computing  
The situation is less clear in the KT 1 model. In this paper, we present several new distributed algorithms in the KT 1 model that trade off between time and message complexity.  ...  This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut  ...  We give (a family of) distributed algorithms for constructing a danner that trade off messages for time (Section 3). 32:6 Time-Message Trade-Offs in Distributed Algorithms Danner Construction.  ... 
doi:10.4230/lipics.disc.2018.32 dblp:conf/wdag/GmyrP18 fatcat:pvizrsqykbae7amf2hzyba4nn4

Complexity in wireless scheduling

Yung Yi, Alexandre Proutière, Mung Chiang
2008 Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '08  
Investigating trade-offs in the 3-dimensional space allows a designer to fix one dimension and vary the other two jointly.  ...  Tradeoff analysis is then extended to systems with congestion control through utility maximization for non-stabilizable arrival inputs, where the complexity-utility-delay trade-off is shown to be different  ...  Then, the authors in [19, 20] explicitly brought up another dimension in addition to stability: the dimension of time complexity, and developed parameterized algorithms that achieve arbitrary trade-off  ... 
doi:10.1145/1374618.1374624 dblp:conf/mobihoc/YiPC08 fatcat:vfknliuqnzdmzi3cexykcmia3q

Three Point Encryption (3PE): Secure Communications in Delay Tolerant Networks

Roy Cabaniss, Vimal Kumar, Sanjay Madria
2012 2012 IEEE 31st Symposium on Reliable Distributed Systems  
This improvement has a performance trade-off, however, reducing the delivery ratio and increasing the delivery time.  ...  The first algorithm, Chaining, uses multiple midpoints to re-encrypt the message for the destination node.  ...  Fragmenting Encryption The advantage of Chaining Encryption's increased security has a trade-off in significantly increased delivery time.  ... 
doi:10.1109/srds.2012.74 dblp:conf/srds/CabanissKM12 fatcat:rvkegxquhbe4ddam3zwz5s6nty

Delaunay Triangulation Based Green Base Station Operation for Self Organizing Network

Gilsoo Lee, Hongseok Kim, Young-Tae Kim, Byoung-Hoon Kim
2013 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing  
We study the base station (BS) turning-off operation that can run without knowing the global knowledge of dynamic traffic distribution in time and space.  ...  energy-delay trade-off curve is almost close to the optimal one, which can be found by the exhaustive search only.  ...  The authors in [9] suggested centralized and distributed algorithms for the trade-off between reducing energy consumption and outage probability.  ... 
doi:10.1109/greencom-ithings-cpscom.2013.27 dblp:conf/greencom/LeeKKK13 fatcat:zq6nuyajhfftjnz6vciqqwduni

Page 7826 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
We establish natural trade-offs between message delivery time and quiescence time, in the form of tight lower and upper bounds, for each combination of the timing models and failure types.  ...  We are interested in simultaneously optimizing the following performance parameters: the message delivery time, which is the time required to deliver a message, and the quiescence time, which is the time  ... 

Fast distributed algorithm for convergecast in ad hoc geometric radio networks

Alex Kesselman, Dariusz R. Kowalski
2006 Journal of Parallel and Distributed Computing  
We study the trade-off between the energy and the latency of convergecast. We show that our algorithm consumes at most O(n log n) times the minimum energy.  ...  We propose a very simple randomized distributed algorithm that has the expected running time O(log n).  ...  ENERGY/LATENCY TRADE-OFF In this section we study the trade-off between the energy and the latency of convergecast.  ... 
doi:10.1016/j.jpdc.2005.11.004 fatcat:6dpirwcfvbad3b2hforvoufivq

HAS4: A Heuristic Adaptive Sink Sensor Set Selection for Underwater AUV-Aid Data Gathering Algorithm

Xingwang Wang, Debing Wei, Xiaohui Wei, Junhong Cui, Miao Pan
2018 Sensors  
In this paper, we target solving the data gathering problem in underwater wireless sensor networks.  ...  By comparing HAS 4 with two benchmark selection methods, experiment results demonstrate that our algorithm can achieve a better performance.  ...  Since the message that transmitted in a distributed algorithm is not determined, the message transmitting time of each time slot should be randomly chosen in distributed HAS 4 to reduce the collision probability  ... 
doi:10.3390/s18124110 pmid:30477173 fatcat:xontf3mqrzagvfvlqtbs3mvznm

Delay-Energy Aware Clustering Multi-hop Routing in Wireless Sensor Networks [chapter]

Trong-Thua Huynh, Cong-Hung Tran, Anh-Vu Dinh-Duc
2016 Lecture Notes in Electrical Engineering  
Although energy efficiency is a major concern in WSN, it often suffers from the addition delay. This paper investigates the trade-off between the energy consumption and the end-to-end delay in WSN.  ...  Thus, a trade-off existing between energy consumption and end-to-end delay is extremely necessary.  ...  in WSNs in order to trade-off energy consumption and end-to-end delay.  ... 
doi:10.1007/978-981-10-0557-2_4 fatcat:2vizico2bfaencyhzizeaymvxu

An Optimized Trade-off Decomposition Steganography Algorithm

Mazhar Tayel, Hamed Shawky
2014 International Journal of Computer Applications  
Also, the trade-off factor was introduced to determine an optimum value for the ESF to get an acceptable degradation in the Stego-image.  ...  A fuzzification is performed in the message channel to compress the decomposed coefficients before embedding in the cover-image to get a new Stego-image.  ...  The maximum value of the trade-off ( ) and its corresponding optimum value for the ESF ( The Trade-Off Corr. and MSE for the tested images table (1) it is seen that, the proposed steganography algorithm  ... 
doi:10.5120/14981-3187 fatcat:wgazivdxw5hfhjtcbfuyw4liji

Page 628 of The Journal of the Operational Research Society Vol. 55, Issue 6 [page]

2004 The Journal of the Operational Research Society  
An empirical evaluation of performance trade-offs in Time Warp. JEEE Trans Parallel Distrib Sys 8: 210-224. Lubachevsky BD, Shwartz A and Weiss A (1991). An analysis of rollback-based simulation.  ...  What is an appropriate interval is clearly dependent on the system environment and will be a trade- off decision between computing performance and model integrity, but the processing of messages only a  ... 

Page 431 of Mathematical Reviews Vol. , Issue 92a [page]

1992 Mathematical Reviews  
In this paper we present a trade- off between the number of faulty processors and the number of rounds by exhibiting a family of algorithms in which processors communicate by one-bit messages.  ...  general.” 92a:68010 68M10 68Q10 94A17 Peleg, David (1-STF-C); Upfal, Eli (1-IBM2) A time-randomness trade-off for oblivious routing.  ... 

A theoretical analysis of multi-hop consensus algorithms for wireless networks: Trade off among reliability, responsiveness and delay tolerance

Sabato Manfredi
2014 Ad hoc networks  
This trade off must be taken into account in the performance evaluation and algorithm design for WMNs.  ...  that explicitly relates the network and algorithm features (e.g. time delay tolerance, topology, the number of hop).  ...  This trade off must be taken into account in the performance evaluation and algorithm design for WMNs.  ... 
doi:10.1016/j.adhoc.2011.05.005 fatcat:5u4y4u4g7vfbhdpjfmqsmrlypu

Page 3592 of Mathematical Reviews Vol. , Issue 90F [page]

1990 Mathematical Reviews  
The usual time-memory trade-off algorithms give C, ~ N for all values of C,, between 0 and N.  ...  .; Hellman, Martin E. (1-STF-E) Time-memory-processor trade-offs. IEEE Trans. Inform. Theory 34 (1988), no. 3, 505-512.  ... 

H-GAP: estimating histograms of local variables with accuracy objectives for distributed real-time monitoring

Dan Jurca, Rolf Stadler
2010 IEEE Transactions on Network and Service Management  
The protocol is tunable in the sense that it allows controlling, at runtime, the trade-off between protocol overhead and an accuracy objective.  ...  algorithms.  ...  An advantage of such a perspective would be that the trade-off between message size and the number of messages becomes controllable in the aggregation protocol.  ... 
doi:10.1109/tnsm.2010.06.i8p0292 fatcat:tf4dk7gtkbgfvde46e52tukafm
« Previous Showing results 1 — 15 out of 84,455 results