Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Practical Methods for Wireless Network Coding With Multiple Unicast Transmissions
Download
index.pdf
Date
2013-03-01
Author
Aktas, Tugcan
Yılmaz, Ali Özgür
AKTAŞ, EMRE
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
176
views
114
downloads
Cite This
We propose a simple yet effective wireless network coding and decoding technique for a multiple unicast network. It utilizes spatial diversity through cooperation between nodes which carry out distributed encoding operations dictated by generator matrices of linear block codes. In order to exemplify the technique, we make use of greedy codes over the binary field and show that the arbitrary diversity orders can be flexibly assigned to nodes. Furthermore, we present the optimal detection rule for the given model that accounts for intermediate node errors and suggest a low-complexity network decoder using the sum-product (SP) algorithm. The proposed SP detector exhibits near optimal performance. We also show asymptotic superiority of network coding over a method that utilizes the wireless channel in a repetitive manner without network coding (NC) and give related rate-diversity trade-off curves. Finally, we extend the given encoding method through selective encoding in order to obtain extra coding gains.
Subject Keywords
Wireless network coding
,
Cooperative communication
,
Linear block code
,
Sum-product decoding
,
unequal error protection
URI
https://hdl.handle.net/11511/35374
Journal
IEEE TRANSACTIONS ON COMMUNICATIONS
DOI
https://doi.org/10.1109/tcomm.2012.010913.110844
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Practical Wireless Network Coding and Decoding Methods for Multiple Unicast Transmissions
Aktas, Tugcan; Yılmaz, Ali Özgür; Aktas, Emre (2012-04-04)
We propose a simple yet effective wireless network coding (NC) and decoding technique. It utilizes spatial diversity through cooperation between nodes which carry out distributed encoding operations dictated by generator matrices of linear block codes. For this purpose, we make use of greedy codes over the binary field and show that desired diversity orders can be flexibly assigned to nodes in a multiple unicast network, contrary to the previous findings in the literature. Furthermore, we present the optima...
Wireless network coding for multiple unicast transmissions
Aktaş, Tuğcan; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2014)
In this work, firstly we propose a practical and effective cooperative communication technique based on network coding (NC) in order to mitigate the detrimental consequences of fading in wireless channels. We base our formulation on multiple unicast transmissions which is the natural way of communication in many modern wireless networks. The proposed technique utilizes spatial diversity through cooperation between overhearing nodes which carry out distributed encoding operations dictated by the generator ma...
SWIM : a new multicast routing algorithm for wireless networks
Akyürek, Alper Sinan; Uysal Bıyıkoğlu, Elif; Department of Electrical and Electronics Engineering (2011)
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 a...
Differential network coding in wireless networks Telsiz aǧlarda farksal aǧ kodlamasi
Özdemir, Özgür; Yılmaz, Ali Özgür (2009-10-29)
In this paper a three-terminal communication scenario where two users exchange information by employing differential binary modulation and network coding via a relay is considered. The transmission is divided into three slots in time where the first and second slots are allocated to the transmission of differential encoded data of the users. After demodulation, the relay broadcasts the bit-wise XOR-ed and differential encoded packet to the users in the third slot. The optimum detector and a simplified decis...
Evaluation of priority dependent and time scheduled MAC layer protocols for ad-hoc networks
Erdeğer, İsmail; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2015)
Ad-hoc networks have very unique features, such as dynamic topologies, relatively limited bandwidth and wireless signal propagation schemes, which present various challenges for wireless communication. In this thesis, control mechanisms for channel access scheduling and topology in ad-hoc networks are evaluated, which utilize the information from two-hop neighborhood to cope with the communication difficulties in ad-hoc networks. Channel assignment is one of the most important topics for ad-hoc networks. Ch...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. Aktas, A. Ö. Yılmaz, and E. AKTAŞ, “Practical Methods for Wireless Network Coding With Multiple Unicast Transmissions,”
IEEE TRANSACTIONS ON COMMUNICATIONS
, pp. 1123–1133, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35374.