ComputingComputer ScienceElectrical EngineeringComputer NetworksDistributed SystemsWireless CommunicationsCooperative CommunicationDistributed SensingNetwork ProtocolsSpectrum ManagementWireless Communication ProtocolsWireless NetworksCooperative Spectrum SensingDistributed Spectrum SensingGossip AlgorithmsNode FailuresSensingSpectrum SharingSpectrum Sharing MechanismsSpectrum Sharing Protocols
Wireless radios of the future will likely be frequency-agile, that is, supporting opportunistic and adaptive use of the RF spectrum. Such radios must coordinate with each other to build an accurate and consistent map of spectral utilization in their surroundings. We focus on the problem of sharing RF spectrum data among a collection of wireless devices. The inherent requirements of such data and the time-granularity at which it must be collected makes this problem both interesting and technically challenging. We propose GUESS, a novel incremental gossiping approach to coordinated spectral sensing. It (1) reduces protocol overhead by limiting the amount of information exchanged between participating nodes, (2) is resilient to network alterations, due to node movement or node failures, and (3) allows exponentially-fast information convergence. We outline an initial solution incorporating these ideas and also show how our approach reduces network overhead by up to a factor of 2.4 and results in up to 2.7 times faster information convergence than alternative approaches.
15
Search and replication in unstructured peer-to-peer networks
Qin Lv, Pei Cao, Edith Cohen et al. · 2014 · 1.6K citations
Gossip-based computation of aggregate information
David Kempe, Alin Dobra, Johannes Gehrke · 2004 · 1.5K citations