Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208074
N. Marchenko, C. Bettstetter, E. Yanmaz
Cooperative relaying has drawn great interest to mitigate the negative effects of small-scale fading in distributed wireless networks. This paper analyzes radio resource allocation in cooperative relaying with proactive relay selection. Due to the introduction of the relay into the communication link an over- expenditure of resources can take place similar to the classical exposed terminal problem. In this work we derive the overall network throughput in two simple scenarios and determine the regions of packet-error-rates where cooperative relaying yields a throughput gain.
{"title":"On Radio Resource Allocation in Proactive Cooperative Relaying","authors":"N. Marchenko, C. Bettstetter, E. Yanmaz","doi":"10.1109/ICCW.2009.5208074","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208074","url":null,"abstract":"Cooperative relaying has drawn great interest to mitigate the negative effects of small-scale fading in distributed wireless networks. This paper analyzes radio resource allocation in cooperative relaying with proactive relay selection. Due to the introduction of the relay into the communication link an over- expenditure of resources can take place similar to the classical exposed terminal problem. In this work we derive the overall network throughput in two simple scenarios and determine the regions of packet-error-rates where cooperative relaying yields a throughput gain.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126262388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208025
L. Thiele, T. Wirth, M. Schellmann, Y. Hadisusanto, V. Jungnickel
Multi-cellular radio systems are often limited due to the presence of cochannel interference. Proposed physical layer concepts, e.g. coordinated joint transmission and interference rejection combining, try to strengthen the signal while combating the interference. It is well known that base station cooperation yields great capacity improvement for downlink multi-antenna cellular networks. However, the proposed solutions assume a central processing unit, coordinating the information exchange and thus determining the optimal resource allocation of the overall cellular network. Recently multi-user eigenmode transmission was proposed to relax the constraint of channel state information at the transmitter. It requires the terminals to feed back their dominant eigenmodes only. To reduce the computational costs and the information exchange further, we consider limited localized base station cooperation. We demonstrate potential capacity gains in a cellular orthogonal frequency division multiplexing system using real 3D measured antenna patterns and the scaling with the number of cooperating antenna arrays. Additionally, we use minimum mean square error equalization at the terminal side to combat residual cochannel interference.
{"title":"MU-MIMO with Localized Downlink Base Station Cooperation and Downtilted Antennas","authors":"L. Thiele, T. Wirth, M. Schellmann, Y. Hadisusanto, V. Jungnickel","doi":"10.1109/ICCW.2009.5208025","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208025","url":null,"abstract":"Multi-cellular radio systems are often limited due to the presence of cochannel interference. Proposed physical layer concepts, e.g. coordinated joint transmission and interference rejection combining, try to strengthen the signal while combating the interference. It is well known that base station cooperation yields great capacity improvement for downlink multi-antenna cellular networks. However, the proposed solutions assume a central processing unit, coordinating the information exchange and thus determining the optimal resource allocation of the overall cellular network. Recently multi-user eigenmode transmission was proposed to relax the constraint of channel state information at the transmitter. It requires the terminals to feed back their dominant eigenmodes only. To reduce the computational costs and the information exchange further, we consider limited localized base station cooperation. We demonstrate potential capacity gains in a cellular orthogonal frequency division multiplexing system using real 3D measured antenna patterns and the scaling with the number of cooperating antenna arrays. Additionally, we use minimum mean square error equalization at the terminal side to combat residual cochannel interference.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127211970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208030
G. Monghal, S. Kumar, K. Pedersen, P. Mogensen
This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic. This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality indicator (CQI) reports from the user equipments. Fractional load handling is operated without inter eNode-B coordination. We conclude that the system can operate under fractional load conditions if the CQI is calculated with wideband interference. Further gain can be obtained if the CQI is calculated with local interference, however, in that case, it is necessary to inject a certain time correlation in the transmission patterns due to reporting delay.
{"title":"Integrated Fractional Load and Packet Scheduling for OFDMA Systems","authors":"G. Monghal, S. Kumar, K. Pedersen, P. Mogensen","doi":"10.1109/ICCW.2009.5208030","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208030","url":null,"abstract":"This paper study the performance of an orthogonal frequency division multiple access (OFDMA) system under fractional load based in long term evolution (LTE) downlink. Fractional load is defined by a situation where only a fraction of the bandwidth is used for transmission due to lack of traffic. This type of situation should result in a global increase of signal to interference and noise ratio (SINR) conditions in the network. We propose different methods integrating the transmission pattern selection to the packet scheduling functionality of the enode-B depending only on the channel quality indicator (CQI) reports from the user equipments. Fractional load handling is operated without inter eNode-B coordination. We conclude that the system can operate under fractional load conditions if the CQI is calculated with wideband interference. Further gain can be obtained if the CQI is calculated with local interference, however, in that case, it is necessary to inject a certain time correlation in the transmission patterns due to reporting delay.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208075
Y. Wu, D. Lee, J.-I. Jung
Mobile ad hoc network consists of nodes with mobility thus resulting in frequent route breakage. Considering this problem, in this paper, we propose a novel routing algorithm which constrains the distance to next relay node to increase route life time in mobile ad hoc networks (MANET). By limiting the distance to next relay node, our algorithm lengthened route lifetime and enhanced the throughput. In the simulation part, we analyzed the impact of node speed and node density on the proposed algorithm and we used LAR for comparison. Simulation results showed that the proposed algorithm have a longer lifetime and higher throughput than LAR. However, our algorithm has a longer latency than LAR due to the increased hop count.
{"title":"Routing Algorithm Limiting Next Hop Selection Distance in Multi Hop Ad Hoc Networks","authors":"Y. Wu, D. Lee, J.-I. Jung","doi":"10.1109/ICCW.2009.5208075","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208075","url":null,"abstract":"Mobile ad hoc network consists of nodes with mobility thus resulting in frequent route breakage. Considering this problem, in this paper, we propose a novel routing algorithm which constrains the distance to next relay node to increase route life time in mobile ad hoc networks (MANET). By limiting the distance to next relay node, our algorithm lengthened route lifetime and enhanced the throughput. In the simulation part, we analyzed the impact of node speed and node density on the proposed algorithm and we used LAR for comparison. Simulation results showed that the proposed algorithm have a longer lifetime and higher throughput than LAR. However, our algorithm has a longer latency than LAR due to the increased hop count.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208014
P. Yi, Y. Wu, J. Ma
Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DoS) attacks launched through compromised nodes or intruders. In this paper, we investigated the effects of flooding attacks in Network Simulation 2 (ns-2) and measured the packet delivery ratio and packet delay under different flooding frequency and different number of attack nodes. Simulation results show that with the increase the flooding frequency and the number of attack nodes, network performance drops. Meanwhile the packet delay firstly increases and then decline to a value of stability in the end.
{"title":"Experimental Evaluation of Flooding Attacks in Mobile Ad Hoc Networks","authors":"P. Yi, Y. Wu, J. Ma","doi":"10.1109/ICCW.2009.5208014","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208014","url":null,"abstract":"Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DoS) attacks launched through compromised nodes or intruders. In this paper, we investigated the effects of flooding attacks in Network Simulation 2 (ns-2) and measured the packet delivery ratio and packet delay under different flooding frequency and different number of attack nodes. Simulation results show that with the increase the flooding frequency and the number of attack nodes, network performance drops. Meanwhile the packet delay firstly increases and then decline to a value of stability in the end.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115694189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208084
D. Obeid, S. Sadek, G. Zaharia, G. El Zein
The aim of this work is to present a practical study to detect heartbeats from distance, as well as cardiopulmonary activity modeling and simulation, in order to separate the heart and the respiration signals. Using a Vector Network Analyzer, measurements are taken at 2.4, 5.8, 10,16 and 60 GHz. The Matlab simulation permits comparing several signal processing techniques in order to identify the most accurate one.
{"title":"A Tunable System for Contact-Less Heartbeat Detection and a Modeling Approach","authors":"D. Obeid, S. Sadek, G. Zaharia, G. El Zein","doi":"10.1109/ICCW.2009.5208084","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208084","url":null,"abstract":"The aim of this work is to present a practical study to detect heartbeats from distance, as well as cardiopulmonary activity modeling and simulation, in order to separate the heart and the respiration signals. Using a Vector Network Analyzer, measurements are taken at 2.4, 5.8, 10,16 and 60 GHz. The Matlab simulation permits comparing several signal processing techniques in order to identify the most accurate one.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122890845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5207962
T. Biermann, Z. Polgar, H. Karl
Exploiting cooperation and coding techniques is a vivid area in current networking research. Unfortunately, implementing and deploying such techniques is often difficult due to their complexity and the required modifications deeply within the protocol stack. We present an architecture that aggregates functionality common to many different cooperation and coding techniques in a Cooperation and Coding Framework (CCFW). Functions which are specific to one single technique only are encapsulated within modules that can be dynamically activated by the framework in beneficial situations. This permits a quick and easy integration of new schemes into existing networks. Furthermore, as modules are automatically activated based on their abstract specifications, techniques which are today designed and implemented with a specific application scenario in mind, can lead to benefits in other scenarios, too.
{"title":"Cooperation and Coding Framework","authors":"T. Biermann, Z. Polgar, H. Karl","doi":"10.1109/ICCW.2009.5207962","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207962","url":null,"abstract":"Exploiting cooperation and coding techniques is a vivid area in current networking research. Unfortunately, implementing and deploying such techniques is often difficult due to their complexity and the required modifications deeply within the protocol stack. We present an architecture that aggregates functionality common to many different cooperation and coding techniques in a Cooperation and Coding Framework (CCFW). Functions which are specific to one single technique only are encapsulated within modules that can be dynamically activated by the framework in beneficial situations. This permits a quick and easy integration of new schemes into existing networks. Furthermore, as modules are automatically activated based on their abstract specifications, techniques which are today designed and implemented with a specific application scenario in mind, can lead to benefits in other scenarios, too.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123165783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208028
Heinrich Hertz, A. Ibing, David Kühling, Dennis Wieruch, H. Boche
LTE advanced standardization discusses OFDMA uplink transmission, which allows for different receiver algorithms than the DFT-spread OFDMA uplink in LTE. We present a hybrid MMSE/QRD-M turbo receiver concept for 4times4 MIMO-OFDMA uplink in LTE Advanced, running the complete baseband and decoding functionality on a Cell BE processor. Multi-user MIMO with different modulation levels on the same resources is supported. Complexity and performance of the receiver are evaluated using implementation benchmarks of the signal processing components and simulated bit error rates. The benchmarks show that advanced receiver algorithms can be put into practice on software defined radio architectures.
{"title":"Software Defined Hybrid MMSE/QRD-M Turbo Receiver for LTE Advanced Uplink on a Cell Processor","authors":"Heinrich Hertz, A. Ibing, David Kühling, Dennis Wieruch, H. Boche","doi":"10.1109/ICCW.2009.5208028","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208028","url":null,"abstract":"LTE advanced standardization discusses OFDMA uplink transmission, which allows for different receiver algorithms than the DFT-spread OFDMA uplink in LTE. We present a hybrid MMSE/QRD-M turbo receiver concept for 4times4 MIMO-OFDMA uplink in LTE Advanced, running the complete baseband and decoding functionality on a Cell BE processor. Multi-user MIMO with different modulation levels on the same resources is supported. Complexity and performance of the receiver are evaluated using implementation benchmarks of the signal processing components and simulated bit error rates. The benchmarks show that advanced receiver algorithms can be put into practice on software defined radio architectures.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123837221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208094
M. Rahmani, Martin Pfannenstein, Eckehard Steinbach, Giuseppe Giordano, Ernst Biersack
We investigate a heterogeneous IP-based network architecture for in-vehicle communication. The wireless technology is an interesting candidate for in-vehicle communication, since it reduces the cabling effort and consequently the cost. In this work, a peripheral wireless network based on the IEEE 802.11 technology is investigated for media streaming in the car. FEC-based multicast and unicast transmissions are studied and compared for the same communication scenarios based on their QoS performance and resource requirements. Moreover, the frame bursting mechanism from the IEEE 802.11e standard has been applied to improve the throughput of small packets over in-vehicle wireless channels.
{"title":"Wireless Media Streaming Over IP-Based In-Vehicle Networks","authors":"M. Rahmani, Martin Pfannenstein, Eckehard Steinbach, Giuseppe Giordano, Ernst Biersack","doi":"10.1109/ICCW.2009.5208094","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208094","url":null,"abstract":"We investigate a heterogeneous IP-based network architecture for in-vehicle communication. The wireless technology is an interesting candidate for in-vehicle communication, since it reduces the cabling effort and consequently the cost. In this work, a peripheral wireless network based on the IEEE 802.11 technology is investigated for media streaming in the car. FEC-based multicast and unicast transmissions are studied and compared for the same communication scenarios based on their QoS performance and resource requirements. Moreover, the frame bursting mechanism from the IEEE 802.11e standard has been applied to improve the throughput of small packets over in-vehicle wireless channels.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123002293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208012
F. Sivrikaya, T. Geithner, C. Truong, M. A. Khan, S. Albayrak
We propose a new location-based stochastic routing approach that is well-suited for wireless sensor networks deployed for public safety applications such as emergency evacuations or search and rescue operations. We first introduce a new modeling and evaluation framework based on Markov chains for randomized routing. Based on this evaluation framework, we study the load balancing and routing performance aspects of i) a near-optimal solution using the complete topology information, ii) a heuristic algorithm that uses only local neighborhood information. Numerical studies using the evaluation framework show that our heuristic routing approach scales well with both network size and density, considering the combined problem of routing and load balancing.
{"title":"Stochastic Routing in Wireless Sensor Networks","authors":"F. Sivrikaya, T. Geithner, C. Truong, M. A. Khan, S. Albayrak","doi":"10.1109/ICCW.2009.5208012","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208012","url":null,"abstract":"We propose a new location-based stochastic routing approach that is well-suited for wireless sensor networks deployed for public safety applications such as emergency evacuations or search and rescue operations. We first introduce a new modeling and evaluation framework based on Markov chains for randomized routing. Based on this evaluation framework, we study the load balancing and routing performance aspects of i) a near-optimal solution using the complete topology information, ii) a heuristic algorithm that uses only local neighborhood information. Numerical studies using the evaluation framework show that our heuristic routing approach scales well with both network size and density, considering the combined problem of routing and load balancing.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124832465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}