Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerformance Study of APS Algorithm for position Determination in Underwater Wireless Sensor Networks
دراسة أداء خوارزمية APS في تحديد الموقع في شبكات الحساسات اللاسلكية تحت الماء
1514
0 47
0
(
0
)
Authors
بشرى معلا( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
غالباً ما يتم نشر شبكات الحساسات اللاسلكية بشكل عشوائي مما يجعل إمكانية تحديد مواقع العقد المنشورة أمراً غاية في التعقيد، و هو ما يسمى مشكلة تحديد مواقع العقد. إن أهمية معلومات مواقع العقد تأتي من السهولة التي تقدمها هذه المعلومات في عمليات التوجيه و التحكم بالشبكة، الأمر الذي ينعكس بشكل من الأشكال على عمل الشبكة بشكل صحيح. في الوقت الحاضر، ظهر نظام تحديد المواقع العالمي (GPS) الذي يعد أهم نظام تحديد المواقع، لكن تكلفة إضافته إلى كل عقدة باهظة، لاسيما في التطبيقات التي تعتمد على شبكات كبيرة الحجم، كما سيتسبب بزيادة حجم العقدة، لذا يمكن تجهيز عدد قليل من العقد بـ GPS، و التي ستساهم بدورها في مساعدة العقد الأخرى على معرفة مواقعها.سندرس في هذه البحث خوارزمية نظام تحديد الموقع (APS) المستخدمة في شبكة الحساسات اللاسلكية تحت الماء، و فيها تكون هناك بعض العقد مجهزة بـ GPS، و التي تساهم في تحديد مواقع العقد الأخرى المتبقية في الشبكة. و سيتم اختبار فعالية استخدام هذه الخوارزمية في تحديد موقع العقدة اعتماداً على المسافة المحسوبة من قبل عقد المرساة القادرة على تحديد موقعها.
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 facility 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.
References used
MohsinMurad, Adil A. Sheikh, Muhammad Asif Manzoor, EmadFelemban, and SaadQaisar, “A Survey on Current Underwater Acoustic Sensor Network Applications”,International Journal of Computer Theory and Engineering, 7(1): 51-56, February 2015
J. Liu, Z. Wang, M. Zuba, Z. Peng, J. Cui, and S. Zhou, “JSL: Joint time synchronization and localization design with stratification compensation in mobile underwater sensor networks”, 9th Annual IEEE Communications Society Conference onSensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 317-325, 2012
A. Syed and J. Heidemann, “Time Synchronization for High LatencyAcoustic Networks”, Twenty-five AnnualJoint Conference of the IEEE Computer and Communications Societies(INFOCOM), Barcelona, Spain, 2006
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 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.
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 s
ensors 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.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
