Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (CDS) based routing is a promising approach for enhancing the routing efficiency in sensor networks. Our idea is to generate a quality based CDS algorithm, which can resolve the standing issues like cardinality, risk fac...

Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2-dimensional plane and looked for the approximated Minimum CDS (MCDS) distributed or centralized to construct the virtual backbone of the wireless network. However, in some real situatio...

3 Energy efficient broadcasting without range adjustment 10 3.1 Clustering based broadcasting protocols . . . . . . . . . . . . . . . . 11 3.2 Neighbor elimination based broadcasting protocols . . . . . . . . . . 11 3.3 Distance-based and probabilistic protocols . . . . . . . . . . . . . . . 11 3.4 Coverage and connected dominating set based broadcasting . . . . . 12 3.5 Forwarding neighbors ba...

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

Primary olfactory neurons project their axons to the olfactory bulb, where they terminate in discrete loci called glomeruli. All neurons expressing the same odorant receptor appear to terminate in a few glomeruli in each olfactory bulb. In the P2-IRES-tau-LacZ line of transgenic mice, LacZ is expressed in the perikarya and axons of primary olfactory neurons that express the P2 odorant receptor....

The concept of the zero-divisor graph of a commutative ring has been studied by many authors, and the k-zero-divisor hypergraph of a commutative ring is a nice abstraction of this concept. Though some of the proofs in this paper are long and detailed, any reader familiar with zero-divisors will be able to read through the exposition and find many of the results quite interesting. Let R be a com...

To improve the efficiency of routing and broadcast and reducing energy consumption in the process of data transmission, calculating minimum connected dominating set is always used to construct virtual backbone network in wireless sensor networks. Calculating the minimum connected dominating set (MCDS) of plane graphs is a NPcomplete problem. In this paper, an algorithm leveraging 1hop neighborh...

Nodes of minimum connected dominating set (MCDS) form a virtual backbone in a wireless adhoc network. In this paper, a modified approach is presented to determine MCDS of an underlying graph of a Wireless Adhoc network. Simulation results for a variety of graphs indicate that the approach is efficient in determining the MCDS as compared to other existing techniques.

Let G = (V,E) be a graph. A set D ⊆ V is a total outer-connected dominating set of G if D is dominating and G[V −D] is connected. The total outer-connected domination number of G, denoted γtc(G), is the smallest cardinality of a total outer-connected dominating set of G. It is known that if T is a tree of order n ≥ 2, then γtc(T ) ≥ 2n 3 . We will provide a constructive characterization for tre...

Full terms and conditions of use: