Elibrary Perpustakaan Universitas Riau

Ebook, artikel jurnal dan artikel ilmiah

  • Beranda
  • Informasi
  • Berita
  • Bantuan
  • Pustakawan
  • Area Anggota
  • Pilih Bahasa :
    Bahasa Arab Bahasa Bengal Bahasa Brazil Portugis Bahasa Inggris Bahasa Spanyol Bahasa Jerman Bahasa Indonesia Bahasa Jepang Bahasa Melayu Bahasa Persia Bahasa Rusia Bahasa Thailand Bahasa Turki Bahasa Urdu

Pencarian berdasarkan :

SEMUA Pengarang Subjek ISBN/ISSN Pencarian Spesifik

Pencarian terakhir:

{{tmpObj[k].text}}
No image available for this title
Penanda Bagikan

e-journal

Minimizing Expected Transmissions Multicast in Wireless Multihop Networks

Kostas Christodoulopoulos - Nama Orang; Christos Papageorgiou - Nama Orang; Emmanouel Varvarigos - Nama Orang;

We address the multicast problem in a wireless multihop network in the presence of errors. Finding the multicast schedule that minimizes the expected number of transmissions, while accounting for both the wireless broadcast advantage (WBA) and the wireless unreliable transmission (WUT) characteristics, has not been solved optimally before. We formally define the problem and propose an initial algorithm of non-polynomial complexity to obtain the optimal solution. The algorithm starts by transforming the wireless network topology into an auxiliary expanded graph that captures the WBA property, and assigning appropriate weights to the links so as to capture the WUT property. The proposed transformation is interesting on its own merit, since it permits us to consider only point-to-point transmissions (as in wireline networks) in the expanded graph, instead of the point-to-multipoint transmissions present in the original wireless network, and can also be useful in other optimization problems some of which we briefly describe. By solving the minimum Steiner tree problem on the expanded graph we obtain the optimal multicast solution for the initial graph. Since the optimal algorithm is of non-polynomial complexity, we also propose a number of heuristic algorithms. In particular, we first present a truncated graph transformation and then describe two heuristic algorithms for obtaining the multicast schedule. Simulation results show that the proposed heuristics have performance close to that of the optimal algorithm, at least for the instances for which we were able to track optimal solutions, while outperforming other heuristic multicast algorithms


Ketersediaan

Tidak ada salinan data

Informasi Detail
Judul Seri
Wireless Inf Networks
No. Panggil
-
Penerbit
New York : Springer Science., 2015
Deskripsi Fisik
Int J Wireless Inf Networks (2015) 22:205–219
Bahasa
English
ISBN/ISSN
DOI 10.1007/s10776-0
Klasifikasi
-
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
(2015) 22
Subjek
JARINGAN INFORMASI
Info Detail Spesifik
-
Pernyataan Tanggungjawab
deliza
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
  • FULLTEXT: Minimizing Expected Transmissions Multicast in Wireless Multihop Networks
Komentar

Anda harus masuk sebelum memberikan komentar

Elibrary Perpustakaan Universitas Riau
  • Informasi
  • Layanan
  • Pustakawan
  • Area Anggota

Tentang Kami

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Cari

masukkan satu atau lebih kata kunci dari judul, pengarang, atau subjek

Donasi untuk SLiMS Kontribusi untuk SLiMS?

© 2025 — Senayan Developer Community

Ditenagai oleh SLiMS
Pilih subjek yang menarik bagi Anda
  • Karya Umum
  • Filsafat
  • Agama
  • Ilmu-ilmu Sosial
  • Bahasa
  • Ilmu-ilmu Murni
  • Ilmu-ilmu Terapan
  • Kesenian, Hiburan, dan Olahraga
  • Kesusastraan
  • Geografi dan Sejarah
Icons made by Freepik from www.flaticon.com
Pencarian Spesifik
Kemana ingin Anda bagikan?