Localization in Wireless Sensor Networks Using Soft Computing Approach

Localization in Wireless Sensor Networks Using Soft Computing Approach

Sunil Kumar Singh, Prabhat Kumar, Jyoti Prakash Singh
Copyright: © 2017 |Pages: 12
DOI: 10.4018/IJISP.2017070104
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Wireless sensor network (WSN) is formed by a large number of low-cost sensors. In order to exchange information, sensor nodes communicate in an ad hoc manner. The acquired information is useful only when the location of sensors is known. To use GPS-aided devices in each sensor makes sensors more costly and energy hungry. Hence, finding the location of nodes in WSNs becomes a major issue. In this paper, the authors propose a combination of range based and range-free localization scheme. In their scheme, for finding the distance, they use received signal strength indication (RSSI), which is a range based center of gravity technique. For finding the location of non-anchor nodes, the authors assign weights to anchor and non-anchor nodes based on received signal strength. The weight, which is assigned to anchor and non-anchor nodes, are designed by fuzzy logic system (FLS).
Article Preview
Top

1. Introduction

Wireless sensor networks(WSNs) (Akyildiz, 2002) consist of a large number of tiny sized sensors having the limited processing capability, limited battery life, and limited storage capacity. WSNs enable several classes of application such as automatic data collection, habitat monitoring, military surveillance and disaster relief operations.For all these applications along with sensed data, the knowledge of location is also necessary. Location information also helps in finding routing of packets from a souce to destination nodes. One of the major options of finding location of each and every sensor nodes is using GPS in sensor nodes. However, use of GPS-aided devices in sensors make them costly and energy hungry, which restricts the usage of sensor nodes. Most of the time, the battery of sensor nodes is non-replacable and hence consumption of more energy reduces their lifetime. The better and more popular option is a use of some sensor (usually 10-15% of total deployement) equipped with GPS devices and determine the location for other sensor nodes with the help of those sensors having GPS devices.The sensor nodes having GPS devices are called as anchor nodes whereas aother normal nodes are called non-anchor nodes. We use an algorithmic approach for finding the location of the non-anchor node using the computational capability of sensor nodes. The localization algorithms can be categorized into two types (i) Range based and (ii) Range free (Akyildiz, 2002). In range based technique, we measure distance or angle between sensors for finding the location of non-anchor nodes. Range free technique does not measure distance or angle, it uses connectivity information for finding the location of the sensors. For measuring angle or distance, range based technique uses procedures such as angle of arrival (AOA) (Cong, 2002), time of arrival (TOA) (Bulusu, 2000), time difference of arrival (TDOA) (Venkatraman, 2004) and received signal strength indication (RSSI) (Li, 2006). These techniques along with triangulation (Leelavathy, 2014) or trilateration (Oguejiofor, 2013) or multilateration (Miwa 2013) technique are used for finding the location in a range based technique. Due to its simplicity, range free techniques are more popular as compared to the range based technique.

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2024)
Volume 17: 1 Issue (2023)
Volume 16: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing