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 × 100m 2  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.
['Dongsoo Kim', 'Jaewook Yu', 'Eric C. Noel', 'K. Wendy Tang']
ExBCG-TC: Extended Borel Cayley Graph Topology Control for Ad-hoc sensor networks