Preferential Detachment in Broadcast Signaling Networks: Connectivity and Cost Trade-off
arXiv:0705.0848 · doi:10.1209/0295-5075/79/58005
Abstract
We consider a network of nodes distributed in physical space without physical links communicating through message broadcasting over specified distances. Typically, communication using smaller distances is desirable due to savings in energy or other resources. We introduce a network formation mechanism to enable reducing the distances while retaining connectivity. Nodes, which initially transmit signals at a prespecified maximum distance, subject links to preferential detachment by autonomously decreasing their transmission radii while satisfying conditions of zero communication loss and fixed maximum node-hopping distance for signaling. Applied to networks with various spatial topologies, we find cost reductions as high as 90% over networks that are restricted to have all nodes with equal transmission distance.
References in corpus (13)
- Statistical mechanics of complex networks
- Resilience of the Internet to random breakdowns
- Efficient routing on complex networks
- Optimal network topologies for local search with congestion
- Improved routing strategies for Internet traffic delivery
- Dynamics of jamming transitions in complex networks
- Continuum percolation of wireless ad hoc communication networks
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Damage Spreading and Opinion Dynamics on Scale Free Networks
- An efficient approach of controlling traffic congestion in scale-free networks
- A generative model for feedback networks
- Congestion-gradient driven transport on complex networks
- Distance-dependent connectivity: Yet Another Approach to the Small World Phenomenon