A Partial Unit Delaunay Graph with Planar and Spanner for Ad Hoc Wireless Networks

Peng Fei Xu; Zhi Gang Chen; Xiao Heng Deng; Jian Ping Yu

doi:10.4028/www.scientific.net/AMR.267.322

Paper Titles

An Efficient DoS Attacks Detection Method Based on Data Mining Scheme
p.302

An Effective Intrusion Detection Model Based on Random Forest and Neural Networks
p.308

The Application of Cloud Storage in the Library
p.314

Path Planning Based on Warehousing Intelligent Inspection Robot in Internet of Things
p.318

A Partial Unit Delaunay Graph with Planar and Spanner for Ad Hoc Wireless Networks
p.322

Increment Update Algorithms Basing on Semantic Similarity Degree for K-Anonymized Dataset
p.328

Minus Domination Numbers of Directed Graphs
p.334

Smart Grid Equipments Condition Monitoring Based on Rough Set
p.338

A New Type of Algorithm for the Variational Inequalities on Supply Chain Economic Equilibrium Model
p.344

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 267A Partial Unit Delaunay Graph with Planar and...

A Partial Unit Delaunay Graph with Planar and Spanner for Ad Hoc Wireless Networks

Abstract:

This paper proposes a new geometry structure, namely Partial unit Delaunay graph (PuDel), to be as the underlying network topology of Ad hoc wireless networks. PuDel has the following attractive properties: (1) PuDel is a connected subgraph of unit Delaunay triangulation; (2) PuDel is a planar spanner of Unit Disk Graph (UDG) whose length stretch factor is at most 1.21; and (3) PuDel can be locally constructed only based on the position information of 1-hops neighbors, and requires no message exchange between nodes in addition to maintaining UDG.

You might also be interested in these eBooks

Manufacturing Systems and Industry Application

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 267)

Pages:

322-327

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.267.322

Citation:

Cite this paper

Online since:

June 2011

Authors:

Peng Fei Xu, Zhi Gang Chen, Xiao Heng Deng, Jian Ping Yu

Keywords:

Delaunay Triangulation, Planar, Spanner, Voronoi Diagram

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Jie Gao and Guibas L. J: IEEE Journal on Selected Areas in Communications, Vol. 23 (2005), p.174.

Google Scholar

[2] Xiangyang Li and Calinescu G.: Proceedings of INFOCOM 2002(New York, USA, June 23-27, 2002), Vol. 3, p.1268.

Google Scholar

[3] Xiangyang Li and Stojmenovic I.: IEEE Transactions on Parallel and Distributed Systems, Vol. 15 (2004), p.350.

Google Scholar

[4] Cong Liu and Jie Wu: Proceedings of INFOCOM 2009 (Rio de Janeiro, Brazil, April 19-25, 2009), Vol. 1, p.2751.

Google Scholar

[5] F. P. Preparata and M. Ian Shamos: Computational Geometry: an Introduction, Springer-Verlag, New York (1985).

Google Scholar

[6] O'Rourke J: Computational geometry in C, Second Edition, Cambridge University Press, Cambridge (1998).

Google Scholar

[7] Chi Zhang and Yanchao Zhang: Wireless Networks, Vol. 15 (2009), p.3.

Google Scholar

[8] DP Dobkin and SJ Friedman: Proceeding of 28th Annual Symposium on Foundations of Computer Science (Los Angeles, USA, Oct 12-14 1987), Vol. 1 (1987), p.20.

Google Scholar

[9] Jiong Wang and Medidi S.: Proceeding of Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (New York, USA, Oct 8-10, 2007), Vol. 1, p.61.

Google Scholar