FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1502442628> ?p ?o ?g. }

• W1502442628 abstract "This thesis addresses optimization problems in wireless communication networks. An optimization problem describes a situation in which one wants to find an optimal solution among all solutions. Mathematicians study an optimization problem to find a general method that provides an answer to each instance of the problem. We call such a method an algorithm. In particular we are interested in finding an efficient algorithm, an algorithm that provides an answer fast. We use complexity theory to classify a problem based on the existence of an efficient algorithm for this problem. Complexity theory focuses on a worst-case analysis, which reflects the uncertainty we have on future instances of the problem. There is a class of optimization problems, called NP-hard problems, for which mathematicians do not know whether there exists an efficient algorithm, and it is widely believed that such an algorithm does not even exist. Therefore, for this class of problems we are interested in finding efficient approximation algorithms that provide an approximate optimal solution. Wireless networks have become an important means of communication, and the use of wireless networks is likely to increase in future years. A main optimization problem in these wireless networks is to communicate data over the network to a central node. This is called data gathering. The quality of a solution depends on multiple criteria, which include the energy costs of communication, and the delay in communication. In this thesis we formulate mathematical models for several gathering problems in wireless networks. The problems we consider are online and distributed by nature; i.e. problem information becomes known over time, and the problem information is distributed over the network. Therefore we focus on online distributed algorithms, which take these restrictions into account. An online approximation algorithm that provides a good approximate solution is also called competitive. For each of the problems we consider, we analyze the theoretical complexity of the problem, we devise online algorithms, and we analyze the quality of the solutions of these algorithms. In Chapter 1 we introduce general concepts and definitions related to optimization problems, and their mathematical formulation. Also, we outline the wireless communication problems addressed in this thesis, and our results. In Chapter 2 we give a background on wireless networks, introducing definitions, concepts and common problems in this field. These problems form the motivation for the optimization problems which we describe and analyze in the following chapters. Chapters 3 and 4 discuss a gathering problem in a wireless network, with constraints on packet latency, and the possibility of data aggregation. Nodes may delay messages in order to aggregate multiple messages into a single packet, and forward this packet to the sink. This aggregation reduces the communication costs at the expense of an increased message latency. We are interested in finding online algorithms that minimize both the message latencies, and the network communication costs, i.e. the energy use of the nodes. In Chapter 3 we focus on the problem with arbitrary latency constraints which are modeled as hard constraints. The objective is to minimize the maximum communication costs of a node. Our main results are the following. We prove that the problem is NP-hard, and we provide offline and online approximation algorithms. We show that our algorithms are robust, in the sense that they have similar competitive ratios in case we choose as objective to minimize the sum of communication costs, in case we assume the cost function to be concave, or in case we limit the possibilities of aggregation. In Chapter 4 we consider the same problem, but focus on constant latencies which are modeled as soft constraints. We use bicriteria optimization to find solutions with both low costs and small packet latencies. The main contributions of this chapter are that we present a constant competitive online distributed algorithm for this problem, in case the latency constraints are not too strict, and an analysis of the almost synchronous time model, a new time model. Chapters 5 and 6 discuss a gathering problem in a wireless network with interference. Interference influences the design of communication algorithms, because it prevents nodes within the same region to communicate simultaneously. We are interested in finding online algorithms that send packets to the sink as fast as possible, explicitly taking into account interference constraints. We use completion times and flow times as performance measures for the solution. In Chapter 5 we analyze the problem with objective to minimize completion times. We focus on minimizing the maximum completion time. We prove that this problem is NP-hard, even in a special case, solving an open problem. We present a class of constant competitive online algorithms. In Chapter 6 we consider the wireless gathering problem with objective to minimize flow times, the time packets are in the network. We classify the problem with objective minimizing maximum flow times, and with objective minimizing average flow times; our results indicate that it is unlikely to find efficient algorithms for these problems. Then we present an online distributed algorithm which is near-optimal in case the algorithm can send packets at a faster speed than currently available; the speed factor gives an indication of the effect of faster communication devices on the quality of the solution." @default.
• W1502442628 created "2016-06-24" @default.
• W1502442628 creator A5004885683 @default.
• W1502442628 date "2008-01-01" @default.
• W1502442628 modified "2023-10-16" @default.
• W1502442628 title "Online gathering algorithms for wireless networks" @default.
• W1502442628 cites W1483484469 @default.
• W1502442628 cites W1552828154 @default.
• W1502442628 cites W1573984806 @default.
• W1502442628 cites W1584243868 @default.
• W1502442628 cites W1604294455 @default.
• W1502442628 cites W1896822992 @default.
• W1502442628 cites W1932124839 @default.
• W1502442628 cites W1972868674 @default.
• W1502442628 cites W1987752709 @default.
• W1502442628 cites W1990313671 @default.
• W1502442628 cites W1992365371 @default.
• W1502442628 cites W1998986058 @default.
• W1502442628 cites W2011039300 @default.
• W1502442628 cites W2018093989 @default.
• W1502442628 cites W2027682573 @default.
• W1502442628 cites W2031816824 @default.
• W1502442628 cites W2034112563 @default.
• W1502442628 cites W2038277544 @default.
• W1502442628 cites W2046306310 @default.
• W1502442628 cites W2053913299 @default.
• W1502442628 cites W2058322021 @default.
• W1502442628 cites W2061990624 @default.
• W1502442628 cites W2080750094 @default.
• W1502442628 cites W2087746279 @default.
• W1502442628 cites W2106261559 @default.
• W1502442628 cites W2108572615 @default.
• W1502442628 cites W2113529358 @default.
• W1502442628 cites W2114853176 @default.
• W1502442628 cites W2115375706 @default.
• W1502442628 cites W2117081489 @default.
• W1502442628 cites W2118487515 @default.
• W1502442628 cites W2121255383 @default.
• W1502442628 cites W2126644064 @default.
• W1502442628 cites W2137560895 @default.
• W1502442628 cites W2139559439 @default.
• W1502442628 cites W2142458954 @default.
• W1502442628 cites W2144289297 @default.
• W1502442628 cites W2150847784 @default.
• W1502442628 cites W2151113359 @default.
• W1502442628 cites W2159472851 @default.
• W1502442628 cites W2160543991 @default.
• W1502442628 cites W2162846859 @default.
• W1502442628 cites W2163208395 @default.
• W1502442628 cites W2168452204 @default.
• W1502442628 cites W2170715240 @default.
• W1502442628 cites W2295428206 @default.
• W1502442628 cites W2610183793 @default.
• W1502442628 cites W2611515161 @default.
• W1502442628 cites W2611804663 @default.
• W1502442628 cites W3103987592 @default.
• W1502442628 cites W3137220996 @default.
• W1502442628 cites W623667239 @default.
• W1502442628 cites W78769 @default.
• W1502442628 cites W108213940 @default.
• W1502442628 hasPublicationYear "2008" @default.
• W1502442628 type Work @default.
• W1502442628 sameAs 1502442628 @default.
• W1502442628 citedByCount "3" @default.
• W1502442628 countsByYear W15024426282012 @default.
• W1502442628 crossrefType "journal-article" @default.
• W1502442628 hasAuthorship W1502442628A5004885683 @default.
• W1502442628 hasConcept C108037233 @default.
• W1502442628 hasConcept C11413529 @default.
• W1502442628 hasConcept C126255220 @default.
• W1502442628 hasConcept C127413603 @default.
• W1502442628 hasConcept C137836250 @default.
• W1502442628 hasConcept C148764684 @default.
• W1502442628 hasConcept C154945302 @default.
• W1502442628 hasConcept C196921405 @default.
• W1502442628 hasConcept C2777212361 @default.
• W1502442628 hasConcept C33923547 @default.
• W1502442628 hasConcept C41008148 @default.
• W1502442628 hasConcept C555944384 @default.
• W1502442628 hasConcept C62611344 @default.
• W1502442628 hasConcept C66938386 @default.
• W1502442628 hasConcept C76155785 @default.
• W1502442628 hasConceptScore W1502442628C108037233 @default.
• W1502442628 hasConceptScore W1502442628C11413529 @default.
• W1502442628 hasConceptScore W1502442628C126255220 @default.
• W1502442628 hasConceptScore W1502442628C127413603 @default.
• W1502442628 hasConceptScore W1502442628C137836250 @default.
• W1502442628 hasConceptScore W1502442628C148764684 @default.
• W1502442628 hasConceptScore W1502442628C154945302 @default.
• W1502442628 hasConceptScore W1502442628C196921405 @default.
• W1502442628 hasConceptScore W1502442628C2777212361 @default.
• W1502442628 hasConceptScore W1502442628C33923547 @default.
• W1502442628 hasConceptScore W1502442628C41008148 @default.
• W1502442628 hasConceptScore W1502442628C555944384 @default.
• W1502442628 hasConceptScore W1502442628C62611344 @default.
• W1502442628 hasConceptScore W1502442628C66938386 @default.
• W1502442628 hasConceptScore W1502442628C76155785 @default.
• W1502442628 hasLocation W15024426281 @default.
• W1502442628 hasOpenAccess W1502442628 @default.
• W1502442628 hasPrimaryLocation W15024426281 @default.

• next