The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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...
In this paper, we investigate and present different node ID assignment algorithms for group-theoretic graphs such as Borel Cayley and de Bruijn graphs. These graphs have been shown to be effective logical topologies in wireless sensor networks when all the nodes are within communication range of each other. However, in practice a sensor node's communication range is limited and some nodes can be out...
We present a novel topology control algorithm for very dense wireless sensor networks that is constrained by a small maximum nodal degree k. Particularly, we limit k = 4 which makes it challenging to formulate a connected network that possesses favorable properties such as a small diameter, short average path length and low energy consumption. Towards this goal, we introduce a graph theoretic approach...
A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information distribution. However, the practical applications of BCG have been challenging because of its inflexible sizes. In this paper, we propose a simple but...
We propose a simple but effective algorithm to formulate growable communication graphs that exhibit (i) fast information dissemination, (ii) high scalability with negligible performance degradation, and (iii) very small diameter and short average path length. In particular, we use Borel Cayley Graphs (BCGs) as base network topologies. Previously, we reported that BCGs are one of the fastest information...
Dense and symmetric graphs are useful for modeling fast information distribution in wireless information networks. In this paper, we focus on a specific family of dense and symmetric graphs, the Borel Cayley graphs. More specifically, we investigate the various parameters in the original formulation of Borel Cayley graphs defined in the matrix domain. By eliminating redundant parameters, we propose...
Radio frequency identification (RFID) systems have been widely deployed for inventory management, personal identification, and asset tracking. In such environments, RFID tags frequently move in and out of a reader's interrogation zone. Consequently, it is necessary for a reader to keep track of all tags in its interrogation zone in a periodic manner. This requirement not only increases workload of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.