scholarly journals A Web-Based Application of TELOSB Sensor Network

2011 ◽  
Vol 7 (2) ◽  
pp. 147-163 ◽  
Author(s):  
Tarek R. Sheltami ◽  
Elhadi M. Shakshuki ◽  
Hussein T. Mouftah

Sensor network can be used in a numerous number of applications. However, implementing wireless sensor networks present new challenges compared with theoretical networks. In addition, implementing a sensor network might provide results different from that derived theoretically. Some routing protocols when implemented might fail to perform. In this paper, we implement three routing protocols, namely: Dynamic MANET on-demand, Collection Tree and Dissemination protocols. To compare the performance of these protocols, they are implemented using a Telosb sensor network. Several performance metrics are carried out to demonstrate the pros and cons of these protocols. A telemedicine application is tested in top of the implemented Telosb sensor network at King Fahd University of Petroleum and Minerals Clinic in Saudi Arabia, utilizing Alive ECG sensors.

2018 ◽  
Vol 7 (2.26) ◽  
pp. 25
Author(s):  
E Ramya ◽  
R Gobinath

Data mining plays an important role in analysis of data in modern sensor networks. A sensor network is greatly constrained by the various challenges facing a modern Wireless Sensor Network. This survey paper focuses on basic idea about the algorithms and measurements taken by the Researchers in the area of Wireless Sensor Network with Health Care. This survey also catego-ries various constraints in Wireless Body Area Sensor Networks data and finds the best suitable techniques for analysing the Sensor Data. Due to resource constraints and dynamic topology, the quality of service is facing a challenging issue in Wireless Sensor Networks. In this paper, we review the quality of service parameters with respect to protocols, algorithms and Simulations. 


2020 ◽  
Vol 17 (6) ◽  
pp. 2562-2574
Author(s):  
Shilpy Ghai ◽  
Vijay Kumar ◽  
Rohit Vaid

Congestion control over resource constrained sensor network is a critical challenge and it is also quite hard to fulfill the QoS constraints for end users. In this paper, a dynamic queue synchronization (DQS) scheme is introduced that can alter the data rate dynamically as per the current buffer length. Its performance is compared with existing schemes i.e., Dynamic Round Robin (DRR) and Random Early Discard (RED) using different routing protocols i.e., LEACH/PEGASIS/TEEN under various constraints (Throughput/End-to-End Delay/Routing Load/Energy).


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.


Author(s):  
Sabri Yassine ◽  
Najib El Kamoun

Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effective and unsupervised solution for collecting this information from the physical world and sending this information back to centralized authority for further processing. GRPW (Geographic Routing in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks. GRPW, a geographical routing protocol for wireless sensor networks, is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. The wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems. Here, a trust model to handle this attack in GRPW is provided called GRPW-MuS-s. Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node, which is suitable for the sensor network.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Guangjie Han ◽  
Xu Jiang ◽  
Aihua Qian ◽  
Joel J. P. C. Rodrigues ◽  
Long Cheng

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.


2013 ◽  
Vol 446-447 ◽  
pp. 1606-1611
Author(s):  
Xia Chen ◽  
Jian Ping Luo ◽  
Ye Liu ◽  
Cheng Zhi Long

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.


2016 ◽  
Vol 850 ◽  
pp. 43-51
Author(s):  
Sherif Moussa ◽  
Ghada Abdel Halim ◽  
Salah Ramadan

Routing the sensed data is considered a main challenge in Wireless Sensor Networks (WSN) because the routing characteristics may vary depending on the network application and/or the network architecture. Since most sensor network applications work in clusters, hierarchical routing protocols have been developed to fit this network topology. This paper introduces the performance differentials for most common hierarchical routing protocols such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Threshold sensitive Energy Efficient sensor Network protocol (TEEN). The design parameters of sensor networks are analyzed to present a classification and comparison of LEACH, TEEN routing protocols. The two protocols are analyzed using different mobility models using NS2 simulation tool. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks.


Sign in / Sign up

Export Citation Format

Share Document