{"title":"Uplink Scheduling with Quality of Service in IEEE 802.16 Networks","authors":"J. Borin, N. Fonseca","doi":"10.1109/GLOCOM.2007.476","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.476","url":null,"abstract":"In order to support real-time and bandwidth demanding applications the IEEE 802.16 standard is expected to provide quality of service (QoS). Although the standard defines a QoS signaling framework and four service levels, scheduling mechanisms for this network are unspecified. In this paper, we propose a scheduling discipline for uplink traffic. Simulation results show that our scheme is capable to provide QoS. Moreover it shares fairly the resources among connections of the same service type.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"142 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":"129734355","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}
Xiaoguang Niu, Xi Huang, Ze Zhao, Yuhe Zhang, Changcheng Huang, Li Cui
{"title":"The Design and Evaluation of a Wireless Sensor Network for Mine Safety Monitoring","authors":"Xiaoguang Niu, Xi Huang, Ze Zhao, Yuhe Zhang, Changcheng Huang, Li Cui","doi":"10.1109/GLOCOM.2007.248","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.248","url":null,"abstract":"This paper describes a wireless sensor network for mine safety monitoring. Based on the characteristics of underground mine gallery and the requirements for mine safety monitoring, we proposed a distributed heterogeneous hierarchical mine safety monitoring prototype system, namely HHMSM This system is capable of monitoring methane concentration, and locating miner. We proposed a novel overhearing-based adaptive data collecting scheme which exploits the redundancy and correlation of the sampling readings in both time and space to reduce traffic and control overhead with a well-bounded offset error for large-scale sensor networks. This mechanism is easy to implement and low-cost compared to other more theoretically based mechanisms such as Kalman filter. Experimental results show that HHMSM achieves better performance on flexibility, correctness, coverage, and lifetime compared with other existing wireless mine safety monitoring systems.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"1 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":"130560046","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 New Stable Clustering Scheme for Pseudo-Linear Highly Mobile Ad Hoc Networks","authors":"E. Sakhaee, A. Jamalipour","doi":"10.1109/GLOCOM.2007.225","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.225","url":null,"abstract":"The concept of clustering can provide an efficient means of establishing a hierarchical structure in large-scale mobile ad hoc networks. In this paper we introduce a new stability-driven clustering algorithm for pseudo-linear highly mobile ad hoc networks such as that of communication between aircraft, ships, trains and cars on highways. The new algorithm aims at establishing stable clusters, where clusterhead re-election is reduced, and cluster membership periods are increased in the targeted system. The scheme is suitable even in systems where global positioning systems (GPS) is not available. The algorithm involves dynamic clusterhead election. Simulations show that the proposed clustering algorithm provides highly stable clusters with several advantages over previous 1-hop clustering schemes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"13 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":"126816780","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":"The Impact of Mutual Coupling on MIMO Maximum-Ratio Combining","authors":"Yuhan Dong, B. Hughes, G. Lazzi","doi":"10.1109/GLOCOM.2007.858","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.858","url":null,"abstract":"We consider the impact of transmitter correlation and mutual coupling on MIMO MRC systems. We present optimal transmission strategies for three input power metrics as well as formulas for the resulting outage probabilities. Numerical results suggest that, regardless of the power metric, most of the performance benefits of MIMO MRC can be obtained with transmit antennas spaced as close as 0.2 - 0.3 wavelengths.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"39 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":"126883582","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 Novel Probability Distribution for Modeling Internet Traffic and its Parameter Estimation","authors":"E. Chlebus, Gautam Divgi","doi":"10.1109/GLOCOM.2007.886","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.886","url":null,"abstract":"A new probability distribution following from Lavalette's law has been proposed for modeling wireless Internet access session statistics collected in a public nationwide Wi-Fi network. We have derived maximum likelihood estimators for this distribution and found them for three data sets of session duration and traffic volume measurements. Goodness of all fits is nearly perfect. The introduced model outperforms the Pareto, truncated Pareto and modified truncated Pareto distributions. Its flexibility makes it a good candidate for describing both long- tailed and non-long-tailed data.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"32 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":"129041404","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}
Victor K. Y. Wu, Geoffrey Y. Li, M. Wylie-Green, T. Reid, P. Wang
{"title":"Error Rate Performance in OFDM-Based Cooperative Networks","authors":"Victor K. Y. Wu, Geoffrey Y. Li, M. Wylie-Green, T. Reid, P. Wang","doi":"10.1109/GLOCOM.2007.654","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.654","url":null,"abstract":"Cooperative relay networks have been shown to improve performance in wireless communication systems as a form of spatial diversity. In this paper, we investigate the error rate performance in a single path relay network and a multiple path relay network using orthogonal frequency division multiplexing (OFDM) signals. Using the amplify-and-forward and decode-and-forward relay algorithms, we derive input-output relations for the two networks. For the amplify-and-forward case, we consider two relay power allocation schemes. The first is constant gain allocation, where the amplifying gain is constant for all subcarriers. The second is equal power allocation, where each subcarrier transmits the same power. The former scheme does not require channel state information (CSI), while the latter one does. For the decode-and-forward case, the transmitter and each relay are assumed to have uniform power allocations. We simulate the word error rate (WER) performance for the two networks. For the single path relay network, amplify-and-forward gives very poor performance, because as we increase the distance between the transmitter and receiver (and thus, add more relays), more noise and channel distortion enter the system. Decode- and-forward gives significantly better performance because noise and channel distortion are eliminated at each relay. For the multiple path relay network, decode-and-forward again gives better performance than amplify-and-forward. However, the performance gains are small compared to the single path relay network case. Therefore, amplify-and-forward may be a more attractive choice in this case due to its lower complexity.","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":"130668905","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":"Delay and Energy Tradeoff in Multi-State Wireless Sensor Networks","authors":"W. L. Leow, H. Pishro-Nik","doi":"10.1109/GLOCOM.2007.198","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.198","url":null,"abstract":"This paper discusses a first attempt to investigate, using analytic means, the transmission delay and energy characteristics of a multi-state wireless sensor network. For such a network with in nodes, where each node can be active, resting or sleeping, a model that describes the transition of a node from one state to another and the probability associated with each state is proposed. Asymptotic analyses of transmission delay and energy are presented. We report the presence of a threshold for the arrival rate of data packets that decides which energy component dominates. The transmission delay-energy tradeoff is presented for the case where transmission energy varies directly with distance raised to a power and when the reported threshold is exceeded.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"12 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":"123978482","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":"Network Layer Negotiation-Based Channel Assignment in Multi-Channel Wireless Networks","authors":"Yi Qu, Chung-Horng Lung, A. Srinivasan","doi":"10.1109/GLOCOM.2007.147","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.147","url":null,"abstract":"Most wireless ad hoc networks research assumes a common communication channel. Using multiple channels can increase network capacity by transmitting traffic on different channels in an interference area. Channel assignment is a critical issue for the multi-channel scheme. Proactive receiver-based channel assignment (RCA) which is a network layer multichannel solution has shown better performance compared to single common channel solutions. However, channel collision cannot be resolved in some scenarios and a large number of orthogonal channels are needed with the RCA scheme. This paper proposes an on-demand negotiation-based channel assignment (NCA) that determines the communicating channel using the network topology and the dynamic traffic. We extend the OLSR (optimized link state routing) protocol to support NCA. Simulation results with NS-2 indicate considerable performance improvement on throughput and end-to-end delay of NCA over RCA for most scenarios.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"44 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":"123463974","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":"Novel Solutions to Integrals of Products of Q-Functions with Wireless Applications","authors":"Yunfei Chen, N. Beaulieu","doi":"10.1109/GLOCOM.2007.337","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.337","url":null,"abstract":"Infinite integrals involving the products of two, three and four Gaussian Q-functions of different arguments are solved in closed-form or in single integral form with finite upper and lower limits. These solutions provide novel expressions in the error rate analyses of signals such as general rectangular quadrature amplitude modulation, differentially encoded quaternay phase shift keying and new solutions for the error rate of the repetition code. As an example, closed-form expressions for the average symbol error rates of general rectangular quadrature amplitude modulation and the repetition code are obtained for a Nakagami-m fading channel.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"9 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":"116288794","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":"ARMA: An Efficient Secure Ad Hoc Routing Protocol","authors":"A. Boukerche, Yonglin Ren","doi":"10.1109/GLOCOM.2007.244","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.244","url":null,"abstract":"The motivation of this paper is to propose a novel secure distributed anonymous routing protocol in wireless mobile ad hoc networks. The objective of the protocol is not only to protect the anonymity and private information of the communicating nodes, but also to protect the security of the route discovery and prevent some malicious behaviors during the two- way conversation. Unlike other related anonymous protocols, in our protocol a source node does not need to collect and maintain the topological information of the network. Additionally, the mobile agent technique and the multicast mechanism used in our protocol protect the privacy of the sender and receiver of a message, while also providing protection for the message content as it traverses a network. They guarantee the anonymity of the sender node, receiver node, and their relationships. In this paper, we present our secure ad hoc routing protocol, which we refer to as ARMA, and provide its proof of correctness.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"152 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":"116502770","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}