SWIM : a new multicast routing algorithm for wireless networks

Download

index.pdf

Date

2011

Author

Akyürek, Alper Sinan

Metadata

Show full item record

Item Usage Stats

209
views

91
downloads

In this work, a new multicast routing algorithm for wireless networks is presented. The algorithm, called SWIM (Source-initiated WIreless Multicast), is a depth-optimal multicast tree formation algorithm. SWIM is fully distributed and has an average computational complexity of O(N 2 ). SWIM forms a shared tree from the source(s) to destinations; yet, as a by-product, it creates a multicast mesh structure by maintaining alternative paths at every tree node. This makes SWIM suitable for both ad hoc networks and access networks with multiple gateways. An extension to the main algorithm is presented for the use in dynamic networks with mobility and/or dynamic destination group. Performance of SWIM is studied with simulations and is compared to other algorithms in the literature. Due to depth optimality, SWIM achieves a lower average and maximum delay than the compared algorithms. The throughput performance is found to be high. Working capability with rateless codes are also studied.

Subject Keywords

Wireless communication systems.

URI

http://etd.lib.metu.edu.tr/upload/12613348/index.pdf
https://hdl.handle.net/11511/20650

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Blind channel estimation based on the Lloyd-Max algorithm innarrowband fading channels and jamming Dizdar, Onur; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2011) In wireless communications, knowledge of the channel coefficients is required for coherent demodulation. In this thesis, a blind channel estimation method based on the Lloyd-Max algorithm is proposed for single-tap fading channels. The algorithm estimates the constellation points for the received signal using an iterative least squares approach. The algorithm is investigated for fast-frequency hopping systems with small block lengths and operating under partial-band and partial-time jamming for both detecti...
Path planning and localization for mobile anchor based wireless sensor networks Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017) In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...
Life time sensitive weighted clustering on wireless sensor networks Alizadeh Jarchlo, Elnaz; Bazlamaçcı, Cüneyt Fehmi; Department of Information Systems (2013) Wireless Sensor Networks typically include wireless sensor nodes with limited energy. Network lifetime and scalability are considered as two significant requirements for sensor network applications. In order to decrease energy consumption and increase network lifetime one can apply an efficient clustering method. The application of the clustering method proposed in this thesis (LTS-WCA) leads to reducing the energy cost and the transmission distance of each node by grouping the nodes in several clusters and...
Cooperative Multiple-Access in Fading Relay Channels Yılmaz, Ayşen (2006-06-15) Virtual antenna arrays can be constructed via relaying even in the case that there is insufficient physical space or other resources for multiple antennae on wireless nodes. When there is a multiple access scenario, relaying offers a variety of ways to establish communication between source and destination nodes. We will compare a scheme based on space division multiple access to previously studied time division based ones. We observe that space division improves especially the ergodic capacity.
Evaluation of Terahertz Channel in Data Centers MOLLAHASANİ, Shahram; Onur, Ertan (2016-04-29) Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in a data center as a complemen...

Citation Formats

A. S. Akyürek, “SWIM : a new multicast routing algorithm for wireless networks,” M.S. - Master of Science, Middle East Technical University, 2011.