Limited energy of the sensors is one of the key issues towards realizing a reliable wireless sensor network (WSN), which can survive under the emerging WSN applications. A promising method for conserving the energy of these sensors can be implemented by applying a sleep-wake scheduling while distributing the data gathering and sensing tasks to a dominating set of awake sensors while the other nodes are in a sleep mode. Producing the maximum possible number of such disjoint dominating sets, called the domatic partition problem in unit disk graphs, can further prolong the network lifetime. This problem becomes challenging when the initial energy of the nodes varies from one to another. In this paper, we introduce multiple local search algorithms that can improve the total lifetime of WSNs consisting of nodes with varying initial energy. We discuss the performance of the existing dominating set algorithm and introduce three more algorithms which can be applied on multiple disjoint dominating sets with nodes having varying initial energy. We discuss the efficiency of each of the algorithms through extensive simulations.

Dominating Set Algorithms for Wireless Sensor Networks Survivability

Revamp energy efficiency in Homogeneous Wireless Sensor Networks using Optimized Radio Energy Algorithm (OREA) and Power-Aware Distance Source Routing protocol

Cluster head selection based on Minimum Connected Dominating Set and Bi-Partite inspired methodology for energy conservation in WSNs

Cyber-physical network (CPN) as well as cyber-physical social computing and networking (CPSCN), as the next generation of computing and networking, utilize a wide variety of sensing devices with significant sensing capabilities. However, it face huge challenge that data packet is transmitted to destination security. Data packets can be dropped by malicious nodes in CPN/CPSCN, causing serious damage to the network. Thus, ensuring the security of data transmission is a crucial issue for wireless sensor networks which is one of the important component of CPN/CPSCN. In this paper, a trust with abstract information verified (TAIV) routing scheme is proposed to improve the data packet arrival ratio. In the TAIV scheme, backbone routing paths are created by constructing an optimal connected dominating set (CDS). CDS routing ensures communication among all nodes in the network. In addition, as the source node sends the data packet to the destination through the backbone routing path, the abstract information is also transmitted to the destination through the auxiliary routing path to allow the destination node to know whether data has been sent to it. Depending on whether the data packet is transmitted to the destination or dropped by the malicious node and whether the abstract message is transmitted to the destination successfully, the destination will reduce or increase the trust in nodes in this routing path accordingly. After a period of time, the trust information of nodes will be diffused by information exchange. If the trust information is sufficient, the malicious node, whose trust is lower than that of the normal node, will be identified and eliminated from the backbone routing path, reducing the number of malicious nodes in the backbone. Thus, the data packet arrival ratio will be improved. The theoretical analysis shows that compared with the previous scheme, the data packet arrival ratio increases by 4.251%–80.208%, and nearly all malicious nodes are identified while retaining long network lifetime.

A Trust With Abstract Information Verified Routing Scheme for Cyber-Physical Network

Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI), which reduces the CDS size as much as possible. Our method first constructs the CDS and then reduces its size further by excluding some of the CDS nodes cleverly without any loss in coverage or connectivity. The simulation results show that our method outperforms existing CDS construction algorithms in terms of both the CDS size and construction cost. CPDS2HI retains the current best performance ratio of ( 4.8 + ln 5 ) | o p t | + 1.2 , |opt| being the size of an optimal CDS of the network, and has the best time complexity of O(D), where D is the network diameter. To the best of our knowledge this is the most time efficient and size-optimal CDS construction algorithm. It has a linear message complexity of O(nΔ), where n is the network size and Δ is the maximum degree of all the nodes.

Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set

In the ad-hoc wireless network, there is no predefined infrastructure. So, nodes communicate with each other via peer communications. For effective communication, connected dominating set (CDS) can be used as a virtual backbone for the network. However, constructing a minimum connected dominating set is a NP-Complete problem. In the literature many approximation algorithms have been reported. In this paper, we propose a distributed three phase greedy approximation algorithm. In our algorithm, the nodes only store one hop neighborhood information to find the next dominators. We also propose a way to reduce the CDS size by downgrading some of the existing dominators after the construction of CDS. The simulation result shows that our CDS construction scheme outperforms all the existing CDS construction algorithms in terms of CDS size for randomly distributed nodes. Our algorithm retains the performance ratio of (4.8 + ln5)opt + 1.2 and time complexity of O(D), where opt being the size of the optimal CDS and D is the diameter of the network.

A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network

In a Wireless Sensor Network (WSN), all the nodes are deployed randomly and are energy constrained. There is no physical backbone infrastructure. So, for effective communication between the nodes, a virtual backbone can be used. A virtual backbone can be formed by constructing the Connected Dominating Set (CDS). In past few years, efficient and fast construction of CDS in a wireless network is the main research problem in topology control. In this chapter, the authors have given a comprehensive survey of the CDS construction algorithms with their merit and demerits. They concluded the chapter with some open problems and interesting issues in this field are proposed.

Connected Dominating Set in Wireless Sensor Network

The non-iterative structure of radial basis function neural networks makes them more appealing for classification tasks decade after decade. In line with the growth of the training data set, the pattern layer also grows. The unprecedented growth of data with no class labels is becoming a challenge for researchers who are working in data science, big data analysis, etc. Although there is literature witnessed for many algorithms to handle data with no class label. However, neural network-based algorithms with a special characteristic of radial basis neural networks for uncovering class labels are very rare. In this paper, we propose a novel class discovery algorithm that combines the best features of radial basis function neural networks (RBFN) and self-organizing feature map (SOFM). We have taken a few datasets with class label for our experimental work. In the training phase of the network, the training instances are used without class labels. In the test phase, they are validated by combining the predicted class labels with their actual class label. The result shows that the proposed algorithm can be treated as an alternative method for class discovery.

Jasaswi Prasad Mohanty

Papers

Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set

Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network

Connected Dominating Set in Wireless Sensor Network

Radial Basis Neural Networks for Class Discovery