{"title":"Frequency Agile Interference-Aware Channel Sounding for Dynamic Spectrum Access Networks","authors":"Qi Chen, A. Wyglinski, G. Minden","doi":"10.1109/GLOCOM.2007.595","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.595","url":null,"abstract":"In this paper, we propose a novel channel sounding technique, called the multicarrier direct sequence swept time delay cross-correlation (MC-DS-STDCC), which is designed to minimize the interference with incumbent licensed transmissions within the context of a dynamic spectrum access (DSA) network. Conventional channel sounders employ the same transmit power level when operating over a specific frequency band. However, the maximum-tolerable transmit power levels permitted across the spectrum within a DSA network can potentially be non-uniform. Our proposed channel sounder is designed to tailor the transmit power level across the frequency band of operation, limiting it to the constraints imposed by both licensed and unlicensed devices, as well as by regulatory agencies. Employing a combination of multicarrier spread spectrum modulation and a conventional channel sounding approach, our proposed technique achieves a mean squared error of the estimated channel impulse response of 10-3 at an SNR of -13 dB and -17 dB respectively for 15- and 31-chip spreading sequences.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114492564","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}
Takanori Hayashi, Kazuhisa Yamagishi, T. Tominaga, A. Takahashi
{"title":"Multimedia Quality Integration Function for Videophone Services","authors":"Takanori Hayashi, Kazuhisa Yamagishi, T. Tominaga, A. Takahashi","doi":"10.1109/GLOCOM.2007.518","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.518","url":null,"abstract":"We present a multimedia quality integration function that can estimate the overall quality of a videophone service considering multimodality and interactivity. That is, it takes into account individual audiovisual qualities and their delays. Videophone services are rich multimedia services that are expected to become popular on the next-generation network (NGN). To provide ones with sufficient quality, we must properly evaluate, design, and manage users' perceptual quality of service, i.e., quality of experience (QoE). Subjective quality assessment tests were conducted using a PC-based point-to-point interactive videophone application to clarify how overall multimedia quality characteristics depend on the individual audiovisual qualities, absolute audiovisual delay, and media synchronization. From the test results, we formulated a multimedia quality integration function that can accurately evaluate overall multimedia quality. In addition, verification test results showed that this function achieved good performance in terms of correlation coefficient and evaluation error between subjective and estimated qualities. Our model will be a useful QoE planning tool capable of providing feedback on individual qualities as well as the overall multimedia quality of videophone services.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114742247","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":"Mobile Instant Messaging Service Over Cellular Networks","authors":"Z. Naor","doi":"10.1109/GLOCOM.2007.1008","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.1008","url":null,"abstract":"The popularity of Internet-based instant messaging services (e.g. MSN messenger, ICQ) is rapidly increasing. Due to the huge number of mobile subscribers, there is a real demand to provide such a service to mobile clients. In order to do so, there is a need to keep track on both the presence and the locations of the participating clients. That is, each subscriber must be always aware about the whereabout of all the other members in its group, and who are the active members at any given moment. A mobile instant messaging (MIM) service is expected to provide to its members an improved, easy-to-use inter-group connectivity, and to support advanced services such as a conference call, a multicast message, and a group search, in an efficient manner. A method for handling an instant messaging service for mobile users over a cellular infrastructure is developed in this study. The main focus is on tracking the presence and the locations of the participating members in an efficient manner, and on the wireless cost of providing advanced group services, such as multicast messages and a conference call, to the group members.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781847","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":"Contention Based Cooperative Multiple Access for Wireless Packet Networks","authors":"A. Masuda, S. Shimamoto","doi":"10.1109/GLOCOM.2007.267","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.267","url":null,"abstract":"We propose a contention based multiple access scheme that enables packet level cooperation in wireless packet network, where the idle nodes help the source nodes by offering relay of the failed packet. Also a prioritization scheme is implemented to optimize to the contention whose complexity is added by participation of relay nodes. Throughput and delay performance improvement is confirmed by computer simulations considering wireless links that have different packet error rates according to the radio condition which suffer from propagation loss and Rayleigh fading. Analysis shows that the addition of active nodes for cooperation rather eases the number of waiting nodes in the contention, and that the reduction of retries needed for transmission reduces the average delay.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114375890","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":"On the Use of Higher Layer Information for Cognitive Networking","authors":"B. S. Manoj, R. Rao, M. Zorzi","doi":"10.1109/GLOCOM.2007.678","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.678","url":null,"abstract":"Cognitive radio networking research today mainly focuses on finding efficient ways to let secondary users access radio spectrum that is licensed to primary users, with minimal interference to the license owners. Physical layer cognition, though very important, is complex, expensive, and can provide only limited information about the higher layer traffic. We argue that, even in the absence of physical layer cognitive capability, higher layer traffic information can still be used to generate sufficient cognitive networking information to improve system performance. In this paper, we present an architecture for cognitive networking and an early prototype and experimental setup of a cognitive network access point (CogNet AP), and we describe our observations and lessons learned from this experimental activity. The CogNet AP gathers, processes, analyzes, and stores information available through its monitoring interface in order to build a cognitive local repository which holds the spatio-temporally tagged network traffic information. The inexpensiveness of the components used for building the CogNet AP shows the flexibility of building Cognitive Network elements compared to cognitive radio devices. The proposed cognitive networking architecture and prototype point to the many possible application scenarios and research potential for such systems which use temporal patterns of higher layer traffic information. From our experiments we found that the use of cognitive information derived from higher networking layers resulted in achieving better system throughput.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"692 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114527770","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}
L. D'Orazio, C. Sacchi, Riccardo Fedrizzi, F. D. Natale
{"title":"An Adaptive Minimum-BER Approach for Multi-User Detection in STBC-MIMO MC-CDMA Systems","authors":"L. D'Orazio, C. Sacchi, Riccardo Fedrizzi, F. D. Natale","doi":"10.1109/GLOCOM.2007.650","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.650","url":null,"abstract":"In the recent years, MIMO MC-CDMA techniques have been proposed in order to increase system capacity over frequency-selective wireless channels. The key feature of MIMO MC-CDMA is the capability of exploiting diversity jointly in time, frequency and in the space domains. Very promising results have been achieved by STBC-MIMO MC-CDMA using receiver schemes targeted to maximize the signal-to-noise plus interference ratio (SINR) at the output of the diversity combiner. Such a concept turns on the minimum mean squared error (MMSE) combining criterion. Nevertheless, it is known by literature that MSE cost function is not always optimal in digital communications. In this work, we are proposing an adaptive multi-user detection approach based on a minimum-BER (M- BER) concept for a synchronous STBC-MIMO MC-CDMA system transmitting data over time-varying multipath fading channels. The practical implementation of the M-BER receiver relies on an adaptive least-mean-square (LMS)-like algorithm, periodically aided by a training sequence and working in decision-directed modality during a coherence time window. Experimental results have shown a performance improvement yielded by the proposed adaptive M-BER MUD with respect to MMSE adaptive MUD achieved by spending an affordable computational effort.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967386","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":"QoS and Selfish Users: A MAC Layer Perspective","authors":"P. Nuggehalli, M. Sarkar, R. Rao","doi":"10.1109/GLOCOM.2007.895","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.895","url":null,"abstract":"Many wireless network standards include quality-of-service (QoS) features at the MAC layer. These features provide nodes transmitting real-time traffic such as voice and video preferential access to the channel over nodes carrying best-effort traffic. The success of these QoS mechanisms requires that nodes be honest and truthfully report their application's QoS category. However rational nodes will, if they can, deviate from a standard's specification to maximize their utility. Network interfaces are becoming increasingly programmable and it is possible for nodes to falsely classify their best-effort traffic as real-time traffic to obtain increased throughput. In this paper, we provide a game-theoretic analysis for a slotted Aloha like MAC that resembles the IEEE 802.11e MAC in many essential respects. Our MAC model allows traffic to be classified as either high-priority (HP) or low-priority (LP), and allows for both random access (contention) and polled (contention-free) channel access. We advocate the use of the contention-free access feature as an efficient and protocol-compliant mechanism to incentivize LP users to be truthful. We discuss appropriate utility functions for HP and LP traffic and analyze the performance of the system using the Nash bargaining solution (NBS) concept from cooperative game theory. The NBS concept is used to find a fair and Pareto-optimal operating point for our system. Since users are strategic, we then use the framework of non-cooperative game theory to find the set of Nash equilibria. Somewhat remarkably, we find that the NBS operating point is a Nash equilibrium, implying that our strategy is both efficient and strategy-proof.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116949286","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":"On Static Code Construction for Alternating Multicast and Simultaneous Multicasts","authors":"C. Ngai, Shenghao Yang, R. Yeung","doi":"10.1109/GLOCOM.2007.276","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.276","url":null,"abstract":"In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one of the multicasts can take place at any time. We propose an algorithm for constructing a linear network code which is static in the sense that the coding operations do not depend on the multicast. The code so constructed achieves the max-flow bound for each multicast, i.e., optimality is achieved when the base field is sufficiently large. An upper bound on the required field size for constructing the code is also obtained. We conjecture that a network code constructed by our algorithm can be converted into a network code for the associated simultaneous multicast problem, i.e., all the multicasts can take place at the same time. An example is presented to illustrate our conjecture.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117348981","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":"Sum-Rate Distortion in MIMO Broadcast Channels with Irregular Limited Feedback","authors":"A. Mukherjee, H. Kwon","doi":"10.1109/GLOCOM.2007.607","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.607","url":null,"abstract":"Recent research in multiuser MIMO systems has focused on providing partial channel state information (CSI) at the transmitter as an alternative to full CSI in order to reduce overhead. However, there is an implicit loss in data throughput even due to partial CSI feedback which is not included in conventional sum-rate computations. We introduce a sum-rate distortion model including the implicit loss for a multiuser MIMO downlink with block diagonalization. A distortion function is subsequently presented which accounts for quantization error at the receiver, feedback latency due to non-homogenous receiver channel coherence times and the loss in net capacity due to feedback overhead. This system model is used to derive bounds on the amount of feedback that can be supported under various antenna, channel and signal-to-noise ratio scenarios. Simulation results are presented to show the impact of feedback on the sum- rate for multi-antenna wireless systems with multiple users.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116005932","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":"Cooperative Network Coding for Wireless Ad-Hoc Networks","authors":"Shengli Fu, K. Lu, Y. Qian, M. Varanasi","doi":"10.1109/GLOCOM.2007.157","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.157","url":null,"abstract":"In wireless ad-hoc networks, a major challenge is how to provide robust and efficient communication. To achieve this goal, cooperative communication and network coding have been proven to be effective. In the literature, most existing studies focus on the performance of the two schemes separately. In our study, we will investigate the performance of system that combines them tightly together. In particular, we will propose a unified two-way traffic model that can characterize the features of both of them. Based on this model, we develop a new cooperative network coding scheme to further improve the system throughput. Both decode-and-forward and amplify-and-forward techniques are discussed for the two-way traffic model. Numerical results show that the new scheme can significantly improve the performance over traditional schemes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116177886","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}