Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnhancend Secure Data Aggregation In Mobile Wireless Sensor Networks (MWSNs)
تحسين التجميع الآمن للبيانات في شبكات الحساسات اللاسلكية المتنقلة
1140
0 31
0.0
(
0
)
Added by
Tishreen University ورقة بحثية
Publication date
2018
fields
Communication Engineering
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
تمثل شبكات الحساسات اللاسلكية المتنقلة تقنية حديثة جذبت الباحثين نظراً لمزاياها و تطبيقاتها المتعددة في مختلف المجالات. تعد خوارزميات التجميع في هذه الشبكات التقنية الأكثر تطبيقاً من أجل تقليل عدد الرزم المرسلة في الشبكة و ذلك بسبب محدودية مصادر العقد الحساسة من حيث طاقة الإرسال، مدى الاتصال و حجم الذاكرة. و قد جعلت خصائص هذا النوع من الشبكات مثل الاتصال اللاسلكي و النشر في بيئات غير متحكم بها هدفاً سهلاً للهجمات. لذلك يعد الأمن قضية جوهرية لشبكات الحساسات اللاسلكية المتنقلة لحماية المعلومات من التطفل و الهجوم. نقدم في هذا البحث خوارزمية تجميع آمن للبيانات في شبكات الحساسات اللاسلكية المتنقلة. تعتمد هذه الخوارزمية على تقنية المفاتيح الثنائية و على تابع الـبعثرة. بهدف تقييم أداء الخوارزمية المقترحة تمت دراسة عدد من البارامترات الهامة و هي زمن التنفيذ و التأخير نهاية إلى نهاية إضافة إلى عدد المفاتيح المخزنة. و قد أظهرت النتائج أن الخوارزمية المقترحة قد قدمت أداءً جيداً من الناحية الأمنية و التأخير الزمني.
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
References used
J. REZAZADEH, M. MORADI, and A. SAMAD ISMAIL. Mobile Wireless Sensor Networks Overview. In International Journal of Computer Communications and Networks (IJCCN), Volume 2, NO 1, February 2012,pp. 17-21
M. ARSHAD, N.M. SAAD, N. KAMEL and N. ARMI. Routing Strategies in Hierarchical Cluster Based Mobile Wireless Sensor Networks. In IEEE INECCE, Pahang, Malaysia ,June 2011,pp. 65-69
L. ZHU . Secure and Privacy-Preserving Data Communication in Internet of ThingsSpringerBriefs in Signal Processing, 2017,pp. 3-12
rate research
Read More
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.
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.
Wireless sensor networks (WSNs) are often deployed by random bestrewing
(airplane bestrewing for example). A majority of nodes cannot obtain their coordinate
beforehand. Therefore, how to obtain the position information of unknown nodes, which is
called localization problem, has become a hot topic in WSN.
Without position information, WSN cannot work properly. Global Position System
(GPS) is the most extensive and mature position system at present. But because the nodes
usually have the shortcoming of high expenditure, large volume, high cost and require
settled basal establishment, therefore, the GPS is inapplicable for the low-cost selfconfigure
sensor networks, and also it is impossible to install GPS for each sensor node. In
this paper, we will study localization mechanisms (which is not based on GPS) used in
WSN, and will test the effectiveness of using MUSIC algorithm in determining the signal
arrival angel depending on the SDMA- technology and ESPAR antenna.
The tracking using wireless sensor networks is one of the applications that are
experiencing significant growth. Due to considerations of wireless sensor networks in
terms of limited energy source, researches continue to improve methods of routing
and
transforming information to ensure lower power. Therefore, we have in this research
improved the routing of target location information within WSN by providing a new
algorithm, which takes advantage of the concept of clustering for wireless network sensors,
with the addition of the possibility of interaction between field sensors that belong to
different clusters, where in other cases, they cannot interact with each other in the
traditional case of cluster networks. to get rid of repeating the same information transfer,
we depend on the parameter intensity of the received signal from the target in the sensors,
which will reflect positively on the network age, and give a more accurate indication of the
target site. We have implemented the proposed algorithm and showed the results of using
the simulator OPNET which is one of the best simulators in the field of various types of
networks.
In this research we study some of the most Bio-inspired MAC
protocols widely used in WSNs. we select the protocols which
depends on ant colony optimization behavior (ACO), bee colony
optimization behavior (BCO) and particle swarm optimization.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
