{"title":"Capacity and Coverage Analysis of a 3GPP-LTE Multihop Deployment Scenario","authors":"R. Schoenen, W. Zirwas, B. Walke","doi":"10.1109/ICCW.2008.11","DOIUrl":"https://doi.org/10.1109/ICCW.2008.11","url":null,"abstract":"Broadband wireless access will be deployed in a cellular way with 3GPP-LTE [1]. For the first rollout the main demand is a huge area coverage. With only few available base station sites that are connected to an access fiber, multihop (relaying) techniques can be used well to fill the coverage gaps. Later with increasing offered traffic, the demand shifts to higher capacity over the area. Even for this purpose relays are beneficial. There is an area around relays where they provide better overall capacity to the user terminal, taking into account all resources used for the first and second hop (the relaying overhead). Relaying or Multihop operation therefore massively improves the coverage as well as the capacity goals at low cost, without the need of a cable or fiber access. This paper analyzes a realistic urban scenario on the island of Jersey. We study the coverage and capacity over the area in three cases. One base station (BS) only, one BS with four relay nodes (RNs), and the latter plus another ring of nine RNs. The BS has fiber access for rates beyond 100 Mbit/s, while the first hop of Relays (HI) is fed over the air from BS using shared resources in the same LTE band. The second hop H2 is fed by the relays of group HI. In this paper we provide the results from numeric analysis based on models we explain here. It is shown that huge gains in coverage and capacity are obtained by relaying.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117306387","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}
{"title":"Outage Probability Minimization under Both The Transmit and Interference Power Constraints for Fading Channels in Cognitive Radio Networks","authors":"Xin Kang, Ying-Chang Liang, H. K. Garg","doi":"10.1109/ICCW.2008.97","DOIUrl":"https://doi.org/10.1109/ICCW.2008.97","url":null,"abstract":"In this paper, we consider a spectrum-sharing environment where a secondary user (SU) is allowed to access the spectrum allocated to a primary user (PU) on condition that the interference power received at the receiver of PU is below a predefined threshold. In particular, besides this interference power constraint defined to protect the PU, we also consider the power limit at the transmitter of the SU. Under such a setup, we derive the optimal power allocation strategies to achieve the minimum outage probability for fading channels and quantify the relationship between the power constraints and the outage probability. Besides, we also study the zero-outage capacity (also known as delay-limited capacity) under the same setup. Finally, computer simulations are conducted to verify our theoretical results.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115496386","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}
{"title":"Moments of Harmonic Mean and Rate Analysis for Two-Way Amplify-and-Forward Relaying","authors":"Yang Han, S. Ting, Chin Keong Ho","doi":"10.1109/ICCW.2008.75","DOIUrl":"https://doi.org/10.1109/ICCW.2008.75","url":null,"abstract":"In this paper, we derive the moments of the harmonic mean of two independent gamma distributed random variables which have the same shape parameter but different scale parameters. We then apply these results to analyze the average sum rate of two-way amplify-and-forward (AF) half- duplex relaying systems. By deriving tight upper and lower bounds for the average sum rate of two-way relaying, we show that two-way relaying can significantly recover the spectrum efficiency loss of one-way relaying. Furthermore, we show that by applying OSTBC at source and destination terminals when multiple antennas are implemented, the average sum rate is further improved compared to the single antenna case and a diversity order of two is also achieved.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123272209","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}
{"title":"Position-Based Adaptive Broadcast for Inter-Vehicle Communications","authors":"Yao-Tsung Yang, Li-Der Chou","doi":"10.1109/ICCW.2008.83","DOIUrl":"https://doi.org/10.1109/ICCW.2008.83","url":null,"abstract":"With the techniques of wireless communications growing mature, inter-vehicle communications provide an efficient way to improve traffic safety and prevent congestion through exchanging or disseminating the traffic information. Broadcast techniques are usually applied for delivering the emergency messages to drivers but often influenced by the hidden terminal, interference, and contention problems. The paper proposes a new broadcast algorithm which is an event- driven protocol and suitable for cooperative collision avoidance in two-way multi-lane highway. Its message-relaying decisions are made in receiver based on the position, direction, and velocity properties of transmitting and receiving vehicles. The simulation results show that the proposed algorithm delivers the emergency messages efficiently and it has the lower latency and less retransmission than other flooding based protocols.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125156190","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}
{"title":"Analysis of Handover Latency for Mobile IPv6 and mSCTP","authors":"Dong Phil Kim, S. Koh","doi":"10.3745/JIPS.2008.4.3.087","DOIUrl":"https://doi.org/10.3745/JIPS.2008.4.3.087","url":null,"abstract":"This paper analyzes the handover latency of mobile IP and mobile SCTP over IPv6 networks. The analytical results are compared with performance by experiment over Linux testbed. For the analysis, we consider the two handover scenarios: horizontal handover and vertical handover. From the results, we see that the mSCTP handover can provide smaller handover latency than the Mobile IP. Moreover, the mSCTP can give much smaller handover latency for the vertical handover where has enough sojourn time of MN in the overlapping region between different subnet regions, compared to the horizontal handover.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130247756","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}
{"title":"Achievable Sum-Rate Maximizing AF Relay Beamforming Scheme in Two-Way Relay Channels","authors":"N. Lee, Hyun Jong Yang, J. Chun","doi":"10.1109/ICCW.2008.63","DOIUrl":"https://doi.org/10.1109/ICCW.2008.63","url":null,"abstract":"This paper deals with design of a amplify-and- forward (AF) relay beamforming matrix in a two-way relay protocol when a relay node has multiple antennas. Two-way relaying is a promising protocol since it provides enhanced spectral efficiency compared to one-way relaying protocols. In this paper we derive the achievable sum-rate upper bound of AF beamforming scheme and propose the achievable sum-rate maximizing relay beamforming scheme when the destination and the relay node have perfect knowledge of the channel state information (CSI) for forward and backward channels. The solution of the sum-rate maximizing scheme is obtained by using the proposed algorithm, general power iterative algorithm, which solves a global optimization problem efficiently. Comparing with one-way relaying protocol, the improved sum-rate performance of the proposed scheme is verified by numerical simulation.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647553","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}
{"title":"Balanced Topology Constructions in the NEMO","authors":"Long-Sheng Li, Li-Keng Kang","doi":"10.1109/ICCW.2008.88","DOIUrl":"https://doi.org/10.1109/ICCW.2008.88","url":null,"abstract":"As we know, mobile ad hoc network (MANET) is a wireless network without any fixed infrastructure. All nodes must communicate with each other by a routing protocol. Most of routing protocols don't consider allocating an IP address to nodes. However, in network mobility (NEMO), all nodes can't only communicate with Internet using Bi-directional tunneling but also can be allocated an IP address. In this paper, we propose two kinds of algorithms to reconstruct MANET to NEMO. Additionally, a novel load balancing solution is proposed. We add the load information into the router advertisement (RA) message. The simulation results show that the proposed solution has improved the connection throughput significantly.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194596","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}
{"title":"Secure Firmware Updates over the Air in Intelligent Vehicles","authors":"D. Nilsson, U. Larson","doi":"10.1109/ICCW.2008.78","DOIUrl":"https://doi.org/10.1109/ICCW.2008.78","url":null,"abstract":"Modern intelligent vehicles have electronic control units containing firmware that enables various functions in the vehicle. New firmware versions are constantly developed to remove bugs and improve functionality. Automobile manufacturers have traditionally performed firmware updates over cables but in the near future they are aiming at conducting firmware updates over the air, which would allow faster updates and improved safety for the driver. In this paper, we present a protocol for secure firmware updates over the air. The protocol provides data integrity, data authentication, data confidentiality, and freshness. In our protocol, a hash chain is created of the firmware, and the first packet is signed by a trusted source, thus authenticating the whole chain. Moreover, the packets are encrypted using symmetric keys. We discuss the practical considerations that exist for implementing our protocol and show that the protocol is computationally efficient, has low memory overhead, and is suitable for wireless communication. Therefore, it is well suited to the limited hardware resources in the wireless vehicle environment.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121214239","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}
S. Valentin, T. Volkhausen, F. A. Onat, H. Yanikomeroglu, H. Karl
{"title":"Enabling Partial Forwarding by Decoding-Based One and Two-Stage Selective Cooperation","authors":"S. Valentin, T. Volkhausen, F. A. Onat, H. Yanikomeroglu, H. Karl","doi":"10.1109/ICCW.2008.29","DOIUrl":"https://doi.org/10.1109/ICCW.2008.29","url":null,"abstract":"With selection decode-and-forward (SDF) relaying, an accurate forwarding decision is essential to avoid error propagation and achieve full cooperation diversity. The methods in literature are either based on CRC or SNR thresholds, both resulting in poor end-to-end performance in practical wireless scenarios with non-block fading and channel coding. We propose to improve performance by accurate and frequent adaptation with partial forwarding. To achieve this in channel-coded systems, we introduce a decoding-based forwarding decision at the relay and propose (1) minimum path difference (MPD) as a non-overhead and accurate decoding-based decision metric and (2) MPD-based SDF protocols with one and two decision stages. Our performance study validates that these protocols significantly improve SDF's end-to-end BER under realistic assumptions.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124367113","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}
{"title":"Applying User Profiles in Transient Peer-to-Peer Environment","authors":"B. Forstner, I. Kelényi, H. Charaf","doi":"10.1109/ICCW.2008.27","DOIUrl":"https://doi.org/10.1109/ICCW.2008.27","url":null,"abstract":"Semantic data is widely used in order to increase the performance of peer-to-peer information retrieval networks. The most efficient approaches construct user profiles in order to describe the fields of interest of the users and to shape a semantic overlay network. However, the characteristics of mobile devices and the behavior of wireless peer-to-peer users require the consideration of the applied algorithms and protocols when applying them in such environment. In this paper we describe our experiments with a special mobile Gnutella client that collected information on the mobile user behavior, together with the other distinctiveness of the mobile environment. We also propose an appropriate utilization of user profiles in transient peer-to-peer systems.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127833179","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}