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.

scholarly journals A Fuzzy-Decision Based Approach for Composite Event Detection in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-20 ◽  
Author(s):  
Shukui Zhang ◽  
Hao Chen ◽  
Qiaoming Zhu ◽  
Juncheng Jia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Event Detection ◽  
Dominating Set ◽  
Wireless Sensor ◽  
Rule Base ◽  
Detection Accuracy ◽  
Two Dimensional ◽  
Fuzzy Decision ◽  
Composite Event

The event detection is one of the fundamental researches in wireless sensor networks (WSNs). Due to the consideration of various properties that reflect events status, the Composite event is more consistent with the objective world. Thus, the research of the Composite event becomes more realistic. In this paper, we analyze the characteristics of the Composite event; then we propose a criterion to determine the area of the Composite event and put forward a dominating set based network topology construction algorithm under random deployment. For the unreliability of partial data in detection process and fuzziness of the event definitions in nature, we propose a cluster-based two-dimensionalτ-GAS algorithm and fuzzy-decision based composite event decision mechanism. In the case that the sensory data of most nodes are normal, the two-dimensionalτ-GAS algorithm can filter the fault node data effectively and reduce the influence of erroneous data on the event determination. The Composite event judgment mechanism which is based on fuzzy-decision holds the superiority of the fuzzy-logic based algorithm; moreover, it does not need the support of a huge rule base and its computational complexity is small. Compared to CollECT algorithm and CDS algorithm, this algorithm improves the detection accuracy and reduces the traffic.

scholarly journals CONE: A Connected Dominating Set-Based Flooding Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2378 ◽  
Author(s):  
Dennis Lisiecki ◽  
Peilin Zhang ◽  
Oliver Theel
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dominating Set ◽  
Average Energy ◽  
Connected Dominating Set ◽  
Wireless Sensor ◽  
Dominating Sets ◽  
Power Sources ◽  
Network Flooding

Wireless sensor networks (WSNs) play a significant role in a large number of applications, e.g., healthcare and industry. A WSN typically consists of a large number of sensor nodes which rely on limited power sources in many applications. Therefore, improving the energy efficiency of WSNs becomes a crucial topic in the research community. As a fundamental service in WSNs, network flooding offers the advantages that information can be distributed fast and reliably throughout an entire network. However, network flooding suffers from low energy efficiency due to the large number of redundant transmissions in the network. In this work, we exploit connected dominating sets (CDS) to enhance the energy efficiency of network flooding by reducing the number of transmissions. For this purpose, we propose a connected dominating set-based flooding protocol (CONE). CONE inhibits nodes that are not in the CDS from rebroadcasting packets during the flooding process. Furthermore, we evaluate the performance of CONE in both simulations and a real-world testbed, and then we compare CONE to a baseline protocol. Experimental results show that CONE improves the end-to-end reliability and reduces the duty cycle of network flooding in the simulations. Additionally, CONE reduces the average energy consumption in the FlockLab testbed by 15%.

Connected dominating set algorithms for wireless sensor networks

2013 ◽  
Vol 13 (2) ◽  
pp. 121 ◽  
Author(s):  
Najla Al Nabhan ◽  
Mznah Al Rodhaan ◽  
Abdullah Al Dhelaan ◽  
Xiuzhen Cheng
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Wireless Sensor

scholarly journals An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks

2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875563 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Rahul Saha ◽  
Hye-jin Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Localization Algorithm ◽  
Mobile Nodes ◽  
Minimum Connected Dominating Set ◽  
Anchor Nodes

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

Sign in / Sign up

Export Citation Format

Share Document