C. Williamson, Emir Halepovic, Hongxia Sun, Yujing Wu
{"title":"Characterization of CDMA2000 cellular data network traffic","authors":"C. Williamson, Emir Halepovic, Hongxia Sun, Yujing Wu","doi":"10.1109/LCN.2005.37","DOIUrl":"https://doi.org/10.1109/LCN.2005.37","url":null,"abstract":"This paper describes the analysis of low-level measurements from a CDMA2000 1x cellular data network. The network traces record detailed information about wireless Internet packet data call activity on the network, including mobile station identity, call initiation, burst behaviour, supplementary channel usage, soft handoffs, and call termination. The analysis in this paper focuses on one continuous week-long trace data set, representative of cellular data network activity. The results from the analysis illustrate the burstiness of the packet call arrival process and the diurnal patterns of cellular data users. The results also characterize the activity per cell site, activity per user, data burst activity, user mobility, and the density of cellular network coverage. Several observations reinforce known results about heavytailed properties in wired Internet traffic, while others show interesting differences in wireless versus wireline traffic","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114741642","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 genetic algorithm for finding optimal location area configurations for mobility management","authors":"J. Taheri, Albert Y. Zomaya","doi":"10.1109/LCN.2005.6","DOIUrl":"https://doi.org/10.1109/LCN.2005.6","url":null,"abstract":"This work presents a new approach to solve the location management problem by using the location areas approach. A modified genetic algorithm is used to find the optimal configuration of location areas in a mobile network. The location areas configuration of the network is modeled so that the general condition of all the chromosomes of each population improves rapidly. Since a generic genetic algorithm will not be so efficient in solving this problem, several modifications have been made to the genetic optimizer to improve its performance. These modifications deal with the mutation operation where three types of mutation are considered after the crossover operation of the genetic algorithm. Simulation results are very promising and they lead to network configurations that are unanticipated","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126640801","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":"Power efficient error control for Bluetooth-based sensor networks","authors":"J. H. Kleinschmidt, W. C. Borelli, M. Pellenz","doi":"10.1109/LCN.2005.108","DOIUrl":"https://doi.org/10.1109/LCN.2005.108","url":null,"abstract":"This paper studies different error control schemes in wireless sensor networks with Bluetooth technology. The tradeoff between reliability and energy consumption of Bluetooth packets are analyzed, using different error control techniques, such as retransmission and channel coding. The AUX1 packet is utilized for custom coding and also adaptive techniques are proposed based on the number of hops of the network. The wireless channel is modeled with Rayleigh fading. The results obtained may be used as references to determine the packet type in a sensor application","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126975542","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":"Energy-efficient bounded-diameter tree scatternet for Bluetooth PANs","authors":"M. Medidi, Jonathan Campbell","doi":"10.1109/LCN.2005.63","DOIUrl":"https://doi.org/10.1109/LCN.2005.63","url":null,"abstract":"Bluetooth is a promising wireless technology that enables devices to form short-range multihop wireless ad-hoc networks, or personal area networks (PANs). However, scatternet formation is one of the challenges that need to be resolved since the performance of a Bluetooth network depends largely on the scatternet topology used. We first identify a particular variant of a height-balanced binary tree, termed ACB-tree for almost-complete-binary tree, that allows two such trees to be combined to create a larger ACB-tree while retaining the height-balance requirement. We then present a distributed scatternet formation algorithm for creation of ACB-trees. We further extend the algorithm to produce an ACB-tree scatternet with energy efficient properties. We also present simulations, conducted using Blueware simulator, to provide experiment results to study and compare the performance of the resulting scatternets","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125179635","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":"Probabilistic coverage in wireless sensor networks","authors":"Nadeem Ahmed, S. Kanhere, S. Jha","doi":"10.1109/LCN.2005.109","DOIUrl":"https://doi.org/10.1109/LCN.2005.109","url":null,"abstract":"The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage in order to anticipate this sensing behavior. We investigate the coverage issues in wireless sensor networks based on probabilistic coverage and propose a distributed probabilistic coverage algorithm (PCA) to evaluate the degree of confidence in detection probability provided by a randomly deployed sensor network. The probabilistic approach is a deviation from the idealistic assumption of uniform circular disc for sensing coverage used in the binary detection model. Simulation results show that area coverage calculated by using PCA is more accurate than the idealistic binary detection model","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123500720","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 gossip-based membership management algorithm for large-scale peer-to-peer media streaming","authors":"Bin Rong, I. Khalil, Z. Tari","doi":"10.1109/LCN.2005.7","DOIUrl":"https://doi.org/10.1109/LCN.2005.7","url":null,"abstract":"A new adaptive gossip-based membership management algorithm is proposed. Its adaptive nature enables it to confine the control overhead to local ranges, and adapt to the ever-changing network traffic conditions and group membership. The random nature of the algorithm ensures that it can cope with random failures and offer proactive measures to maintain service at a certain level. Mathematical analysis and simulation results indicate that more than 90% of the nodes can work properly even under very high network dynamics (with a short half-life time of 50 seconds), and all these are achieved by using a relatively low overhead","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121498273","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":"Design and evaluation of a high performance parallel file system","authors":"Li Ou, Xubin He","doi":"10.1109/LCN.2005.50","DOIUrl":"https://doi.org/10.1109/LCN.2005.50","url":null,"abstract":"In this paper we propose a high performance parallel file system over iSCSI (iPVFS) for cluster computing. iPVFS provides a cost-effective solution for heterogeneous cluster environment by dividing a set of I/O servers into two groups, one group with higher performance servers as I/O nodes, while another group with relatively lower performance machines serves as storage target nodes. This combination provides a higher aggregate performance because of the cooperative cache among different target nodes. We have developed a model to analyze iPVFS. Our simulation results show that using same number of total nodes, iPVFS outperforms PVFS for both small requests and large requests under different workloads","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130448210","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":"Real 3G WCDMA networks performance analysis","authors":"N. Kara, O. Issa, Alain Byette","doi":"10.1109/LCN.2005.114","DOIUrl":"https://doi.org/10.1109/LCN.2005.114","url":null,"abstract":"Third generation (3G) technologies are becoming more widely deployed. However, a prerequisite for the successful deployment of such services is the measurement of practical performance characteristics offered by the underlying wireless network (e.g. 3G). This paper presents the results of a number of experiments aiming to identify the performance of a real WCDMA (wideband code division multiple access) -based wireless network for different types of applications: FTP, HTTP, VoIP, and audio and video streaming. Moreover, the paper discusses the impact on the measured performance by assigning different QoS profiles to end-users. Based on the evaluation results, the paper provides a set of recommendations for both operators and service developers when designing and deploying applications on such wireless networks. These recommendations can also help researchers in accurately validating 3G wireless network research proposals","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123337790","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}
F. Eyermann, P. Rácz, B. Stiller, C. Schaefer, T. Walter
{"title":"Service-oriented Accounting Configuration Management based on Diameter","authors":"F. Eyermann, P. Rácz, B. Stiller, C. Schaefer, T. Walter","doi":"10.1109/LCN.2005.124","DOIUrl":"https://doi.org/10.1109/LCN.2005.124","url":null,"abstract":"The new accounting configuration management based on diameter is highly suitable for wireless and mobile communication systems. The diameter protocol extensions by new commands and new AVP's result in a complete and standard-conforming approach. This paper draws the conclusion that the service-oriented accounting configuration management proposed complies with all requirements defined. The common layer above any network access technology is the IP layer and all diameter extensions proposed fit well. User and service profiles enable mobile and wireless network operators to have the best available flexibility to add new services, assign new services to users, and, by providing the respective accounting definitions, have a user- and service-specific accounting configuration in place","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116500170","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":"Efficient SOAP binding for mobile Web services","authors":"K. Y. Lai, T. Phan, Z. Tari","doi":"10.1109/LCN.2005.62","DOIUrl":"https://doi.org/10.1109/LCN.2005.62","url":null,"abstract":"Existing Web services rely on HTTP and TCP as the underlying transport protocols for SOAP messaging. While these protocols provide a number of benefits, including being able to pass through firewalls and are universally supported across different platforms, they were designed for wired networks with high bandwidth, low latency and low error rate transmissions. Due to the variability of wireless channels however, these assumptions do not hold in wireless environments. In this paper, we investigate the performance of HTTP and TCP as transport protocols for SOAP in wireless environments. Through extensive testing, we show that SOAP-over-HTTP and SOAP-over-TCP are inefficient and lead to high latency and transmission overhead for wireless applications. To overcome these limitations, we study the use of UDP as a binding protocol for SOAP. The results obtained are promising and show that SOAP-over-UDP provides throughput that is ten times higher compared to SOAP-over-HTTP in a wireless setting. Furthermore, using UDP to transport SOAP messages reduces transmission overhead by more than 50% compared to SOAP-over-HTTP. Finally, to illustrate where UDP binding can be useful, example applications are also described in this paper","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129847743","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}