The Upper Bound of the Number of Nodes on Fixed Energy Budget in Wireless Sensor Networks

2007 ◽  
Author(s):  
Fang Wang ◽  
Guifa Teng ◽  
Lisheng Ren
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Budget ◽  
Upper Bound ◽  
Wireless Sensor ◽  
Fixed Energy

α-Derivable digraphs and its application in wireless sensor networking

2020 ◽  
Vol 12 (03) ◽  
pp. 2050030
Author(s):  
M. Hamidi ◽  
R. Ameri
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Equivalence Relation ◽  
Upper Bound ◽  
Wireless Sensor ◽  
Positive Relation ◽  
Sensor Networking ◽  
Directed Hypergraphs ◽  
Wireless Sensor Networking

This paper considers derivable directed hypergraphs by undirected hypergraphs and generates undirected hypergraphs from directed hypergraphs. It tries to enumerate derivable directed hypergraphs and to find an upper bound for it. We introduce a positive relation on directed hypergraphs and derives digraphs via positive equivalence relation. We consider wireless sensor hypernetworks as directed hypergraphs and by clustering directed hypergraphs and positive equivalence relation obtain wireless sensor networks and show by cluster digraphs.

scholarly journals Computing Open Locating-Dominating Number of Some Rotationally-Symmetric Graphs

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1415
Author(s):  
Hassan Raza
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Upper Bound ◽  
Dominating Set ◽  
Convex Polytopes ◽  
Wireless Sensor ◽  
Environmental Processes ◽  
Dominating Number ◽  
Rotationally Symmetric ◽  
Location Detection

Location detection is studied for many scenarios, such as pointing out the flaws in multiprocessors, invaders in buildings and facilities, and utilizing wireless sensor networks for monitoring environmental processes. The system or structure can be illustrated as a graph in each of these applications. Sensors strategically placed at a subset of vertices can determine and identify irregularities within the network. The open locating-dominating set S of a graph G=(V,E) is the set of vertices that dominates G, and for any i,j∈ V(G) N(i)∩S≠N(j)∩S is satisfied. The set S is called the OLD-set of G. The cardinality of the set S is called open locating-dominating number and denoted by γold(G). In this paper, we computed exact values of the prism and prism-related graphs, and also the exact values of convex polytopes of Rn and Hn. The upper bound is determined for other classes of convex polytopes. The graphs considered here are well-known from the literature.

Sign in / Sign up

Export Citation Format

Share Document