Title :
A theoretical framework for analysis of communication pathways in random networks
Author :
Sefat, M.N. ; Bais, Abdul ; Sarshar, N. ; Chan, Chi Hou
Author_Institution :
Fac. of Eng., Univ. of Regina, Regina, SK, Canada
Abstract :
Gossip algorithms are used to distribute packets in different networks such as P2P networks, wireless ad-hoc networks and sensor networks. These algorithms are more applicable when little information is available about the structure of the network. In this paper we present a strategy based on gossip algorithm to maximize the aggregate throughput in an all to all communication network. All of the nodes in this design, attempt to send a packet to other nodes. We present the aggregate throughput as a function of basic parameters in gossip algorithms by setting up a connection between the gossip algorithm and percolation theory. Then we apply this function to optimize the main parameters of the algorithm. We report simulation results for a simplified model of gossip algorithm using an exponential random network.
Keywords :
optimisation; percolation; random processes; telecommunication networks; P2P network; aggregate throughput maximization; communication pathway exponential random network; gossip algorithm; packet distribution; parameter optimization; percolation theory; wireless ad-hoc network; wireless sensor network; Ad hoc networks; Aggregates; Algorithm design and analysis; Broadcasting; Probability; Signal processing algorithms; Throughput;
Conference_Titel :
Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4673-4537-8
DOI :
10.1109/Allerton.2012.6483386