Learning Centre

Distributed optimization algorithms for multihop wireless networks

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Schumacher, André
dc.date.accessioned 2012-08-29T09:49:42Z
dc.date.available 2012-08-29T09:49:42Z
dc.date.issued 2010
dc.identifier.isbn 978-952-60-3481-2 (PDF)
dc.identifier.isbn 978-952-60-3480-5 (printed) #8195;
dc.identifier.issn 1797-5069
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/4899
dc.description.abstract Recent technological advances in low-cost computing and communication hardware design have led to the feasibility of large-scale deployments of wireless ad hoc and sensor networks. Due to their wireless and decentralized nature, multihop wireless networks are attractive for a variety of applications. However, these properties also pose significant challenges to their developers and therefore require new types of algorithms. In cases where traditional wired networks usually rely on some kind of centralized entity, in multihop wireless networks nodes have to cooperate in a distributed and self-organizing manner. Additional side constraints, such as energy consumption, have to be taken into account as well. This thesis addresses practical problems from the domain of multihop wireless networks and investigates the application of mathematically justified distributed algorithms for solving them. Algorithms that are based on a mathematical model of an underlying optimization problem support a clear understanding of the assumptions and restrictions that are necessary in order to apply the algorithm to the problem at hand. Yet, the algorithms proposed in this thesis are simple enough to be formulated as a set of rules for each node to cooperate with other nodes in the network in computing optimal or approximate solutions. Nodes communicate with their neighbors by sending messages via wireless transmissions. Neither the size nor the number of messages grows rapidly with the size of the network. The thesis represents a step towards a unified understanding of the application of distributed optimization algorithms to problems from the domain of multihop wireless networks. The problems considered serve as examples for related problems and demonstrate the design methodology of obtaining distributed algorithms from mathematical optimization methods. en
dc.format.extent Verkkokirja (1330 KB, 151 s.)
dc.format.mimetype application/pdf
dc.language.iso en en
dc.publisher Aalto-yliopiston teknillinen korkeakoulu en
dc.relation.ispartofseries TKK dissertations in information and computer science 22 en
dc.subject.other Computer science
dc.title Distributed optimization algorithms for multihop wireless networks en
dc.type G4 Monografiaväitöskirja fi
dc.contributor.school Aalto-yliopiston teknillinen korkeakoulu fi
dc.contributor.department Tietojenkäsittelytieteen laitos fi
dc.contributor.department Department of Information and Computer Science en
dc.subject.keyword ad hoc network en
dc.subject.keyword approximation algorithm en
dc.subject.keyword distributed algorithm en
dc.subject.keyword lifetime maximization en
dc.subject.keyword network optimization en
dc.subject.keyword network utility maximization en
dc.subject.keyword optimization algorithm en
dc.subject.keyword primal-dual algorithm en
dc.subject.keyword routing en
dc.subject.keyword sensor network en
dc.subject.keyword sleep scheduling en
dc.subject.keyword wireless communication en
dc.identifier.urn URN:ISBN:978-952-60-3481-2
dc.type.dcmitype text en
dc.type.ontasot Väitöskirja (monografia) fi
dc.type.ontasot Doctoral dissertation (monograph) en
dc.contributor.supervisor Orponen, Pekka, Prof.


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse