Information spreading in stationary Markovian evolving graphs

Clementi, Andrea E. F.; Pasquale, Francesco; Monti, Angelo; Silvestri, Riccardo

doi:10.1109/ipdps.2009.5160986

Cited by 82 publications

(192 citation statements)

References 32 publications

(51 reference statements)

Supporting

Mentioning

186

Contrasting

Unclassified

Order By: Relevance

“…Thus, the variable v is the maximum speed that vehicles in the network can possibly achieve. Random waypoint and Markov mobility are two examples of such motion models [9], [11], [16], [17].…”

Section: A Mobility Modelmentioning

confidence: 99%

Speed limits in autonomous vehicular networks due to communication constraints

Talak

Karaman

Modiano

2016

2016 IEEE 55th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

Abstract-Increasing applications and decreasing sizes of autonomous vehicles is likely to result in a dense network of heterogeneous autonomous vehicles, each moving around to perform a separate task. Autonomous vehicles need to be aware of other vehicles in it's vicinity in order to successfully perform their tasks. Such network awareness is ensured by exchanging location and control information over wireless radio channels. However, wireless interference constraints limit the number of messages that can be exchanged between the vehicles. In this paper, we study the impact of such communication constraints on maximum speed in dense autonomous vehicular networks. We define hazard rate to be the fraction of times a vehicle enters a region, call it 'uncertainty region', where there is a positive chance of other vehicles being present. We show that such a performance measure follows a threshold behavior with respect to maximum speed v as the network density n increases to infinity. We show that, for a planar network, the hazard rate tends to 1, if the maximum speed v decreases slower than n −3/2 , and tends to 0, if v decreases faster than n −3/2 . For the network hazard rate, which is fraction of times any vehicle enters it's uncertainty region, the threshold is n −2 . For the spatial network, however, these thresholds turn out to be larger. This implies that it is better to plan autonomous vehicular networks, such as UAV networks, over a three dimensional space rather than a two dimensional one.

show abstract

Section: A Mobility Modelmentioning

confidence: 99%

Speed limits in autonomous vehicular networks due to communication constraints

Talak

Karaman

Modiano

2016

2016 IEEE 55th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

show abstract

“…In the case of cycle-free signature, the belief will converge to the exact a posterior probability after a finite number of iterations that is bounded by half length of the longest path in the signature. Generally speaking, signature can not avoid cycle, and the propagated information may lead to inaccurate a posterior probability [9]. In the flooding schedule, the updated message has to be stored until all the other nodes complete updating, which means the new message can not join the belief propagation immediately.…”

Section: B Serial Schedulementioning

confidence: 99%

Fast convergence and reduced complexity receiver design for LDS-OFDM system

Wen

Razavi

Xiao

et al. 2014

2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC)

View full text Add to dashboard Cite

Abstract-Low density signature for OFDM (LDS-OFDM) is able to achieve satisfactory performance in overloaded conditions, but the existing LDS-OFDM has the drawback of slow convergence rate for multiuser detection (MUD) and high receiver complexity. To tackle these problems, we propose a serial schedule for the iterative MUD. By doing so, the convergence rate of MUD is accelerated and the detection iterations can be decreased. Furthermore, in order to exploit the similar sparse structure of LDS-OFDM and LDPC code, we utilize LDPC codes for LDS-OFDM system. Simulations show that compared with existing LDS-OFDM, the LDPC code improves the system performance.

show abstract

“…investigate the speed limit for information flooding over Markovian evolving graphs (e.g. [19]- [21]), but they did not study the spreading rate under multi-message gossip. Recently, Pettarin et.…”

Section: A Motivation and Related Workmentioning

confidence: 99%

On the Role of Mobility for Multimessage Gossip

Chen

Shakkottai

Andrews

2013

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We consider information dissemination in a large n-user wireless network in which k users wish to share a unique message with all other users. Each of the n users only has knowledge of its own contents and state information; this corresponds to a one-sided push-only scenario. The goal is to disseminate all messages efficiently, hopefully achieving an orderoptimal spreading rate over unicast wireless random networks. First, we show that a random-push strategy -where a user sends its own or a received packet at random -is order-wise suboptimal in a random geometric graph: specifically, Ω ( √ n) times slower than optimal spreading. It is known that this gap can be closed if each user has "full" mobility, since this effectively creates a complete graph. We instead consider velocityconstrained mobility where at each time slot the user moves locally using a discrete random walk with velocity v(n) that is much lower than full mobility. We propose a simple twostage dissemination strategy that alternates between individual message flooding ("self promotion") and random gossiping. We prove that this scheme achieves a close to optimal spreading rate (within only a logarithmic gap) as long as the velocity is at least v(n) = ω( log n/k). The key insight is that the mixing property introduced by the partial mobility helps users to spread in space within a relatively short period compared to the optimal spreading time, which macroscopically mimics message dissemination over a complete graph.

show abstract

Information spreading in stationary Markovian evolving graphs

Cited by 82 publications

References 32 publications

Speed limits in autonomous vehicular networks due to communication constraints

Speed limits in autonomous vehicular networks due to communication constraints

Fast convergence and reduced complexity receiver design for LDS-OFDM system

On the Role of Mobility for Multimessage Gossip

Contact Info

Product

Resources

About