A Strategic Framework for Searching Mobile Targets Using Mobile Sensors

A Strategic Framework for Searching Mobile Targets Using Mobile Sensors This paper presents a cooperative, combinatorial search model for a multi-mobile sensor, multi-mobile target scenario in a two dimensional grid space. In the proposed model, sensors and targets act as searchers and hiders of a search game. A search game is a game between searcher and hider, modeled on a graph. In this paper, the identified problem states that multiple targets enter into a grid from the same or different sides and try to exit on the opposite directions of their respective entry sides. Alternatively, multiple mobile sensors are randomly deployed in the grid and try to maximize the number of target searched and to minimize search time before the targets leave the grid. This problem fits into several real life scenarios such as international border security, terrorist searching in a specified area, finding spies etc. The novelty of the proposed model is interpreting the problem as a search game and formulating strategies for the mobile sensors to optimize their moves to maximize the number of target searched and minimize search time. In this paper, shortest path and random walk strategies for the targets are analyzed by applying suitable mathematical models and on the other hand, advantages of cooperative over non-cooperative strategies for the mobile sensors are also shown with the help of analytical methods and simulation results. The significant mathematical concepts applied in the proposed model are as follows-computing shortest path, random walk, Markov chain, probability graph, overlapping of multiple probability graphs, cooperative and non-cooperative strategies etc. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Wireless Personal Communications Springer Journals

A Strategic Framework for Searching Mobile Targets Using Mobile Sensors

Loading next page...
 
/lp/springer_journal/a-strategic-framework-for-searching-mobile-targets-using-mobile-XHpkFAHk5z
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Engineering; Communications Engineering, Networks; Signal,Image and Speech Processing; Computer Communication Networks
ISSN
0929-6212
eISSN
1572-834X
D.O.I.
10.1007/s11277-017-4113-7
Publisher site
See Article on Publisher Site

Abstract

This paper presents a cooperative, combinatorial search model for a multi-mobile sensor, multi-mobile target scenario in a two dimensional grid space. In the proposed model, sensors and targets act as searchers and hiders of a search game. A search game is a game between searcher and hider, modeled on a graph. In this paper, the identified problem states that multiple targets enter into a grid from the same or different sides and try to exit on the opposite directions of their respective entry sides. Alternatively, multiple mobile sensors are randomly deployed in the grid and try to maximize the number of target searched and to minimize search time before the targets leave the grid. This problem fits into several real life scenarios such as international border security, terrorist searching in a specified area, finding spies etc. The novelty of the proposed model is interpreting the problem as a search game and formulating strategies for the mobile sensors to optimize their moves to maximize the number of target searched and minimize search time. In this paper, shortest path and random walk strategies for the targets are analyzed by applying suitable mathematical models and on the other hand, advantages of cooperative over non-cooperative strategies for the mobile sensors are also shown with the help of analytical methods and simulation results. The significant mathematical concepts applied in the proposed model are as follows-computing shortest path, random walk, Markov chain, probability graph, overlapping of multiple probability graphs, cooperative and non-cooperative strategies etc.

Journal

Wireless Personal CommunicationsSpringer Journals

Published: Apr 3, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off