Do you want to publish a course? Click here

Performance Evaluation Of Link Quality Estimators In Wireless Sensor Networks Based On Collection Tree Routing Protocol

تقييم أداء مقاييس جودة الوصلات في شبكات الحساسات اللاسلكية التي تعتمد على بروتكول التوجيه الشجري

1098   0   142   0 ( 0 )
 Publication date 2017
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

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.



References used
Baccour, N.; Koubaa, A.; Ben Jamaa, M.; Youssef, H.; Zuniga, M.;Alves,M.2009 "A comparative simulation study of link quality estimators in wireless sensor networks," Modeling, Analysis & Simulation of Computer and Telecommunication Systems,IEEE International Symposium,vol.no.2,pp.1,10
Woo.A;Culler,D, U.C. Berkeley,2003,"Evaluation of efficient link reliability estimators for lowpower wireless networks", Technical Report,pp127
Tang,L;Wang,K;Huang,Y, 2007,“Channel Characterization and Link Quality Assessment of IEEE 802.15.4-Compliant Radio for Factory Environments”,IEEE Transactions on Industrial Informatics.
rate research

Read More

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.
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 low cost, ease of deployment has exposed WSNs an attractive choice for numerous applications,like environmental monitoring applications , security applications, real time tracking, and so on. But in reality, these networks are operated on batte ry with limitations in their computation capabilities, memory, bandwidth ,so they called networks with resource constrained nature, and this impels various challenges in its design and its performance. Limited battery capacity of sensor nodes makes energy efficiency a major and challenge problem in wireless sensor networks. Thus, the routing protocols for wireless sensor networks must be energy efficient in order to maximize the network lifetime. In this paper we simulated LEACH,SEP,DEEC,TEEN routing protocols and evaluated their performance by comparing with DT routing protocol in Homogeneous and Heterogeneous Wireless Sensor Networks on MATLAB.
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 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.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

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