Do you want to publish a course? Click here

A comparative Study of Node Localization Algorithms in Wireless Sensor Networks

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

1746   0   56   0 ( 0 )
 Publication date 2015
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

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.

References used
D. Waltenegus and P.Christian P., "Fundamentals Of Wireless Sensor Networks Theory And Practice ". John Wiley & Sons Ltd, ISBN:978-0-470-99765-9, 2010
G. Mao, B. Fidan, and B. Anderson. "Wireless Sensor Networks Localization Techniques". Computer Networks, 51(10). 2529-2553, 2007
A. Mesmoudi , M. Feham, and N. Labraoui, “Wireless Sensor Networks Localization Algorithms: A Comprehensive Survey”, International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.6, November 2013
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.
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.
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
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.

suggested questions

comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

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