发布求助
文献互助 智能选刊 最新文献

39th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
OutMet: A new metric for prioritising intrusion alerts using correlation and outlier analysis OutMet:使用相关性和离群值分析对入侵警报进行优先级排序的新度量
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925787
Riyanat Shittu, A. Healing, R. Ghanea-Hercock, R. Bloomfield, M. Rajarajan
{"title":"OutMet: A new metric for prioritising intrusion alerts using correlation and outlier analysis","authors":"Riyanat Shittu, A. Healing, R. Ghanea-Hercock, R. Bloomfield, M. Rajarajan","doi":"10.1109/LCN.2014.6925787","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925787","url":null,"abstract":"In a medium sized network, an Intrusion Detection System (IDS) could produce thousands of alerts a day many of which may be false positives. In the vast number of triggered intrusion alerts, identifying those to prioritise is highly challenging. Alert correlation and prioritisation are both viable analytical methods which are commonly used to understand and prioritise alerts. However, to the author's knowledge, very few dynamic prioritisation metrics exist. In this paper, a new prioritisation metric - OutMet, which is based on measuring the degree to which an alert belongs to anomalous behaviour is proposed. OutMet combines alert correlation and prioritisation analysis. We illustrate the effectiveness of OutMet by testing its ability to prioritise alerts generated from a 2012 red-team cyber-range experiment that was carried out as part of the BT Saturn programme. In one of the scenarios, OutMet significantly reduced the false-positives by 99.3%.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125050490","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}
引用次数: 11
MEME: Real-time mobility estimation for mobile environments MEME:移动环境的实时移动性估计
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925765
S. Qayyum, U. Sadiq, Mohan J. Kumar
{"title":"MEME: Real-time mobility estimation for mobile environments","authors":"S. Qayyum, U. Sadiq, Mohan J. Kumar","doi":"10.1109/LCN.2014.6925765","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925765","url":null,"abstract":"Knowledge of user movement in mobile environments paves the way for intelligent resource allocation and event scheduling for a variety of applications. Existing schemes for estimating user mobility are limited in their scope as they rely on repetitive patterns of user movement. Such patterns may not exist, or are difficult to recognize in soft-real time, in open environments such as parks, malls, or streets. We propose a novel scheme for Real-time Mobility Estimation for Mobile Environments (MEME). MEME employs the concept of temporal distances and uses logistic regression to make real time estimations about user movement. MEME relies only on opportunistic message exchange and is fully distributed, scalable, and requires neither a central infrastructure nor Global Positioning System. MEME has been tested on real world and synthetic mobility traces - makes predictions about direction and count of users with up to 90% accuracy, enhances successful video downloads in shared environments.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124034253","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}
引用次数: 2
Delay tolerant handover for heterogeneous networks 异构网络的容延迟切换
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925794
Peggy Begerow, S. Krug, Atheer Al Rubaye, Karsten Renhak, J. Seitz
{"title":"Delay tolerant handover for heterogeneous networks","authors":"Peggy Begerow, S. Krug, Atheer Al Rubaye, Karsten Renhak, J. Seitz","doi":"10.1109/LCN.2014.6925794","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925794","url":null,"abstract":"Intermittent connectivity is one major challenge for mobile nodes that move between different networks. Existing handover procedures are able to maintain the connectivity, if the communication ranges of the networks overlap. Otherwise, the connection will be lost. This is especially problematic for e-health applications, when emergency physicians are on the way to a patient and need to stay in contact with him during the journey. Delay tolerant networks provide an option to maintain at least asynchronous communication under such conditions. But the whole network has to support the corresponding protocols, even if they are not needed in fully connected parts of the network. Therefore, we present an approach to provide handover functionality which allows nodes to switch to delay tolerant transmission seamlessly. We will discuss some conceptual aspects before presenting our solution and show the feasibility of our approach for an e-health scenario.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115037861","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}
引用次数: 1
Dynamic curve adaptation for geographic routing in Wireless Multihop Networks 无线多跳网络中地理路由的动态曲线自适应
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925754
Adrian Loch, Wei-Chih Hong, M. Hollick
{"title":"Dynamic curve adaptation for geographic routing in Wireless Multihop Networks","authors":"Adrian Loch, Wei-Chih Hong, M. Hollick","doi":"10.1109/LCN.2014.6925754","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925754","url":null,"abstract":"Geographic routing yields scalable operation in Wireless Multihop Networks. Nodes forward packets to the destination either in a greedy manner, or along arbitrary curves from source to destination. The latter allows for higher robustness, as paths are adjusted to avoid, for instance, congested areas or non-cooperative nodes. However, determining working curves is either based on unreliable trial-and-error approaches or requires global network knowledge. We propose two local schemes that dynamically adapt the curve defining the packet forwarding at node level. Our first procedure uses cached curves, and the second one builds local maps at each node. We implement them for the case of planar graph routing with guaranteed delivery but they can also be easily adapted to greedy routing. We evaluate our schemes by means of simulation in constrained multihop networks, and show that they reduce transmissions up to 74% compared to existing solutions.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124096757","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}
引用次数: 0
Standard-compliant simulation for self-organization schemes in LTE femtocells LTE飞蜂窝中自组织方案的标准兼容仿真
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925813
K. Suleiman, A. Taha, H. Hassanein
{"title":"Standard-compliant simulation for self-organization schemes in LTE femtocells","authors":"K. Suleiman, A. Taha, H. Hassanein","doi":"10.1109/LCN.2014.6925813","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925813","url":null,"abstract":"Femtocells play a critical role in LTE and LTE-Advanced networks. Their particular advantage is realized by their autonomy in management and optimization. Our interest in this work is in a special category of self-optimization use cases overseeing femtocell handovers. Specifically, we present a flexible, extendable and standards-compliant environment written in MATLAB for studying handover related self-optimization schemes. The paper describes the overall structure and design of the environment, and offers a detailed explanation of the different modules involved. Sample results that validate the environment are also given. To the best of our knowledge, no such environment has been publicly accessible so far.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127514683","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}
引用次数: 1
Leveraging network virtualization for energy-efficient cloud: Future directions 利用网络虚拟化实现高能效云:未来方向
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925825
Fatoumata B. Kasse, B. Gueye, H. Elbiaze
{"title":"Leveraging network virtualization for energy-efficient cloud: Future directions","authors":"Fatoumata B. Kasse, B. Gueye, H. Elbiaze","doi":"10.1109/LCN.2014.6925825","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925825","url":null,"abstract":"Reducing the energy consumed in cloud computing is becoming one of the most challenging research directions due to the overwhelming growth of services that are hosted and delivered by cloud computing. Indeed, the energy consumed by data transport represents a significant percentage according to the overall consumption of the cloud. Hence, by exploiting network and router virtualization technologies, we firstly propose a Green Cloud Architecture (GCA), where we can either shut down, or make in sleeping mode virtual routers; or migrate virtual routers towards another physical router according to energy-awareness. Secondly, we evaluate our green cloud architecture by proposing an energy-aware resource allocation algorithm. The mapping algorithm is evaluated through simulations and our green architecture significantly reduces the power consumption during data transport by up to 41%.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130126336","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}
引用次数: 2
Reducing MANET neighborhood discovery overhead 减少MANET邻域发现开销
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925795
Raphael Ernst, Sascha Jopen, Tobias Bartelt
{"title":"Reducing MANET neighborhood discovery overhead","authors":"Raphael Ernst, Sascha Jopen, Tobias Bartelt","doi":"10.1109/LCN.2014.6925795","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925795","url":null,"abstract":"Routing in MANETs still is a challenging task. Especially for proactive protocols where nodes periodically send control messages, a vast amount of the available data rate is used for link detection and the dissemination of topology information. Numerous enhancements to existing routing protocols to reduce the overhead caused by control messages have been proposed. Most of them use complex algorithms or keep track of previous messages. Due to the complexity and sometimes requirements for special hardware or information sources, none of these extensions are widely used. Therefore, we propose two extensions which are simple to implement yet provide significant overhead reduction for typical control messages. The first extension removes unnecessary bytes and redundancy from control messages. The second extension introduces smaller messages sent as replacements when the information did not change since the last message. Both extensions can be used in parallel or individually, providing a good amount of overhead reduction while being simple to implement and integrate.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122914225","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
Cryptographically-Curated File System (CCFS): Secure, inter-operable, and easily implementable Information-Centric Networking 加密管理文件系统(CCFS):安全、可互操作且易于实现的以信息为中心的网络
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925766
A. Goldman, A. Uluagac, J. Copeland
{"title":"Cryptographically-Curated File System (CCFS): Secure, inter-operable, and easily implementable Information-Centric Networking","authors":"A. Goldman, A. Uluagac, J. Copeland","doi":"10.1109/LCN.2014.6925766","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925766","url":null,"abstract":"Cryptographically-Curated File System (CCFS) proposed in this work supports the adoption of Information-Centric Networking. CCFS utilizes content names that span trust boundaries, verify integrity, tolerate disruption, authenticate content, and provide non-repudiation. Irrespective of the ability to reach an authoritative host, CCFS provides secure access by binding a chain of trust into the content name itself. Curators cryptographically bind content to a name, which is a path through a series of objects that map human meaningful names to cryptographically strong content identifiers. CCFS serves as a network layer for storage systems unifying currently disparate storage technologies. The power of CCFS derives from file hashes and public keys used as a name with which to retrieve content and as a method of verifying that content. We present results from our prototype implementation. Our results show that the overhead associated with CCFS is not negligible, but also is not prohibitive.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134029900","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}
引用次数: 2
An energy- and proximity-based unequal clustering algorithm for Wireless Sensor Networks 基于能量和邻近度的无线传感器网络不平等聚类算法
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925780
M. M. Afsar, M. Younis
{"title":"An energy- and proximity-based unequal clustering algorithm for Wireless Sensor Networks","authors":"M. M. Afsar, M. Younis","doi":"10.1109/LCN.2014.6925780","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925780","url":null,"abstract":"Wireless Sensor Networks (WSNs) are usually constrained energy and bandwidth. Many solutions, like network clustering, have been proposed in order to overcome these limitations. While this solution is deemed efficient, the cluster-heads closer to the base-station would forward more data packets than farther ones, and thus their energy drains at a faster rate. In this paper, we propose an Energy- and Proximity-based Unequal Clustering algorithm (EPUC) to solve this problem. Basically EPUC imposes a condition on the distance among cluster-heads that is adaptively adjusted, so that the inter-cluster-head proximity is smaller as they get closer to the base-station. In addition, the cluster population is set while factoring in the inter-cluster relaying activities in order to balance the load on cluster-heads. We evaluate the performance of EPUC through simulation and confirm its effectiveness of EPUC using network lifetime metrics.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125595745","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
Modeling for user interaction by influence transfer effect in online social networks 基于影响转移效应的在线社交网络用户交互建模
39th Annual IEEE Conference on Local Computer Networks Pub Date : 2014-10-16 DOI: 10.1109/LCN.2014.6925823
Qindong Sun, Nan Wang, Yadong Zhou, Hanqin Wang, L. Sui
{"title":"Modeling for user interaction by influence transfer effect in online social networks","authors":"Qindong Sun, Nan Wang, Yadong Zhou, Hanqin Wang, L. Sui","doi":"10.1109/LCN.2014.6925823","DOIUrl":"https://doi.org/10.1109/LCN.2014.6925823","url":null,"abstract":"User interaction is one of the most important features of online social networks, and is the basis of research of user behavior analysis, information spreading model, etc. However, existing approaches focus on the interactions between adjacent nodes, which do not fully take the interactions and relationship between local region users into consideration as well as the details of interaction process. In this paper, we find that there exists influence transfer effect in the process of user interactions, and present a regional user interaction model to analyze and understand interactions between users in a local region by influence transfer effect. Based on real data from Sina Weibo, we validate the effectiveness of our model by the experiments of user type classification, influential user identification and zombie user identification in online social networks. The experimental results show that our model present better performance than the PageRank based method and machine learning method.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130006513","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}
引用次数: 4
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信