Do you want to publish a course? Click here

Improving defence techniques In Secure Implicit Geographic Forwarding “SIGF “ in Wireless Sensor Networks

تطوير تقنيات الحماية في بروتوكول التوجيه الجغرافي الضمني الآمن في شبكات الحساسات اللاسلكية

1814   1   23   0 ( 0 )
 Publication date 2016
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

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.



References used
(J.Sen, "A Survey on Wireless Sensor Network Security", International Journal of Communication Networks and Information Security (IJCNIS) , USA , 1(2): 55-74, August (2009
(A.Erring , R.Szewczyk , V.Wen, D.Culler,.J.D. Tygar , " SPINS: Security Protocols for Sensor Networks" , Intel Research Berkely, USA , Vol.9,No.2, April (2001
(L.Mcgrath , C.weiss , " Wireless Sensor Networks Security" , CS-591 Fundamentals of Computer and Network Security, Colorado.(2005
rate research

Read More

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

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