scholarly journals An Efficiency of Timing to Route Discovery in Mobile Sink by using WSN

2019 ◽  
Vol 8 (12) ◽  
pp. 4559-4564
Keyword(s):  
Wireless Sensor Network ◽  
Time Delay ◽  
Energy Dissipation ◽  
Sensor Network ◽  
Large Scale ◽  
Hot Spot ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delay Bound

Due to the prospective implementation in many fields, study functionality in the wireless sensor network has risen very impressively in recent years. Wireless large-scale sensor networks contain various sources and various sink numbers. This plays a significant part in application performance. To this end, we will concentrate on the primary issue of sink arrangement in this study to minimize time delay in the worst scenario as well as to increase the lifespan of the wireless sensor network. Here we suggest an interconnected anatomy frame for calculating the mobility of the junction sink, routing details. We're talking about the causes of sub problems and bringing them efficient results. Then we combine all these outcomes and suggest the real issue with the optimum polynomial-time algorithm. From this consequence, the merits of involving nodes (mobile sink) and network argument or parametric quantity impact will be displayed. (Example: various sensors, sinks and time delay bound) the lifespan of the network. As we understand, Wireless sensor network nodes are battery-dependent equipment that collects information from the surroundings and send this (information) information to the sink node for further computational processing leading to energy dissipation in batteries The batteries are non-rechargeable or in certain settings it may be hard to replace or recharge. These problems result in the design of a new algorithm for node energy efficiency In typical conditions, the sensor nodes display many to one communication with the sink, resulting in a faster energy depletion of the nodes near the sink, commonly referred to as the energy deficiency hole problem or the hot spot problem. hence in this situation, the mobility of the sink can help in balancing of energy dissipation of the sensor nodes In wireless sensor network when information data hold up by working sink it should be Bounded. Our results show that the proposed algorithm can work better than previous methods and yield results in remote locations such as in the wide region of the wireless sensor network, lake, mountains, hill stations, etc. Additional guideline antennas can boost the transfer chain, which increases to lower hops and low routing delays. Finally, numerical studies analyze the suggested work and simulations are performed to validate through MATLAB.

scholarly journals Novel Learning Algorithms for Efficient Mobile Sink Data Collection Using Reinforcement Learning in Wireless Sensor Network

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Santosh Soni ◽  
Manish Shrivastava
Keyword(s):  
Reinforcement Learning ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Research Study ◽  
Hot Spot ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Hot Spot Problem

Generally, wireless sensor network is a group of sensor nodes which is used to continuously monitor and record the various physical, environmental, and critical real time application data. Data traffic received by sink in WSN decreases the energy of nearby sensor nodes as compared to other sensor nodes. This problem is known as hot spot problem in wireless sensor network. In this research study, two novel algorithms are proposed based upon reinforcement learning to solve hot spot problem in wireless sensor network. The first proposed algorithm RLBCA, created cluster heads to reduce the energy consumption and save about 40% of battery power. In the second proposed algorithm ODMST, mobile sink is used to collect the data from cluster heads as per the demand/request generated from cluster heads. Here mobile sink is used to keep record of incoming request from cluster heads in a routing table and visits accordingly. These algorithms did not create the extra overhead on mobile sink and save the energy as well. Finally, the proposed algorithms are compared with existing algorithms like CLIQUE, TTDD, DBRkM, EPMS, RLLO, and RL-CRC to better prove this research study.

scholarly journals A Distributed Collision-Free Data Aggregation Scheme for wireless sensor network

2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879584 ◽  
Author(s):  
Danyang Qin ◽  
Yan Zhang ◽  
Jingya Ma ◽  
Ping Ji ◽  
Pan Feng
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Data Aggregation ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Delay ◽  
Free Data ◽  
Aggregation Scheme ◽  
Aggregation Technology

Due to the advantages of large-scale, data-centric and wide application, wireless sensor networks have been widely used in nowadays society. From the physical layer to the application layer, the multiply increasing information makes the data aggregation technology particularly important for wireless sensor network. Data aggregation technology can extract useful information from the network and reduce the network load, but will increase the network delay. The non-exchangeable feature of the battery of sensor nodes makes the researches on the battery power saving and lifetime extension be carried out extensively. Aiming at the delay problem caused by sleeping mechanism used for energy saving, a Distributed Collision-Free Data Aggregation Scheme is proposed in this article to make the network aggregate data without conflicts during the working states periodically changing so as to save the limited energy and reduce the network delay at the same time. Simulation results verify the better aggregating performance of Distributed Collision-Free Data Aggregation Scheme than other traditional data aggregation mechanisms.

scholarly journals Disjoint Spanning Tree Based Reliability Evaluation of Wireless Sensor Network

Sensors ◽  
2020 ◽  
Vol 20 (11) ◽  
pp. 3071
Author(s):  
Sonam Lata ◽  
Shabana Mehfuz ◽  
Shabana Urooj ◽  
Asmaa Ali ◽  
Nidal Nasser
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Spanning Tree ◽  
Large Scale ◽  
Spanning Trees ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Stable Operation ◽  
Communication Reliability

Wireless sensor networks (WSNs) are becoming very common in numerous manufacturing industries; especially where it is difficult to connect a sensor to a sink. This is an evolving issue for researchers attempting to contribute to the proliferation of WSNs. Monitoring a WSN depends on the type of collective data the sensor nodes have acquired. It is necessary to quantify the performance of these networks with the help of network reliability measures to ensure the stable operation of WSNs. Reliability plays a key role in the efficacy of any large-scale application of WSNs. The communication reliability in a wireless sensor network is an influential parameter for enhancing network performance for secure, desirable, and successful communication. The reliability of WSNs must incorporate the design variables, coverage, lifetime, and connectivity into consideration; however, connectivity is the most important factor, especially in a harsh environment on a large scale. The proposed algorithm is a one-step approach, which starts with the recognition of a specific spanning tree only. It utilizes all other disjoint spanning trees, which are generated directly in a simple manner and consume less computation time and memory. A binary decision illustration is presented for the enumeration of K-coverage communication reliability. In this paper, the issue of computing minimum spanning trees was addressed and it is a pertinent method for further evaluating reliability for WSNs. This paper inspects the reliability of WSNs and proposes a method for evaluating the flow-oriented reliability of WSNs. Further, a modified approach for the sum-of-disjoint products to determine the reliability of WSN from the enumerated minimal spanning trees is proposed. The proposed algorithm when implemented for different sizes of WSNs demonstrates its applicability to WSNs of various scales. The proposed methodology is less complex and more efficient in terms of reliability.

scholarly journals Analyzing Multimode Wireless Sensor Networks Using the Network Calculus

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Xi Jin ◽  
Nan Guan ◽  
Jintao Wang ◽  
Peng Zeng
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Large Scale ◽  
Wireless Sensor ◽  
Network Calculus ◽  
Original Network ◽  
Delay Bound ◽  
Maximum Delay

The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

scholarly journals A REVIEW ON A HYBRID APPROACH USING MOBILE SINK AND FUZZY LOGIC FOR REGION BASED CLUSTERING IN WSN

2017 ◽  
Vol 16 (2) ◽  
pp. 7586-7590
Author(s):  
Amneet Kaur ◽  
Harpreet Kaur
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Hybrid Approach ◽  
Mobile Sink ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wide Range ◽  
Energy Constrained

A Wireless Sensor Network or WSN is supposed to be made up of a large number of sensors and at least one base station. The sensors are autonomous small devices with several constraints like the battery power, computation capacity, communication range and memory. They also are supplied with transceivers to gather information from its environment and pass it on up to a certain base station, where the measured parameters can be stored and available for the end user. In most cases, the sensors forming these networks are deployed randomly and left unattended to and are expected to perform their mission properly and efficiently. As a result of this random deployment, the WSN has usually varying degrees of node density along its area. Sensor networks are also energy constrained since the individual sensors, which the network is formed with, are extremely energy-constrained as well. Wireless sensor networks have become increasingly popular due to their wide range of application. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. Minimizing the energy consumption of a wireless sensor network application is crucial for effective realization of the intended application in terms of cost, lifetime, and functionality. However, the minimizing task is hardly possible as no overall energy cost function is available for optimization.

scholarly journals DATA TRAFFIC TRUST MODEL FOR CLUSTERED WIRELESS SENSOR NETWORK

2021 ◽  
Vol 9 (1) ◽  
pp. 1225-1229
Author(s):  
Dr. Senthilkumar A, Dr. Lekashri S, Abhay Chaturvedi, Dr. R. Manikandan
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Trust Management ◽  
Large Scale ◽  
Sampling Rate ◽  
Trust Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Data Packets

Trust is an essential parameter among sensor nodes to provide secured and successful communication. Many trust management schemes have been proposed earlier for large scale Wireless Sensor Network (WSN) however not cooperates well in terms of low dependability, memory overheads, large communication etc, therefore a system called Data Traffic Trust Scheme (DTTS) for clustered WSN is proposed here. Here the trust nodes are identified through the data traffic sampling rate. The trust rate is identified through the number of sent and receive data packets and the malicious packets are diagnosed through the un-matching packet rate. The simulation results are evaluated to show the efficiency for the proposed scheme.

scholarly journals Investigation of Parameter Effects on Virtual-Spring-Force Algorithm for Wireless-Sensor-Network Applications

Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3082
Author(s):  
Zhiyong Yu ◽  
Rongxin Tang ◽  
Kai Yuan ◽  
Hai Lin ◽  
Xin Qian ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Central Force ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Area ◽  
Node Deployment ◽  
Spring Force

Virtual-force algorithms (VFAs) have been widely studied for accurate node deployment in wireless-sensor-network (WSN) applications. Their main purpose is to achieve the maximum coverage area with the minimum number of sensor nodes in the target area. Recently, we reported a new VFA based on virtual spring force (VFA-SF) and discussed in detail the corresponding efficiency via statistical analysis. The optimized strategy by adding an external central force (VFA-SF-OPT) was presented, which effectively eliminates the coverage hole or twisted structure in the final network distribution. In this paper, the parameter effects on VFA-SF and the VFA-SF-OPT were further investigated: (1) Node velocity dramatically affects the convergence rate of the node-deployment process. (2) A suitable external central force improves equilibrium distance and reduces energy consumption. (3) The effects of VFA-SF and VFA-SF-OPT for different types of obstacles are discussed. Generally, by choosing suitable parameters, both VFA-SF and VFA-SF-OPT can effectively improve node deployment and energy consumption for the whole sensor network. The results give important insight in parameter selection and information fusion in the application of a large-scale WSN.

scholarly journals Enhancing the Performance of Wireless Sensor Networks thorugh Clustering and Joint Routing with Mobile Sink

2019 ◽  
Vol 8 (6) ◽  
pp. 323-327
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Optimal Solution ◽  
Life Time ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Traffic Characteristics ◽  
Routing Methods

In wireless sensor network, randomly deployed nodes are formed as a clusters of varying size for each area depending upon the numbers of users. This paper deals with the cluster based joint routing with mobile sink and with static sink in cognitive based wireless sensor network. The Joint Routing (JR) is designed to overcome the problems, due to data gatherings of the sensor nodes for any application. Channel resources usually may vary among the different routing methods based on the traffic characteristics and application they require, which poses a great challenge to guarantee time delivery services. These problems poses a great challenge for cognitive radio based WSN. The resource allocation technique overcomes the problems like spatial priority, time delay, transmission delay and energy loss and here the channel resources are allocated with the help of TDMA technique. The static sink in networks consumes more energy which results the early die out of the nodes. Hence throughput of the networks declines which badly affect the network life time. To overcome these issues, static sink is replaced by mobile sink, which consumes less energy, before each transmission in a sensor networks. The networks with mobile sink provide us optimal solution and performance as well, while comparing with network with static sink. It is shown that the proposed system achieves 15% of improved throughput, 20% of less packet loss and 35% of less delay when compare with the system having centralized sink.

An Energy Efficient Routing Scheme for Mobile Wireless Sensor Network with Mobile Sink

2017 ◽  
Vol 7 (8) ◽  
pp. 100
Author(s):  
Ravneet Pal Kaur ◽  
Maninder Singh
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Mobile Wireless ◽  
Mobile Wireless Sensor Network ◽  
Mobile Wireless Sensor

In wireless sensor network, the sensor nodes find the route towards the sink to transmit the sensory information such as temperature, pressure etc of a particular area. The sensor nodes transmit the data directly to sink or it relays the data through neighbor nodes using single or multi-hop links. Each time when nodes send their data to static sink, the data is passed through the nearer nodes of sink to it. As soon as the nodes near to the sink become dead, the entire network will be useless as there will be no communication to the sink node. So, to conserve the energy we use mobile sink approach. Thus with the inclusion of mobile sink in WSN, new paradigm called mobile wireless sensor network came into existence. In this paper, to conserve energy and to perform energy efficient routing, we have proposed chain-based energy efficient routing scheme for mobile wireless sensor network (CB-EERM)which is using mobile sink and media access approach where sink moves from one position to another position in sensor field and sojourn at a particular location to collect the whole aggregated data from the various  leader(aggregator)nodes in chain using media access approach. The proposed mobile scheme CB-EERM is validated through simulation and compared with traditional static approach using metrics such as energy consumption, throughput, delay and packet delivery ratio where proposed approach outperforms the existing scheme.

Sign in / Sign up

Export Citation Format

Share Document