.png){kind=icon}
Return
A Simple and Scalable Algorithm for Alignment in Broadcast Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/JSAC.2010.100923.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of coordinating a group of mobile nodes communicating through a wireless medium. The objective of the network is the alignment of all the nodes towards a common direction through local interactions, without the need for global knowledge such as the network topology or the maximum degree of the network, or even local parameters, such as the number of neighbors. The key feature of our algorithm is that each node state update is done through voting, where the probability of each vote is biased by the state of the node neighbors. We propose two possible physical implementations for our algorithm. The first is based on the explicit exchange of packetized messages, while the second is a cross-layer approach. Our analysis unveils key convergence properties of this simple class of alignment algorithms, via analytical and simulated results.
Keywords:
Wireless Sensor Networks
Alignment
Low-Complexity
Randomized Algorithms
Consensus
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more