scholarly journals Highly Reliable Decision-Making Using Reliability Factor Feedback for Factory Condition Monitoring via WSNs

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Zafar Iqbal ◽  
Heung-No Lee ◽  
Saeid Nooshabadi

Cooperation among sensors in a wireless sensor network, deployed for industrial monitoring in an indoor scenario, is a topic of interest in the smart factory and smart city research. The indoor wireless communication channel is very harsh and the observations of all the sensors cannot be sent reliably to the base station. Failure to transmit correct sensing results to the base station may result in false alarms or missed detection of events. Therefore, we propose a cooperation scheme for the wireless sensors to send the data reliably to the base station. Our aim is to increase the reliability of the received information, reduce the probability of error, lower the overall power consumption, and keep the latency to an acceptable low level. We propose a reliability factor feedback algorithm to adjust the weight of unreliable sensors in the decision-making process. The proposed scheme is analyzed based on its latency, power consumption, and packet delivery ratio. Our results show significant improvement in the reliability of the received data, improved packet delivery, and reduced false alarm ratio for full repetition and cluster head-based cooperation. The power consumption and latency in data transmission are also kept to an acceptable low level.

Author(s):  
Nitin Chouhan ◽  
Uma Rathore Bhatt ◽  
Raksha Upadhyay

: Fiber Wireless Access Network is the blend of passive optical network and wireless access network. This network provides higher capacity, better flexibility, more stability and improved reliability to the users at lower cost. Network component (such as Optical Network Unit (ONU)) placement is one of the major research issues which affects the network design, performance and cost. Considering all these concerns, we implement customized Whale Optimization Algorithm (WOA) for ONU placement. Initially whale optimization algorithm is applied to get optimized position of ONUs, which is followed by reduction of number of ONUs in the network. Reduction of ONUs is done such that with fewer number of ONUs all routers present in the network can communicate. In order to ensure the performance of the network we compute the network parameters such as Packet Delivery Ratio (PDR), Total Time for Delivering the Packets in the Network (TTDPN) and percentage reduction in power consumption for the proposed algorithm. The performance of the proposed work is compared with existing algorithms (deterministic and centrally placed ONUs with predefined hops) and has been analyzed through extensive simulation. The result shows that the proposed algorithm is superior to the other algorithms in terms of minimum required ONUs and reduced power consumption in the network with almost same packet delivery ratio and total time for delivering the packets in the network. Therefore, present work is suitable for developing cost-effective FiWi network with maintained network performance.


Author(s):  
Vasin Chaoboworn ◽  
Yoschanin Sasiwat ◽  
Dujdow Buranapanichkit ◽  
Hiroshi Saito ◽  
Apidet Booranawong

In this paper, the communication reliability of a 2.4 GHz multi-hop wireless sensor network (WSN) in various test scenarios is evaluated through experiments. First, we implement an autonomous communication procedure for a multi-hop WSN on Tmote sky sensor nodes; 2.4 GHz, an IEEE 802.15.4 standard. Here, all nodes including a transmitter node (Tx), forwarder nodes (Fw), and a base station node (BS) can automatically work for transmitting and receiving data. The experiments have been tested in different scenarios including: i) in a room, ii) line-of-sight (LoS) communications on the 2nd floor of a building, iii) LoS and non-line-of-sight (NLoS) communications on the 1st floor to the 2nd floor, iv) LoS and NLoS communications from outdoor to the 1st and the 2nd floors of the building. The experimental results demonstrate that the communication reliability indicated by the packet delivery ratio (PDR) can vary from 99.89% in the case of i) to 14.40% in the case of iv), respectively. Here, the experiments reveal that multi-hop wireless commutations for outdoor to indoor with different floors and NLoS largely affect the PDR results, where the PDR more decreases from the best case (i.e., the case of a)) by 85.49%. Our research methodology and findings can be useful for users and researchers to carefully consider and deploy an efficient 2.4 GHz multi-hop WSN in their works, since different WSN applications require different communication reliability level.


2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Yu Han ◽  
Jian Su ◽  
Guangjun Wen ◽  
Yiran He ◽  
Jian Li

In the last decade, energy harvesting wireless sensor network (EHWSN) has been well developed. By harvesting energy from the surrounding environment, sensors in EHWSN remove the energy constraint and have an unlimited lifetime in theory. The long-lasting character makes EHWSN suitable for Industry 4.0 applications that usually need sensors to monitor the machine state and detect errors continuously. Most wireless sensor network protocols have become inefficient in EHWSN due to neglecting the energy harvesting property. In this paper, we propose CPEH, which is a clustering protocol specially designed for the EHWSN. CPEH considers the diversity of the energy harvesting ability among sensors in both cluster formation and intercluster communication. It takes the node’s information such as local energy state, local density, and remote degree into account and uses fuzzy logic to conduct the cluster head selection and cluster size allocation. Meanwhile, the Ant Colony Optimization (ACO) as a reinforcement learning strategy is utilized by CPEH to discover a highly efficient intercluster routing between cluster heads and the base station. Furthermore, to avoid cluster dormancy, CPEH introduces the Cluster Head Relay (CHR) strategy to allow the proper cluster member to undertake the cluster head that is energy depletion. We make a detailed simulation of CPEH with some famous clustering protocols under different network scenarios. The result shows that CPEH can effectively improve the network throughput and delivery ratio than others as well as successfully solve the cluster dormancy problem.


Sensor Review ◽  
2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Farzad Kiani ◽  
Amir Seyyedabbasi ◽  
Sajjad Nematzadeh

Purpose Efficient resource utilization in wireless sensor networks is an important issue. Clustering structure has an important effect on the efficient use of energy, which is one of the most critical resources. However, it is extremely vital to choose efficient and suitable cluster head (CH) elements in these structures to harness their benefits. Selecting appropriate CHs and finding optimal coefficients for each parameter of a relevant fitness function in CHs election is a non-deterministic polynomial-time (NP-hard) problem that requires additional processing. Therefore, the purpose of this paper is to propose efficient solutions to achieve the main goal by addressing the related issues. Design/methodology/approach This paper draws inspiration from three metaheuristic-based algorithms; gray wolf optimizer (GWO), incremental GWO and expanded GWO. These methods perform various complex processes very efficiently and much faster. They consist of cluster setup and data transmission phases. The first phase focuses on clusters formation and CHs election, and the second phase tries to find routes for data transmission. The CH selection is obtained using a new fitness function. This function focuses on four parameters, i.e. energy of each node, energy of its neighbors, number of neighbors and its distance from the base station. Findings The results obtained from the proposed methods have been compared with HEEL, EESTDC, iABC and NR-LEACH algorithms and are found to be successful using various analysis parameters. Particularly, I-HEELEx-GWO method has provided the best results. Originality/value This paper proposes three new methods to elect optimal CH that prolong the networks lifetime, save energy, improve overhead along with packet delivery ratio.


Sensors are regarded as significant components of electronic devices. The sensor nodes deployed with limited resources, such as the power of battery inserted in the sensor nodes. So the lifetime of wireless sensor networks(WSNs) can be increased by using the energy of the sensor nodes in an efficient way. A major part of energy is consumed during the communication of data. Also, the growing demand for usage of wireless sensors applications in different aspects makes the quality-of-service(QoS) to be one of the paramount issues in wireless sensors applications. QoS guarantee in WSNs is difficult and more challenging due to the fact that the sensors have limited resources and the various applications running over these networks have different constraints in their nature and requirements. The packet delivery ratio(PDR) is a major factor of QoS. To achieve high QoS the packet delivery ratio should be maximum. The energy-efficient unequal clustering routing protocol (EEUCR) is evaluated and results show that it enhances the packet delivery ratio(PDR) and a lifetime of WSNs. In this protocol, the area of the network is divided into a number of rings of unequal size and each ring is further divided into a number of clusters. Rings nearer to the base station(BS) have smaller area and area of rings keeps on increasing as the distance from BS increases for balanced energy consumption. The nodes with heterogeneous energy are deployed in the network. Nodes nearer to the base station have higher energy as compared to farther nodes. Static clustering is used but cluster heads(CHs) are not fixed and are elected on the basis of remaining energy. This helps to increase lifetime of EEUCR. PDR of EEUCR is improved because multiple rings help to find better route which further aids to ensure safe reception of packets at the destination. Simulation results are compared with existing protocols and show that this algorithm gives better results.


Author(s):  
Advin Manhar, Dr. Deepak Dembla

Mobile adhoc networks (MANET) are a self-coordinated wireless network that is worked without perpetual foundation and base station endorsement. In MANETs (Mobile Ad Hoc Networks) every single node activity goes about as the information source and communicator router. It notices its useful neighbours by making themselves by passing the nodes that got terminated of that correspondence range. In this paper, we designed the IHRP routing protocol with the help of combining the AODV, AOMDV and OLSR routing protocol with the network situation based routing adaptation. In the previous analysis, we identify AODV is more compatible for dynamic environment (where node motion is higher).The AOMDV routing protocol is useful for network load balancing and congestion control. OLSR is compatible for stable network which use as maximum link stability base routing. While we are designing the IHRP routing protocol through of the above (AODV, AOMDV and OLSR) protocol .We handle the network behaviour with better performance in any situation. Initially the RREP are broadcasted to find out the route. The poll of routing, select based on the network situation. The proposed IHRP start with a RREQ packet is to search the distance from its origin to its objective node. The network motion is higher than AODV protocol handle the particular situation but in any situation, while the 70% network node are stable then the route selection and transferring of data with the help of an OLSR routing protocol. The propose IHRP routing protocol also handle the network load and control the network congestion through the AOMDV routing protocol. Our proposed protocol IHRP also works in a hybrid manner while the source and destination belong in longer range such as different cluster. At that time situation based routing was followed between the clusters. We saw in the result part the comparison of IHRP and ZRP routing protocol. Execution of the improved hybrid routing protocol (IHRP) is much better than hybrid routing protocol (ZRP). In case of Packet Delivery Ratio analysis for IHRP and ZRP, we clearly show that The Packet Delivery Ratio is 97.99% by IHRP and 79.49% by ZRP, so we can say that the performance of packet delivery ratio in Improved hybrid routing protocol (IHRP) is much better than ZRP, where Improved hybrid routing protocol (IHRP) and hybrid routing protocol (ZRP) both performed the conjunction of proactive and reactive routing protocol features therefore we can say that Packet Delivery Ratio is better in improved hybrid routing protocol (IHRP) as compare to hybrid routing protocol (ZRP). We clearly show that the Normal Routing Load analysis for IHRP and ZRP where Normal Routing Load is 0.11% by IHRP and 4.72 % by ZRP, so we can say that performance of Improved Hybrid Routing Protocol (IHRP) in case of a Normal Routing Load   is much less than the Hybrid Routing Protocol (ZRP). In case of overall parameter matrix (Normal Routing Load, Throughput, Packet Delivery Ratio and Average End To End Delay) the performance of Improved Hybrid Routing Protocol (IHRP) is much better than existing Hybrid routing protocol (ZRP).


Author(s):  
Amit Grover Et al.

Wireless Sensor Networks (WSNs) comprised of battery operated sensor nodes that collect data from their neighbor nodes and transmit the aggregated information to the sink node or the Base Station (BS). This may result in congestion near the BS and leads to a bottleneck situation in the network. In this paper, an extensive study of earlier reported diverse congestion techniques explicitly diverse Algorithm based - and Layer based-congestion techniques is carried out. Accordingly, a recommendation is drawn based upon their performance comparison. Furthermore, a demonstration is carried out for contemporary earlier reported strategies such as Pro-AODV, CC-AODV, EDAPR, ED-AODV and PCC-AODV by evaluating delay, packet delivery ratio (PDR) and packet loss ratio (PLR). Accordingly, a recommended congestion strategy is suggested depending upon the comparison of the demonstrated schemes.


Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 18 ◽  
Author(s):  
Mohammad Kazem Chamran ◽  
Kok-Lim Alvin Yau ◽  
Rafidah M. D. Noor ◽  
Richard Wong

This paper demonstrates the use of Universal Software Radio Peripheral (USRP), together with Raspberry Pi3 B+ (RP3) as the brain (or the decision making engine), to develop a distributed wireless network in which nodes can communicate with other nodes independently and make decision autonomously. In other words, each USRP node (i.e., sensor) is embedded with separate processing units (i.e., RP3), which has not been investigated in the literature, so that each node can make independent decisions in a distributed manner. The proposed testbed in this paper is compared with the traditional distributed testbed, which has been widely used in the literature. In the traditional distributed testbed, there is a single processing unit (i.e., a personal computer) that makes decisions in a centralized manner, and each node (i.e., USRP) is connected to the processing unit via a switch. The single processing unit exchanges control messages with nodes via the switch, while the nodes exchange data packets among themselves using a wireless medium in a distributed manner. The main disadvantage of the traditional testbed is that, despite the network being distributed in nature, decisions are made in a centralized manner. Hence, the response delay of the control message exchange is always neglected. The use of such testbed is mainly due to the limited hardware and monetary cost to acquire a separate processing unit for each node. The experiment in our testbed has shown the increase of end-to-end delay and decrease of packet delivery ratio due to software and hardware delays. The observed multihop transmission is performed using device-to-device (D2D) communication, which has been enabled in 5G. Therefore, nodes can either communicate with other nodes via: (a) a direct communication with the base station at the macrocell, which helps to improve network performance; or (b) D2D that improve spectrum efficiency, whereby traffic is offloaded from macrocell to small cells. Our testbed is the first of its kind in this scale, and it uses RP3 as the distributed decision-making engine incorporated into the USRP/GNU radio platform. This work provides an insight to the development of a 5G network.


2012 ◽  
Vol 1 (04) ◽  
pp. 235-246 ◽  
Author(s):  
Jennifer S. Raj

The wireless sensor networks incorporated with multitude of distributed autonomous sensors with the potency of monitoring any changes that is physical or environmental, faces few challenges due to its distributed nature and the limited battery availability. The challenges incurred result with delay in the transmission, dynamic topology changes, and the link failures due to the reduced life span of the sensors. The researchers claim that the reduce in the life span of the sensor are the result of energy usage in the transmission leading to an enormous battery power consumption for a single conveyance. So the paper proposes an energy efficient conveyance for the information that are sensed utilizing the hybrid algorithms that include the K-means for the purpose of clustering, Genetic algorithm for the purpose of cluster head selection and the Ant colony optimization for determining the shortest path between the member to the cluster head and the cluster head to the base station. The performance evaluation of the proposed process using the network simulator-2 serves as an evidence for the improved capabilities of the same in terms of the throughput, packet delivery ratio (PDR), energy efficiency and the network life time.


2019 ◽  
Vol 8 (3) ◽  
pp. 6013-6018

MANETs are a trending topic in the wireless communication network. MANETs are formed automatically by an autonomous system of mobile nodes that are connected via wireless links. Cluster-head gateway switch routing protocol (CGSR) is a proactive protocol which is also called table-driven protocol. It consists of routing table information before setting up a connection. Ad-hoc on-demand distance vector protocol (AODV) is a reactive protocol, it sets path only when demanded by the network. CGSR protocol forms a group of nodes into clusters and selects a node as cluster-head based on some clustering algorithms for each cluster. In this paper, we have proposed a protocol, which combines the advantages of both CGSR and AODV to minimize traffic congestion in an ad-hoc wireless network. The performance metrics such as routing overhead, end-end delay, packet delivery ratio, throughput, and average energy consumption are enhanced and compared with other clustering protocols such as CGSR and LEACH protocols. The comparison result reveals that the routing overhead, end-end delay, and the average energy consumption is reduced and packet delivery ratio, throughput is improved.


Sign in / Sign up

Export Citation Format

Share Document