The Insights of DV-Based Localization Algorithms in the Wireless Sensor Networks with Duty-Cycled and Radio Irregular Sensors

Abstract

Abstract-Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumptions: (i) all nodes in WSN are always awake and (ii) the radio range of nodes is an ideal circle. This overlooks the common scenario that sensor nodes are duty-cycled in order to save energy and the radio range of nodes is irregular. In this paper we revisit the Distance-Vector-based (DV-based) positioning algorithms, particularly, Hop-Count-Ratio based Localization (HCRL) algorithm and investigate the following problems: (i) how is the relationship between the number of sleeping neighbor sensor nodes and the localization accuracy and (ii) how is the relationship between the degree of irregularity (DOI, which is a parameter of radio range irregularity) and the localization accuracy. We conduct a large number of experiments in WSNs' simulator NetTopo, and find that the parameters: the number of waking nodes, DOI, anchor node density and localization error, are interactional, i.e., for a given deployed static WSN, there is an optimal number of waking nodes and an optimal anchor node density, which can minimize network energy consumption without losing much of the localization accuracy. Furthermore, waking up more sensor nodes cannot always help to increase the localization accuracy, which actually is different from our intuitive thinking: more waking nodes can help to increase the localization accuracy of DV-based localization algorithms at all time.

Flood Control Distance Vector-Hop (FCDV-Hop) Localization in Wireless Sensor Networks

“…Reference [33] did a comprehensive review of 31 WSN simulators. Among the simulators are in [6] and [34]. Reference [6] conducted a large number of experiments using the WSN simulator known as Network Topology (NetTopo) by implementing the Hop-Count-Ratio-based Localization (HCRL) algorithm by [35] with Connected K-Neighbourhood (CKN).…”

“…Among the simulators are in [6] and [34]. Reference [6] conducted a large number of experiments using the WSN simulator known as Network Topology (NetTopo) by implementing the Hop-Count-Ratio-based Localization (HCRL) algorithm by [35] with Connected K-Neighbourhood (CKN). The radio range irregularity model was used to reflect the impact of the duty cycle and this models' impact on the DV-based localization algorithms.…”

Performance evaluation of DV-hop localization algorithm with mobility models for Mobile Wireless Sensor Networks

“…However, most of conventional issues are studied in a traditional network, e.g. ad hoc wireless network [3] or Wireless Sensor Networks (WSNs) [4] [5], instead of in an MWSN. The literature omits movements of nodes in real environments, such as caused by wind, and required in applications.…”

A RSSI-Based Distributed Weighted Search Localization Algorithm for WSNs

“…In range-based localization, nodes are able to measure the distances or angles to their neighbors using received signal strength indicator (RSSI), time-of-arrival, time difference of arrival, angle-of-arrival, and so on [4,5]. In range-free localization, for example, centroid localization, APIT, DV-Hop, and LAEP [6][7][8][9][10], nodes have no ability to measure the distances or angles to their neighbors and instead use connectivity or hop information to compute the positions of the nodes. Range-based localization can provide higher localization accuracy than range-free localization, but the latter is simpler and does not require extra hardware for measurement.…”