--- _id: '18972' author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow citation: ama: Damerow V. Average and Smoothed Complexity of Geometric Structures. Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006. apa: Damerow, V. (2006). Average and Smoothed Complexity of Geometric Structures (Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Damerow_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Average and Smoothed Complexity of Geometric Structures}, volume={190}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Damerow, Valentina}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures. Vol. 190. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. ieee: V. Damerow, Average and Smoothed Complexity of Geometric Structures, vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. mla: Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. short: V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. date_created: 2020-09-04T06:47:03Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' - _id: '26' intvolume: ' 190' language: - iso: eng publication_identifier: isbn: - 3-939350-09-5 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Average and Smoothed Complexity of Geometric Structures type: dissertation user_id: '5786' volume: 190 year: '2006' ... --- _id: '18999' abstract: - lang: eng text: "We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform- independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.\r\nAs the unused computation power of the participating PCs is unpredictable, we need novel strategies for load balancing that have no access to future changes of the computation power available for the application. We develop, analyze, and compare different load balancing strategies for PUBWCL. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\nDuring our evaluation of the load balancing algorithms we simulated the external work load in order to have repeatable testing conditions. With the best performing load balancing strategy we could save 39% of the execution time on average and even up to 50% in particular cases, in our test environment.\r\n" author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler citation: ama: 'Bonorden O, Meyer auf der Heide F, Gehweiler J. A Web Computing Environment for Parallel Algorithms in Java. In: Journal on Scalable Computing: Practice and Experience. ; 2006:1-14.' apa: 'Bonorden, O., Meyer auf der Heide, F., & Gehweiler, J. (2006). A Web Computing Environment for Parallel Algorithms in Java. In Journal on Scalable Computing: Practice and Experience (pp. 1–14).' bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Gehweiler_2006, title={A Web Computing Environment for Parallel Algorithms in Java}, booktitle={Journal on Scalable Computing: Practice and Experience}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Gehweiler, Joachim}, year={2006}, pages={1–14} }' chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Joachim Gehweiler. “A Web Computing Environment for Parallel Algorithms in Java.” In Journal on Scalable Computing: Practice and Experience, 1–14, 2006.' ieee: 'O. Bonorden, F. Meyer auf der Heide, and J. Gehweiler, “A Web Computing Environment for Parallel Algorithms in Java,” in Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.' mla: 'Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.' short: 'O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.' date_created: 2020-09-04T09:50:01Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' language: - iso: eng page: 1-14 publication: 'Journal on Scalable Computing: Practice and Experience' status: public title: A Web Computing Environment for Parallel Algorithms in Java type: conference user_id: '15415' year: '2006' ... --- _id: '19001' abstract: - lang: eng text: "We present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web Computing Library (PUBWCL), which formerly used a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. Using distributed heterogeneous hash tables (DHHT), our architecture features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations.\r\n" author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Gehweiler J, Schomaker G. Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In: Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT). ; 2006:51-58. doi:10.1109/ds-rt.2006.15' apa: Gehweiler, J., & Schomaker, G. (2006). Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT) (pp. 51–58). https://doi.org/10.1109/ds-rt.2006.15 bibtex: '@inproceedings{Gehweiler_Schomaker_2006, title={Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}, DOI={10.1109/ds-rt.2006.15}, booktitle={Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)}, author={Gehweiler, Joachim and Schomaker, Gunnar}, year={2006}, pages={51–58} }' chicago: Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” In Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 51–58, 2006. https://doi.org/10.1109/ds-rt.2006.15. ieee: J. Gehweiler and G. Schomaker, “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries,” in Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58. mla: Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58, doi:10.1109/ds-rt.2006.15. short: 'J. Gehweiler, G. Schomaker, in: Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58.' date_created: 2020-09-04T09:56:41Z date_updated: 2022-01-06T06:53:57Z department: - _id: '63' doi: 10.1109/ds-rt.2006.15 language: - iso: eng page: 51-58 publication: Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT) publication_identifier: isbn: - '0769526977' publication_status: published status: public title: Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries type: conference user_id: '15415' year: '2006' ... --- _id: '23881' abstract: - lang: eng text: Computing a maximum weighted stable set in a bipartite graph is considered well-solved and usually approached with preflow-push, Ford–Fulkerson or network simplex algorithms. We present a combinatorial algorithm for the problem that is not based on flows. Numerical tests suggest that this algorithm performs quite well in practice and is competitive with flow based algorithms especially in the case of dense graphs. author: - first_name: Ulrich full_name: Faigle, Ulrich last_name: Faigle - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling citation: ama: Faigle U, Frahling G. A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics. 2006:1380-1391. doi:10.1016/j.dam.2005.05.037 apa: Faigle, U., & Frahling, G. (2006). A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics, 1380–1391. https://doi.org/10.1016/j.dam.2005.05.037 bibtex: '@article{Faigle_Frahling_2006, title={A combinatorial algorithm for weighted stable sets in bipartite graphs}, DOI={10.1016/j.dam.2005.05.037}, journal={Discrete Applied Mathematics}, author={Faigle, Ulrich and Frahling, Gereon}, year={2006}, pages={1380–1391} }' chicago: Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.” Discrete Applied Mathematics, 2006, 1380–91. https://doi.org/10.1016/j.dam.2005.05.037. ieee: U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable sets in bipartite graphs,” Discrete Applied Mathematics, pp. 1380–1391, 2006. mla: Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.” Discrete Applied Mathematics, 2006, pp. 1380–91, doi:10.1016/j.dam.2005.05.037. short: U. Faigle, G. Frahling, Discrete Applied Mathematics (2006) 1380–1391. date_created: 2021-09-07T12:54:05Z date_updated: 2022-01-06T06:56:02Z department: - _id: '63' doi: 10.1016/j.dam.2005.05.037 language: - iso: eng page: 1380-1391 publication: Discrete Applied Mathematics publication_identifier: issn: - 0166-218X publication_status: published status: public title: A combinatorial algorithm for weighted stable sets in bipartite graphs type: journal_article user_id: '15415' year: '2006' ... --- _id: '23882' abstract: - lang: eng text: In this paper we develop an efficient implementation for a k-means clustering algorithm. Our algorithm is a variant of KMHybrid [28, 20], i.e. it uses a combination of Lloyd-steps and random swaps, but as a novel feature it uses coresets to speed up the algorithm. A coreset is a small weighted set of points that approximates the original point set with respect to the considered problem. The main strength of the algorithm is that it can quickly determine clusterings of the same point set for many values of k. This is necessary in many applications, since, typically, one does not know a good value for k in advance. Once we have clusterings for many different values of k we can determine a good choice of k using a quality measure of clusterings that is independent of k, for example the average silhouette coefficient. The average silhouette coefficient can be approximated using coresets.To evaluate the performance of our algorithm we compare it with algorithm KMHybrid [28] on typical 3D data sets for an image compression application and on artificially created instances. Our data sets consist of 300,000 to 4.9 million points. We show that our algorithm significantly outperforms KMHybrid on most of these input instances. Additionally, the quality of the solutions computed by our algorithm deviates less than that of KMHybrid.We also computed clusterings and approximate average silhouette coefficient for k=1,…,100 for our input instances and discuss the performance of our algorithm in detail. author: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Frahling G, Sohler C. A fast k-means implementation using coresets. In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06. ; 2006. doi:10.1145/1137856.1137879' apa: Frahling, G., & Sohler, C. (2006). A fast k-means implementation using coresets. In Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06. https://doi.org/10.1145/1137856.1137879 bibtex: '@inproceedings{Frahling_Sohler_2006, title={A fast k-means implementation using coresets}, DOI={10.1145/1137856.1137879}, booktitle={Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06}, author={Frahling, Gereon and Sohler, Christian}, year={2006} }' chicago: Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.” In Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006. https://doi.org/10.1145/1137856.1137879. ieee: G. Frahling and C. Sohler, “A fast k-means implementation using coresets,” in Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06, 2006. mla: Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.” Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006, doi:10.1145/1137856.1137879. short: 'G. Frahling, C. Sohler, in: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006.' date_created: 2021-09-07T13:03:31Z date_updated: 2022-01-06T06:56:02Z department: - _id: '63' doi: 10.1145/1137856.1137879 language: - iso: eng publication: Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06 publication_status: published status: public title: A fast k-means implementation using coresets type: conference user_id: '15415' year: '2006' ... --- _id: '20436' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: Hamann H. Modeling and Investigation of Robot Swarms.; 2006. apa: Hamann, H. (2006). Modeling and Investigation of Robot Swarms. bibtex: '@book{Hamann_2006, title={Modeling and Investigation of Robot Swarms}, author={Hamann, Heiko}, year={2006} }' chicago: Hamann, Heiko. Modeling and Investigation of Robot Swarms, 2006. ieee: H. Hamann, Modeling and Investigation of Robot Swarms. 2006. mla: Hamann, Heiko. Modeling and Investigation of Robot Swarms. 2006. short: H. Hamann, Modeling and Investigation of Robot Swarms, 2006. date_created: 2020-11-19T12:18:36Z date_updated: 2022-01-06T06:54:27Z department: - _id: '63' - _id: '238' language: - iso: eng status: public title: Modeling and Investigation of Robot Swarms type: mastersthesis user_id: '15415' year: '2006' ... --- _id: '17979' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: Schindelhauer C, Volbert K, Ziegler M. Geometric spanners with applications in wireless networks. Computational Geometry. 2006:197-214. doi:10.1016/j.comgeo.2006.02.001 apa: Schindelhauer, C., Volbert, K., & Ziegler, M. (2006). Geometric spanners with applications in wireless networks. Computational Geometry, 197–214. https://doi.org/10.1016/j.comgeo.2006.02.001 bibtex: '@article{Schindelhauer_Volbert_Ziegler_2006, title={Geometric spanners with applications in wireless networks}, DOI={10.1016/j.comgeo.2006.02.001}, journal={Computational Geometry}, author={Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, year={2006}, pages={197–214} }' chicago: Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Geometric Spanners with Applications in Wireless Networks.” Computational Geometry, 2006, 197–214. https://doi.org/10.1016/j.comgeo.2006.02.001. ieee: C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” Computational Geometry, pp. 197–214, 2006. mla: Schindelhauer, Christian, et al. “Geometric Spanners with Applications in Wireless Networks.” Computational Geometry, 2006, pp. 197–214, doi:10.1016/j.comgeo.2006.02.001. short: C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214. date_created: 2020-08-14T13:26:24Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1016/j.comgeo.2006.02.001 language: - iso: eng page: 197-214 publication: Computational Geometry publication_identifier: issn: - 0925-7721 publication_status: published status: public title: Geometric spanners with applications in wireless networks type: journal_article user_id: '15415' year: '2006' ... --- _id: '17985' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: Ziegler M. Effectively open real functions. Journal of Complexity. 2006:827-849. doi:10.1016/j.jco.2006.05.002 apa: Ziegler, M. (2006). Effectively open real functions. Journal of Complexity, 827–849. https://doi.org/10.1016/j.jco.2006.05.002 bibtex: '@article{Ziegler_2006, title={Effectively open real functions}, DOI={10.1016/j.jco.2006.05.002}, journal={Journal of Complexity}, author={Ziegler, Martin}, year={2006}, pages={827–849} }' chicago: Ziegler, Martin. “Effectively Open Real Functions.” Journal of Complexity, 2006, 827–49. https://doi.org/10.1016/j.jco.2006.05.002. ieee: M. Ziegler, “Effectively open real functions,” Journal of Complexity, pp. 827–849, 2006. mla: Ziegler, Martin. “Effectively Open Real Functions.” Journal of Complexity, 2006, pp. 827–49, doi:10.1016/j.jco.2006.05.002. short: M. Ziegler, Journal of Complexity (2006) 827–849. date_created: 2020-08-14T13:40:13Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1016/j.jco.2006.05.002 language: - iso: eng page: 827-849 publication: Journal of Complexity publication_identifier: issn: - 0885-064X publication_status: published status: public title: Effectively open real functions type: journal_article user_id: '15415' year: '2006' ... --- _id: '17987' author: - first_name: Klaus full_name: Meer, Klaus last_name: Meer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: Logical Approaches to Computational Barriers. Berlin, Heidelberg; 2006. doi:10.1007/11780342_39' apa: Meer, K., & Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg. https://doi.org/10.1007/11780342_39 bibtex: '@inbook{Meer_Ziegler_2006, place={Berlin, Heidelberg}, title={Uncomputability Below the Real Halting Problem}, DOI={10.1007/11780342_39}, booktitle={Logical Approaches to Computational Barriers}, author={Meer, Klaus and Ziegler, Martin}, year={2006} }' chicago: Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” In Logical Approaches to Computational Barriers. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11780342_39. ieee: K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006. mla: Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” Logical Approaches to Computational Barriers, 2006, doi:10.1007/11780342_39. short: 'K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.' date_created: 2020-08-14T13:43:09Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11780342_39 language: - iso: eng place: Berlin, Heidelberg publication: Logical Approaches to Computational Barriers publication_identifier: isbn: - '9783540354666' - '9783540354680' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Uncomputability Below the Real Halting Problem type: book_chapter user_id: '15415' year: '2006' ... --- _id: '18351' abstract: - lang: eng text: In this paper the ideas of a new research project are presented. The material flow simu- lator d3FACT insight shall manage multiple parallel and time synchronous simulations to grand the power of real-time visualization in combination with statistical analysis. This research is issued to overcome the conflict of simulation run repetition for a good statistical basis and real-time immersive visualization. A side effect will be the reduc- tion of time needed for simulation experiments. The planned simulation tool has the feature of triggered cloning, i.e., the user can decide during runtime to clone a set of simulations after changing parameters to preserve the original system. The simulations will be aggregated by visualization and statistics. The rendering is planned to overlay several simulations using effects like inking and transparency. Simulation data will be aggregated with statistical functions and diagrams. author: - first_name: 'Wilhelm ' full_name: 'Dangelmaier, Wilhelm ' last_name: Dangelmaier - first_name: 'Daniel ' full_name: 'Huber, Daniel ' last_name: Huber - first_name: 'Christoph ' full_name: 'Laroque, Christoph ' last_name: Laroque - first_name: Mark full_name: Aufenanger, Mark last_name: Aufenanger - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jens full_name: Krokowski, Jens last_name: Krokowski - first_name: Michael full_name: Kortenjan, Michael last_name: Kortenjan citation: ama: 'Dangelmaier W, Huber D, Laroque C, et al. d3FACT insight goes parallel - Aggregation of multiple simulations. In: Simulation and Visualization 2006 (SimViS). SCS European Publishing House; 2006:79-88.' apa: Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski, J., & Kortenjan, M. (2006). d3FACT insight goes parallel - Aggregation of multiple simulations. In Simulation and Visualization 2006 (SimViS) (pp. 79–88). SCS European Publishing House. bibtex: '@inproceedings{Dangelmaier_Huber_Laroque_Aufenanger_Fischer_Krokowski_Kortenjan_2006, title={d3FACT insight goes parallel - Aggregation of multiple simulations}, booktitle={Simulation and Visualization 2006 (SimViS)}, publisher={SCS European Publishing House}, author={Dangelmaier, Wilhelm and Huber, Daniel and Laroque, Christoph and Aufenanger, Mark and Fischer, Matthias and Krokowski, Jens and Kortenjan, Michael}, year={2006}, pages={79–88} }' chicago: Dangelmaier, Wilhelm , Daniel Huber, Christoph Laroque, Mark Aufenanger, Matthias Fischer, Jens Krokowski, and Michael Kortenjan. “D3FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” In Simulation and Visualization 2006 (SimViS), 79–88. SCS European Publishing House, 2006. ieee: W. Dangelmaier et al., “d3FACT insight goes parallel - Aggregation of multiple simulations,” in Simulation and Visualization 2006 (SimViS), 2006, pp. 79–88. mla: Dangelmaier, Wilhelm, et al. “D3FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” Simulation and Visualization 2006 (SimViS), SCS European Publishing House, 2006, pp. 79–88. short: 'W. Dangelmaier, D. Huber, C. Laroque, M. Aufenanger, M. Fischer, J. Krokowski, M. Kortenjan, in: Simulation and Visualization 2006 (SimViS), SCS European Publishing House, 2006, pp. 79–88.' date_created: 2020-08-26T09:48:35Z date_updated: 2022-01-06T06:53:29Z department: - _id: '63' language: - iso: eng page: 79-88 publication: Simulation and Visualization 2006 (SimViS) publisher: SCS European Publishing House status: public title: d³FACT insight goes parallel - Aggregation of multiple simulations type: conference user_id: '15415' year: '2006' ... --- _id: '18672' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj citation: ama: Sohler C, Czumaj A. Sublinear-time Algorithms. EATCS Bulletin. 2006;(89):23--47. apa: Sohler, C., & Czumaj, A. (2006). Sublinear-time Algorithms. EATCS Bulletin, (89), 23--47. bibtex: '@article{Sohler_Czumaj_2006, title={Sublinear-time Algorithms}, number={89}, journal={EATCS Bulletin}, author={Sohler, Christian and Czumaj, Artur}, year={2006}, pages={23--47} }' chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS Bulletin, no. 89 (2006): 23--47.' ieee: C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” EATCS Bulletin, no. 89, pp. 23--47, 2006. mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS Bulletin, no. 89, 2006, pp. 23--47. short: C. Sohler, A. Czumaj, EATCS Bulletin (2006) 23--47. date_created: 2020-08-31T08:18:02Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' issue: '89' language: - iso: eng page: 23--47 publication: EATCS Bulletin status: public title: Sublinear-time Algorithms type: journal_article user_id: '15415' year: '2006' ... --- _id: '16462' author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Bettina full_name: Rehberg, Bettina last_name: Rehberg citation: ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F, Rehberg B. Efficient Parallel Algorithms. In: Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006:137-153.' apa: 'Bonorden, O., Gehweiler, J., Meyer auf der Heide, F., & Rehberg, B. (2006). Efficient Parallel Algorithms. Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, 181, 137–153.' bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_Rehberg_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Parallel Algorithms}, volume={181}, booktitle={Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Rehberg, Bettina}, year={2006}, pages={137–153}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: 'Bonorden, Olaf, Joachim Gehweiler, Friedhelm Meyer auf der Heide, and Bettina Rehberg. “Efficient Parallel Algorithms.” In Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, 181:137–53. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.' ieee: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, and B. Rehberg, “Efficient Parallel Algorithms,” in Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, 2006, vol. 181, pp. 137–153.' mla: 'Bonorden, Olaf, et al. “Efficient Parallel Algorithms.” Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, vol. 181, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–53.' short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, B. Rehberg, in: Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–153.' date_created: 2020-04-08T07:54:09Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' - _id: '26' intvolume: ' 181' language: - iso: eng page: 137-153 publication: 'Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing' publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Efficient Parallel Algorithms type: conference user_id: '5786' volume: 181 year: '2006' ... --- _id: '16472' author: - first_name: Erik D. full_name: Demaine, Erik D. last_name: Demaine - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Rasmus full_name: Pagh, Rasmus last_name: Pagh - first_name: Mihai full_name: Pǎtraşcu, Mihai last_name: Pǎtraşcu citation: ama: 'Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In: LATIN 2006: Theoretical Informatics. Berlin, Heidelberg; 2006. doi:10.1007/11682462_34' apa: 'Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/11682462_34' bibtex: '@inbook{Demaine_Meyer auf der Heide_Pagh_Pǎtraşcu_2006, place={Berlin, Heidelberg}, title={De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}, DOI={10.1007/11682462_34}, booktitle={LATIN 2006: Theoretical Informatics}, author={Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, year={2006} }' chicago: 'Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Pǎtraşcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11682462_34.' ieee: 'E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.' mla: 'Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.' short: 'E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.' date_created: 2020-04-08T09:36:10Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11682462_34 language: - iso: eng place: Berlin, Heidelberg publication: 'LATIN 2006: Theoretical Informatics' publication_identifier: isbn: - '9783540327554' - '9783540327561' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space) type: book_chapter user_id: '15415' year: '2006' ... --- _id: '16473' author: - first_name: M. full_name: Dynia, M. last_name: Dynia - first_name: J. full_name: Kutyłowski, J. last_name: Kutyłowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2006. doi:10.1007/11821069_29' apa: Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29 bibtex: '@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin, Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={10.1007/11821069_29}, booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }' chicago: Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11821069_29. ieee: M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006. mla: Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29. short: 'M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.' date_created: 2020-04-08T09:38:28Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11821069_29 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540377917' - '9783540377931' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Smart Robot Teams Exploring Sparse Trees type: book_chapter user_id: '15415' year: '2006' ... --- _id: '16476' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Jarosław full_name: Kutyłowski, Jarosław last_name: Kutyłowski - first_name: Paweł full_name: Lorek, Paweł last_name: Lorek - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Dynia M, Kutyłowski J, Lorek P, Meyer auf der Heide F. Maintaining Communication Between an Explorer and a Base Station. In: IFIP International Federation for Information Processing. Boston, MA; 2006. doi:10.1007/978-0-387-34733-2_14' apa: Dynia, M., Kutyłowski, J., Lorek, P., & Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In IFIP International Federation for Information Processing. Boston, MA. https://doi.org/10.1007/978-0-387-34733-2_14 bibtex: '@inbook{Dynia_Kutyłowski_Lorek_Meyer auf der Heide_2006, place={Boston, MA}, title={Maintaining Communication Between an Explorer and a Base Station}, DOI={10.1007/978-0-387-34733-2_14}, booktitle={IFIP International Federation for Information Processing}, author={Dynia, Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm}, year={2006} }' chicago: Dynia, Miroslaw, Jarosław Kutyłowski, Paweł Lorek, and Friedhelm Meyer auf der Heide. “Maintaining Communication Between an Explorer and a Base Station.” In IFIP International Federation for Information Processing. Boston, MA, 2006. https://doi.org/10.1007/978-0-387-34733-2_14. ieee: M. Dynia, J. Kutyłowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining Communication Between an Explorer and a Base Station,” in IFIP International Federation for Information Processing, Boston, MA, 2006. mla: Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.” IFIP International Federation for Information Processing, 2006, doi:10.1007/978-0-387-34733-2_14. short: 'M. Dynia, J. Kutyłowski, P. Lorek, F. Meyer auf der Heide, in: IFIP International Federation for Information Processing, Boston, MA, 2006.' date_created: 2020-04-08T11:13:52Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-0-387-34733-2_14 language: - iso: eng place: Boston, MA publication: IFIP International Federation for Information Processing publication_identifier: isbn: - '9780387346328' - '9780387347332' issn: - 1571-5736 publication_status: published status: public title: Maintaining Communication Between an Explorer and a Base Station type: book_chapter user_id: '15415' year: '2006' ... --- _id: '17011' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Andreas full_name: Kuhmlehn, Andreas last_name: Kuhmlehn - first_name: Jaroslaw full_name: Kutylowski, Jaroslaw last_name: Kutylowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: Dynia M, Kuhmlehn A, Kutylowski J, Meyer auf der Heide F, Schindelhauer C. SmartS Simulator Design.; 2006. apa: Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). SmartS Simulator Design. bibtex: '@book{Dynia_Kuhmlehn_Kutylowski_Meyer auf der Heide_Schindelhauer_2006, title={SmartS Simulator Design}, author={Dynia, Miroslaw and Kuhmlehn, Andreas and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }' chicago: Dynia, Miroslaw, Andreas Kuhmlehn, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. SmartS Simulator Design, 2006. ieee: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, SmartS Simulator Design. 2006. mla: Dynia, Miroslaw, et al. SmartS Simulator Design. 2006. short: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, C. Schindelhauer, SmartS Simulator Design, 2006. date_created: 2020-05-18T13:52:43Z date_updated: 2022-01-06T06:53:02Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-05T10:06:52Z date_updated: 2020-08-05T10:06:52Z file_id: '17620' file_name: smarts-design.pdf file_size: 147312 relation: main_file success: 1 file_date_updated: 2020-08-05T10:06:52Z has_accepted_license: '1' language: - iso: eng publication_status: published status: public title: SmartS Simulator Design type: report user_id: '15415' year: '2006' ... --- _id: '19611' author: - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: Volbert K. Geometric Spanners for Topology Control in Wireless Networks. Vol 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Volbert, K. (2005). Geometric Spanners for Topology Control in Wireless Networks (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Volbert_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Geometric Spanners for Topology Control in Wireless Networks}, volume={168}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Volbert, Klaus}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Vol. 168. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-09-22T07:40:37Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 168' language: - iso: eng publication_identifier: isbn: - 3-935433-77-8 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101556 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Geometric Spanners for Topology Control in Wireless Networks type: dissertation user_id: '5786' volume: 168 year: '2005' ... --- _id: '19827' abstract: - lang: eng text: "We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1).\r\n\r\nThe Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled d-regular graph G to G' is equal to those from G' to G. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled d-regular graphs. For degree d ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely.\r\n\r\nWe use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled." author: - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Mahlmann P, Schindelhauer C. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05. ; 2005. doi:10.1145/1073970.1073992' apa: Mahlmann, P., & Schindelhauer, C. (2005). Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05. https://doi.org/10.1145/1073970.1073992 bibtex: '@inproceedings{Mahlmann_Schindelhauer_2005, title={Peer-to-peer networks based on random transformations of connected regular undirected graphs}, DOI={10.1145/1073970.1073992}, booktitle={Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2005} }' chicago: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005. https://doi.org/10.1145/1073970.1073992. ieee: P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05, 2005. mla: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005, doi:10.1145/1073970.1073992. short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005.' date_created: 2020-10-01T09:50:59Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1073970.1073992 language: - iso: eng publication: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05 publication_identifier: isbn: - '1581139861' publication_status: published status: public title: Peer-to-peer networks based on random transformations of connected regular undirected graphs type: conference user_id: '15415' year: '2005' ... --- _id: '19834' abstract: - lang: eng text: 'We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). Each node can establish a cell classification of its neighborhood based on the position data which is announced by all nodes.
The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.
For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.
While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear
combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. In: 19th IEEE International Parallel and Distributed Processing Symposium. ; 2005:248. doi:10.1109/ipdps.2005.147' apa: Rührup, S., & Schindelhauer, C. (2005). Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. 19th IEEE International Parallel and Distributed Processing Symposium, 248. https://doi.org/10.1109/ipdps.2005.147 bibtex: '@inproceedings{Rührup_Schindelhauer_2005, title={Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}, DOI={10.1109/ipdps.2005.147}, booktitle={19th IEEE International Parallel and Distributed Processing Symposium}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005}, pages={248} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” In 19th IEEE International Parallel and Distributed Processing Symposium, 248, 2005. https://doi.org/10.1109/ipdps.2005.147. ieee: 'S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure,” in 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi: 10.1109/ipdps.2005.147.' mla: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147. short: 'S. Rührup, C. Schindelhauer, in: 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248.' date_created: 2020-10-01T11:27:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/ipdps.2005.147 language: - iso: eng page: '248' publication: 19th IEEE International Parallel and Distributed Processing Symposium publication_identifier: isbn: - '0769523129' publication_status: published status: public title: Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure type: conference user_id: '15415' year: '2005' ... --- _id: '19835' abstract: - lang: eng text: The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion. author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: 'Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005). Vol 3738. ; 2005:244-257. doi:10.1007/11561354_21' apa: Rührup, S., Schindelhauer, C., & Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) (Vol. 3738, pp. 244–257). https://doi.org/10.1007/11561354_21 bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={10.1007/11561354_21}, booktitle={Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2005}, pages={244–257} }' chicago: Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 3738:244–57, 2005. https://doi.org/10.1007/11561354_21. ieee: S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257. mla: Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21. short: 'S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257.' date_created: 2020-10-01T11:31:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_21 intvolume: ' 3738' language: - iso: eng page: 244-257 publication: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Performance Analysis of the Hierarchical Layer Graph for Wireless Networks type: conference user_id: '15415' volume: 3738 year: '2005' ...