Abstract
Interference in wireless communication is generally considered as an undesired phenomenon which needs to be combatted. Unlike traditional approaches, this paper investigates the possibility of exploiting interference for the cooperative solution of a linear algebraic equation, of which each agent knows only a portion. The presented communication system, together with the designed iterative algorithm, guarantees that agents converge exponentially to a global solution (unique or non-unique) of the algebraic linear equation, notwithstanding the presence of the unknown fading wireless channel. Guaranteeing privacy is one of the benefits of this approach: the unknown fading channel prohibits the access to neighboring agents’ local equations. Such a feature is extremely useful in case local equations contain sensitive information. Randomized simulations reinforce our theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
