{"title":"Server selection and admission control for IP-based video on demand using available bandwidth estimation","authors":"Brian Meskill, A. Davy, B. Jennings","doi":"10.1109/LCN.2011.6115202","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115202","url":null,"abstract":"Service providers offering IP-based video on demand services often replicate video content in multiple content servers with different network points of attachment. When a request for a content item arrives from an end-user, a decision must be made as to whether the request should be admitted and, if so, which server should be used. To ensure adequate quality-of-service this admission control / server selection decision should be cognisant of the current link utilisation on the paths between the end-user's point of attachment and those of the servers. We have studied the conditions and parameters under which end-to-end available bandwidth estimation tools (ABETs) pathChirp and Assolo can be used in this decision process. We specify an admission control / server selection algorithm that uses available bandwidth estimations. Simulation study results show pathChirp (but not Assolo), when appropriately parameterised, can generate available bandwidth estimates that can be used by our admission control / server selection algorithm to react appropriately to changes in background loads on network paths.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115314420","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}
Jintao Lin, Lianfeng Shen, Nan Bao, Bailong Su, Zhipeng Deng, Dayang Wang
{"title":"Channel Characteristic Aware Spectrum Aggregation algorithm in Cognitive Radio networks","authors":"Jintao Lin, Lianfeng Shen, Nan Bao, Bailong Su, Zhipeng Deng, Dayang Wang","doi":"10.1109/LCN.2011.6115528","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115528","url":null,"abstract":"In Cognitive Radio (CR) networks, it is common that the spectrum holes are too narrow to support high-speed communications. Discontinuous Orthogonal Frequency Division Multiplexing (DOFDM) is a good way for a secondary user to access several spectrum fragments simultaneously with one Radio Front (RF). In this paper, a novel Channel Characteristic Aware Spectrum Aggregation (CCASA) algorithm which uses DOFDM to aggregation spectrum fragments with only one radio front is proposed in order to increase the overall throughput of a CR network. By combining Adaptive Modulation and Coding (AMC) and spectrum aggregation, the good subcarriers are assigned to the specific secondary users in CCASA algorithm thus achieving a better channel efficiency. Different bandwidth requirement and aggregation limitation of secondary users are both considered in this algorithm while maintaining a fairly low computational complexity. The simulation results show that CCASA achieves a bigger total throughput than existing aggregation algorithms.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127278739","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":"Performance modelling of broadcast polling protocol in unsaturated IEEE 802.16 networks","authors":"Jianqing Liu, Sammy Chan, H. Vu","doi":"10.1109/LCN.2011.6115181","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115181","url":null,"abstract":"In this paper, we propose a general model for the broadcast polling protocol of unsaturated IEEE 802.16 networks in which each subscriber station has a finite buffer. A subscriber station can be modelled as a M/G/1/K queue with its service time determined by the broadcast polling protocol. The buffer overflow probability, network throughput and packet delay performances are analyzed. The proposed model is validated by simulation confirming its accuracy for various scenarios studied.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124775659","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}
Robson Costa, P. Portugal, F. Vasques, R. Moraes, Ricardo Felipe Custódio
{"title":"A coordination layer to handle real-time communication in Wi-Fi networks with uncontrolled traffic sources","authors":"Robson Costa, P. Portugal, F. Vasques, R. Moraes, Ricardo Felipe Custódio","doi":"10.1109/LCN.2011.6115204","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115204","url":null,"abstract":"In this paper we propose the use of a coordination layer to handle real-time communication in infrastructured WiFi networks. This layer combines a TDMA scheme with a traffic separation mechanism (FCR MAC), which enables the prioritization of real-time (RT) traffic over uncontrolled (external) traffic sources. The target of this paper is to assess the behavior of this coordination layer when supporting RT communication and to compare these results with those obtained with IEEE 802.11e EDCA. The simulation assessment considers an open communication environment, where a set of RT and non-RT stations share the same coverage area and frequency band. A realistic error-prone channel was used to measure the impact of interferences against an error-free channel. We show that the proposed solution offers a significant improvement when compared with EDCA, in what concerns average deadline losses and delay.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123731682","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":"Providing mobile Internet service using MOnetary Wireless NETworking (MOWNET)","authors":"A. Nayebi, Amin Dahesh, H. Sarbazi-Azad","doi":"10.1109/LCN.2011.6115542","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115542","url":null,"abstract":"A MOWNET is a wireless network that uses financial incentives to make different agents collaborate. In this paper, architecture is proposed to use MOWNETs for Internet service providing. Limited shared bandwidth is a substantial problem in wireless Internet access, which can be alleviated by increasing the number of base stations and decreasing the transmission power of each station. A promising approach to commercialize this idea is using financial incentives to encourage people to collaborate in building the network. Adding financial incentives to the network protocols and using anonymous relay agents incur substantial considerations in network design, which are considered in our protocol.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114938285","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 area coverage reliability of wireless sensor networks","authors":"M. Shazly, E. Elmallah, J. Harms, H. Aboelfotoh","doi":"10.1109/LCN.2011.6115520","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115520","url":null,"abstract":"In this paper we consider wireless sensor networks (WSNs) whose nodes can fail independently of each other during normal operation. For successful operation, a network is required to provide sensing coverage of an aggregate area that exceeds a given application-specific coverage requirement. We formulate an area coverage reliability problem that quantifies the likelihood that the network can be in an operating state where the coverage condition is satisfied. Existing results show that the problem is #P-hard even when the WSN is restricted to a rectangular grid with a single corner-located sink. Thus, an exact solution is unlikely to exist for many WSN topologies. We present a framework for computing reliability lower bounds by decomposing an arbitrary WSN into subnetworks that share only the sink node and computing coverage probabilities for each subnetwork. We show that the framework yields an efficiently computable lower bound when the subnetworks are chosen to be trees and cycles. Our design utilizes a 3-state node reliability model that has been shown to improve over the conventional 2-state (operate/fail) model. The obtained results investigate some design issues of the framework, the quality of the obtained lower bounds, and discuss an application of the obtained lower bounds in improving the design of WSNs.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116200408","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":"Effective utilization of place as a resource in pocket switched networks","authors":"Mohammad S. Hashemian, Kevin G. Stanley","doi":"10.1109/LCN.2011.6115200","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115200","url":null,"abstract":"The growth of wireless devices with short-range communications capabilities is making research into Pocket Switched Networks (PSN)s more appealing. While some recent research has investigated the role of location in predicting the mobility patterns of autonomous agents within PSNs, little attention has been paid to the location as a resource itself. In this paper we investigate the potential for stationary nodes, acting as relay stations for mobile agents in PSNs. Using empirical datasets, we demonstrate that appropriate utilization of place as a resource can increase network performance and decrease the load on nodes which are popular because of their location rather than their mobility pattern.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121982574","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}
M. Femminella, R. Francescangeli, E. Maccherani, Luca Monacelli
{"title":"Implementation and performance analysis of advanced IT services based on open source JAIN SLEE","authors":"M. Femminella, R. Francescangeli, E. Maccherani, Luca Monacelli","doi":"10.1109/LCN.2011.6115544","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115544","url":null,"abstract":"The standard framework proposed by the JAIN SLEE specifications is emerging as a viable alternative for the development of advanced telecom services. The Mobicents JSLEE platform is the only open source implementation of those specifications. Its tuning is not trivial since it relies on several Java technologies implemented in multiple abstract layers. In this paper, we present the implementation of two realistic benchmark services and the relevant test campaign for the performance analysis of the Mobicents JAIN SLEE platform, with the aim of optimizing the achievable system throughput, for using it in a carrier-grade environment.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122103535","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":"Scalability issues in localizing Things","authors":"Walid M. Ibrahim, A. Taha, H. Hassanein","doi":"10.1109/LCN.2011.6115533","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115533","url":null,"abstract":"Localization will play an important role in the Internet of Things (IoT), and will employ several complementary mechanisms, each applicable to Things with different characteristics. This paper investigates the impact of scale and mobility on wireless multi-hop localization mechanisms, which specifically target Things with limited capabilities inhibiting them for self-localization, i.e., cannot locally perform trilateration or angle of arrival analysis. Building on a representative system for wireless multi-hop localization, we evaluate the impact of network size and node mobility on various operational aspects, including number of messages sent, collisions, localization accuracy, in addition to the percentage of unlocalized nodes. We also show how a basic optimization can result in substantial gains. More critically, however, we establish the need for further optimizations in realizing localizations in IoT.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129696189","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":"iHorse — A WSN-based equine monitoring system","authors":"A. Rodrigues, J. Silva, F. Boavida, Tiago Camilo","doi":"10.1109/LCN.2011.6115158","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115158","url":null,"abstract":"Horses played a key role in the history of mankind, having been instrumental in the rise and fall of great empires. In modern days, they are still very important assets, from economical, operational or even sentimental points of view. Their importance is, thus, the main motivation for developing the iHorse equine monitoring system presented in this paper. iHorse is a deployed, fully-operational, commercially-available, wireless-sensor-network-based system and application, developed and tested over a three-year period. The aim of this paper is to provide information on the main features of the system, including its architecture, implementation details and performance data. The paper also discusses the lessons learnt throughout the system development and deployment phases.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124632767","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}