%0 Journal Article
%T Borel Cayley Graph-Based Topology Control for Consensus Protocol in Wireless Sensor Networks
%A Junghun Ryu
%A Jaewook Yu
%A Eric Noel
%A K. Wendy Tang
%J ISRN Sensor Networks
%D 2013
%R 10.1155/2013/805635
%X Borel Cayley graphs have been shown to be an efficient candidate topology in interconnection networks due to their small diameter, short path length, and low degree. In this paper, we propose topology control algorithms based on Borel Cayley graphs. In particular, we propose two methods to assign node IDs of Borel Cayley graphs as logical topologies in wireless sensor networks. The first one aims at minimizing communication distance between nodes, while the entire graph is imposed as a logical topology; while the second one aims at maximizing the number of edges of the graph to be used, while the network nodes are constrained with a finite radio transmission range. In the latter case, due to the finite transmission range, the resultant topology is an ¡°incomplete¡± version of the original BCG. In both cases, we apply our algorithms in consensus protocol and compare its performance with that of the random node ID assignment and other existing topology control algorithms. Our simulation indicates that the proposed ID assignments have better performance when consensus protocols are used as a benchmark application. 1. Introduction An adhoc wireless sensor network (WSN) is a self-organized and distributed network consisting of a large number of small and light sensor nodes [1, 2]. A sensor node includes a processor, a wireless radio, and various sensors to monitor and sense environmental parameters such as temperature, moisture, and pressure. In a WSN, sensor nodes interchange information and collaborate with each other to achieve a common mission. The flexibility, fault tolerance, high sensing fidelity, low cost, and rapid deployment characteristics of sensor networks create many new and exciting application areas for remote sensing [3]. Examples of ad-hoc wireless sensor networks applications include building monitoring [4], environmental sensing [5¨C7], traffic monitoring [8], and surveillance [9]. Some WSN applications require very dense networks. Hundreds to several thousands of nodes can be deployed throughout a sensor field. For example, some machine diagnosis applications use up to 3000 nodes in a 100£¿m by 100£¿m area [10] or sensors can be deployed within tens of feet of each other for object tracking [11]. The topology of a large and dense sensor network is important to its performance. For example, topology control algorithms are essential in reducing energy consumption and radio interference [12], thus expanding the network¡¯s lifetime. According to [13], topology control algorithms can be classified as location-based, direction-based, or
%U http://www.hindawi.com/journals/isrn.sensor.networks/2013/805635/