Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations

Peng Guo; Tao Jiang; Youwen Yi; Qian Zhang; Kui Zhang

doi:10.1109/GLOCOM.2011.6133794

Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations

Peng Guo, Tao Jiang, Youwen Yi, Qian Zhang, Kui Zhang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

11 Downloads (Pure)

Abstract

In this paper, we propose a novel algorithm of distributed navigation for people to escape from critical event region in wireless sensor networks (WSNs). Unlike existing works, the scenario discussed in the paper has no goal or exit as guidance, leading to a big challenge for the navigation problem. To solve it, our proposed navigation algorithm computes the convex hull of the event region just by some topological methods. With the reference of the convex hull, people can be easily navigated out of the event region. Both the computation complexity and communication overhead of the proposed algorithm are very low, as it only needs to flood two shortest path trees in a limited area around the event region with a distance ⌊L/2π⌋ + 1 to the event boundary, where L is the length of the boundary. Conducted simulations have verified the effectiveness and scalability of the proposed algorithm.

Original language	English
Title of host publication	IEEE GLOBECOM 2011
Subtitle of host publication	2011 IEEE Global Communications Conference, 5-9 December 2011, Houston, Texas, USA
Place of Publication	USA
Publisher	IEEE
Pages	1-6
Number of pages	6
ISBN (Print)	978-1-4244-9268-8
DOIs	https://doi.org/10.1109/GLOCOM.2011.6133794
Publication status	Published - 8 Dec 2011
Event	2011 IEEE Global Communications Conference, GLOBECOM 2011: Energizing Global Communications - Hilton Americas-Houston, Houston, United States Duration: 5 Dec 2011 → 9 Dec 2011 http://globecom2011.ieee-globecom.org/index.html

Conference

Conference	2011 IEEE Global Communications Conference, GLOBECOM 2011
Abbreviated title	GLOBECOM
Country/Territory	United States
City	Houston
Period	5/12/11 → 9/12/11
Internet address	http://globecom2011.ieee-globecom.org/index.html

Keywords

METIS-284899
EWI-20357
CR-C.2.1
IR-79116

Access to Document

10.1109/GLOCOM.2011.6133794

Cite this

@inproceedings{41ad7c8c2d654269a907483b09427140,

title = "Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations",

abstract = "In this paper, we propose a novel algorithm of distributed navigation for people to escape from critical event region in wireless sensor networks (WSNs). Unlike existing works, the scenario discussed in the paper has no goal or exit as guidance, leading to a big challenge for the navigation problem. To solve it, our proposed navigation algorithm computes the convex hull of the event region just by some topological methods. With the reference of the convex hull, people can be easily navigated out of the event region. Both the computation complexity and communication overhead of the proposed algorithm are very low, as it only needs to flood two shortest path trees in a limited area around the event region with a distance ⌊L/2π⌋ + 1 to the event boundary, where L is the length of the boundary. Conducted simulations have verified the effectiveness and scalability of the proposed algorithm.",

keywords = "METIS-284899, EWI-20357, CR-C.2.1, IR-79116",

author = "Peng Guo and Tao Jiang and Youwen Yi and Qian Zhang and Kui Zhang",

note = "10.1109/GLOCOM.2011.6133794 ; 2011 IEEE Global Communications Conference, GLOBECOM 2011 : Energizing Global Communications, GLOBECOM ; Conference date: 05-12-2011 Through 09-12-2011",

year = "2011",

month = dec,

day = "8",

doi = "10.1109/GLOCOM.2011.6133794",

language = "English",

isbn = "978-1-4244-9268-8",

pages = "1--6",

booktitle = "IEEE GLOBECOM 2011",

publisher = "IEEE",

address = "United States",

url = "http://globecom2011.ieee-globecom.org/index.html",

}

Guo, P, Jiang, T, Yi, Y, Zhang, Q & Zhang, K 2011, Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations. in IEEE GLOBECOM 2011: 2011 IEEE Global Communications Conference, 5-9 December 2011, Houston, Texas, USA. IEEE, USA, pp. 1-6, 2011 IEEE Global Communications Conference, GLOBECOM 2011, Houston, Texas, United States, 5/12/11. https://doi.org/10.1109/GLOCOM.2011.6133794

Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations. / Guo, Peng; Jiang, Tao; Yi, Youwen et al.
IEEE GLOBECOM 2011: 2011 IEEE Global Communications Conference, 5-9 December 2011, Houston, Texas, USA. USA: IEEE, 2011. p. 1-6.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations

AU - Guo, Peng

AU - Jiang, Tao

AU - Yi, Youwen

AU - Zhang, Qian

AU - Zhang, Kui

N1 - 10.1109/GLOCOM.2011.6133794

PY - 2011/12/8

Y1 - 2011/12/8

N2 - In this paper, we propose a novel algorithm of distributed navigation for people to escape from critical event region in wireless sensor networks (WSNs). Unlike existing works, the scenario discussed in the paper has no goal or exit as guidance, leading to a big challenge for the navigation problem. To solve it, our proposed navigation algorithm computes the convex hull of the event region just by some topological methods. With the reference of the convex hull, people can be easily navigated out of the event region. Both the computation complexity and communication overhead of the proposed algorithm are very low, as it only needs to flood two shortest path trees in a limited area around the event region with a distance ⌊L/2π⌋ + 1 to the event boundary, where L is the length of the boundary. Conducted simulations have verified the effectiveness and scalability of the proposed algorithm.

AB - In this paper, we propose a novel algorithm of distributed navigation for people to escape from critical event region in wireless sensor networks (WSNs). Unlike existing works, the scenario discussed in the paper has no goal or exit as guidance, leading to a big challenge for the navigation problem. To solve it, our proposed navigation algorithm computes the convex hull of the event region just by some topological methods. With the reference of the convex hull, people can be easily navigated out of the event region. Both the computation complexity and communication overhead of the proposed algorithm are very low, as it only needs to flood two shortest path trees in a limited area around the event region with a distance ⌊L/2π⌋ + 1 to the event boundary, where L is the length of the boundary. Conducted simulations have verified the effectiveness and scalability of the proposed algorithm.

KW - METIS-284899

KW - EWI-20357

KW - CR-C.2.1

KW - IR-79116

U2 - 10.1109/GLOCOM.2011.6133794

DO - 10.1109/GLOCOM.2011.6133794

M3 - Conference contribution

SN - 978-1-4244-9268-8

SP - 1

EP - 6

BT - IEEE GLOBECOM 2011

PB - IEEE

CY - USA

T2 - 2011 IEEE Global Communications Conference, GLOBECOM 2011

Y2 - 5 December 2011 through 9 December 2011

ER -

Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this