Do you want to publish a course? Click here

Address Vector Multi Hop (AV_MH) Algorithm for Localization in Wireless Sensor Networks

خوارزمية شعاع العناوين متعددة القفزات (AV-MH) لتحديد الموضع في شبكات الحساسات اللاسلكية

1153   0   8   0.0 ( 0 )
 Publication date 2017
and research's language is العربية
 Created by مهند عيسى




Ask ChatGPT about the research

Localization is an essential process in many wireless sensors networks applications like environmental surveillance and forest fires detection, where sensors are usually randomly thrown in difficult to reach places, considering the limited wireless sensors capability in terms of energy availability and the capacity of computations a low cost and energy conservation algorithms are needed to determine the approximate position of the sensors. In this research a new algorithm was proposed ‘Address Vector Multi-Hop (AV_MH)’ to determine the position of the randomly deployed sensors, this algorithm is based on the idea of making benefit from short address assignment in networks that support hierarchical addressing, considering that the most important techniques used in the field of sensor networks such as ZigBee and 6LowPAN which depend on the IEEE802.15.4 standard support this type of addressing. The results showed the possibility of obtaining an approximate position of the wireless sensors in a rapid and inexpensive and cost-effective way in terms of the number of sent messages and required calculations.


Artificial intelligence review:
Research summary
تتناول هذه الورقة البحثية خوارزمية جديدة لتحديد الموضع في شبكات الحساسات اللاسلكية، والتي تُعرف بخوارزمية شعاع العناوين متعددة القفزات (AV_MH). تُعتبر عملية تحديد الموضع ضرورية في العديد من التطبيقات مثل مراقبة البيئة وكشف حرائق الغابات. تستند الخوارزمية المقترحة إلى الاستفادة من عملية توزيع العناوين القصيرة في الشبكات التي تدعم العنونة الهرمية، مثل شبكات ZigBee و6LowPAN التي تعتمد على المعيار IEEE802.15.4. تُظهر النتائج أن الخوارزمية قادرة على تحديد موضع تقريبي للحساسات بطريقة سريعة وغير مكلفة من حيث عدد الرسائل المرسلة والحسابات المطلوبة. تعتمد الخوارزمية على بناء الشبكة هرميًا وتوزيع العناوين، مما يُمكن الحساسات من تحديد موضعها بناءً على متوسط المسافة والميل للفروع التي تنتمي إليها. تُوفر الخوارزمية دقة مقبولة في تحديد الموضع وتُقلل من استهلاك الطاقة بفضل تقليل عدد الرسائل المرسلة.
Critical review
تُعد هذه الورقة البحثية خطوة مهمة في مجال تحديد الموضع في شبكات الحساسات اللاسلكية، إلا أن هناك بعض النقاط التي يمكن تحسينها. أولاً، تعتمد الخوارزمية بشكل كبير على توزيع العناوين الهرمي، مما قد يكون غير فعال في البيئات ذات التوزيع العشوائي الكبير للحساسات. ثانيًا، لم تتناول الورقة بشكل كافٍ تأثير العوامل البيئية المختلفة مثل التداخل الكهرومغناطيسي والعوائق الفيزيائية على دقة تحديد الموضع. ثالثًا، كان من الممكن تقديم مقارنة أكثر تفصيلًا بين الخوارزمية المقترحة والخوارزميات الأخرى الموجودة في الأدبيات لتوضيح الفروق والميزات بشكل أفضل. وأخيرًا، يُفضل إجراء تجارب ميدانية إضافية للتحقق من فعالية الخوارزمية في بيئات متنوعة ومعقدة.
Questions related to the research
  1. ما هي الخوارزمية المقترحة في الورقة البحثية؟

    الخوارزمية المقترحة هي خوارزمية شعاع العناوين متعددة القفزات (AV_MH) لتحديد الموضع في شبكات الحساسات اللاسلكية.

  2. ما هي الفائدة الرئيسية لاستخدام خوارزمية AV_MH؟

    الفائدة الرئيسية هي القدرة على تحديد موضع تقريبي للحساسات بطريقة سريعة وغير مكلفة من حيث عدد الرسائل المرسلة والحسابات المطلوبة، مما يُقلل من استهلاك الطاقة.

  3. ما هي التقنيات التي تدعم العنونة الهرمية المستخدمة في الخوارزمية؟

    التقنيات التي تدعم العنونة الهرمية المستخدمة في الخوارزمية هي شبكات ZigBee و6LowPAN التي تعتمد على المعيار IEEE802.15.4.

  4. ما هي النقاط التي يمكن تحسينها في البحث؟

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


References used
No references
rate research

Read More

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.
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.
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.
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 prog rams 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.
comments
Fetching comments Fetching comments
mircosoft-partner

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