scholarly journals Input-Dynamic Distributed Algorithms for Communication Networks

Author(s):  
Klaus-Tycho Foerster ◽  
Janne H. Korhonen ◽  
Ami Paz ◽  
Joel Rybicki ◽  
Stefan Schmid

Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.

2013 ◽  
Vol 4 (3) ◽  
pp. 388-392
Author(s):  
Shanu K Rakesh ◽  
Bharat Choudhary ◽  
Rachna Sandhu

Swarm intelligence, as demonstrated by natural biological swarms, has numerous powerful properties desirable in many engineering systems, such as telecommunication. Communication network management is becoming increasingly difficult  due to the increasing size, rapidly changing topology, and complexity of communication networks. This paper describes  how biologically-inspired agents can be used to solve control problems in telecommunications. These agents, inspired by the foraging behaviour of ants, exhibit the desirable characteristics of simplicity of action and interaction. The colle ction of agents, or swarm system, deals only with local knowledge and exhibits a form of distributed control with agent communication effected through the environment. In this paper we explore the application of ant-like agents to the problem of routing in telecommunication networks.


2021 ◽  
Vol 19 (2) ◽  
pp. 41-48
Author(s):  
Yu. V. Nemtsov ◽  
I. V. Seryogin ◽  
P. I. Volnov

Base station (BS) is a terminal device of a radio communication network, while railway radio communications play an important role in ensuring safety of passenger and cargo transportation.A proposed method for calculating the performance of base stations in railway digital radio communication networks is intended to calculate for the BS the probabilities of being in certain state.BS was decomposed and such functional elements as circuit groups and a radio frequency path were identified, as well as the central module ensuring the exchange of information with elements of this BS and with other BSs. A detailed study of each element has increased accuracy of the proposed method. Following the Markov model, BS is presented as a system in which all possible states are considered. Models for BS with two and three circuit groups have been constructed. The parameters of each functional element of the model can be obtained through observation over a certain period. The solution of the system of equations for each of the models presented in the article will allow obtaining the values of the system being in a certain state. The obtained characteristics can be used to calculate the reliability of the entire radio communication network, and then to assess quality of service provided to the users of this network.Conclusions are made about the possibilities of using the obtained models when designing new railway communication networks and when calculating quality indices of existing ones. The proposed models can be applied not only to railway radio communication networks but also to mobile communication networks of commercial operators. 


2020 ◽  
Vol 3 (1) ◽  
pp. 27-36
Author(s):  
Muhammad Ikhsan Ikhsan ◽  
Roza Yulida ◽  
Fajar Restuhadi

In order to encourage rubber agribusiness activities, farmers need adequate information and reliable sources of information to achieve their goals. To meet information needs, farmers develop communication networks between farmers and their actors. This research aims to describe the sociogram of the communication network of rubber farmers in self-help patterns,and analyze the relationship between farmer characteristics and communication networks.This research conducted in Batu Bersurat Village XIII Koto Kampar District. The method used in this research is the census method and the study respondents were taken as many as 42 farmers.  The results of this research indicate that the structure of the communication network formed in rubber farmers approached the radial personal networkstructure .Based on the correlation test results indicate that the characteristics of rubber farmers related to locall centrality are, extent of land tenure, cosmopolity, intensity of counseling, and number of sources of information. Correlation test results indicate that the characteristics of rubber farmers related to globall centrality are level of education, extent of land tenure, cosmopolity, intensity of counseling, and number of sources of information.Correlation test results indicate that the characteristics of rubber farmers related to betwenness are extent of land tenure, cosmopolity, intensity of counseling, and number of sources of information.


2020 ◽  
Author(s):  
Indushree Banerjee ◽  
Martijn Warnier ◽  
Frances M. T Brazier

Abstract When physical communication network infrastructures fail, infrastructure-less communication networks such as mobile ad-hoc networks (MANET), can provide an alternative. This, however, requires MANETs to be adaptable to dynamic contexts characterized by the changing density and mobility of devices and availability of energy sources. To address this challenge, this paper proposes a decentralized context-adaptive topology control protocol. The protocol consists of three algorithms and uses preferential attachment based on the energy availability of devices to form a loop-free scale-free adaptive topology for an ad-hoc communication network. The proposed protocol has a number of advantages. First, it is adaptive to the environment, hence applicable in scenarios where the number of participating mobile devices and their availability of energy resources is always changing. Second, it is energy-efficient through changes in the topology. This means it can be flexibly be combined with different routing protocols. Third, the protocol requires no changes on the hardware level. This means it can be implemented on all current phones, without any recalls or investments in hardware changes. The evaluation of the protocol in a simulated environment confirms the feasibility of creating and maintaining a self-adaptive ad-hoc communication network, consisting of multitudes of mobile devices for reliable communication in a dynamic context.


2019 ◽  
Vol 7 (2) ◽  
pp. 119-125
Author(s):  
Megafirmawanti Lasinta ◽  
Nurmala Katrina Pandjaitan ◽  
Sarwititi Sarwoprasodjo

Efforts to solve environmental pollution in densely populated communities in urban areas are not only the responsibility of the government. Communities as part of social system also have an important role to control the environmental impacts of pollution. One way that community members must do in reducing environmental damage is familiarize environmentally friendly behavior. This research focuses on the analysis of environmentally friendly behavior of Pulo Geulis community members in Bogor City. Pulo Geulis is a Delta in the middle of the Ciliwung River which more or less contributes to whether or not the Ciliwung River is polluted in Bogor City. The communication process is an important factor in changing individual behavior. This study aimed to analyze the structure of community communication networks in developing environmentally friendly behavior. Primary data was obtained through a survey of 100 respondents and in-depth interviews with several informants. Data were analyzed using sociometric methods. The results of sociometric analysis showed that the structure of the community communication network in building community-friendly behavior is a radial personal network. This structure illustrated that community information centers are located in certain individuals such as head of RW, head of RT, or Posyandu cadres. The radial personal network in this study also described the formation of clique, star, bridge, and isolates in the community communication network at Pulo Geulis.


Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 4895
Author(s):  
Maurício R. Silva ◽  
Elitelma S. Souza ◽  
Pablo J. Alsina ◽  
Deyvid L. Leite ◽  
Mateus R. Morais ◽  
...  

This paper presents a communication network for a squadron of unmanned aerial vehicles (UAVs) to be used in the scanning rocket impact area for Barreira do Inferno Launch Center—CLBI (Rio Grande do Norte, Brazil), aiming at detecting intruder boats. The main features of communication networks associated with multi-UAV systems are presented. This system sends information through Wireless Sensor Networks (WSN). After comparing and analyzing area scanning strategies, it presents the specification of a data communication network architecture for a squadron of UAVs within a sensor network using XBee Pro 900HP S3B modules. A brief description is made about the initial information from the construction of the system. The embedded hardware and the design procedure of a dedicated communication antenna to the XBee modules are presented. In order to evaluate the performance of the proposed architecture in terms of robustness and reliability, a set of experimental tests in different communication scenarios is carried out. Network management software is employed to measure the throughput, packet loss and other performance indicators in the communication links between the different network nodes. Experimental results allow verifying the quality and performance of the network nodes, as well as the reliability of the communication links, assessing signal received quality, range and latency.


2020 ◽  
pp. 009365022091503
Author(s):  
Bei Yan ◽  
Lian Jian ◽  
Ruqin Ren ◽  
Janet Fulk ◽  
Emily Sidnam-Mauch ◽  
...  

Research on the wisdom of crowds (WOC) identifies two paradoxical effects of communication. The social influence effect hampers the WOC, whereas the collective learning effect improves crowd wisdom. Yet it remains unclear under what conditions such communication impedes or enhances collective wisdom. The current study examined two features characterizing communication in online communities, communication network centralization and shared task experience, and their effect on the WOC. Both these features can serve as indicators of the likelihood that underlying communication may facilitate either social influence or collective learning. With an 8-year longitudinal behavioral-trace data set of 269,871 participants and 1,971 crowds, we showed that communication network centralization negatively affected the WOC. By contrast, shared task experience positively predicted the WOC. Shared task experience also moderated the effect of communication network centralization such that centralized communication networks became more beneficial for crowd performance as shared task experience increased.


1993 ◽  
Vol 03 (04) ◽  
pp. 313-320 ◽  
Author(s):  
PHILIP D. MACKENZIE

In the postal model of message passing systems, the actual communication network between processors is abstracted by a single communication latency factor, which measures the inverse ratio of the time it takes for a processor to send a message and the time that passes until the recipient receives the message. In this paper we examine the problem of broadcasting multiple messages in an order-preserving fashion in the postal model. We prove lower bounds for all parameter ranges and show that these lower bounds are within a factor of seven of the best upper bounds. In some cases, our lower bounds show significant asymptotic improvements over the previous best lower bounds.


Author(s):  
Armando Castañeda ◽  
Pierre Fraigniaud ◽  
Ami Paz ◽  
Sergio Rajsbaum ◽  
Matthieu Roy ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document