37th Annual IEEE Conference on Local Computer Networks最新文献_第2页

A real-time services performance and interference mitigation for femtocell scenarios in LTE networks LTE网络中飞蜂窝场景的实时业务性能和干扰缓解

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423671

Mauricio Iturralde, T. Ali-Yahiya, A. Wei, A. Beylot

{"title":"A real-time services performance and interference mitigation for femtocell scenarios in LTE networks","authors":"Mauricio Iturralde, T. Ali-Yahiya, A. Wei, A. Beylot","doi":"10.1109/LCN.2012.6423671","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423671","url":null,"abstract":"In order to enhance the Quality of Service in LTE, femtocell architecture has been proposed as a promising solution. However, interference is the main weak point in femtocell scenarios which causes a serious impact on multimedia services performance. Femtocell interference mitigation in LTE networks is the principle objective of this paper. We propose an enhancement of the well known four-coloring method for interference mitigation by combining it with cooperative game theory. Our proposed scheme aims to provide a solution to effectively achieve femtocell interference mitigation while guaranteeing the bitrate application for real-time services. The basic metrics of quality of service (QoS) such as throughput, Packet Loss Ratio (PLR), delay and Signal-to-Interference-plus-Noise-Ratio (SINR) are investigated. Our simulation environment is derived from realistic scenarios in order to study the performance of real-time service like Video and VoIP applications. Throughout our numerical results, we demonstrate the improvement of QoS constraints along with balancing between interference reduction requirement and resource allocation efficiency for real-time applications.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122298757","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}

引用次数: 5

A distributed energy saving approach for Ethernet switches in data centers 数据中心以太网交换机的分布式节能方法

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423667

Weisheng Si, J. Taheri, Albert Y. Zomaya

引用次数: 18

Interconnecting disjoint network segments using a mix of stationary and mobile nodes 使用固定和移动节点的混合连接不连接的网络段

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423631

Ahmad Abbas, M. Younis

{"title":"Interconnecting disjoint network segments using a mix of stationary and mobile nodes","authors":"Ahmad Abbas, M. Younis","doi":"10.1109/LCN.2012.6423631","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423631","url":null,"abstract":"In many applications need arises to connect a set of disjoint nodes or segments. Examples include repairing a partitioned network topology after the failure of multiple nodes, federating a set of standalone networks to serve an emerging event, and forming a strongly connected topology for a sparsely located data sources. Contemporary solutions for interconnecting these disjoint segments/nodes either deploy stationary relay nodes (RN) to form data paths or employ one or multiple mobile data collectors (MDCs) that pick packets from sources and transport them to destinations. The RN-based solution is preferred since it establishes permanent links as opposed to the intermittent links provided by the MDCs. In this paper we investigate the interconnection problem when the number of available RNs is insufficient for forming a stable topology and a mix of RNs and MDCs is to be used. We present an algorithm for determining where the RNs are to be placed and planning optimized travel routes for the MDCs so that the data delivery latency as well as the MDC motion overhead are minimized. The performance of the algorithm is validated through simulation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127648505","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}

引用次数: 9

Towards an architecture for mobile healthcare 迈向移动医疗体系结构

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423623

P. J. Dillon, T. Znati

引用次数: 4

Characterization and modeling in large-scale urban DTNs 大规模城市dtn的表征与建模

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423647

Chunhe Xia, Dongyue Liang, Haiquan Wang, Min Luo, Weifeng Lv

{"title":"Characterization and modeling in large-scale urban DTNs","authors":"Chunhe Xia, Dongyue Liang, Haiquan Wang, Min Luo, Weifeng Lv","doi":"10.1109/LCN.2012.6423647","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423647","url":null,"abstract":"In Delay Tolerant Networks (DTNs), characteristics of mobility model have essential impact on routing protocols design and verification. Most of current studies about network characteristics are derived from theoretical models or small-scale real network traces. Properties of nodes in those networks are simple and can not reflect features in large-scale applications. In addition, few studies focus on modeling large-scale urban DTNs based on the network characteristics. In this paper, we analyze a large-scale urban DTN including traces from 12096 taxies in Beijing City. We observed that inter contact time (ICT) between two nodes satisfies exponential distribution, and the network forms a number of hotspot areas in which the vehicles tend to cluster. Based on the observation, we design a DTN mobility model by introducing characteristics of hotspot area and prove that distribution of ICT in this model also exhibits exponential nature as it is in real urban DTNs. Our further simulation experiment reveals the similarity between the proposed model and urban DTNs. This result thus demonstrates that the model is rational to guide DTN protocols design and verification in large-scale applications.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132755629","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}

引用次数: 19

Half-Symmetric Lens based localization algorithm for wireless sensor networks 基于半对称透镜的无线传感器网络定位算法

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423639

Noureddine Lasla, A. Derhab, Abdelraouf Ouadjaout, Miloud Bagaa, A. Ksentini, N. Badache

{"title":"Half-Symmetric Lens based localization algorithm for wireless sensor networks","authors":"Noureddine Lasla, A. Derhab, Abdelraouf Ouadjaout, Miloud Bagaa, A. Ksentini, N. Badache","doi":"10.1109/LCN.2012.6423639","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423639","url":null,"abstract":"The area-based localization algorithms use only the location information of some reference nodes, called anchors, to give the residence area of the remaining nodes. The current algorithms use triangle, ring or circle as a geometric shape to determine the sensors' residence area. Existing works suffer from two major problems: (1) in some cases, they might issue wrong decisions about nodes' presence inside a given area, or (2) they require high anchor density to achieve a low location estimation error. In this paper, we deal with the localization problem by introducing a new way to determine the sensors' residence area which shows a better accuracy than the existing algorithms. Our new localization algorithm, called HSL (Half Symmetric Lens based localization algorithm for WSN), is based on the geometric shape of half-symmetric lens. We also uses the Voronoi diagram in HSL to mitigate the problem of unlocalizable sensor nodes. Finally, we conduct extensive simulations to evaluate the performance of HSL. Simulation results show that HSL has better locatable ratio and location accuracy compared to representative state-of-the-art area-based algorithms.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134353341","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}

引用次数: 6

A privacy-preserving reputation system for participatory sensing 参与式感知的隐私保护信誉系统

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423585

Kuan Lun Huang, S. Kanhere, Wen Hu

{"title":"A privacy-preserving reputation system for participatory sensing","authors":"Kuan Lun Huang, S. Kanhere, Wen Hu","doi":"10.1109/LCN.2012.6423585","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423585","url":null,"abstract":"Participatory sensing is a revolutionary paradigm in which volunteers collect and share information from their local environment using mobile phones. The design of a successful participatory sensing application is met with two challenges - (1) user privacy and (2) data trustworthiness. Addressing these challenges concurrently is a non-trivial task since they result in conflicting system requirements. User privacy is often achieved by removing the links between successive user contributions while such links are essential in establishing trust. In this work, we present a way to transfer reputation values (which is a proxy for assessing trustworthiness) between anonymous contributions. We also propose a reputation anonymization scheme that prevents the inadvertent leakage of privacy due to the inherent relationship between reputation information. We conduct extensive simulations using real-world mobility traces and practical application. The results show that our solution reduces the probabilities of users being tracked via successive contributions by as much as 80%. Moreover, this improvement has no discernible impact on the normal operation of the application.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114633764","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}

引用次数: 68

Near-optimal routing for contour detection in wireless sensor networks 无线传感器网络中轮廓检测的近最优路由

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423662

V. Pulimi, T. Paul, Kevin G. Stanley, D. Eager

引用次数: 4

LPS and LRF: Efficient buffer management policies for Delay and Disruption Tolerant Networks LPS和LRF:延迟和中断容忍网络的有效缓冲管理策略

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423649

J. Naves, I. Moraes, C. Albuquerque

引用次数: 19

A novel dynamic Q-learning-based scheduler technique for LTE-advanced technologies using neural networks 基于神经网络的lte先进技术的一种新的动态q学习调度技术

37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423642

I. Comsa, Sijing Zhang, Mehmet Emin Aydin, P. Kuonen, J. Wagen

{"title":"A novel dynamic Q-learning-based scheduler technique for LTE-advanced technologies using neural networks","authors":"I. Comsa, Sijing Zhang, Mehmet Emin Aydin, P. Kuonen, J. Wagen","doi":"10.1109/LCN.2012.6423642","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423642","url":null,"abstract":"The tradeoff concept between system capacity and user fairness attracts a big interest in LTE-Advanced resource allocation strategies. By using static threshold values for throughput or fairness, regardless the network conditions, makes the scheduler to be inflexible when different tradeoff levels are required by the system. This paper proposes a novel dynamic neural Q-learning-based scheduling technique that achieves a flexible throughput-fairness tradeoff by offering optimal solutions according to the Channel Quality Indicator (CQI) for different classes of users. The Q-learning algorithm is used to adopt different policies of scheduling rules, at each Transmission Time Interval (TTI). The novel scheduling technique makes use of neural networks in order to estimate proper scheduling rules for different states which have not been explored yet. Simulation results indicate that the novel proposed method outperforms the existing scheduling techniques by maximizing the system throughput when different levels of fairness are required. Moreover, the system achieves a desired throughput-fairness tradeoff and an overall satisfaction for different classes of users.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129668723","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}

引用次数: 20