Change search
ReferencesLink to record
Permanent link

Direct link
Creating and maintaining topologies in wireless networks
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
2006 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Wireless ad-hoc networks differs in many aspects compared to traditional infrastructured networks. Among other things, individual nodes cannot be expected to know the topology of the entire network. Also, since nodes typically are powered by batteries and eventually will run out of energy, it is imperative for algorithms to minimize the energy cost while distributing it as fairly as possible over all nodes in the network. This thesis covers different types of distributed algorithms for wireless networks, where all of them in some way creates or maintains a topology in order to facilitate communication in the network. The thesis comprises three scientific papers. The first paper concerns clustering, dividing the set of nodes in a network into subsets based on the network's connectivity graph. We propose a new clustering algorithm which uses the novel idea to maintain an existing clustering structure rather than creating a new structure from scratch, in order to minimize the changes in the structure as well as the communication overhead. The second paper covers interference reduction through topology control. We discuss previous work in how to measure interference, and present new metrics that aims to measure the average interference of the network rather than just the worst path. We also propose a new topology control algorithm and compare its performance to previous topology control algorithms, using our as well as previous interference models. In the third paper, we present a power-aware routing algorithm for Bluetooth networks. Unless similar previous work, our algorithm does not require the nodes to have any knowledge of the network except for their neighbors. By collecting path information in the routing messages, individual nodes can still make routing decisions in order to avoid nodes that are close to being depleted of energy. We also present a simplified version of the algorithm for general wireless ad-hoc networks.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2006. , 58 p.
Series
Licentiate thesis / Luleå University of Technology, ISSN 1402-1757 ; 2006:42
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-18296Local ID: 7dcb4390-74b4-11db-962b-000ea68e967bOAI: oai:DiVA.org:ltu-18296DiVA: diva2:991303
Note
Godkänd; 2006; 20061115 (ysko)Available from: 2016-09-29 Created: 2016-09-29Bibliographically approved

Open Access in DiVA

fulltext(556 kB)6 downloads
File information
File name FULLTEXT01.pdfFile size 556 kBChecksum SHA-512
cca05d3a89d85857eec080d9e6ae4e4da67d04fe7bb127efd67aeda3182fa4d4c54673b3d7a227f451b4248b1d775ca9b492a13de9f4d2241b943dcc29d8c488
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Johansson, Tomas
By organisation
Embedded Internet Systems Lab

Search outside of DiVA

GoogleGoogle Scholar
Total: 6 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link