The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this work, we investigate information spreading in multiplex networks, adopting the gossip (random-walk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explore the impact of layer number, layer...
In this paper, we analyze the effect of mobility on information spreading in geometric networks through natural random walks. Specifically, our focus is on epidemic propagation via mobile gossip, a variation from its static counterpart. Our contributions are twofold. Firstly, we propose a new performance metric, mobile conductance, which allows us to separate the details of mobility models from the...
In this paper, we propose a novel distributed network decomposition algorithm with the aid of the factor graph model and the max-product algorithm, which aims to achieve minimum cut weight. Its effectiveness is testified for general graph partition as well as distributed inference in wireless networks. Our algorithm is fully distributed, simple in computation, and readily extensible, thus providing...
In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability compared to the belief propagation algorithm. Based on this framework, structured variational methods are explored to take advantage of both the simplicity of variational approximation (for inter-cluster processing) and the accuracy of...
Distributed resource allocation is an important problem in wireless ad hoc networks, in which there is no centralized scheduler and the resource allocation is carried out in a distributed way. Information exchange in the distributed resource allocation incurs overhead since it does not convey data information. The communication complexity, defined as the minimum number of exchanged messages needed...
In the first part of this two-part paper, we initiate the study of collaborative quickest detection in an adhoc setting for a simple two-node scenario. In this part, we extend our study to the general multi-node network, where we also explicitly address information exchange protocol and network topology control. We further consider block transmission mode and correlated observations. In each scenario,...
Collaborative quickest detection is used to detect a certain distribution change in an adhoc network, in which there is no data fusion center and local decisions need to be made at all nodes. A two-thread cumulative sum (CUSUM) algorithm is proposed for a simple two-node network. The corresponding performance, particularly the performance gain induced by collaboration, is analyzed. Numerical results...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.