Do you want to publish a course? Click here

Performance Evaluation of the Kernel Based Wireless Sensor Network Simulator Using an Authentication Algorithm

تقييم أداء نواة محاكي شبكات الحساسات اللاسلكية باستخدام خوارزمية المصادقة

885   0   3   0.0 ( 0 )
 Publication date 2021
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

Wireless sensor network simulation programs provide representation for an actual system, without needing to deploy real testbed which is highly constrained by the available budget, and the direct operations inside physical layer in most of these programs are hidden and work implicitly. This is what motivated us to build a kernel for a virtual simulation platform to be able to simulate protocol operations and algorithms at the node processing unit level, The proposed system aims to observe the execution of operations at the low level of the wireless sensor physical infrastructure with the ability to modify at this level. Since secure routing is considered one of the most challenges in WSN field, so we apply in this paper one of the secure routing algorithms inside the GUI of the proposed system to observe execution at the low level of processor operations, which give us the ability to discover the weakness of algorithms and improve them. Three scenarios were applied to evaluate the performance of the proposed simulation platform. The results demonstrate a high flexibility and effectiveness of this platform in tracing the progress of operations performed within the wireless sensor nodes at the Assembly language level.


Artificial intelligence review:
Research summary
تقدم الورقة البحثية نواة لمنصة محاكاة افتراضية لشبكات الحساسات اللاسلكية، تهدف إلى محاكاة عمليات البروتوكولات والخوارزميات على مستوى وحدة المعالجة المركزية. تركز المنصة على مراقبة تنفيذ العمليات على المستوى المنخفض للبنية الفيزيائية لعقد الحساسات، مع إمكانية التعديل عند هذا المستوى. تم تطبيق خوارزمية المصادقة بين عقدتين مستقلتين من عقد الحساسات ضمن الواجهة المصممة للمنصة، وذلك بهدف مراقبة التنفيذ واكتشاف نقاط الضعف وتحسين الخوارزميات. تم اختبار أداء المنصة من خلال ثلاثة سيناريوهات مختلفة، وأظهرت النتائج مرونة وفعالية عالية في تتبع سير العمليات المنجزة ضمن عقد الحساسات على مستوى لغة الـ Assembly. تهدف الدراسة إلى تحسين أمن التوجيه في شبكات الحساسات اللاسلكية من خلال تطوير خوارزميات أكثر فعالية واختبارها في بيئة محاكاة افتراضية.
Critical review
دراسة نقدية: تقدم الورقة البحثية إسهاماً مهماً في مجال محاكاة شبكات الحساسات اللاسلكية، حيث تركز على مستوى منخفض من العمليات وتتيح إمكانية التعديل والمراقبة. ومع ذلك، يمكن توجيه بعض الانتقادات البناءة. أولاً، قد يكون من المفيد تضمين مقارنة مع منصات محاكاة أخرى لتوضيح الفروق والميزات الفريدة للمنصة المقترحة. ثانياً، يمكن توسيع نطاق الاختبارات لتشمل سيناريوهات أكثر تعقيداً وتنوعاً، مما يعزز من موثوقية النتائج. أخيراً، قد يكون من المفيد تقديم تفاصيل أكثر حول كيفية تحسين الخوارزميات بناءً على النتائج المستخلصة من المحاكاة، وذلك لتقديم رؤية أوضح حول الخطوات المستقبلية.
Questions related to the research
  1. ما الهدف الرئيسي من بناء نواة لمنصة محاكاة افتراضية لشبكات الحساسات اللاسلكية؟

    الهدف الرئيسي هو محاكاة عمليات البروتوكولات والخوارزميات على مستوى وحدة المعالجة المركزية، مع التركيز على مراقبة وتنفيذ العمليات على المستوى المنخفض للبنية الفيزيائية لعقد الحساسات، وإمكانية التعديل عند هذا المستوى لتحسين أمن التوجيه واكتشاف نقاط الضعف.

  2. ما هي الخوارزمية التي تم تطبيقها في الدراسة؟

    تم تطبيق خوارزمية المصادقة بين عقدتين مستقلتين من عقد الحساسات ضمن الواجهة المصممة للمنصة الافتراضية.

  3. ما هي النتائج التي أظهرتها اختبارات المنصة المقترحة؟

    أظهرت النتائج مرونة وفعالية عالية للمنصة المقترحة في تتبع سير العمليات المنجزة ضمن عقد الحساسات على مستوى لغة الـ Assembly.

  4. ما هي التحديات التي تواجه شبكات الحساسات اللاسلكية والتي تم التركيز عليها في الدراسة؟

    أحد التحديات الرئيسية التي تم التركيز عليها هو أمن التوجيه، حيث أن وسط الاتصال اللاسلكي يسمح لأي عقدة خارجية بالوصول إلى المعطيات المتبادلة، مما يستدعي تطوير خوارزميات أكثر فعالية لتحسين الأمن.


References used
NAKOV,S;CO., "Introduction to Programming",InFundamentals Of Computer Programming With C#, ISBN 978-954-400-773-7,Bulgary, Sofia,2013
C. Price, "MIPS IV Instruction Set Revision".3.2ed. MIPS Technologies, Inc., USA, September,1995
SAHOO,S; MISHRA,P; SATPATHY,R, "Secure Routing in Wireless Sensor Networks",IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 2, January 2012
rate research

Read More

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

suggested questions

comments
Fetching comments Fetching comments
mircosoft-partner

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