{"title":"On Optimal Power Allocation for Source-Orthogonal Relay-Nonorthogonal Amplify-and-Forward Relaying","authors":"R. Nikjah, N. Beaulieu","doi":"10.1109/GLOCOM.2008.ECP.787","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.787","url":null,"abstract":"An amplify-and-forward relaying network where the source is orthogonal to all the relays but the relays are nonorthogonal (SORNAF) is studied. The problem of relay power optimization in a SORNAF relaying scheme is formulated as a nonconcave fractional program. Selection amplify-and-forward (SAF) relaying is a possible power allocation strategy previously proposed for the SORNAF scheme. A necessary condition for the optimality of the SAF power allocation is derived in terms of instantaneous channel coefficients, based on which, an upper bound on the SAF optimality probability is calculated. The upper bound approaches zero almost exponentially as the number of relays increases, showing that SAF relaying is asymptotically strictly suboptimal. A suboptimal power allocation, which is significantly superior to the SAF algorithm in terms of outage performance, is also proposed for SORNAF relaying.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132846443","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":"Queued Cooperative Wireless Networks With Rateless Codes","authors":"N. Mehta, V. Sharma, G. Bansal","doi":"10.1109/GLOCOM.2008.ECP.885","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.885","url":null,"abstract":"Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has recently attracted considerable interest. It provides a natural and efficient mechanism for accumulating mutual information from multiple transmitting relays. We develop an analysis of queued cooperative relay systems that combines the communication-theoretic transmission aspects of cooperative communication using rateless codes over Rayleigh fading channels with the queuing-theoretic aspects associated with buffering messages at the relays. Relay cooperation combined with queuing reduces the message transmission times and also helps distribute the traffic load in the network, which improves throughput significantly.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133621033","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":"An Asymptotically Minimal Node-Degree Topology for Load-Balanced Architectures","authors":"Zhenhua Liu, Xiaoping Zhang, Youjian Zhao, Hong-Tao Guan","doi":"10.1109/GLOCOM.2008.ECP.454","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.454","url":null,"abstract":"Load-balanced architectures appear to be a promising way to scale Internet to extra high capacity. However, architectures based on mesh topology have a node-degree of N, which prevents these architectures from large node numbers. This consideration motivates us to study the properties of node degree and its impact on the corresponding load-balanced architectures. In this paper we first show the asymptotically minimal node degree for any topology to achieve a constant ideal throughput under uniform traffic pattern when the channel bandwidth is fixed. We further introduce a unidirectional direct interconnection topology, named Plus 2^i (P2i), with this minimal node degree and prove that it has an ideal throughput of no less than twice the channel bandwidth under uniform traffic pattern. Based on the property, we provide the P2i load-balanced (PLB) architecture. Using this architecture, we show that scalability, 100% throughput and packet ordering can be all achieved and the scheduling algorithm is easy to implement. To the best of our knowledge, this is the first load-balanced architecture constructed on multi-hop direct interconnection topologies without packet reordering problem.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133312861","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":"Broadband Data Transport Protocol Designed for Ethernet Services in Metro Ethernet Networks","authors":"C. Estevez, G. Ellinas, G. Chang","doi":"10.1109/GLOCOM.2008.ECP.497","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.497","url":null,"abstract":"The metro Ethernet network (MEN) expands the advantages of Ethernet to cover areas wider than LAN. Ethernet Services were created to provide multiple services to this carrier-grade network that is rapidly growing popularity in North America [21], Europe [22], and Asia [23]. Techniques to police the network layer for MENs are very mature; but the transport layer relies on different flavors of TCP that do not get the most of Ethernet services. We propose a transport layer protocol that can replace previous versions of TCP to better suit metro Ethernet service policies, such as those established for specified service level agreements (SLAs). Ethernet service's traffic and performance parameters include committed information rate (CIR), excess information rate (EIR), and guaranteed packet loss rate. The purpose of this transport protocol is to integrate these parameters, which are applied at the networking layer, into the proposed transport protocol to make a smarter controller.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132102057","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}
Shigeaki Harada, R. Kawahara, Tatsuya Mori, N. Kamiyama, H. Hasegawa, H. Yoshino
{"title":"A Method of Detecting Network Anomalies in Cyclic Traffic","authors":"Shigeaki Harada, R. Kawahara, Tatsuya Mori, N. Kamiyama, H. Hasegawa, H. Yoshino","doi":"10.1109/GLOCOM.2008.ECP.396","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.396","url":null,"abstract":"We present a method of detecting network anomalies, such as DDoS (distributed denial of service) attacks and flash crowds, automatically in real time. We evaluated this method using measured traffic data and found that it successfully differentiated suspicious traffic. In this paper, we focus on cyclic traffic, which has a daily and/or weekly cycle, and show that the differentiation accuracy is improved by utilizing such a cyclic tendency in anomaly detection. Our method differentiates suspicious traffic that has different statistical characteristics from normal traffic. At the same time, it learns about cyclic large- volume traffic, such as traffic for network operations, and finally considers it to be legitimate.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132687526","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":"Wireless Carriers' Transport Network Alternatives and Economic Considerations","authors":"Sunan Han","doi":"10.1109/GLOCOM.2008.ECP.1080","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.1080","url":null,"abstract":"Due to rapid traffic growth caused by new subscriptions and emerging bandwidth-hungry applications, wireless carriers are facing a task to upgrade their transport capabilities to avoid enormous spending in leasing point-to- point services or dedicated rings. This article reviews four transport alternatives and a case study that explores the economic crossover points of the four approaches. We then present some price sensitivity to the case study to confirm the trend of the advantageous build-based approaches over leasing ones. The article also provides a methodology in migrating a lease-based transport network to a build-based one and investigates the economic benefits of the migration.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694885","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":"Asymptotic Throughput in Wireless Multicast OFDM Systems","authors":"Juan Liu, Wei Chen, Z. Cao, Y. Zhang, S. Liew","doi":"10.1109/GLOCOM.2008.ECP.913","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.913","url":null,"abstract":"With the proliferation of wireless multimedia applications, multicast/broadcast has been recognized as an efficient technique to transmit a large volume of data to multiple mobile stations at the same time. In most multicast systems, the transmitter (e.g., base station) adapts its data rate to the worst channel among all users in the multicast group, so as to guarantee service quality to each user. Predictably, the more users in a multicast group, the lower data rate the base station can transmit. On the other hand, grouping more users together leads to a more efficient utilization of spectrum bandwidth, as these users are served simultaneously. A natural question that arises is how to group users to maximize the throughput of multicast systems, given a fixed amount of bandwidth resource. In this paper, we attempt to answer this important question that has not been addressed before. Through theoretical analysis, we prove that (1) the average throughput increases with the number of users in a multicast group, when the number of subcarriers allocated to a group is proportional to the number of users therein. Moreover, the throughput approaches infinite-bandwidth Gaussian channel capacity when the number of users gets large; (2) the number of users, and hence the number of subcarriers, that is needed for throughput to be arbitrarily close to its asymptotic value increases almost linearly with the transmit SNR. Our analysis is validated through simulations.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132733390","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}
Kapil Gulati, A. Chopra, R. Heath, B. Evans, K. R. Tinsley, X. Lin
{"title":"MIMO Receiver Design in the Presence of Radio Frequency Interference","authors":"Kapil Gulati, A. Chopra, R. Heath, B. Evans, K. R. Tinsley, X. Lin","doi":"10.1109/GLOCOM.2008.ECP.641","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.641","url":null,"abstract":"Multi-input multi-output (MIMO) receivers have been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless transceivers, however, may be affected by radio frequency interference (RFI) that is well modeled using non-Gaussian impulsive statistics. In this paper, we consider the problem of receiver design for a two transmit, two receive antenna MIMO system in the presence of RFI. First, we show that RFI is well modeled using a bivariate Middleton Class A model and validate the model with measured data. Using this RFI model, we demonstrate that conventional MIMO receivers experience significant degradation in communication performance. Then we derive the maximum likelihood (ML) receiver assuming bivariate Middleton Class A noise. Furthermore, we develop a parameter estimation method for this noise model and propose two sub-optimal ML receivers with reduced computational complexity. Simulations show significant improvement in symbol error rate performance of the proposed techniques over receivers designed assuming additive Gaussian noise.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132739460","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}
Jiao Zhang, Yujun Zhang, Hanwen Zhang, Yi Sun, Zhongcheng Li
{"title":"Trust-Based Fast Authentication for Mobile IPv6 Networks","authors":"Jiao Zhang, Yujun Zhang, Hanwen Zhang, Yi Sun, Zhongcheng Li","doi":"10.1109/GLOCOM.2008.ECP.948","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.948","url":null,"abstract":"Trust relationship among multiple domains is the basis for inter-domain fast authentication. This paper proposes a fast authentication method combining inter-domain trust relationship for wireless mobile IPv6 networks. In order to implement inter-domain trust relationship, a dynamic trust maintenance mechanism is designed. Based on Combined Public Key (CPK) algorithm, a new signature and verification scheme is applied to accelerate the authentication process. This scheme supports the proposed trust-based mutual authentication between mobile node and the access network. Theoretical analysis and numerical results show that the proposed method is more effective in reducing authentication delay and signaling overhead. Additionally, the proposed method is proven to be tolerant of existential forgery and man-in-the-middle attacks.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127648392","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}
B. Liu, Fengyuan Ren, Chuang Lin, Yaqin Yang, Rongfei Zeng, Hao Wen
{"title":"The Redeployment Issue in Underwater Sensor Networks","authors":"B. Liu, Fengyuan Ren, Chuang Lin, Yaqin Yang, Rongfei Zeng, Hao Wen","doi":"10.1109/GLOCOM.2008.ECP.978","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.978","url":null,"abstract":"The mobility of underwater sensor nodes makes the network topology inconveniently controlled and slowly changed. Thus, in order to enable underwater sensor networks to work more effectively, it is necessary for us to periodically detect the coverage rate and redeploy nodes to non-coverage areas. In this paper, we take the lead in introducing the redeployment issue in underwater sensor networks. In our opinion, the key point of the redeployment issue is coverage. For this special coverage topic, we first propose a coverage rate definition scheme. Then along with the definitions, two redeployment algorithms are introduced, of which one is based on adding new nodes while the other one is by the means of moving redundant ones. By modeling the mobility behavior of underwater nodes with three-dimensional random walks, we employ simulation experiments to verify our ideas, the results of which show the importance of redeployment in the underwater environment.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127648975","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}