---
_id: '26707'
abstract:
- lang: eng
  text: "Planar graph routing works provably correct if the underlying network graph
    is connected and planar. Typically, wireless networks modeled as 2D graphs, are
    not planar and planar graph routing applied on such unprocessed network graphs
    may fail. Planarizing a given connected graph by removing intersecting links might
    be impossible if the outcome still needs to be a connected subgraph. It becomes
    even more difficult with distributed planarization techniques, where each node
    is allowed to use only the information about its local neighborhood. Furthermore,
    it is getting complicated if the nodes' assigned positions do not reflect the
    exact physical location. With or without exact location information, the outcome
    might be disconnected, nonplanar, or both of it. With all these unsolvable problems,
    the question arises how to apply planar graph routing in a realistic network setting?
    Fortunately, wireless network graphs bear one property which distinguishes them
    from arbitrary graphs: due to limited communication range, network links cannot
    become arbitrarily long. In this work we exploit this locality property to build
    a new localized planarization algorithm, which is location fault tolerant and
    which produces planar connected graphs in most cases in realistic wireless models.
    We evaluate our algorithm using the Log Normal Shadowing model and show that our
    algorithm always produces planar connected graphs in all simulations even when
    large location errors are present.\r\n"
author:
- first_name: Emi
  full_name: Mathews, Emi
  last_name: Mathews
- first_name: Hannes
  full_name: Frey, Hannes
  last_name: Frey
citation:
  ama: 'Mathews E, Frey H. A Localized Planarization Algorithm for Realistic Wireless
    Networks. In: <i>IEEE International Symposium on a World of Wireless, Mobile and
    Multimedia Networks (WoWMoM)</i>.  IEEE Computer Society; 2011:1-9.'
  apa: Mathews, E., &#38; Frey, H. (2011). A Localized Planarization Algorithm for
    Realistic Wireless Networks. <i>IEEE International Symposium on a World of Wireless,
    Mobile and Multimedia Networks (WoWMoM)</i>, 1–9.
  bibtex: '@inproceedings{Mathews_Frey_2011, title={A Localized Planarization Algorithm
    for Realistic Wireless Networks}, booktitle={IEEE International Symposium on a
    World of Wireless, Mobile and Multimedia Networks (WoWMoM)}, publisher={ IEEE
    Computer Society}, author={Mathews, Emi and Frey, Hannes}, year={2011}, pages={1–9}
    }'
  chicago: Mathews, Emi, and Hannes Frey. “A Localized Planarization Algorithm for
    Realistic Wireless Networks.” In <i>IEEE International Symposium on a World of
    Wireless, Mobile and Multimedia Networks (WoWMoM)</i>, 1–9.  IEEE Computer Society,
    2011.
  ieee: E. Mathews and H. Frey, “A Localized Planarization Algorithm for Realistic
    Wireless Networks,” in <i>IEEE International Symposium on a World of Wireless,
    Mobile and Multimedia Networks (WoWMoM)</i>, 2011, pp. 1–9.
  mla: Mathews, Emi, and Hannes Frey. “A Localized Planarization Algorithm for Realistic
    Wireless Networks.” <i>IEEE International Symposium on a World of Wireless, Mobile
    and Multimedia Networks (WoWMoM)</i>,  IEEE Computer Society, 2011, pp. 1–9.
  short: 'E. Mathews, H. Frey, in: IEEE International Symposium on a World of Wireless,
    Mobile and Multimedia Networks (WoWMoM),  IEEE Computer Society, 2011, pp. 1–9.'
date_created: 2021-10-21T12:40:58Z
date_updated: 2022-01-06T06:57:26Z
department:
- _id: '672'
language:
- iso: eng
page: 1-9
publication: IEEE International Symposium on a World of Wireless, Mobile and Multimedia
  Networks (WoWMoM)
publisher: ' IEEE Computer Society'
status: public
title: A Localized Planarization Algorithm for Realistic Wireless Networks
type: conference
user_id: '21240'
year: '2011'
...