On Vertex Cover Problems in Distributed Systems

2016 ◽  
pp. 1-29 ◽  
Author(s):  
Can Umut Ileri ◽  
Cemil Aybars Ural ◽  
Orhan Dagdeviren ◽  
Vedat Kavalci
Keyword(s):  
Wireless Sensor Networks ◽  
Distributed Systems ◽  
Sensor Networks ◽  
Communication Networks ◽  
Distributed Algorithms ◽  
Data Aggregation ◽  
Undirected Graph ◽  
Vertex Cover ◽  
Research Area ◽  
Wireless Sensor

An undirected graph can be represented by G(V,E) where V is the set of vertices and E is the set of edges connecting vertices. The problem of finding a vertex cover (VC) is to identify a set of vertices VC such that at least one endpoint of every edge in E is incident to a vertex V in VC. Vertex cover is a very important graph theoretical structure for various types of communication networks such as wireless sensor networks, since VC can be used for link monitoring, clustering, backbone formation and data aggregation management. In this chapter, we will define vertex cover and related problems with their applications on communication networks and we will survey some important distributed algorithms on this research area.

QoS-Aware Chain-Based Data Aggregation in Cooperating Vehicular Communication Networks and Wireless Sensor Networks

2015 ◽  
pp. 874-896 ◽  
Author(s):  
Zahra Taghikhaki ◽  
Yang Zhang ◽  
Nirvana Meratnia ◽  
Paul J.M. Havinga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Communication Networks ◽  
Data Aggregation ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Vehicular Communication ◽  
The Road ◽  
Vehicular Communication Networks ◽  
Save Energy

Vehicular Communication Networks (VCNs) and Wireless Sensor Networks (WSNs) are emerging types of networks, which have individually been extensively explored. However, their cooperation and exploring advantages offered by their integration are poorly explored. Such integration helps better investigate impacts of human mobility and transportation behaviors on safety and well-being of cities, their residents, their surrounding environments, and ecology. In this chapter, the authors propose a QoS-Aware Chain-based data Aggregation (QoS-ACA) technique for wireless sensor networks cooperating with vehicular communication networks, which fast, reliably, and energy efficiently aggregates sensor data and sends the aggregated value to the road side units. Ensuring quality of service parameters has been put forward as an essential consideration for wireless sensor networks, which are often deployed in unattended and open environments and are characterized by their limited resources. To this end, in-network data aggregation is an efficient solution to save energy and bandwidth and to provide meaningful information to end-users.

QoS-Aware Chain-Based Data Aggregation in Cooperating Vehicular Communication Networks and Wireless Sensor Networks

2012 ◽  
pp. 169-190 ◽  
Author(s):  
Zahra Taghikhaki ◽  
Yang Zhang ◽  
Nirvana Meratnia ◽  
Paul Havinga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Communication Networks ◽  
Data Aggregation ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Vehicular Communication ◽  
The Road ◽  
Vehicular Communication Networks ◽  
Save Energy

Vehicular Communication Networks (VCNs) and Wireless Sensor Networks (WSNs) are emerging types of networks, which have individually been extensively explored. However, their cooperation and exploring advantages offered by their integration are poorly explored. Such integration helps better investigate impacts of human mobility and transportation behaviors on safety and well-being of cities, their residents, their surrounding environments, and ecology. In this chapter, the authors propose a QoS-Aware Chain-based data Aggregation (QoS-ACA) technique for wireless sensor networks cooperating with vehicular communication networks, which fast, reliably, and energy efficiently aggregates sensor data and sends the aggregated value to the road side units. Ensuring quality of service parameters has been put forward as an essential consideration for wireless sensor networks, which are often deployed in unattended and open environments and are characterized by their limited resources. To this end, in-network data aggregation is an efficient solution to save energy and bandwidth and to provide meaningful information to end-users.

On centralized and distributed algorithms for minimizing data aggregation time in duty-cycled wireless sensor networks

2014 ◽  
Vol 20 (7) ◽  
pp. 1729-1741 ◽  
Author(s):  
Shiliang Xiao ◽  
Jingchang Huang ◽  
Lebing Pan ◽  
Yongbo Cheng ◽  
Jianpo Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Distributed Algorithms ◽  
Data Aggregation ◽  
Wireless Sensor

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

Energy efficient fixed-cluster architecture for wireless sensor networks

2021 ◽  
Vol 40 (5) ◽  
pp. 8727-8740
Author(s):  
Rajvir Singh ◽  
C. Rama Krishna ◽  
Rajnish Sharma ◽  
Renu Vig
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Cluster Formation ◽  
Wireless Sensor ◽  
Efficient Operation ◽  
Cluster Architecture ◽  
Dynamic Cluster

Dynamic and frequent re-clustering of nodes along with data aggregation is used to achieve energy-efficient operation in wireless sensor networks. But dynamic cluster formation supports data aggregation only when clusters can be formed using any set of nodes that lie in close proximity to each other. Frequent re-clustering makes network management difficult and adversely affects the use of energy efficient TDMA-based scheduling for data collection within the clusters. To circumvent these issues, a centralized Fixed-Cluster Architecture (FCA) has been proposed in this paper. The proposed scheme leads to a simplified network implementation for smart spaces where it makes more sense to aggregate data that belongs to a cluster of sensors located within the confines of a designated area. A comparative study is done with dynamic clusters formed with a distributive Low Energy Adaptive Clustering Hierarchy (LEACH) and a centralized Harmonic Search Algorithm (HSA). Using uniform cluster size for FCA, the results show that it utilizes the available energy efficiently by providing stability period values that are 56% and 41% more as compared to LEACH and HSA respectively.

Sign in / Sign up

Export Citation Format

Share Document