29,348 Hits in 3.8 sec

Agent-based randomized broadcasting in large networks

Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
2007 Discrete Applied Mathematics  
We also show that, in contrast to traditional randomized broadcasting (TRB), graphs exist in which agent-based randomized broadcasting requires (n 2 ) steps.  ...  On the other hand, some graphs which require (n ln n) steps to spread the information in the traditional broadcast model, allow very fast agent-based broadcasting.  ...  We start our analysis by considering randomized agent-based broadcasting in random graphs.  ... 
doi:10.1016/j.dam.2006.04.035 fatcat:gylbs3n2ibcvbckhisjs7zlv64

Impact of mobility and topology on information diffusion in MANETs

Dimitri Perrin, Hiroyuki Ohsaki
2012 2012 IEEE Symposium on Computers and Communications (ISCC)  
Randomness in path selection can significantly alter the system performances, in both regular and irregular network structures.  ...  The random walk and random waypoint models are popular analysis tools for these epidemic broadcasts, and represent two types of random mobility.  ...  Broadcast simulation platform The computer-based modelling framework used in this paper relies on an agent-based structure.  ... 
doi:10.1109/iscc.2012.6249334 dblp:conf/iscc/PerrinO12 fatcat:ffxl2cxgnfdj7n5lqgxfnx6nzy

Knowledge dynamics in a network industry

Robin Cowan, Nicolas Jonard, Müge Özman
2004 Technological forecasting & social change  
In this paper, we model the impact of networks on knowledge growth in an innovating industry.  ...  Specifically, we compare two mediums of knowledge exchange; random interaction, and the case in which interaction occurs on a fixed architecture.  ...  Agents interact in a totally random manner, and broadcast each time to different set of s agents.  ... 
doi:10.1016/s0040-1625(03)00045-3 fatcat:lowwudus5vbtnn2vyngkwhgjy4

Large networks of rational agents form persistent echo chambers

Jens Koed Madsen, Richard M Bailey, Toby D. Pilditch
2018 Scientific Reports  
We then test if many equally rational Bayesian agents, under reasonable constraints of sampling, can grow, maintain, and strengthen ECs in the context of a large social network.  ...  In line with these observations, we use agent-based modelling to simulate behaviour of, and interactions between, agents 17,19-21 equipped with reasonable cognitive assumptions.  ...  For relatively large social networks (random and scale-free), all agents ultimately achieve high levels of confidence in their views.  ... 
doi:10.1038/s41598-018-25558-7 pmid:30120276 pmcid:PMC6098126 fatcat:iaougtuszvca3ju2dh7efzl4xm

Sequential TOA-Based Moving Target Localization in Multi-Agent Networks

Qin Shi, Xiaowei Cui, Sihao Zhao, Mingquan Lu
2020 IEEE Communications Letters  
This letter investigates a novel localization system based on multi-agent networks, where multiple agents serve as mobile anchors broadcasting their time-space information to the targets.  ...  An extended two-step weighted least squares (TSWLS) method is proposed to jointly estimate the position and velocity of the target in the presence of agent information uncertainties.  ...  This letter investigates a novel localization system based on multi-agent networks, where multiple agents serve as mobile anchors broadcasting their time-space information to the targets.  ... 
doi:10.1109/lcomm.2020.2993894 fatcat:6ljrd7i6qjai3duows3n77tuoa

Nature-inspired techniques for self-organization in dynamic networks

Ozalp Babaoglu
2010 Proceedings of the 7th ACM international conference on Computing frontiers - CF '10  
Each agent has a unique ID and can determine the relative position of any other agentAgents have access to a peer sampling service (can be trivially implemented if the broadcast range of agents covers  ...  [1 -200] ms • Rescue teams with mobile devices • Automobiles in vehicular networks • Swarms of robots • Satellites in earth orbit ■ Ad hoc wireless communication network (no fixed infrastructure) based  ... 
doi:10.1145/1787275.1787318 dblp:conf/cf/Babaoglu10 fatcat:5fz6u43i2rbetkailwsmpv5qzi

The Impact of Social Networks on Multi-Agent Recommender Systems [article]

Hamilton Link and Jared Saia and Terran Lane and Randall A. LaViolette
2005 arXiv   pre-print
We define two network structures: in the "mailing-list model," agents representing similar users form cliques, while in the "word-of-mouth model" the agents are distributed randomly in a scale-free network  ...  Agents can only communicate with their immediate neighbors in the network, but neighboring agents may or may not represent users with common interests.  ...  Self-arcs are an inevitable artifact of generating simulated networks using the random configuration model but occur in no significant fraction in large graphs.  ... 
arXiv:cs/0511011v1 fatcat:2ftyslq3yjhk3bhxaercpqihym

Tight bounds on information dissemination in sparse mobile networks

Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
Formally, we consider k mobile agents performing independent random walks on an n-node grid. At time 0, each agent is located at a random node of the grid and one agent has a rumor.  ...  (SODA 2011) who showed that above the percolation point the broadcast time is polylogarithmic in k.  ...  We proved a tight bound (up to logarithmic factors) on the broadcast of a rumor in a mobile network where agents perform independent random walks on a grid and the transmission radius defines a system  ... 
doi:10.1145/1993806.1993882 dblp:conf/podc/PettarinPPU11 fatcat:rhg62mpazzc7hhlb3yzpqakalm

Information Spread across Social Network Services with Non-Responsiveness of Individual Users

Shigeo Shioda, Keisuke Nakajima, Masato Minamikawa
2020 Computers  
In most practical applications, an exact analytic solution is not available for the SIR model, so previous studies have largely been based on the assumption that the probability of an SNS user having the  ...  In contrast, we propose a different approach based on a "strong correlation assumption", in which the probability of an SNS user having the target information is strongly correlated with whether its neighboring  ...  Thus, in this paper, we focus on the broadcasting-based information spread using the SIR model explicitly considering the network topology.  ... 
doi:10.3390/computers9030065 fatcat:4jstnungerflxjur4wcq4g6dzu

Naming Games in Spatially-Embedded Random Networks [article]

Qiming Lu, G. Korniss, Boleslaw K. Szymanski
2007 arXiv   pre-print
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks.  ...  Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks  ...  While the underlying RGG communication topology is motivated by large-scale sensor networks, the NG on (SW) RGGs captures fundamental features of agreement dynamics of spatially-embedded networked agent-based  ... 
arXiv:cs/0604075v3 fatcat:qdlw57rp2jfbjhftmycafvoeia

Successful Transmission Rate of Mobile Terminals with Agents in Segmented Ad Hoc Network

Kohei Arai, Lipur Sugiyanta
2011 International Journal of Advanced Computer Science and Applications  
Researches in this network are mostly simulation based.  ...  Mobile Wireless Ad-Hoc Network (MANET) is a special kind of network, where all of the nodes move in time. Random movement is the commonly used to model the mobility in this network.  ...  The agents are free to roam among the overlapped area within the network in a random manner. This agents' capability will be presented on the next paper. IV.  ... 
doi:10.14569/ijacsa.2011.020601 fatcat:qj32gni23nabdllzfeq7gzllga

Interception in Distance-Vector Routing Networks [article]

David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi
2016 arXiv   pre-print
We relate two variants of our model based on the allowed kinds of lies, define strategies for colluding agents, and prove optimality in special cases.  ...  In the Autonomous Systems (AS) graph of the United States, we show that compromising only 18 random nodes in the AS graph surprisingly captures 10% of all traffic paths in the network in expectation when  ...  ACKNOWLEDGEMENT We thank everyone involved in the 2014 AMS Network Science Mathematical Research Community for inspira-tion and many helpful comments, especially the organizers Aaron Clauset, David Kempe  ... 
arXiv:1507.05206v3 fatcat:3azwfwnnhjhjpf4dzlsdrbwhxi

A Novel Approach to Hinder Jamming Attack in WSN

Annu Joshi, G.N.Purohit G.N.Purohit
2015 Communications on Applied Electronics  
Wireless sensor networks (WSN) are used in many scientific and technological fields.  ...  To overcome this demerit of USS, a novel approach is presented in the paper by combining the uncoordinated spread spectrum (USS) technique with mobile agent techniques.  ...  In [5] , [6] , the respective authors address broadcast jamming mitigation based on spreadspectrum (SS) communication.  ... 
doi:10.5120/cae-1505 fatcat:cbtancvmozdglec6tk67m3f3ne

Low latency allcast over broadcast erasure channels [article]

Mark A. Graham and Ayalvadi J. Ganesh and Robert J. Piechocki
2021 arXiv   pre-print
We study two schemes, (i) random relaying, and (ii) random linear network coding, and analyse their performance in an asymptotic regime in which n tends to infinity.  ...  Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each broadcast reaches a random subset of nodes.  ...  We presented two classes of algorithms, one based on random relaying and another based on random linear network coding.  ... 
arXiv:2107.10695v1 fatcat:wt4zuuyigzampbnhlhorsujysm

CarAgent: Collecting and disseminating floating car data in vehicular networks

Hui Huang, Mahbub Hassan, Glenn Geers, Lavy Libman
2018 Vehicular Communications  
In this paper, we present CarAgent, a message exchange protocol that periodically collects and uploads FCD to data centres with the minimal utilisation of existing mobile network resources.  ...  We evaluate CarAgent using microscopic simulation of road traffic in real street maps while incorporating wireless protocol details of Long Term Evolution (LTE) and DSRC.  ...  However, as studied in [38] , too small timer leads to broadcast overload problem in contention-based networks.  ... 
doi:10.1016/j.vehcom.2018.08.002 fatcat:zvqkkk736rfwfkr6hn2m2dmtua
« Previous Showing results 1 — 15 out of 29,348 results