Managing Cohort Movement of Mobile Sensors Via Gps-Free and Compass-Free Node Localization

Loading...
Publication Logo

Date

2010

Journal Title

Journal ISSN

Volume Title

Publisher

Academic Press Inc Elsevier Science

Open Access Color

Green Open Access

Yes

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Top 10%
Influence
Top 10%
Popularity
Top 10%

Research Projects

Journal Issue

Abstract

A critical problem in mobile ad hoc wireless sensor networks is each node's awareness of its position relative to the network. This problem is known as localization. In this paper, we introduce a variant of this problem, directional localization, where each node must be aware of both its position and orientation relative to its neighbors. Directional localization is relevant for applications that require uniform area coverage and coherent movement. Using global positioning systems for localization in large scale sensor networks may be impractical in enclosed spaces, and might not be cost effective. In addition, a set of preexisting anchors with globally known positions may not always be available. In this context, we propose two distributed algorithms based on directional localization that facilitate the collaborative movement of nodes in a sensor network without the need for global positioning systems, seed nodes or a preexisting infrastructure such as anchors with known positions. Our first algorithm, GPS-free Directed Localization (GDL) assumes the availability of a simple digital. compass on each sensor node. We relax this requirement in our second algorithm termed GPS- and Compass-free Directed Localization (GCDL). Through experimentation, we demonstrate that our algorithms scale well for large numbers of nodes and provide convergent localization over time, despite errors introduced by motion actuators and distance measurements. In addition, we introduce mechanisms to preserve swarm formation during directed sensor network mobility. Our simulations confirm that, in a number of realistic scenarios, our algorithms provide for a mobile sensor network that preserves its formation over time, irrespective of speed and distance traveled. We also present our method to organize the sensor nodes in a polygonal geometric shape of our choice even in noisy environments, and investigate the possible uses of this approach in search-and-rescue type of missions. (C) 2010 Elsevier Inc. All rights reserved.

Description

Keywords

Localization, Wireless sensor networks, Mobility, Distributed systems, wireless sensor networks, localization, mobility

Fields of Science

0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Citation

WoS Q

Q1

Scopus Q

Q1
OpenCitations Logo
OpenCitations Citation Count
13

Source

Journal of Parallel And Dıstrıbuted Computıng

Volume

70

Issue

7

Start Page

743

End Page

757
PlumX Metrics
Citations

CrossRef : 13

Scopus : 12

Captures

Mendeley Readers : 25

SCOPUS™ Citations

12

checked on Feb 12, 2026

Web of Science™ Citations

8

checked on Feb 12, 2026

Page Views

1

checked on Feb 12, 2026

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
1.28979721

Sustainable Development Goals

SDG data is not available