scholarly journals Assessment of Service Quality in Wireless Sensor Networks with Probabilistic Linguistic Term Sets

2017 ◽  
Vol 13 (03) ◽  
pp. 125 ◽  
Author(s):  
Pinghua Zhang ◽  
Shuangxiang She
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Service Quality ◽  
Decision Maker ◽  
Evaluation System ◽  
Wireless Sensor ◽  
Linguistic Term ◽  
Probabilistic Linguistic Term Sets ◽  
Ranking Order ◽  
Definition Of

<span style="font-family: 'Times New Roman',serif; font-size: 12pt; mso-fareast-font-family: SimSun; mso-fareast-theme-font: minor-fareast; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;">Wireless sensor networks as an emerging technology have garnered a lot of attention recently. With the development of wireless sensor networks, some problems such as data delay, information loss, and others have gradually appeared. In order to cope with these problems, evaluating the service quality in wireless sensor networks is crucial. However, how to evaluate the service quality in wireless sensor networks and especially how to accurately portray the preferences of a decision maker exactly are often difficult. To deal with this challenge, firstly, an evaluation system of attributes related to the service quality in wireless sensor networks is constructed based on the existing studies. Then, the probabilistic linguistic method including the definition of probabilistic linguistic term sets, the operators of probabilistic linguistic term sets, and the ranking order of probabilistic linguistic term sets are introduced. Probabilistic term sets used to denote the preferences of a decision maker are considered as more appropriate expressions than classical linguistic term sets, 2-tuple linguistic term sets, and portion linguistic term sets in the process of evaluating the service quality in wireless sensor networks. Finally, the probabilistic linguistic method is applied in the constructed service quality in wireless sensor networks so as to demonstrate its validity and applicability and further to help the decision maker find the problems in the service quality in wireless sensor networks and improve them.</span>

scholarly journals TSCH and RPL Joining Time Model for Industrial Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3904
Author(s):  
Jose Vera-Pérez ◽  
Javier Silvestre-Blanes ◽  
Víctor Sempere-Payá
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Industry 4.0 ◽  
Wireless Sensor ◽  
Lossy Networks ◽  
Industrial Wireless Sensor Networks ◽  
Time Model ◽  
Industrial Internet ◽  
Channel Hopping ◽  
Definition Of

Wireless sensor networks (WSNs) play a key role in the ecosystem of the Industrial Internet of Things (IIoT) and the definition of today’s Industry 4.0. These WSNs have the ability to sensor large amounts of data, thanks to their easy scalability. WSNs allow the deployment of a large number of self-configuring nodes and the ability to automatically reorganize in case of any change in the topology. This huge sensorization capacity, together with its interoperability with IP-based networks, allows the systems of Industry 4.0 to be equipped with a powerful tool with which to digitalize a huge amount of variables in the different industrial processes. The IEEE 802.15.4e standard, together with the access mechanism to the Time Slotted Channel Hopping medium (TSCH) and the dynamic Routing Protocol for Low-Power and Lossy Networks (RPL), allow deployment of networks with the high levels of robustness and reliability necessary in industrial scenarios. However, these configurations have some disadvantages in the deployment and synchronization phases of the networks, since the time it takes to synchronize the nodes is penalized compared to other solutions in which access to the medium is done randomly and without channel hopping. This article proposes an analytical model to characterize the behavior of this type of network, based on TSCH and RPL during the phases of deployment along with synchronization and connection to the RPL network. Through this model, validated by simulation and real tests, it is possible to parameterize different configurations of a WSN network based on TSCH and RPL.

CHRONOLOGICAL TREE — A COMPRESSED STRUCTURE FOR MINING BEHAVIORAL PATTERNS FROM WIRELESS SENSOR NETWORKS

2008 ◽  
Vol 09 (03) ◽  
pp. 255-276 ◽  
Author(s):  
SAMER SAMARAH ◽  
AZZEDINE BOUKERCHE
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Time Interval ◽  
Behavioral Patterns ◽  
Data Mining Technique ◽  
Representation Structure ◽  
Definition Of

Wireless Sensor Networks (WSNs) have proven their success in a variety of applications for monitoring physical and critical environments. However, the streaming nature, limited resources, and the unreliability of wireless communication are among the factors that affect the Quality of Service (QoS) of WSNs. In this paper, we propose a data mining technique to extract behavioral patterns about the sensor nodes during their operation. The behavioral patterns, which we refer to as Chronological Patterns, can be thought of as tutorials that teach about the set of sensors that report on events within a defined time interval and the order in which the events were detected. Chronological Patterns can serve as a helpful tool for predicting behaviors in order to enhance the performance of the WSN and thus improve the overall QoS. The proposed technique consists of: a formal definition of the Chronological Patterns and a new representation structure, which we refer to as Chlorotical Tree (CT), that facilities the mining of these patterns. To report about the performance of the CT, several experiments have been conducted to evaluate the CT using different density factors.

scholarly journals Research on Evaluating Algorithms for the Service Quality of Wireless Sensor Networks Based on Interval-Valued Intuitionistic Fuzzy EDAS and CRITIC Methods

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Shihui Li ◽  
Bo Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Service Quality ◽  
Social Life ◽  
Wireless Sensor ◽  
Intuitionistic Fuzzy ◽  
Economic Production ◽  
Multiple Attribute ◽  
Interval Valued

Wireless sensor networks play an important role in economic production and social life. However, in recent years, the number of wireless sensor network vulnerabilities has been increasing rapidly, which makes wireless sensor networks face more and more severe challenges. It is of great significance to realize the quantitative evaluation of wireless sensor networks in order to maintain the service quality of wireless sensor networks more effectively. The evaluating problem of the service quality of wireless sensor networks is a kind of multiple attribute group decision-making (MAGDM) problem. In this paper, depending on the classical EDAS method, the EDAS method will be extended to interval-valued intuitionistic fuzzy sets (IVIFSs) to address some MAGDM issues. At first, some essential concepts of IVIFSs are briefly reviewed. Subsequently, relying on the CRITIC method, the attributes’ weights are decided. Furthermore, integrating the EDAS method with IVIFSs, IVIF-EDAS method is established, and all calculating procedures are depicted. Finally, an empirical application for evaluating the service quality of wireless sensor networks is given to demonstrate this novel algorithm, and some comparative analyses are made to confirm the merits of the designed method.

QoS-Based Data Aggregation Technology in Wireless Sensor Networks

2011 ◽  
Vol 135-136 ◽  
pp. 702-708
Author(s):  
Zheng Yu Chen ◽  
Geng Yang ◽  
Guo Hua Li ◽  
Jian Xu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Aggregation ◽  
Wireless Sensor ◽  
Future Research ◽  
Efficient Manner ◽  
Trade Offs ◽  
Future Research Directions ◽  
Definition Of

The main goal of data-aggregation algorithms in wireless sensor networks (WSNs) is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In this article, we focus on QoS-based data-aggregation problems in WSNs. Firstly, we provide a definition of the different QoS parameters for data aggregation, such as energy efficiency, network lifetime, data latency and data quality. Then, we compare the different algorithms on each QoS parameter, describe the main features of each algorithm, and highlight the trade-offs between each parameter. Finally, we conclude with possible future research directions on QoS-based data aggregation in WSNs.

Research on the Time Synchronization Technology of Wireless Sensor Network

2014 ◽  
Vol 1070-1072 ◽  
pp. 2033-2036
Author(s):  
Ya Qin Fan ◽  
Jing Ya Wang ◽  
Shu Ting Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Time Synchronization ◽  
Rapid Development ◽  
Wireless Sensor ◽  
Practical Significance ◽  
Basic Characteristics ◽  
Definition Of

The paper studies the basic characteristics and the definition of the wireless sensor networks, the time synchronization of wireless sensor network and the algorithm of time synchronization in wireless sensor networks. This paper studies the RBS algorithm and its improved algorithm. The research results have practical significance to the rapid development of network and the future network.

scholarly journals An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 1831 ◽  
Author(s):  
Yu-Ning Chen ◽  
Wu-Hsiung Lin ◽  
Chiuyuan Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Detection Probability ◽  
Sensor Node ◽  
Fundamental Problem ◽  
Wireless Sensor ◽  
Sensor Deployment ◽  
Sensing Model ◽  
Definition Of ◽  
Probabilistic Sensing Model

The coverage problem is a fundamental problem for almost all applications in wireless sensor networks (WSNs). Many applications even impose the requirement of multilevel (k) coverage of the region of interest (ROI). In this paper, we consider WSNs with uncertain properties. More precisely, we consider WSNs under the probabilistic sensing model, in which the detection probability of a sensor node decays as the distance between the target and the sensor node increases. The difficulty we encountered is that there is no unified definition of k-coverage under the probabilistic sensing model. We overcome this difficulty by proposing a “reasonable” definition of k-coverage under such a model. We propose a sensor deployment scheme that uses less number of deployed sensor nodes while ensuring good coverage qualities so that (i) the resultant WSN is connected and (ii) the detection probability satisfies a predefined threshold p th , where 0 < p th < 1 . Our scheme uses a novel “zone 1 and zone 1–2” strategy, where zone 1 and zone 2 are a sensor node’s sensing regions that have the highest and the second highest detection probability, respectively, and zone 1–2 is the union of zones 1 and 2. The experimental results demonstrate the effectiveness of our scheme.

scholarly journals Object Tracking Based on (m,k)-firm Model in Multimedia Wireless Sensor Networks

Proceedings ◽  
2019 ◽  
Vol 15 (1) ◽  
pp. 46
Author(s):  
Kim ◽  
Kim ◽  
Sung ◽  
Shah ◽  
Chow ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Service Quality ◽  
Object Tracking ◽  
Support Service ◽  
Multimedia Data ◽  
Wireless Sensor ◽  
Current Status ◽  
Network Technology ◽  
Intermediate Node

Object tracking is one of the most promising applications in wireless sensor networks (WSN). However, current scalar based WSN cannot provide diverse object information for type and shape of object. To defeat this problem, multimedia WSN is employed to support various information for the object. When using multimedia, service quality problems naturally arise, which makes it necessary for network technology as to support service quality stably. In this paper, we present real-time network technology for applying (m,k) -firm stream to object tracking in multimedia WSN. The proposed method satisfies the (m,k) -firm requirement of the data transmitted from each sensor node to the sink, and at the same time, aggregates the multimedia data to compensate the technology at intermediate node. In addition, according to current status, adaptive QoS routing protocol chooses the path to satisfy the new (m,k)-firm for users. Finally, simulation result is given to prove the suitability of the proposed scheme by presenting stream dynamic failure ratio value for the (m,k)-firm stream.

scholarly journals An Improved Energy-Aware Routing Protocol Using Multiobjective Particular Swarm Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Zhihao Peng ◽  
Mehdi Sajedi Jabloo ◽  
Yahya Dorostkar Navaei ◽  
Morteza Hosseini ◽  
Rozita Jamili Oskouei ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Service Quality ◽  
Routing Protocol ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Swarm Optimization

The energy of sensor nodes in wireless sensor networks is limited, which is one of the most important challenges due to the lack of a fixed power supply. Because data transmission consumes the most energy of nodes, a node that transmits more packets runs out of energy faster than the others. When the energy of a node comes to the end of a network, the process of network operation may be disrupted. In this case, critical information in the network with the desired quality may not reach the hole and eventually the base stations. Therefore, considering the dynamic topology and distributed nature of wireless sensor networks, designing energy-efficient routing protocols is the main challenge. In this paper, an energy-aware routing protocol based on a multiobjective particle swarm optimization algorithm is presented. In the proposed particle swarm optimization algorithm method, the proportionality function for selecting the optimal threaded node is set based on the goals related to service quality including residual energy, link quality, end-to-end delay, and delivery rate. The simulation results show that the proposed method consumes less energy and has a longer lifespan compared with the state-of-the-art methods due to balancing the goals related to service quality criteria.

Sign in / Sign up

Export Citation Format

Share Document