Do you want to publish a course? Click here

Many wireless sensor network applications like forest fire detection and environment monitoring recommend making benefit from moving humans, vehicles, or animals to enhance network performance. In this research, we had improved our previous protocol (Dynamic Tree Routing DTR) to support mobility in a wireless sensor network. First, we had mathematically approximated the speed threshold for mobile sensors, which enables them to successfully associate with nearby coordinators. Second, we test our (MDTR) protocol in a network with mobile sensors sending packets toward the network's main coordinator. The simulation results obtained from network Simulator (NS2) showed a good approximation of speed threshold, and good performance of MDTR in term of delay, throughput, and hop-count compared with AODV and MZBR Protocols.
The location of wireless sensor nodes located in the center is necessary for applications where information about the site is important information such as security, protection, object tracking and other applications. localization algorithms are c lassified into two types: Range-based and Range-free. The study focused on Range-free localization algorithms because they are less expensive in terms of hardware requirements. The MATLAB was used to simulate the algorithms, whose performance was evaluated by changing the number of network nodes, the number of Anchor nodes, and the contract area of communication in order to illustrate performance differences in terms of localization error. The results showed the superiority of the amorphous algorithm, achieving high localization accuracy and lower cost for the number of Anchor nodes needed to achieve a small error.
Mobile Wireless Sensor Network (MWSN) is an emerging technology for attraction of researchers with its research advantage and various application domains. Due to limited resources of sensor nodes such as transmission power, communication capability and size of memory, data aggregation algorithms are the most practical technique that reduces large amount of transmission in this network. Security is an important criterion to be considered because, wireless sensor nodes are deployed in a remote or hostile environment area that is prone to attacks easily. Therefore, security are essential issue for MWSN to protect information against attacks. In this research, we offered an algorithm of secure data aggregation in MWSN based on pair-wise keys technology and hash function. We studied important parameters such as execution time, end-to-end delay and number of storied keys. Results showed that
Many wireless sensor network applications like forest fire detection and environment monitoring recommend making benefit from moving humans, vehicles, or animals to enhance network performance. In this research, we had improved our previous protoco l (Dynamic Tree Routing DTR) in order to support mobility in a wireless sensor network. First, we had mathematically approximated the speed threshold for mobile sensors, which enables them to successfully associate with nearby coordinators. Second, we test our (MDTR) protocol in a network with mobile sensors sending packets toward network's main coordinator. The simulation results obtained from network Simulator (NS2) showed a good approximation of speed threshold, and good performance of MDTR in term of delay, throughput, and hop-count compared with AODV and MZBR Protocols.
In this PAPER, we perform a study and extensive comparative between the well-known link quality estimators and CTP, a tree-based routing protocol provided by TinyOS for different network topology and simulate it using TOSSIM simulator to evaluate the performance of these estimators.
Mobile wireless sensor network (MWSN) is a wireless ad hoc network that consists of avery large number of tiny sensor nodes communicating with each other in which sensornodes are either equipped with motors for active mobility or attached to mobile objectsfor passive mobility. A real-time routing protocol for MWSN is an exciting area of research because messages in the network are delivered according to their end-to-end deadlines (packet lifetime) while sensor nodes are mobile. This paper proposes an enhanced realtime with load distribution (ERTLD) routing protocol for MWSN which is based on our previousrouting protocol RTLD. ERTLD utilized corona mechanism and optimal forwardingmetrics to forward the data packet in MWSN. It computes the optimal forwarding nodebased on RSSI, remaining battery level of sensor nodes and packet delayover one-hop. ERTLDensures high packet delivery ratio and experiences minimum end-to-end delay in WSNand MWSN compared to baseline routing protocol. . In this paper we consider a highly dynamic wireless sensor network system in which the sensor nodes and the base station(sink) are mobile.ERTLD has been studied and verified and compared with baseline routing protocols RTLD,MM-SPEED , RTLCthrough Network Simulator- 2(NS2)
Routing protocols play an essential role in meeting the quality of service requirements in the network, but achieving these requirements may require frequent send and receive operations to build and maintain routing tables, which consume sensors r esource If we take into consideration the limitations of wireless sensor networks in terms of the amount of available energy and storage capacity. In this research a performance comparison of the on-demand Distance Vector Routing protocol AODV and Hierarchical Routing protocolHR was carried out in terms of the packet delivery and loose rate, delay and jitter, and the amount of expended energy in the Wireless sensor network operates according to IEEE802.15.4 standard in cases where some of sensors get out of work for limited periods of time. The results showed that the hierarchical routing protocols perform better in terms of delay time and transfer rate and the amount of consumed energy than on-demand Distance Vector Routing protocol routing protocol, but suffer larger packet loss due to routing path corruption as a result of sensors crashes.
The purpose of this study is to offer help to patients through the employment of databases applications of existing and available telecommunication systems in medical services ,particularly treatment. So that it can be possible to avoided what can be avoided of health disasters that a human being encounter without warning. This study examines how modern technologies can be employed in controlling and processing some vital signs of human beings,particulary those who suffer some health problems affiliated with some diseases ,and keeping these problems under control in order to maintain the stability of the patients health statues. The vital signs that the study is applied to are blood pressure, pulse and blood glucose, since any of change in the value of any of these signs, positive or negative, may cause the patient to have a sudden health problems.
Wireless Sensor Networks (WSNs) are deployed in adversarial environments and used for critical applications such as battle field surveillance and medical monitoring, then security weaknesses become a big concern. The severe resource constraints of WSNs give rise to the need for resource bound security solutions. The Implicit Geographic Forwarding Protocol (IGF) is considered stateless, which means that it does not contain any routing tables and does not depend on the knowledge of the network topology, or on the presence or absence of the node in WSN. This protocol is developed to provide a range of mechanisms that increase security in IGF. Thus it keeps the dynamic connectivity features and provides effective defenses against potential attacks. These mechanisms supported the security against several attacks as Black hole, Sybil and Retransmission attacks, but the problem was the inability of mechanisms to deal with physical attack. This research deals with a detailed study of the SIGF-2 protocol and proposes an improvement for it, in which we use the concept of deployment knowledge from random key pool algorithm of keys management to defend against physical attack . The evaluation of simulation results, with different parameters, proved that our proposal had improved the studied protocol.
A lot of research directed its concern to the reliability of Wireless Sensor Networks (WSNs) used in various applications, especially in early detection of forest fires to ensure the reliability of warning alarms sent by sensors and reduce the aver age of false warnings. In this research we have tried to evaluate the reliability of WSN used in early detection of fires in Fir and cedar preserve, mainly. By designing hybrid WSN network, similar to the terrains of the preserve and modeling it using program Opnet14.5. We have studied several scenarios, to allow increasing malfunction of the network resulting from fire break out and spreading: starting in allowance of 0% and comparing its results the results of mathematical equations of reliability according to the same scenarios. In addition, we have calculated the final availability through suggesting a mechanism to improve WSN reliability using the redundancy, i.e add sensitive spare nodes, which replace the damaged ones as the result of fire. The results have proved the remarkable increasing of reliability. Also, it has been predicted of the reliability of the network designed according to reliability of different values of the nodes used by using one of the reliability devices "the Block Diagram".
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا