TY - GEN
T1 - ExBCG-TC
T2 - 10th Annual Wireless Telecommunications Symposium, WTS 2011
AU - Kim, Dongsoo
AU - Yu, Jaewook
AU - Noel, Eric
AU - Tang, K. Wendy
PY - 2011
Y1 - 2011
N2 - In our previous work, we exploited a modified version Borel Cayley Graphs (BCGs) as an underlying topology for dense wireless sensor networks using the BCG Topology Control (BCG-TC) algorithm. However, BCG-TC requires sensors to have a large transmission range to guarantee connectivity. In this paper, to overcome the transmission range limit and construct an efficient communication graph, we propose its extended version, the EXTENDED BCG-TC (ExBCG-TC). The ExBCG-TC consists of two processes: 1) the BCG-TC operation and 2) the Less-Degree Priority Connection (LDPC) operation. In ExBCG-TC, the LDPC is used to establish the connections between a node with a degree smaller than 4 and its physical neighbors in a distributed manner after the BCG-TC operation. We simulate ExBCG-TC with 500 to 1500 nodes that are uniformly and randomly distributed in an 100 × 100m2 area. As a result, ExBCG-TC reduces the required transmission range for a connected network by 60% of the BCG-TC while producing shortest diameter and average path length among all the topology control algorithms investigated.
AB - In our previous work, we exploited a modified version Borel Cayley Graphs (BCGs) as an underlying topology for dense wireless sensor networks using the BCG Topology Control (BCG-TC) algorithm. However, BCG-TC requires sensors to have a large transmission range to guarantee connectivity. In this paper, to overcome the transmission range limit and construct an efficient communication graph, we propose its extended version, the EXTENDED BCG-TC (ExBCG-TC). The ExBCG-TC consists of two processes: 1) the BCG-TC operation and 2) the Less-Degree Priority Connection (LDPC) operation. In ExBCG-TC, the LDPC is used to establish the connections between a node with a degree smaller than 4 and its physical neighbors in a distributed manner after the BCG-TC operation. We simulate ExBCG-TC with 500 to 1500 nodes that are uniformly and randomly distributed in an 100 × 100m2 area. As a result, ExBCG-TC reduces the required transmission range for a connected network by 60% of the BCG-TC while producing shortest diameter and average path length among all the topology control algorithms investigated.
UR - https://www.scopus.com/pages/publications/84880720137
U2 - 10.1109/WTS.2011.5960827
DO - 10.1109/WTS.2011.5960827
M3 - Conference contribution
AN - SCOPUS:84880720137
SN - 9781457701627
T3 - Wireless Telecommunications Symposium
BT - 2011 Wireless Telecommunications Symposium, WTS 2011
Y2 - 13 April 2011 through 15 April 2011
ER -