TY - GEN
T1 - Multicluster ALLIANCES
T2 - 40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
AU - Dong, L.
AU - Elancheziyan, A.
AU - De Oliveira, J. C.
AU - Petropulu, A. P.
PY - 2006
Y1 - 2006
N2 - ALLIANCES is a new cooperative random access protocol which was proposed for resolving collisions in wireless networks. It can achieve high throughput and enables efficient use of energy with minimal scheduling overhead. The initial ALLIANCES approach was designed based on a small-scale network with fixed infrastructure, i.e., there is a base station (BS) that takes care of synchronization issues, declares each collision, and coordinates retransmissions. In this paper we propose a multicluster extension of ALLIANCES that enables its application to a large-scale wireless sensor network (WSN). The network is divided into groups of nodes called clusters, and each cluster is headed by the cluster head (CH). Collision resolutions and transmissions of CHs in different clusters are separable. Nodes in a cluster communicate only with the CH, who in turn forwards the information to a sink node. Collisions within a cluster are resolved as in ALLIANCES by the CH, which acts like a BS. Our simulation results shows that, with a proper clustering algorithm, the proposed scheme can achieve better performance than ALOHA, TDMA and single cluster ALLIANCES.
AB - ALLIANCES is a new cooperative random access protocol which was proposed for resolving collisions in wireless networks. It can achieve high throughput and enables efficient use of energy with minimal scheduling overhead. The initial ALLIANCES approach was designed based on a small-scale network with fixed infrastructure, i.e., there is a base station (BS) that takes care of synchronization issues, declares each collision, and coordinates retransmissions. In this paper we propose a multicluster extension of ALLIANCES that enables its application to a large-scale wireless sensor network (WSN). The network is divided into groups of nodes called clusters, and each cluster is headed by the cluster head (CH). Collision resolutions and transmissions of CHs in different clusters are separable. Nodes in a cluster communicate only with the CH, who in turn forwards the information to a sink node. Collisions within a cluster are resolved as in ALLIANCES by the CH, which acts like a BS. Our simulation results shows that, with a proper clustering algorithm, the proposed scheme can achieve better performance than ALOHA, TDMA and single cluster ALLIANCES.
UR - http://www.scopus.com/inward/record.url?scp=47049084765&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47049084765&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2006.354755
DO - 10.1109/ACSSC.2006.354755
M3 - Conference contribution
SN - 1424407850
SN - 9781424407859
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 300
EP - 304
BT - Conference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
Y2 - 29 October 2006 through 1 November 2006
ER -