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

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

Decision centric identification and rank ordering of security metrics 以决策为中心的安全度量的识别和排序

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

Moazzam Khan, Mohammad-Ali Omer, J. Copeland

{"title":"Decision centric identification and rank ordering of security metrics","authors":"Moazzam Khan, Mohammad-Ali Omer, J. Copeland","doi":"10.1109/LCN.2012.6423610","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423610","url":null,"abstract":"A network has several attributes which play a role in determining the security of the network and its robustness to external threats. These attributes are related to security through a complex nonlinear function which is generally unknown to the network management personnel. Since the network security is an explicit function of these attributes, the managers do not realize when the value of a certain attribute has become critical to the point of threatening network security. In this paper we take a theoretically rigorous approach to quantifying the effect each of the individual attributes has on the network. By using ideas from probability and decision theory, we can order the significant factors determining network security. This is similar to dimensionality reduction which is commonly employed for model based identification methods. Based on our analysis we can come up with critical coefficients which must be maintained by the administrator if the network is to remain secure to external threats. We show how the mathematical framework leads to the prediction of network's security health, and how real world data can be used to substantiate these claims. Paper concludes by validating our results on a list of compromised machine and determining if our identified metrics played the significant role in the infection.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"65 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":"131783051","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}

引用次数: 3

DYAMAND: DYnamic, Adaptive MAnagement of Networks and Devices 动态的，自适应的网络和设备管理

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

J. Nelis, Tom Verschueren, D. Verslype, Chris Develder

{"title":"DYAMAND: DYnamic, Adaptive MAnagement of Networks and Devices","authors":"J. Nelis, Tom Verschueren, D. Verslype, Chris Develder","doi":"10.1109/LCN.2012.6423604","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423604","url":null,"abstract":"Consumer devices increasingly are “smart” and hence offer services that can interwork with and/or be controlled by others. However, the full exploitation of the inherent opportunities this offers, is hurdled by a number of potential limitations. First of all, the interface towards the device might be vendor and even device specific, implying that extra effort is needed to support a specific device. Standardization efforts try to avoid this problem, but within a certain standard ecosystem the level of interoperability can vary (i.e. devices carrying the same standard logo are not necessarily interoperable). Secondly, different application domains (e.g. multimedia vs. energy management) today have their own standards, thus limiting trans-sector innovation because of the additional effort required to integrate devices from traditionally different domains into novel applications. In this paper, we discuss the basic components of current so-called service discovery protocols (SDPs) and present our DYAMAND (DYnamic, Adaptive MAnagement of Networks and Devices) framework. We position this framework as a middleware layer between applications and discoverable/controllable devices, and hence aim to provide the necessary tool to overcome the (intra- and inter-domain) interoperability gaps previously sketched. Thus, we believe it can act as a catalyst enabling transsector innovation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"39 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":"131302819","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}

引用次数: 21

Application-aware adaptive duty cycle-based Medium Access Control for energy efficient wireless data transmissions 基于应用感知自适应占空比的高效无线数据传输介质访问控制

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

Yang Song, B. Ciubotaru, Gabriel-Miro Muntean

引用次数: 5