scholarly journals Performance analysis of wireless sensor networks assisted by on-demand-based cloud infrastructure

2020 ◽  
Author(s):  
Umamaheswari S

The wireless sensor networks composed of tiny sensor with the capability of mon- itoring the tangible changes for a wide range of applications are limited with the capabilities on processing and storage. Their limited capabilities make them seek the help of the cloud that provides the rented service of processing and storage. The dense deployment of the wireless sensor and their vulnerability to the unknown attacks, alterations make them incur difficulties in the process of the conveyance causing the modifications or the loss of the content. So, the paper proposes an optimized localization of the nodes along with the identification of the trusted nodes and minimum distance path to the cloud, allowing the target to have anytime and anywhere access of the content. The performance of the cloud infrastructure-supported wireless sensor network is analyzed using the network simulator 2 on the terms of the forwarding latency, packet loss rate, route failure, storage, reliability, and the network longevity to ensure the capacities of the cloud infrastructure-supported wireless sensor networks.

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.


Author(s):  
Neetika Jain ◽  
Sangeeta Mittal

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.


Energies ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2417
Author(s):  
Andrzej Michalski ◽  
Zbigniew Watral

This article presents the problems of powering wireless sensor networks operating in the structures of the Internet of Things (IoT). This issue was discussed on the example of a universal end node in IoT technology containing RFID (Radio Frequency Identification) tags. The basic methods of signal transmission in these types of networks are discussed and their impact on the basic requirements such as range, transmission speed, low energy consumption, and the maximum number of devices that can simultaneously operate in the network. The issue of low power consumption of devices used in IoT solutions is one of the main research objects. The analysis of possible communication protocols has shown that there is a possibility of effective optimization in this area. The wide range of power sources available on the market, used in nodes of wireless sensor networks, was compared. The alternative possibilities of powering the network nodes from Energy Harvesting (EH) generators are presented.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Asmaa Ez-Zaidi ◽  
Said Rakrak

Wireless sensor networks have been the subject of intense research in recent years. Sensor nodes are used in wide range of applications such as security, military, and environmental monitoring. One of the most interesting applications in wireless sensor networks is target tracking, which mainly consists in detecting and monitoring the motion of mobile targets. In this paper, we present a comprehensive survey of target tracking approaches. We then analyze them according to several metrics. We also discuss some of the challenges that influence the performance of tracking schemes. In the end, we conduct detailed analysis and comparison between these algorithms and we conclude with some future directions.


2010 ◽  
Vol 159 ◽  
pp. 29-34
Author(s):  
Shu Ming Xiong ◽  
Xiao Qian Qu ◽  
Yong Zhao Zhan ◽  
Xin Sheng Wang ◽  
Liang Min Wang

Due to the node failures incurred by intrusion threat, a wireless sensor networks will initiate topology re-generation, which is based on correct availability evaluation of current intrusion-tolerant topology. The paper proposes an availability evaluation model based on semi-Markov process (SMP) to estimate topology availability of the intrusion-tolerant topology concerning the effects from intrusion behaviors. In view of some limitations of node computation ability and storage ability, this model reduces the complexities resulting from modeling the different intrusion threats and is set up on the uniform intruding results to simplify the model design. Using the DTMC model embedded in SMP topology availability is computed and finally we analyze the sensitivity to parameters in the model.


Author(s):  
Pradeep Kumar Ts ◽  
Sayali Chitnis

The world of internet of things (IoT) and automation has been catching a robust pace to impact wide range of commercial and domestic applications for some time now. The IoT holds ad-hoc or wireless sensor networks (WSNs) at its very primary implementation level, the hardware level. The increasing requirement of these networks demands a renewed and better design of the network that improves the already existing setbacks of WSNs, which is mainly the power consumption and optimization. Routing highly affects the power consumed in the nodes in WSNs, hence having a modified routing algorithm which is specific to the application and meets its needs, particularly it is a good approach instead of having a generalized existent routing approach. Currently, for WSN having adequate number of nodes, routing involves maximum number of nodes and hops so as to reduce power consumption. However, for restricted areas and limited nodes, this scenario concludes with using up more number of nodes simultaneously resulting in reducing several batteries simultaneously. A routing algorithm is proposed in this paper for such applications that have a bounded region with limited resources. The work proposed in this paper is motivated from the routing algorithm positional attribute based next-hop determination approach (PANDA-TP) which proposes the increase in number of hops to reduce the requirement of transmission power. The aim of the proposed work is to compute the distance between the sending and receiving node and to measure the transmission power that would be required for a direct(path with minimum possible hops) and a multi-hop path. If the node is within the thresh-hold distance of the source, the packet is undoubtedly transferred directly; if the node is out of the thresh-hold distance, then the extra distance is calculated. Based on this, the power boosting factor for the source node, and if necessary, then the extra number of nodes that would be required to transmit is determined. An extra decision-making step is added to this approach which makes it convenient to utilize in varied situations. This routing approach suits the current level of robustness that the WSNs demand. 


2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875563 ◽  
Author(s):  
Gulshan Kumar ◽  
Mritunjay Kumar Rai ◽  
Rahul Saha ◽  
Hye-jin Kim

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.


Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R

<p>Wireless sensor networks are usually left unattended and serve hostile environment, therefore can easily be compromised. With compromised nodes an attacker can conduct several inside and outside attacks. Node replication attack is one of them which can cause severe damage to wireless sensor network if left undetected. This paper presents fuzzy based simulation framework for detection and revocation of compromised nodes in wireless sensor network. Our proposed scheme uses PDR statistics and neighbor reports to determine the probability of a cluster being compromised. Nodes in compromised cluster are then revoked and software attestation is performed.Simulation is carried out on MATLAB 2010a and performance of proposed scheme is compared with conventional algorithms on the basis of communication and storage overhead. Simulation results show that proposed scheme require less communication and storage overhead than conventional algorithms.</p>


Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R

<p>Wireless sensor networks are usually left unattended and serve hostile environment, therefore can easily be compromised. With compromised nodes an attacker can conduct several inside and outside attacks. Node replication attack is one of them which can cause severe damage to wireless sensor network if left undetected. This paper presents fuzzy based simulation framework for detection and revocation of compromised nodes in wireless sensor network. Our proposed scheme uses PDR statistics and neighbor reports to determine the probability of a cluster being compromised. Nodes in compromised cluster are then revoked and software attestation is performed.Simulation is carried out on MATLAB 2010a and performance of proposed scheme is compared with conventional algorithms on the basis of communication and storage overhead. Simulation results show that proposed scheme require less communication and storage overhead than conventional algorithms.</p>


Sign in / Sign up

Export Citation Format

Share Document