{"title":"MIMO Multichannel Beamforming in Interference-Limited Ricean Fading Channels","authors":"Shi Jin, M. Mckay, Kai‐Kit Wong, Xiqi Gao","doi":"10.1109/GLOCOM.2008.ECP.200","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.200","url":null,"abstract":"This paper investigates the performance of multiple- input multiple-output (MIMO) multichannel beamforming systems in interference-limited Ricean fading channels. We derive new expressions for the exact symbol error rate, as well as the diversity order and array gain. Our results are based on new exact closed-form expressions which we derive for the marginal ordered eigenvalue distributions of finite-dimensional complex noncentral F-distributed random matrices. Numerical results are presented to validate the theoretical analysis.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"6 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":"116212247","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}
H. Rowaihy, Matthew P. Johnson, A. Bar-Noy, T. Brown, T. L. Porta
{"title":"Assigning Sensors to Competing Missions","authors":"H. Rowaihy, Matthew P. Johnson, A. Bar-Noy, T. Brown, T. L. Porta","doi":"10.1109/GLOCOM.2008.ECP.17","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.17","url":null,"abstract":"When a sensor network is deployed in the field, it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we propose centralized and distributed schemes to assign sensors to missions. We also adapt our distributed scheme to make it energy-aware to extend network lifetime. Finally, we show simulation results comparing these solutions. We find that our greedy algorithm frequently performs near-optimally and that the distributed schemes usually perform nearly as well.","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":"116261972","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 End-to-End Performance Inference Technique for Peer-to-Peer Networks","authors":"B. Feng, Changcheng Huang, M. Devetsikiotis","doi":"10.1109/GLOCOM.2008.ECP.286","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.286","url":null,"abstract":"For voice/video applications that are based on Peer-to-Peer (P2P) models, ensuring the end-to-end Quality of Service (QoS) is crucial, especially if users are paying fees. In this paper we propose an End-to-end Performance Inference Technique (EPIT) that uses a prediction-based approach to map the ingress traffic levels of the P2P network to the end-to-end QoS in the network. Furthermore, by coupling Simulated Annealing (SA) with EPIT, we describe a traffic engineering solution in such a way that the QoS constraints are met while traffic flows into the network are maximized.","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":"121570127","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":"A Secure Key Management Scheme for Wireless and Mobile Ad Hoc Networks Using Frequency-Based Approach: Proof and Correctness","authors":"A. Boukerche, Yonglin Ren, Samer M. J. Samarah","doi":"10.1109/GLOCOM.2008.ECP.353","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.353","url":null,"abstract":"Security plays an important role in today's information technology, particularly in wireless and mobile environments due to the lack of pre-deployed infrastructure and the unsuitability of centralized management. Since the encryption technique has been introduced to provide secure communications, it is critical to manage all kinds of keys efficiently when the network size is large or the topology undergoes frequent changes. This paper presents a novel key management scheme that not only employs both symmetric and asymmetric key algorithms, but also achieves its key updates through a frequency-based approach. In addition, our scheme provides necessary protection for other aspects of key management, such as data confidentiality, key distribution, etc. Through the discussion of the current issues of key management and a further analysis of our key management scheme, our solution is proven to be secure in the process of key management and to be robust against attacks aimed at causing malicious key updates.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"267 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":"124342693","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":"A Memory-Optimized Bloom Filter Using an Additional Hashing Function","authors":"M. Ahmadi, Stephan Wong","doi":"10.1109/GLOCOM.2008.ECP.476","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.476","url":null,"abstract":"A bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filters have increased in popularity in database and networking applications. In this paper, we introduce a new extension to optimize memory utilization for regular bloom filters, called bloom filter with an additional hashing function (BFAH). The regular bloom filter stores items from a set k times k memory locations that are determined by the k addresses stored in the bit-array structure. Which k addresses to utilize is determined by to which positions in the structure the k (regular) hashing functions are pointing to. Utilizing the additional hashing function, only one out of these k memory addresses is selected to store the item only once. Consequently, there is no longer needed to store the k-1 redundant copies. We implemented our approach in a software packet classifier based on tuple space search with the H3 class of universal hashing functions. Our results show that our approach is able to reduce the number of collisions when compared to a regular bloom filter.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"507 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":"127601973","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}
Kyouwoong Kim, C. Spooner, I. Akbar, Jeffrey H. Reed
{"title":"Specific Emitter Identification for Cognitive Radio with Application to IEEE 802.11","authors":"Kyouwoong Kim, C. Spooner, I. Akbar, Jeffrey H. Reed","doi":"10.1109/GLOCOM.2008.ECP.404","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.404","url":null,"abstract":"Cognitive radio (CR) is believed to be an enabling technology for increasing spectrum efficiency. A CR collects spectrum usage information from not only its own spectrum sensing module, but also from peer CRs. The heavy dependence on spectrum knowledge from other CRs requires identification of malicious CR devices that could generate spoofed information. In addition, it also needs to track the users associated with problematic CR devices which unintentionally violate spectrum usage etiquette. The specific emitter identification (SEI) concept is applied to identification of such non-cooperative CR devices. In this paper, second-order cyclic features of OFDM signals are proposed as a means of increasing CR network security and stability through SEI. For this exploratory work, IEEE 802.11a/g signals from different WLAN cards are measured and classified using hidden Markov Models (HMMs).","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"14 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":"127609586","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":"Cross-Layer Adaptive Resource Allocation Algorithm For Wireless Communications Networks","authors":"Karim E. Morsy, F. Digham, M. Nafie, A. Elezabi","doi":"10.1109/GLOCOM.2008.ECP.1042","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.1042","url":null,"abstract":"In this paper, a cross-layer adaptive resource allocation (XARA) algorithm for channel division based systems, such as OFDMA, is proposed. XARA design is based on a PHY-MAC cross-layer approach which yields better channel utilization compared to separate PHY or MAC designs. XARA uses a joint power and channel allocation algorithm to determine both the channel assignment and the transmission power for each user in order to maximize the overall system capacity. Through an iterative algorithm, XARA enhances the channel utilization by taking into account the demands of the users so as to assign the minimum number of time slots needed to fulfill the requirements of each user. The saved time slots are reported to the scheduling and admission control functions of the MAC layer in order to either allow more users to enter the network or to allow the current users to request more quality of service \"QoS\" sessions. The proposed algorithm can fit in different wireless systems such as WIMAX and LTE. The algorithm is also flexible enough to accommodate the dynamic nature of the spectrum in the case of cognitive radio networks and considers the power constraints associated with such networks.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"28 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":"127697333","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":"Modeling Mobility-Assisted Data Collection in Wireless Sensor Networks","authors":"H. Almasaeid, A. Kamal","doi":"10.1109/GLOCOM.2008.ECP.44","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.44","url":null,"abstract":"Exploiting mobility to enhance the performance of wireless sensor networks (WSNs), in terms of connectivity, coverage, and lifetime elongation, has recently been the focus of several research studies. Mobility was adopted in two different ways; either using a network of mobile sensor nodes or deploying a few supplementary special mobile elements, usually referred to as mobile agents to help enhance connectivity and coverage. Different modes of operation (roles) were assigned to mobile agents including being a data relay, data collector, and data sink. In this paper we use a closed queueing network to model mobility and then evaluate data latency under all those roles. The proposed model provides powerful means to understand the effect of different parameters, like velocity and number of mobile agents as well as their movement strategy, on data latency.","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":"127721375","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":"A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks","authors":"Wen-Tsuen Chen, Po-Yu Chen, C. Wu, Chi-Fu Huang","doi":"10.1109/GLOCOM.2008.ECP.20","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.20","url":null,"abstract":"One of the major applications of wireless sensor networks is guiding navigation service with its goal to assist moving objects in leaving a hazardous region safely and quickly. In this paper, we propose a distributed guiding navigation protocol that can guide moving objects to multiple exits with load balancing among multiple navigation paths to the exits. With the assistances of sensor nodes, moving objects are guided to different navigation paths so that they can move to exits as soon as possible without causing congestion. In some traditional navigation algorithms, a sensor may select a wrong guiding direction when an information- updating packet has not flooded through the whole network. Hence, the guiding direction of the sensor may oscillate in a short time and guided objects will confuse with this phenomenon, called direction oscillation problem. This problem will be eliminated in our proposed protocol. Simulation results indicate that our protocol can guide moving objects to exits in shorter time and solve the direction oscillation problem effectively.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"92 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":"126492517","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":"Multi-Hop Effective Bandwidth Based Routing in Multi-Radio Wireless Mesh Networks","authors":"Hongkun Li, Y. Cheng, Chi Zhou","doi":"10.1109/GLOCOM.2008.ECP.1011","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.1011","url":null,"abstract":"In this paper, we address the routing issue in a wireless mesh network, where each node is stationary and equipped with one or more radios. Specifically, we propose a new path metric called multi-hop effective bandwidth (MHEB), which provides a generic approach to calculate the achievable bandwidth along a path, taking the impacts of inter/intra-flow interference and space/channel diversity into account. We also present a new routing protocol based on the MHEB metric, which achieves interference-aware and load-balancing routing at the same time. Performance of the MHEB based routing in improving the network throughput is validated through computer simulations, compared with the existing popular routing metrics.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"8 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":"125743569","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}