Cooperative wireless networks

In the last few years, there have been a lot of interests in wireless ad-hoc networks as they have remarkable commercial and military applications. Such wireless networks have the benefit of avoiding a wired infrastructure. However, signal fading is a severe problem for wireless communications particularly for the multi-hop transmissions in the ad-hoc networks. Cooperative communication has been proposed as an effective way to improve the quality of wireless links. The key idea is to have multiple wireless devices at different locations cooperatively share their antenna resources and aid each other’s transmission. In this thesis, we develop effective algorithms for cooperative wireless ad-hoc networks, and the performance of cooperative communication is measured based on various criteria, such as cooperative region, power ratio and end-to-end performance. For example, the proposed interference subtraction and supplementary cooperation algorithms can significantly improve network throughput of a multi-hop routing. Comprehensive simulations are carried out for all the proposed algorithms and performance analysis, providing quantitative evidence and comparison over other schemes. In our view, the new cooperative communication algorithms proposed in this research enable wireless ad-hoc networks to improve radio unreliability and meet future application requirements of high-speed and high-quality services with high energy efficiency. The acquired new insights on the network performance of the proposed algorithms can also provide precise guidelines for efficient designs of practical and reliable communications systems. Hence these results will potentially have a broad impact across a range of related areas, including wireless communications, network protocols, radio transceiver design and information theory

Design And Performance Analysis Of Enhanced Network Coded Cooperative Communication Systems

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2017Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2017Kablosuz haberleşme sistemi birbiriyle haberleşebilen birçok hareketli düğüm noktasından oluşmaktadır. Sönümleme ise kablosuz haberleşme sistemlerinin performansını olumsuz yönde etkileyen önemli faktörlerden biridir. Sönümlemenin mevcut olduğu ortamlarda güvenilir bir haberleşme için kanal kodlama ve çeşitleme teknikleri önerilmiş ve uygulanmıştır. Bunlardan biri, çeşitleme kazancı elde ederek olabildiğince hatasız veri iletimi gerçekleştirmek üzere her bir terminalde çoklu verici ve alıcı düğümleri kullanan çok girişli çok çıkışlı çeşitleme (MIMO) tekniğidir. Fakat işbirlikli çeşitleme tekniği bunu her bir terminalde birden çok verici anten kullanmadan gerçekleştirebilmektedir. Kablosuz yayın ortamı komşu röle düğümlerin işbirliği yapmasına imkan sağlayarak verinin kaynak düğümlerden hedef düğümlere aktarılması sırasındaki sönümleme etikisini azaltmaktadır. Bu sebeple, işbirlikli haberleşme sistemi veri iletimi sırasında röle düğümler ile oluşturulan birden çok haberleşme ağının kullanılmasını ve kendiliğinden oluşan uzaysal kanal çeşitlemesinden faydalanılmasını mümkün kılmaktadır. Doğrudan veri iletimi kullanan klasik tek atlamalı haberleşme sistemlerinde bir alıcı doğrudan gelen işaretin içerisindeki veriyi elde ederek yansıyan işaretleri girişim olarak algılarken, işbirlikli haberleşme sistemleri diğer işaretleri katkı olarak değerlendirmektedir. Böylelikle işbirlikli çeşitlemede veri iki ya da daha çok işaretin birlikte değerlendirilmesiyle elde etmektedir. Başka bir deyişle, işbirlikli çeşitleme kablosuz haberleşme ağlarında bulunan her bir düğümdeki antenin dağıtık olarak kullanıldığı bir anten çeşitleme tekniğidir. Hareketli düğümlerin (mobile nodes) güç, bant genişliği ve boyut gibi kısıtları sebebiyle diğer çeşitleme tekniklerinin kanal sönümlemesine karşı kullanılamadığı kablosuz tasarsız (ad hoc) algılayıcı ağları için işbirlikli çeşitleme özellikle faydalı olmaktadır. Bütün senaryolar için, hareketli kullanıcılar arasında işbirliği olan kablosuz sistemler bu işbirliğinin olmadığı diğer sistemlere göre daha yüksek bir sığa potansiyeline sahiptir. Fakat, işbirlikli haberleşme ile hata performansında elde edilen iyileşme çoğu durumda kablosuz ağdaki iletim hızından feragat ile mümkündür. Bu gibi durumlarda, ağ kodlama tekniği sayesinde röle düğümlere gönderilmiş olan veri paketlerinin akıllı bir şekilde birleştirilmesi ile işbirlikli kablosuz ağlardaki veri hızında ciddi bir iyileştirme sağlanabilmektedir. Ağ kodlama esasen kayıpsız haberleşme sistemlerinde yönlendirme ağlarının verimini artırmak için geliştirilmiştir. Fakat, ağ kodlama ile işbirlikli kablosuz ağların tümleştirilmesi (entegrasyonu) sönümlemenin bulunduğu ortamlarda kaynakların daha verimli bir şekilde kullanılması ve hata performansının iyileştirilmesi yönünde ciddi bir potansiyele sahiptir. Ağ kodlama, 5G standartlarının ötesindeki kablosuz ağlarda sürekli artan kullanıcı ve cihazların taleplerini karşılayabilecek kabiliyete sahiptir. Kablosuz sistemlerin yayın doğası işbirlikli haberleşme ve ağ kodlamanın beraber uygulanmasını ve bu iki tekniğin faydalarından yararlanmayı mümkün kılmaktadır. Bu bağlamda, son yıllarda mevcut literatürde çeşitli ağ kodlama teknikleri değerlendirilmekte fakat her yöntem röle düğümlerdeki veri paketleri işlevlerinin birleştirilmesi ve iletilmesini kapsamaktadır. Bu tezde, rastgele doğrusal ağ kodlama, karmaşık alan ağ kodlama ve XOR ağ kodlama tekniklerinin benzetimleri yapılmış ve çeşitli bakış açıları ile analiz edilmiştir. Tezin ilk bölümünde, Rayleigh ve Rician sönümleme kanalları için varış düğümlerindeki kod çözme hata olasılığı üzerinden rastgele doğrusal ağ kodlama sistemlerinin performansı incelenmektedir. Doğrusal ağ kodlama sistemlerinde, ara düğümlerdeki veri bitleri paket vektörler olarak alınmakta ve ara düğümler belirli bir boyutta ve eşit olasılıklı Galois kümesinden çıkarılan katsayılar ile alınan paketleri doğrusal olarak birleştirerek veriyi çözmektedir. Bu bölümdeki benzetim ortamı birden çok kaynak ile röle ve varış düğümlerinden oluşmakta; kaynak ve varış noktaları arasında ise doğrudan bağlantılar bulunmamaktadır. Belirtilen sistemdeki haberleşme kanalı kesintileri ve dolayısıyla paket kayıpları sönümleme etkisiyle oluşmaktadır. Belirtilen sistem modeli için ortaya çıkan benzetim sonuçları, paket çözümündeki kayıp olasılığının sadece sönümleme ortamı değil röle düğümlerde ağ kodlama için kullanılan katsayılar tarafından da belirlendiğini göstermektedir. Sönümleme kanallarındaki çözümleme kayıp olasılıkları röle düğümlerdeki paketlerin doğrusal olarak birleştirilmesi sırasında kullanılan rastgele katsayıları barındıran Galois kümesinin boyutu artırılarak düşürülebilmektedir. Tezin ikinci kısmında ise, karmaşık alan ağ kodlamasının bit hat oranı performansı frekans seçmeli Rayleigh sönümleme kanalları için dik frekans bölmeli çoğullama (OFDM) kullanılarak analiz edilmiştir. Daha önceki çalışmalarda, bu analiz düz sönümleme kanalları için yapılmıştır. Performans değerlendirmesinde kullanılan sistem modeli birden çok kaynak düğümü, tekli ya da çoklu röle düğümleri ve tek varış düğümü içermektedir. Hem kuvvetlendir ve aktar hem de çöz ve aktar tipi röleler için hata performansı elde edilmekte ve çoklu röle sistemleri için röle seçimi hem kuvventlendir ve aktar hem de çöz ve aktar seçenekleri için ele alınmaktadır. Katlamalı kanal kodları da opsiyonel olarak mevcut sisteme performansı artırmak için eklenebilmekte ve sert kararlı (hard decision) Viterbi Algoritması kaynak bitleri çözmek için kullanılmaktadır. Buna ek olarak, kaynak ve varış noktalarına farklı uzaklıklardaki röle düğümlerinde asimetrik bağlantı ortamları da değerlendirilmiştir. Daha önce bahsedilen senaryo kapsamında hedef ve/veya röle düğümlerde her bir bitin aynı zamanda elde edilmesi için OFDM ile birlikte çoklu kullanıcı belirleme kuralları uygulanmıştır. Benzetim sonuçları, rölelerdeki analog dalga formunun kaydedilmesini gerektirmesi dolayısıyla uygulama açısından pratik olmasa da her durumda kuvvetlendir ve aktar röle düğümlerinin, çöz ve aktar tipi röle düğümlerinden daha iyi performansa sahip olduğunu göstermektedir. Dahası, sistem modelinde hem kuvvetlendir ve aktar hem de çöz ve aktar tipi röleler ile röle seçimi yapıldığında hata performansında hatırı sayılır bir iyileştirme gözlenmektedir. Son olarak, asimetrik ağlarda, daha iyi bir hata performansı röle düğümlerinin kaynak düğümlerine daha yakın yerleştirilmesi ile elde edilebilmektedir. Tezin üçüncü kısmında, ele alınan tekniklerin faydalı yönlerini birleştirecek şekilde, OFDM kullanan kanal kodlamalı karmaşık alan ağ kodlama tekniği önerilmekte ve bit hata oranı üzerinden performans değerlendirmesi yapılmaktadır. Buradaki çalışma OFDM kullanan katlamalı kanal kodlamalı karmaşık alan ağ kodlama ve ikinci bölümde bahsedilen sert kararlı (hard decision) Viterbi Algoritmasının genişletilmesidir. Sistem modeli ikinci kısımdaki ile aynı olmakla birlikte yavaş ve frekans seçimli Rayleigh sönümleme kanalı içermektedir. Yine hem kuvvetlendir ve aktar hem de çöz ve aktar türü röleler bu bağlamda değerlendirilmiş ve birden çok röle içeren senaryolarda röle seçimi uygulanmıştır. Fakat, bu bölümde kodlanmış kaynak bitlerinin elde edilmesi için yumuşak kararlı (soft decision) Viterbi Algoritması ve Max-Log-MAP kod çözme teknikleri kullanılmakta ve böylelikle çok kullanıcı belirleme kuralları kodlanmış kaynak bitleri için log likelihood oranlarını sağlamaktadır. Dahası, kafeste farklı kod oranlarına ve durum sayılarına sahip katlamalı kodlar ve asimetrik bağlantı ortamları için performans analizi verilmektedir. Benzetim sonuçlarına göre, hem yumuşak kararlı Viterbi hem de Max- Log-MAP kanal çözümleme tekniklerinin belirtilen sistem modelinde aynı bit hatası performansına sahip olduğu görülmektedir. Kuvventlendir ve aktar yöntemi çöz ve aktar yöntemine göre her durumda daha iyi sonuç vermekte ve röle seçim teknikleri fark edilir bir performans iyileştirmesine sebep olmaktadır. Daha düşük kod oranlı ve daha çok kafes durumuna (trellis state) sahip katlamalı kodlar sistem performansını ciddi bir şekilde artırmakta ve asimetrik bağlantılarda aynı şekilde performansın iyileştirilmesi amacına katkı yapmaktadır. Tezin son bölümü OFDM ile birleştirilmiş iki yönlü röle ağları için XOR ağ kodlama tekniğinin geliştirilmiş versiyonu ile ilgilidir. İki yönlü röle ağları için geliştirilen geleneksel stratejiler ile karşılaştırıldığında, bu stratejide Galois küme eklemesi veya kaynaklarda çoklu veri paketlerinin bit XOR kodlaması uygulanmaktadır. XOR kodlamalı paket, iki yönlü röle ağının hata performansını artırmak için verici çeşitleme kazancı elde etmek üzere artıklık barındıran veri paketleri ile birlikte röle düğümlerine iletilmektedir. Sistem modeli, iki kaynak ve istenen hata performansının elde edilmesi için farklı sayıda ve katlamalı kanal kodlamalı röle düğümleri içermektedir. Sistemde birden çok röle olduğu durumda röle seçimi de yapılmakta ve bu sayede sadece hata performansı artırılmamakta aynı zamanda verimlilik de artmaktadır. Sonuçlar, iki yönlü röle ağının iletim ucunda sağlanan artıklık ile sistemde bit hatası performansının artırıldığını göstermektedir.A wireless communication system consists of multiple wireless nodes that can move around and communicate with each other. Fading is one of major degrading factors that can limit the performance of wireless communication systems. In order to achieve reliable communication in fading environments, channel coding and diversity techniques were proposed and implemented. Multiple input multiple output (MIMO) is one of the diversity techniques which uses multiple transmission and reception nodes per terminal to obtain diversity gains for reduced errors in the transmission of data. But cooperative diversity techniques can realize this purpose without installing multiple transmission antennas per terminal. The broadcasting nature of wireless medium allows neighbouring relay nodes to cooperate in communication by forwarding information from source nodes to destination nodes for fading mitigation. Therefore, cooperative communication system utilizes multiple communication routes created by relay nodes and exploits the inherent spatial diversity of the channel for information transmission. While classical single hop communication systems use direct transmission in which a receiver recovers the information using the direct signal only and regarding the reflected signal as interference, the cooperative communication systems consider the other signal as contribution. Therefore, cooperative diversity retrieves information from the combination of two or more signals. In other words, cooperative diversity is a virtual antenna diversity technique that uses distributed antennas belonging to each node in a wireless network for communication. Cooperative diversity is particularly considered useful in wireless ad hoc and sensor networks, where power/bandwidth/size restrictions of the mobile nodes may prevent the use of other diversity techniques to combat channel fading. In all scenarios, cooperation among mobile users of a wireless system has the potential to provide an increased capacity in comparison with the systems without using cooperation. However, in most cases, cooperative communication attains this improvement in error performance by sacrificing the throughput of wireless network. In such cases, network coding technique can substantially improve the data rate of cooperative wireless networks by intelligently combining the forwarded packets of information at the relay nodes. Network coding was originally proposed for lossless communication systems to increase the throughput of routing networks. But the integration of network coding with cooperative wireless networks has the potential to ensure more efficient usage of resources with improved error performance in fading environments. Network coding can ensure the capability to address the ever increasing number of users and devices in wireless networks, in beyond 5G standards. The broadcast nature of wireless systems allows the joint implementation of cooperative communication and network coding, exploiting the benefits of both techniques. In this context, several types of network coding have been discussed in literature in the recent years but each type involves the concept of combining and transmitting the functions of information packets at the relay nodes. In this thesis, random linear network coding, complex field network coding and exclusive-OR (XOR) network coding are simulated and analyzed in different perspectives. In the first part of this thesis, the performance of random linear network coding systems is investigated for Rayleigh and Rician fading channels in terms of decoding failure probabilities at destination nodes. In random linear network coding systems, the information bits at the intermediate nodes are received as packet vectors and the intermediate nodes encode the information data by linearly combining the received packets, with coefficients randomly extracted from the Galois field of a particular size, with equal probability. The setup considered in this section consists of multiple source, relay and destination nodes, with no direct links between sources and destinations. The communication channel outage and hence the packet loss in the given system occurs due to fading. The simulation results for the supposed system model show that the packet decoding failure probabilities are not only determined by the fading environment but also by the coefficients used in the network coding at the relay nodes. In fading channels, decoding failure probabilities can be reduced by increasing the size of the Galois field that contains random coefficients for linear combination of packets at relay nodes. In the second part of this thesis, the bit error rate performance of complex field network coding is analyzed with orthogonal frequency division multiplexing (OFDM) for frequency selective Rayleigh fading channels. In previous literatures, this analysis is performed for flat fading channels. The system model used in the performance evaluation contains multiple source nodes, single or multiple relay nodes and a single destination node. Both amplify and forward as well as decode and forward types of relays are assumed to obtain error performance results and for multi-relay system, relay selection is also taken into account for both amplify and forward and decode and forward relay types. Convolutional channel codes are also optionally integrated in the given system to boost the system performance and hard decision Viterbi decoding is used to decode source bits. In addition to this, asymmetric link environments, with relay nodes at different distances from sources and destination, are also considered. Multiuser detection rules with OFDM are employed at destination node and/or relay nodes to retrieve each source bits at the same time, for the above mentioned scenarios. The simulation results indicate that amplify and forward relay nodes outperform decode and forward relay nodes in all cases but are not very suitable from the implementation perspective since they require the storage of analog waveform at relays. Moreover, a considerable improvement is error performance can be observed when relay selection is provided in the system model with both amplify and forward and decode and forward types of relays. Finally, in asymmetric network, better error performance can be achieved by placing relay nodes closer to the source nodes. The third part of this thesis proposes the channel coded complex field network coding with OFDM, combining the mutual benefits of all the techniques involved and the performance evaluation is made in terms of bit error rate. This work is the extension of the Convolutional channel coded complex field network coding with OFDM and hard decision Viterbi decoding, presented in the second part. The system model is same as the second part with slow and frequency selective Rayleigh fading channel. Again, both amplify and forward and decode and forward types of relays are considered in this context and relay selection is employed in scenarios with multiple relays. However, this part uses soft decision Viterbi and Max-Log-MAP decoding techniques for obtaining coded source bits and therefore, in this case, the multiuser detection rules provide log likelihood ratios for coded source bits. Moreover, the performance analysis is provided for Convolutional codes with different code rates and number of states in the trellis as well as for asymmetric link environments. From simulation results, it is seen that both soft decision Viterbi and Max-Log-MAP channel decoding techniques provide almost same bit error performance in the given system model. Amplify and forward performs better than decode and forward in all cases and relay selection techniques results in a noticeable performance gain. Convolutional codes with lower code rate and more number of trellis states can enhance the system performance considerably and asymmetric links also serve the similar purpose of performance improvement. The final part of thesis is related to an enhanced version of XOR network coding scheme for two-way relay networks, combined with OFDM. Compared to other conventional strategies for two-way relay networks, this strategy performs Galois field addition or bit-wise XOR coding of multiple information packets at sources. The XOR coded packet is transmitted to the relay nodes along with the information packets which facilitates redundancy to acquire transmit diversity gain for improving error performance of the two-way relay network. The system model consists of two source and different number of relay nodes with Convolutional channel encoding in the system to obtain desired error performance. Relay selection is also provided when there are multiple relays in the system and this provision not only improves the error performance but also gives better throughput. The results show that the redundancy provided at the transmission end of two-way relay network enhances bit error performance of the system.Yüksek LisansM.Sc

An Energy conserving routing scheme for wireless body sensor nanonetwork communication

Current developments in nanotechnology make electromagnetic communication possible at the nanoscale for applications involving body sensor networks (BSNs). This specialized branch of wireless sensor networks, drawing attention from diverse fields, such as engineering, medicine, biology, physics, and computer science, has emerged as an important research area contributing to medical treatment, social welfare, and sports. The concept is based on the interaction of integrated nanoscale machines by means of wireless communications. One key hurdle for advancing nanocommunications is the lack of an apposite networking protocol to address the upcoming needs of the nanonetworks. Recently, some key challenges have been identified, such as nanonodes with extreme energy constraints, limited computational capabilities, terahertz frequency bands with limited transmission range, and so on, in designing protocols for wireless nanosensor networks. This work proposes an improved performance scheme of nanocommunication over terahertz bands for wireless BSNs making it suitable for smart e-health applications. The scheme contains - a new energy-efficient forwarding routine for electromagnetic communication in wireless nanonetworks consisting of hybrid clusters with centralized scheduling; a model designed for channel behavior taking into account the aggregated impact of molecular absorption, spreading loss, and shadowing; and an energy model for energy harvesting and consumption. The outage probability is derived for both single and multilinks and extended to determine the outage capacity. The outage probability for a multilink is derived using a cooperative fusion technique at a predefined fusion node. Simulated using a nano-sim simulator, performance of the proposed model has been evaluated for energy efficiency, outage capacity, and outage probability. The results demonstrate the efficiency of the proposed scheme through maximized energy utilization in both single and multihop communications; multisensor fusion at the fusion node enhances the link quality of the transmission

Five decades of hierarchical modulation and its benefits in relay-aided networking

Hierarchical modulation (HM), which is also known as layered modulation, has been widely adopted across the telecommunication industry. Its strict backward compatibility with single-layer modems and its low complexity facilitate the seamless upgrading of wireless communication services. The specific features of HM may be conveniently exploited for improving the throughput/information-rate of the system without requiring any extra bandwidth, while its complexity may even be lower than that of the equivalent system relying on conventional modulation schemes. As a recent research trend, the potential employment of HM in the context of cooperative communications has also attracted substantial research interests. Motivated by the lower complexity and higher flexibility of HM, we provide a comprehensive survey and conclude with a range of promising future research directions. Our contribution is the conception of a new cooperative communication paradigm relying on turbo trellis-coded modulation-aided twin-layer HM-16QAM and the analytical performance investigation of a four-node cooperative communication network employing a novel opportunistic routing algorithm. The specific performance characteristics evaluated include the distribution of delay, the outage probability, the transmit power of each node, the average packet power consumption, and the system throughput. The simulation results have demonstrated that when transmitting the packets formed by layered modulated symbol streams, our opportunistic routing algorithm is capable of reducing the transmit power required for each node in the network compared with that of the system using the traditional opportunistic routing algorithm. We have also illustrated that the minimum packet power consumption of our system using our opportunistic routing algorithm is also lower than that of the system using the traditional opportunistic routing algorithm

Controlling the mobility and enhancing the performance of multiple message ferries in delay tolerant networks

In einem drahtlosen Netzwerk mit isolierten und stationären Knoten können Adhoc und verzögerungstolerante Netzwerk Routing-Protokolle nicht verwendet werden. Message Ferry Netzwerke sind die Lösung für diese Fälle, in denen ein (oder mehrere) Message Ferry Knoten den store-carry-forward Mechanismus verwendet und zwischen den Knoten reist, um Nachrichten auszutauschen. In diesem Fall erfahren die Nachrichten für gewöhnlich eine lange Verzögerung. Um die Performance der Message Ferry Netzwerke zu verbessern, kann die Mobilität der Message Ferry Knoten gesteuert werden. In dieser Doktorarbeit werden zwei Strategien zur Steuerung der Mobilität der Message Ferry Knoten studiert. Die Strategien sind das on-the-fly Entscheidungsverfahren in Ferry Knoten und die offline Wegplanung für Ferry Knoten. Für die on-the-fly Strategie untersucht diese Arbeit Decision-maker in Ferry Knoten, der die Entscheidung auf Grundlage der lokalen Observation eines Ferry Knoten trifft. Zur Koordinierung mehrerer Ferry Knoten, die keine globale Kenntnis über das Netzwerk haben, wird eine indirekte Signalisierung zwischen Ferry Knoten vorgeschlagen. Zur Kooperation der Ferry Knoten für die Zustellung der Nachrichten werden einige Ansätze zum Nachrichtenaustausch zwischen Ferry Knoten vorgeschlagen, in denen der Decision-maker eines Ferry Knotens seine Information mit dem verzögerungstoleranten Router des Ferry Knoten teilt, um die Effizienz des Nachrichtenaustauschs zwischen Ferry Knoten zu verbessern. Umfangreiche Simulationsstudien werden zur Untersuchung der vorgeschlagenen Ansätze und des Einflusses verschiedener Nachrichtenverkehrsszenarien vorgenommen. Außerdem werden verschiedene Szenarien mit unterschiedlicher Anzahl von Ferry Knoten, verschiedener Geschwindigkeit der Ferry Knoten und verschiedener Ansätze zum Nachrichtenaustausch zwischen Ferry Knoten studiert. Zur Evaluierung der offline Wegplanungsstrategie wird das Problem als Multiple Traveling Salesmen Problem (mTSP) modelliert und ein genetischer Algorithmus zur Approximation der Lösung verwendet. Es werden verschiedene Netzwerkarchitekturen zur Pfadplanung der Ferry Knoten vorgestellt und studiert. Schließlich werden die Strategien zur Steuerung der Mobilität der Ferry Knoten verglichen. Die Ergebnisse zeigen, dass die Performance der Strategien in Bezug auf die Ende-zu-Ende-Verzögerung von dem Szenario des Nachrichtenverkehrs abhängt. In Szenarien, wie Nachrichtenverkehr in Sensor-Netzwerken, in denen ein Knoten die Nachrichten zu allen anderen Knoten sendet oder von allen anderen Knoten empfängt, zeigt die offline Wegplanung, basierend auf der mTSP Lösung, bessere Performance als die on-the-fly Strategie. Andererseits ist die on-the-fly Stratgie eine bessere Wahl in Szenarien wie Nachrichtenaustausch zwischen Rettungskräften während einer Katastrophe, in denen alle drahtlose Knoten die Nachrichten austauschen müssen. Zudem ist die on-the-fly Strategie flexibler, robuster als offline Wegplanung und benötigt keine Initialisierungszeit.In a wireless network with isolated and stationary nodes, ad hoc and delay tolerant routing approaches fail to deliver messages. Message ferry networks are the solution for such networks where one or multiple mobile nodes, i.e. message ferry, apply the store-carry-forward mechanism and travel between nodes to exchange their messages. Messages usually experience a long delivery delay in this type of network. To improve the performance of message ferry networks, the mobility of ferries can be controlled. In this thesis, two main strategies to control mobility of multiple message ferries are studied. The strategies are the on-the-fly mobility decision making in ferries and the offline path planning for ferries. To apply the on-the-fly strategy, this work proposes a decision maker in ferries which makes mobility decisions based on the local observations of ferries. To coordinate multiple ferries, which have no global view from the network, an indirect signaling of ferries is proposed. For cooperation of ferries in message delivery, message forwarding and replication schemes are proposed where the mobility decision maker shares its information with the delay tolerant router of ferries to improve the efficiency of message exchange between ferries. An extensive simulation study is performed to investigate the performance of the proposed schemes and the impact of different traffic scenarios in a network. Moreover, different scenarios with different number of ferries, different speed of ferries and different message exchange approaches between ferries are studied. To study the offline path planning strategy, the problem is modeled as multiple traveling salesmen problem (mTSP) and a genetic algorithm is applied to approximate the solution. Different network architectures are proposed and studied where the path of ferries are planned in advance. Finally, the strategies to control the mobility of ferries are compared. The results show that the performance of each strategy, in terms of the average end-to-end delay of messages, depends on the traffic scenario in a network. In traffic scenarios same as the traffic in sensor networks, where only a single node generates messages to all nodes or receives messages from all node, the offline path planning based on mTSP solution performs better than the on-the-fly decision making. On the other hand, in traffic scenarios same as the traffic in disaster scenarios, where all nodes in a network may send and receive messages, the on-the-fly decision making provides a better performance. Moreover, the on-thy-fly decision making is always more flexible, more robust and does not need any initialization time

Analytic Performance Model for State-Based MAC Layer Cooperative Retransmission Protocols

© 2015 IEEE. Cooperative retransmission can significantly improve link reliability over lossy and time-varying wireless links. However, comparing retransmission protocols is challenging, and generally requires simplistic assumptions specific to each protocol. In this paper, we develop a general model to evaluate cooperative retransmission protocols with distributed, slot-based contention algorithms. Specifically, we propose to calculate the relay time-out probabilities at a MAC time-slot scale, formulate retransmission outcomes as functions of the time-out probabilities, and derive the probability of a retransmission process for every data frame. We also propose a Markov extension of our model to characterise the dependency between retransmissions of multiple frames. This enables our model to analyse continuous retransmissions of successive frames. Validated by QualNet simulations, our model can analytically predict the probabilities of cooperative retransmissions with an accuracy of ± 1%. As a result, direct comparisons between cooperative retransmission protocols become tangible, without implementing the full protocol in a state-based simulator

Cooperative Relaying In Power Line Environment: A Survey and Tutorial

Exchange of information is essential in any society and the demand for faster, cheaper, and secure communications is increasing every day. With other hi-tech initiatives like IPv6 and Internet-of-Things (IOT) already in the horizon, demand for broadband is set to escalate beyond its current level. Inherently laden in the challenges posed by this technology are fresh opportunities in terms of penetration of data services into rural communities and development of innovative strategies for more efficient use of the grid. Though still in its developmental phase/stage, Power Line Communication (PLC) has grown beyond theoretical fantasy to become a reality. The proofs are the readily available PLC systems that can be purchased off the shelfto achieve in-house networking and the much talked about, smart metering technology; generally regarded as the “new bride” in utilities industry. One of the biggest gains of PLC is its use of existing electrical cables, thereby eliminating cost of installation and maintenance of data cables. However, given that the power infrastructure was traditionally built to deliver electricity, data signals do suffer various forms of distortions and impairments as they transit it. This paper presents a tutorial on the deployed wireless system technique which is to be adapted to PLC scenario for the purpose of managing the available source energy for achieving reliable communication system. One of these techniques is the cooperative diversity. Its application and deployment in power line environment is explored. The improvement achieved through cooperative diversity in some PLC systems were presented along with the associated limitations. Finally, future areas of research which will further improve the reliability of PLC systems and reduce its power consumption during transmission is shown

Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Capacity Enhancement in 60 GHz Based D2D Networks by Relay Selection and Scheduling

Millimeter-wave or 60 GHz communication is a promising technology that enables data rates in multigigabits. However, its tremendous propagation loss and signal blockage may severely affect the network throughput. In current data-centric device-to-device (D2D) communication networks, the devices with intended data communications usually lay in close proximity, unlike the case in voice-centric networks. So the network can be visualized as a naturally formed groups of devices. In this paper, we jointly consider resource scheduling and relay selection to improve network capacity in 60 GHz based D2D networks. Two types of transmission scenarios are considered in wireless personal area networks (WPANs), intra and intergroup. A distributed receiver based relay selection scheme is proposed for intragroup transmission, while a distance based relay selection scheme is proposed for intergroup transmission. The outage analysis of our proposed relay selection scheme is provided along with the numerical results. We then propose a concurrent transmission scheduling algorithm based on vertex coloring technique. The proposed scheduling algorithm employs time and space division in mmWave WPANs. Using vertex multicoloring, we allow transmitter-receiver (Tx-Rx) communication pairs to span over more colors, enabling better time slot utilization. We evaluate our scheduling algorithm in single-hop and multihop scenarios and discover that it outperforms other schemes by significantly improving network throughput