Abstract
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.
| Original language | English (US) |
|---|---|
| Article number | 5555917 |
| Pages (from-to) | 1190-1199 |
| Number of pages | 10 |
| Journal | IEEE Journal on Selected Areas in Communications |
| Volume | 28 |
| Issue number | 7 |
| DOIs | |
| State | Published - Sep 2010 |
| Externally published | Yes |
Fingerprint
Keywords
- Alignment
- Consensus
- Low-Complexity
- Randomized Algorithms
- Wireless Sensor Networks
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
Cite this
A simple and scalable algorithm for alignment in broadcast networks. / Pagliari, Roberto; Yildiz, Mehmet E.; Kirti, Shrut; Morgansen, Kristi A.; Javidi, Tara; Scaglione, Anna.
In: IEEE Journal on Selected Areas in Communications, Vol. 28, No. 7, 5555917, 09.2010, p. 1190-1199.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A simple and scalable algorithm for alignment in broadcast networks
AU - Pagliari, Roberto
AU - Yildiz, Mehmet E.
AU - Kirti, Shrut
AU - Morgansen, Kristi A.
AU - Javidi, Tara
AU - Scaglione, Anna
PY - 2010/9
Y1 - 2010/9
N2 - 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.
AB - 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.
KW - Alignment
KW - Consensus
KW - Low-Complexity
KW - Randomized Algorithms
KW - Wireless Sensor Networks
UR - http://www.scopus.com/inward/record.url?scp=77956192438&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77956192438&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2010.100923
DO - 10.1109/JSAC.2010.100923
M3 - Article
AN - SCOPUS:77956192438
VL - 28
SP - 1190
EP - 1199
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
SN - 0733-8716
IS - 7
M1 - 5555917
ER -