2008 33rd IEEE Conference on Local Computer Networks (LCN)最新文献_第3页

Spherical Coordinate Routing for 3D wireless ad-hoc and sensor networks 三维无线自组织和传感器网络的球面坐标路由

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664163

Shao Tao, A. Ananda, M. Chan

引用次数: 6

Supporting a seamless map in peer-to-peer system for Massively Multiplayer Online Role Playing Games 支持大规模多人在线角色扮演游戏的点对点系统无缝地图

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664202

Xinbo Jiang, F. Safaei

{"title":"Supporting a seamless map in peer-to-peer system for Massively Multiplayer Online Role Playing Games","authors":"Xinbo Jiang, F. Safaei","doi":"10.1109/LCN.2008.4664202","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664202","url":null,"abstract":"Massively multiplayer online role playing games feature huge maps that can be partitioned into smaller components called zones to achieve scalability. In peer-to-peer (P2P) systems, those zones can be assigned to peers who are willing to take up the role of zone servers. A seamless map requires inter-zone communications to allow interactions between players across zone boundaries. In assigning zones to peers, it is critical to seek approaches to reduce the inter-zone communication cost in P2P system. In this paper, we formulate the zone assignment problem for P2P system and demonstrate that the problem is NP-hard. We hence propose a low-cost heuristic that partitions the physical network into bins, as well as, aggregating the partitions of the virtual world by clustering neighboring zones in a game map. We then demonstrate that by assigning clustered neighboring zones in the virtual map into peers in common physical network bins, we are able to achieve similar inter-zone communication cost for the zone assignment problem as that can be achieved by the optimization model we formulated, while avoiding the prohibitively high computation cost required by the latter.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127585694","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

Monitoring the spatial-temporal effect of internet traffic based on Random Matrix Theory 基于随机矩阵理论的互联网流量时空效应监测

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664178

Jia Liu, Wenzhu Zhang, Jian Yuan, Depeng Jin, Lieguang Zeng

{"title":"Monitoring the spatial-temporal effect of internet traffic based on Random Matrix Theory","authors":"Jia Liu, Wenzhu Zhang, Jian Yuan, Depeng Jin, Lieguang Zeng","doi":"10.1109/LCN.2008.4664178","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664178","url":null,"abstract":"Monitoring traffic pattern is always an important approach to improve the performance of computer networks. In recent years, peer-to-peer (P2P) service gradually dominates the Internet traffic against traditional client-server (C-S) service such as Web. The changed situation of networks is mainly in two aspects. One is that popular P2P file-sharing applications require both board downstream and upstream bandwidth, which conflicts to asymmetry structure of the C-S service oriented networks, and another is that the topology of P2P overlay networks is varying with peers joining and leaving. The dramatic shift of Internet traffic may cause different patterns from that observed in early years. This leads a new round of Internet measurement, which requires effective monitoring of network-wide traffic within the region of ISP or autonomous system. Unfortunately, few of technologies can capture well the dynamics of C-S and P2P traffic in a macroscopic level. In this paper, we propose a method based on random matrix theory (RMT) for the detection of networkwide traffic pattern. Using only a few observation points, our method can monitor the macroscopic effect of the Internet traffic. We show that such macroscopic-level monitoring can be used to capture shifts in spatial-temporal patterns caused by P2P and C-S traffic, and inform where and when P2P and C-S traffic possibly arise in transit networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127696964","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

A cross-domain framework for coordinated end-to-end QoS adaptation 用于协调端到端QoS适配的跨域框架

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664224

Lifen Zhou, H. Pung, L. Ngoh

引用次数: 2

A graph theoretic approach in achieving robust peer-to-peer networking paradigm 实现健壮点对点网络范例的图论方法

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664227

Hosein Shafiei, F. Hoseini, A. Khonsari, M. Ould-Khaoua

引用次数: 0

Opportunistic Wireless Broadcast (OWB): Dynamic redundancy detection in the wireless medium 机会无线广播(OWB):无线媒体中的动态冗余检测

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664284

D. Salyers, A. Striegel, C. Poellabauer

引用次数: 0

Evaluating “no-new-wires” home networks 评估“无新线路”家庭网络

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664296

Yeting Yu, Jianping Pan, Ming Lu, Lin X. Cai, D. Hoffman

引用次数: 5

Key management in wireless sensor networks with inter-network sensor roaming 网络间传感器漫游无线传感器网络中的密钥管理

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664187

Sejin Choi, V. Sarangan, Steve Trost

{"title":"Key management in wireless sensor networks with inter-network sensor roaming","authors":"Sejin Choi, V. Sarangan, Steve Trost","doi":"10.1109/LCN.2008.4664187","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664187","url":null,"abstract":"Wireless sensor networks (WSNs) are considered to be an ideal solution for many commercial and industrial applications due to their low-cost and easy deployability. However, Security is a critical concern in WSNs due to the technical challenge of providing sufficient security with battery-powered sensors that have limited computational resources. Although numerous advancements have been made in the field of key management in WSNs, most have focused on establishing keys within a single WSN. In addition, many have assumed that the locations of the sensors are fixed. As the number of WSN applications increases, there is an increasing demand for solutions that allow sensors to securely roam between different WSNs even when the WSNs are managed by independent organizations. This paper presents a base station-to-sensor pairwise key management protocol that allows sensor nodes to relocate to other WSNs as required by the application. In addition, the proposed solution localizes the damage that can arise when a sensor or a base-station is compromised without increasing the computational burden on the sensors. To the best of our knowledge, this is one of the first few works to address the pairwise key distribution problem in WSNs that allow nodes to roam between different, independent networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129282327","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

Effect of intrusion detection on secure group communications in hierarchically structured group architectures 分层结构组体系结构中入侵检测对安全组通信的影响

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664307

Jin-Hee Cho, I. Chen

引用次数: 1

In-network-aggregation as case study for a support tool reducing the complexity of designing secure wireless sensor networks 以网络内聚合为例，研究了一种降低安全无线传感器网络设计复杂性的支持工具

2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664280

Steffen Peter, K. Piotrowski, P. Langendörfer

{"title":"In-network-aggregation as case study for a support tool reducing the complexity of designing secure wireless sensor networks","authors":"Steffen Peter, K. Piotrowski, P. Langendörfer","doi":"10.1109/LCN.2008.4664280","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664280","url":null,"abstract":"This paper shows how complex security-related design decisions in wireless sensor networks can be made less difficult with a proposed supporting tool. As case study in this paper we focus on in-network-aggregation which is a promising option to reduce network effort. We introduce several algorithms for concealed data aggregation, each with its own benefits and drawbacks concerning security issues but also with respect to code size, processing overhead etc. Selecting the optimal combination requires in-depth knowledge of programming resource constrained devices, protocols for those devices, and last but not least significant background in security. Our proposed configuration tool - named configKIT - has been designed to cope with such complexity. This paper presents how configKIT works, how it will be set up, and how it can be applied in practice. The pre-compiler assessment process considers memory, energy and security parameters and provides reliable application-dependent configurations to the developer before a single line of code is written. The approach can reduce development time significantly and enables even complex and sophisticated security algorithms to a broader public.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131478964","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