scholarly journals A Dynamically Reconfigurable Wireless Sensor Network Testbed for Multiple Routing Protocols

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Wenxian Jiang ◽  
Chenzhe Gu ◽  
Jingjing Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Routing Protocols ◽  
Data Transmission ◽  
Wireless Sensor ◽  
Dynamically Reconfigurable ◽  
Flow Table ◽  
And Performance ◽  
Protocol Switching ◽  
Future Work

Because wireless sensor networks (WSNs) are complex and difficult to deploy and manage, appropriate structures are required to make these networks more flexible. In this paper, a reconfigurable testbed is presented, which supports dynamic protocol switching by creating a novel architecture and experiments with several different protocols. The separation of the control and data planes in this testbed means that routing configuration and data transmission are independent. A programmable flow table provides the testbed with the ability to switch protocols dynamically. We experiment on various aspects of the testbed to analyze its functionality and performance. The results demonstrate that sensors in the testbed are easy to manage and can support multiple protocols. We then raise some important issues that should be investigated in future work concerning the testbed.

Multipath Ring Routing in Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 701-705 ◽  
Author(s):  
Gui Min Huang ◽  
Wu Jin Tao ◽  
Ping Shan Liu ◽  
Si Yun Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Routing Protocols ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Delivery ◽  
The Past ◽  
Transmission Reliability

In the past years, the routing problems of wireless sensor network (WSN) have attracted great interest, and many routing protocols for WSN have being proposed. However, these routing protocols pay little attention to the transmission reliability. Therefore, this paper proposes a new multipath ring routing algorithm for WSNs. The proposed algorithm utilizes ring level to separate sensor nodes into several sections, which can improve the reliability of the data transmission. Using the multipath ring routing data delivery improves as an average of 27.58% to leach routing and 113.06% to directing routing.

Implementation of Fuzzy Based Simulation for Clone Detection in Wireless Sensor Networks

2016 ◽  
Vol 6 (4) ◽  
pp. 1570
Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Clone Detection ◽  
Storage Overhead ◽  
And Performance ◽  
And Storage ◽  
Compromised Nodes

<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>

Implementation of Fuzzy Based Simulation for Clone Detection in Wireless Sensor Networks

2016 ◽  
Vol 6 (4) ◽  
pp. 1570
Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Clone Detection ◽  
Storage Overhead ◽  
And Performance ◽  
And Storage ◽  
Compromised Nodes

<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>

Clustering in Wireless Sensor Networks: Performance Comparison of EAMMH and LEACH Protocols Using MATLAB

2013 ◽  
Vol 705 ◽  
pp. 337-342 ◽  
Author(s):  
Monica R. Mundada ◽  
Nishanth Thimmegowda ◽  
T. Bhuvaneswari ◽  
V. Cyrilraj
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Network Lifetime ◽  
Routing Protocols ◽  
Sensor Node ◽  
Clustering Algorithms ◽  
Performance Comparison ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Important Design

Conservation of the energy available in each sensor node and increasing network lifetime are most important design issues for a wireless sensor network (WSN). Many routing algorithms have been developed in this regard. Out of all these, clustering algorithms have gained a lot of importance in increasing the network lifetime thereby the efficiency of the nodes in it. Clustering provides an effective way for prolonging the lifetime of WSN. This paper elaborately compares the two renowned routing protocols namely, LEACH and EAMMH supported by simulations scenarios, and analysis of the results against known metrics with energy and network lifetime being major among them.

scholarly journals Hierarchical Energy Efficient Routing in Wireless Sensor Networks and its Challenges

2019 ◽  
Vol 9 (1) ◽  
pp. 4024-4027
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Route Of Transmission

Wireless sensor network consists of various sensor nodes connected through wireless media. Sensor nodes are tiny devices having lesser energy capabilities. Sensor nodes are either ad-hoc or mobile in their environment. Wireless sensor network route of transmission media is discovered by routing protocols and responsible for secure communication between sensor nodes. Energy is a precious resource of sensor nodes, and the entire lifetime of WSNs is depending on the energy capability of the sensor nodes. The fundamental problem is how to organize topology of WSN for deployed sensor nodes with lesser power consumption as possible. Major problems in wireless sensor networks which consume extra energy are interference, control message overhead, packet delay, unnecessary transmission, and bandwidth utilization. Therefore, energy efficient techniques are needed to overcome these problems. Hierarchical routing is the best routing method for finding optimal path between sensor nodes which enhance the lifetime of the network. This paper focuses towards various hierarchical energy efficient routing in wireless sensor networks and analyzes various features of WSN that should consider during designing of routing protocols.

scholarly journals A Comparative Study of Routing Protocols of Heterogeneous Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Guangjie Han ◽  
Xu Jiang ◽  
Aihua Qian ◽  
Joel J. P. C. Rodrigues ◽  
Long Cheng
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Comparative Study ◽  
Sensor Network ◽  
Routing Protocols ◽  
Wireless Sensor ◽  
Stable Period ◽  
Heterogeneous Wireless Sensor Networks ◽  
Heterogeneous Wireless Sensor Network

Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently—EDFCM, MCR, and EEPCA—together with two previous classical routing protocols—LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols.

The Routing Protocols for Wireless Sensor Networks

2013 ◽  
Vol 446-447 ◽  
pp. 1606-1611
Author(s):  
Xia Chen ◽  
Jian Ping Luo ◽  
Ye Liu ◽  
Cheng Zhi Long
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Wireless Sensor

Wireless Sensor Network (WSN) is a network which connect the human and the nature. The lifetime is an important standard which measures the network is good or not. The routing can influence on the lifetime of the network. This paper mainly introduces some routing protocols in WSN and describes their advantages and shortcomings.

Optimization of energy-efficient dynamic task assignment for wireless sensor networks based on particle swarm algorithm

2021 ◽  
pp. 1-11
Author(s):  
Shu Zhang ◽  
Jianhua Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Path Planning ◽  
Data Transmission ◽  
Energy Efficient ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Task

This paper provides an in-depth analysis of the optimization of energy-efficient dynamic task allocation in wireless sensor networks through an improved particle swarm optimization algorithm, and introduces the idea of software-defined networking into wireless sensor network to propose a software-defined wireless sensor network non-uniform cluster routing protocol. The protocol decouples the data layer from the control layer, and the base station performs the cluster head election, network clustering, and routing control operations. The base station optimizes the cluster head election process by electing cluster head nodes using an improved particle cluster algorithm. Based on the elected cluster head nodes, the base station calculates their corresponding contention radius and plans the data transmission path. The results of the calculation are sent to the corresponding nodes for cluster creation and data transmission. The simulation results fully show that the use of this protocol can achieve the purpose of significantly extending the service life of the network. This paper comprehensively analyses the whole process of mobile charging of UAVs under improved conditions and proposes a path planning algorithm. The multi-level weighted charging path planning proposed in this paper considers both fairness and timeliness. Finally, the paper verifies the effectiveness of the algorithm.

scholarly journals Fast Simple Flooding Strategy in Wireless Sensor Networks

2019 ◽  
Vol 54 (6) ◽  
Author(s):  
Maha Salih Abdulridha ◽  
Ghaihab Hassan Adday ◽  
Imad S. Alshawi
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocols ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Additional Equipment ◽  
New Strategy ◽  
Design Factors

The wide deployment of wireless sensor networks is the primary reason behind the advancement of numerous routing protocols. In this context, sensors need to be remotely conveyed in unattended situations. Further, propels in wireless sensor network innovation have ensured accessibility and minimal effort in terms of sensor hubs with a capacity to sense various physical and natural environment conditions, in addition to wireless communication and data processing. Moreover, wireless sensor networks are rather different from regular and cellular networks, which comprise nodes with restricted bandwidth and energy. However, the most important limitation of wireless sensor networks is their characteristic limited energy resources. Furthermore, there is an imbalance of power consumption in their sensor nodes. Therefore, it is preferable to distribute the amount of energy throughout a wireless sensor network to minimize the maintenance and maximize the overall system performance. To this end, this paper suggests a new strategy in wireless sensor network dissemination and routing protocols referred to as the Fast Simple Flooding Strategy, which focuses on energy efficiency as a crucial design objective for routing protocols used in wireless sensor networks, without the overhead of other design factors, and reduces end-to-end latency. Additionally, this new strategy can be listed under flat approaches; it is simple and very fast in delivering the packet to the sink and does not require additional equipment or complex mathematical operations. It also resolves the major drawbacks of classic flooding and gossiping.

Sign in / Sign up

Export Citation Format

Share Document