Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEvaluation Performance Of Localization Algorithms in Wireless Sensor Networks
تقييم أداء خوارزميات تحديد الموقع في شبكات الحساسات اللاسلكية
1055
0 38
0.0
(
0
)
Added by
Tishreen University ورقة بحثية
Publication date
2018
fields
Informatics Engineering
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
تعد عملية تحديد موقع عقد الحساسات اللاسلكية المنتشرة في الوسط ضرورية من أجل التطبيقات التي تعد فيها المعلومات المتعلقة بموقع التحسس معلومات مهمة كتطبيقات الأمن و الحماية و تتبع الأهداف و غيرها من التطبيقات. تصنف خوارزميات تحديد الموقع إلى نوعين: المعتمدة على المدى Range-based و غير المعتمدة على المدى (Range-free). ركزت الدراسة على الخوارزميات غير المعتمدة على المدى لأنها أقل كلفة من حيث متطلبات أجهزة العتاد الصلب المستخدمة. استخدم الماتلاب في محاكاة الخوارزميات، حيثُ جرى تقييم أدائها في ظل تغيير عدد العقد الشبكية، عدد العقد المرجعية، إضافة الى مجال اتصال العقد بغيةَ توضيحِ اختلافات الأداء من ناحية خطأ الموقع. أظهرت النتائج تفوق خوارزمية عدم الانتظام (Amorphous)، محققة دقة عالية في تحديد الموقع، و كلفة أقل بالنسبة الى عدد العقد المرجعية المطلوبة لتحقيق خطأ موقع صغير.
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 classified 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.
References used
JEVTIC,M.;ZOONIC,N.Evaluation of Wireless Sensor Network Simulators. 17th Telecommunication forum TELFOR,Serbia, Belgrade, November 24-26, 2009
STOLERU,R.;HE,T.;STANKOVIC,J.A.Range-Free Localization. Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks. Advances in Information Security, vol.30. Springer, Boston,vol.30,2007,3-33
SINGH,S.;SHAKYA,R.;YADUVIR,S.Localization Techniques in Wireless Sensor Networks International Journal of Computer Science and InformationTechnologie,vol.6, 2015,844-850
rate research
Read More
Wireless Sensor Networks (WSNs) are often deployedrandomly;this makes the
positiondetermination of deployed nodes a very difficult issue, which is called localization
problem. The importance of node localization information becomes from the facilit
y of
routing operation and the network control, that makes the network works correctly.
Nowadays, Global Position System (GPS) is appeared as the most important position
system, but it is inapplicable for the low-cost self-configure sensor networks, and also it is
impossible to install GPS for each sensor nodebecause of high cost, large volume and high
complexity required of adding it to nodes, especially for large network.Therefore, a few
number of nodes may be configured with GPS.
In this paper,we will study the localization algorithmAd-hoc Positioning System
(APS) algorithmused inUnderwater WSN, andwill testthe effectiveness of usingitin
determining the node position based on the distance calculated by anchor nodes. These
nodes are the nodes which know their positions.
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 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.
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.
Wireless Multimedia Sensor Network (WMSN) consists of a large number of small size, low power, limited sources sensor nodes, deployed in tested field, These nodes have the ability of sensing, processing, storing and sending multimedia data from the t
ested field in real time. The security in WMSNs is one of most important issues that should be studied due to the special nature of this network, and of the importance of inquest basic security requirements when sending information in the network. Using cryptography technics are very effective ways to realize basic security requirements in this network. The recently proposed MQQ algorithm is one of public key cryptography (PKC) algorithms, which provides a good performance compared to other PKC algorithms. In this research, we present an analyzing study of MQQ implementation in WMSNs. To achieve our goal, we used real images taken by multimedia wireless sensor nodes. We studied the most important parameters such as the size of generated keys and encrypted images, the execution time and the space occupied in the flash memory of multimedia wireless sensor nodes and complexity degree of this algorithm. Results showed that MQQ has good performance, as well as the execution time of operations is better than RSA algorithm. Results also showed the importance of taking into account a large size of public key of MQQ algorithm when implementation it in WMSNs.
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
