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

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

筛选
英文 中文
Identification of malicious web pages through analysis of underlying DNS and web server relationships 通过分析底层DNS和web服务器关系来识别恶意网页
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664306
C. Seifert, I. Welch, P. Komisarczuk, C. Aval, B. Endicott-Popovsky
{"title":"Identification of malicious web pages through analysis of underlying DNS and web server relationships","authors":"C. Seifert, I. Welch, P. Komisarczuk, C. Aval, B. Endicott-Popovsky","doi":"10.1109/LCN.2008.4664306","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664306","url":null,"abstract":"Malicious Web pages that launch drive-by-download attacks on Web browsers have increasingly become a problem in recent years. High-interaction client honeypots are security devices that can detect these malicious Web pages on a network. However, high-interaction client honeypots are both resource-intensive and unable to handle the increasing array of vulnerable clients. This paper presents a novel classification method for detecting malicious Web pages that involves inspecting the underlying server relationships. Because of the unique structure of malicious front-end Web pages and centralized exploit servers, merely counting the number of domain name extensions and Domain Name System (DNS) servers used to resolve the host names of all Web servers involved in rendering a page is sufficient to determine whether a Web page is malicious or benign, independent of the vulnerable Web browser targeted by these pages. Combining high-interaction client honeypots and this new classification method into a hybrid system leads to performance improvements.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"78 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":"126096958","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}
引用次数: 37
Graph theory based aggregation of sensor readings in wireless sensor networks 无线传感器网络中基于图论的传感器读数聚合
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664216
T. Bokareva, N. Bulusu, S. Jha
{"title":"Graph theory based aggregation of sensor readings in wireless sensor networks","authors":"T. Bokareva, N. Bulusu, S. Jha","doi":"10.1109/LCN.2008.4664216","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664216","url":null,"abstract":"Two of the fundamental challenges associated with data gathering in sensor networks are data classification and data aggregation. This paper provides a solution to classify and aggregate sensor readings. We leverage our previous experience and use Competitive Learning Neural Network (CLNN) as the data classification mechanism. We then propose and evaluate Graph Theory Based Aggregation (GTBA) which combines outputs of CLNN across the network. We have evaluated two main interpretations of GTBA on real data sets produced by the WSN and on a testbed consisting of MicaZ motes. We demonstrate its ability to deduce an accurate representation of the data and distinguish the noise free data with a high probability.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"54 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":"132540927","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
Queue-based contention control for congested multihop wireless networks 拥塞多跳无线网络中基于队列的争用控制
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664228
Jaeseon Hwang, Hyuk Lim
{"title":"Queue-based contention control for congested multihop wireless networks","authors":"Jaeseon Hwang, Hyuk Lim","doi":"10.1109/LCN.2008.4664228","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664228","url":null,"abstract":"In multihop wireless networks, packets from a source node are relayed by intermediate nodes (relay nodes) toward their destination node along a multihop wireless path. However, if a relay node simultaneously receives a large number of packets and fails to forward them at the same rate as they are received, the end-to-end throughput performance of the network degrades due to packet losses at the bottleneck relay node. In this paper, we propose an adaptive contention control algorithm that adjusts the channel access probability depending on the level of congestion at each relay node in order to improve the end-to-end throughput performance in multihop wireless networks. In this algorithm, a bottleneck relay node is granted permission to increase its channel access probability by reducing its contention window size, thus enabling it to forward packets more aggressively. Through a series of simulations, we show that the end-to-end throughput is improved by about 60% in a chain topology.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"8 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":"133211575","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
Covert channels in multiplayer first person shooter online games 多人第一人称射击在线游戏中的隐蔽通道
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664172
S. Zander, G. Armitage, P. Branch
{"title":"Covert channels in multiplayer first person shooter online games","authors":"S. Zander, G. Armitage, P. Branch","doi":"10.1109/LCN.2008.4664172","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664172","url":null,"abstract":"Covert channels aim to hide the existence of communication between two or more parties. Such channels typically utilise pre-existing (overt) data transmissions to carry hidden messages. Internet-based covert channels often encode new information into unused (or loosely specified) IP packet header fields, or the time intervals between IP packet arrivals. We propose a novel covert channel embedded within the traffic of multiplayer, first person shooter online games. We encode covert bits as slight, yet continuous, variations of a playerpsilas characterpsilas movements. Movement information is propagated to all clients attached to a given game server, yet the channel remains covert so long as the variations are visually imperceptible to the human players. A modified version of Quake III Arena is used to demonstrate our concept. We empirically analyse the covert channelpsilas bit rate, and compare the statistical characteristics of unmodified game traffic with those of game traffic carrying covert information.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"69 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":"131086726","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}
引用次数: 29
IP address configuration in VANET using centralized DHCP 在VANET中使用集中式DHCP配置IP地址
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664252
Brijesh Kadri Mohandas, R. Liscano
{"title":"IP address configuration in VANET using centralized DHCP","authors":"Brijesh Kadri Mohandas, R. Liscano","doi":"10.1109/LCN.2008.4664252","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664252","url":null,"abstract":"Vehicular ad-hoc networks (VANET) are a mobile adhoc networking technology to facilitate vehicle-to-vehicle and vehicle-to-roadside communication. A vehicle in VANET is considered to be an intelligent mobile node capable of communicating with its neighbors and other vehicles in the network. As in a mobile ad-hoc network (MANET) it is necessary to identify or address each vehicle in the vehicular ad-hoc network with a unique address. The current addressing mechanisms in VANET do not succeed in configuring the vehicle with a unique address. Furthermore, there is a need for address reconfigurations depending on the mobility patterns. In order to deal with these problems, we have presented a centralized addressing scheme for VANET using DHCP (Dynamic Host Configuration Protocol). Results obtained in our approach are compared against the results presented in one of the existing addressing mechanism in VANET. It is observed that our approach is efficient and feasible for vehicular ad-hoc networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"17 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":"114942546","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}
引用次数: 42
CORE: centrally optimized routing extensions for the IEEE 802.16 MeSH mode CORE:针对IEEE 802.16 MeSH模式的集中优化路由扩展
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664152
P. Mogre, Nico d'Heureuse, M. Hollick, R. Steinmetz
{"title":"CORE: centrally optimized routing extensions for the IEEE 802.16 MeSH mode","authors":"P. Mogre, Nico d'Heureuse, M. Hollick, R. Steinmetz","doi":"10.1109/LCN.2008.4664152","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664152","url":null,"abstract":"The IEEE 802.16 standard specifies a MeSH mode which permits the deployment of Wireless Mesh Networks (WMNs) supporting carrier-grade QoS. The network operator for such planned WMNs is interested in maximizing the traffic admitted in the WMN and simultaneously supporting QoS. Recently network coding has emerged as a promising technique for increasing the throughput in WMNs. This paper proposes CORE, which addresses the problem of jointly optimizing the routing, scheduling, and bandwidth savings via network coding. Prior solutions are either not applicable in the 802.16 MeSH or computationally too costly to be of practical use in the WMN under realistic scenarios. COREpsilas heuristics, in contrast, are able to compute solutions for the above problem within a operator definable maximum computational cost, thereby enabling the computation and near real-time deployment of the computed solutions. We analyze the performance of COREpsilas heuristics via a thorough simulation study covering the typical usage scenarios for WMNs. The results presented demonstrate that CORE is able to increase the number of flows admitted considerably and with minimal computational costs. Further, the results provide insights into limiting factors for the gains which can be obtained in different usage scenarios.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"14 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":"115422574","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}
引用次数: 8
Q-learning based collaborative load balancing using distributed search for unstructured P2P networks 基于q学习的分布式搜索非结构化P2P网络协同负载平衡
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664283
S. Thampi, K. C. Sekaran
{"title":"Q-learning based collaborative load balancing using distributed search for unstructured P2P networks","authors":"S. Thampi, K. C. Sekaran","doi":"10.1109/LCN.2008.4664283","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664283","url":null,"abstract":"Peer-to-peer structures are becoming more and more popular and an exhilarating new class of ground-breaking, Internet-based data management systems. Query load balancing is an important problem for the efficient operation of unstructured P2P networks. The key issue is to identify overloaded peers and reassign their loads to others. This paper proposes a novel mobile agent based two-way load balancing technique for dynamic unstructured P2P networks. In this scheme, target peers are selected based on the result of reinforcement learning. Simulation results indicate that our technique manages the load on peers effectively and increases the search performance significantly.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"70 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114114214","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}
引用次数: 8
An evaluation method for delay time and its jitter of WLAN using a GSPN model 基于GSPN模型的无线局域网延迟时间及其抖动评估方法
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664285
M. Tsunoyama, H. Imai
{"title":"An evaluation method for delay time and its jitter of WLAN using a GSPN model","authors":"M. Tsunoyama, H. Imai","doi":"10.1109/LCN.2008.4664285","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664285","url":null,"abstract":"This paper proposes a method for evaluating mean delay time and its standard deviation (jitter) of wireless local area networks (WLAN) using Generalized Stochastic Petri Nets (GSPN). The WLAN is modeled using GSPN and the mean delay time and its jitter are calculated using equations derived from the Markov chain associated with the GSPN model. The method is applied to evaluate delay time and its jitter for 802.11e WLAN. The results reveal that the values calculated based on the equations agree well with the values obtained from simulations.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"21 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":"115651578","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
Optimal distance-based clustering for tag anti-collision in RFID systems RFID系统中标签防碰撞的最优距离聚类
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664179
W. Alsalih, Kashif Ali, H. Hassanein
{"title":"Optimal distance-based clustering for tag anti-collision in RFID systems","authors":"W. Alsalih, Kashif Ali, H. Hassanein","doi":"10.1109/LCN.2008.4664179","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664179","url":null,"abstract":"Tag collisions can impose a major delay in radio frequency identification (RFID) systems. Such collisions are hard to overcome with passive tags due to their limited capabilities. In this paper, we look into the problem of minimizing the time required to read a set of passive tags. We propose a novel approach, the distance-based clustering, in which the interrogation zone of an RFID reader is divided into equal sized clusters (discs), and tags of different clusters are read separately. The novel contributions of this paper are the following. First, we provide a mathematical analysis to the problem and derive a closed-form formula relating delay to the number of tags and clusters. Second, we devise a method to efficiently find the optimal number of clusters. The proposed scheme can be augmented with any tree-based anti-collision scheme, and substantially improve its performance. Simulation results show that our approach makes significant improvements in reducing collisions and delay.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"18 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":"126106560","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}
引用次数: 33
Implementation and performance evaluation of Selective Repeat ARQ for WiMAX NS-2 model WiMAX NS-2模式选择性重复ARQ的实现与性能评价
2008 33rd IEEE Conference on Local Computer Networks (LCN) Pub Date : 2008-10-31 DOI: 10.1109/LCN.2008.4664174
M. Hempel, Wei Wang, H. Sharif, Ting Zhou, P. Mahasukhon
{"title":"Implementation and performance evaluation of Selective Repeat ARQ for WiMAX NS-2 model","authors":"M. Hempel, Wei Wang, H. Sharif, Ting Zhou, P. Mahasukhon","doi":"10.1109/LCN.2008.4664174","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664174","url":null,"abstract":"With the steady development of WiMAX based broadband wireless access networks, complete and accurate simulation studies become crucial. In an effort to further improve our ns-2 simulation model for mobile WiMAX, we have implemented a selective repeat automatic retransmission request (SR-ARQ) mechanism into our model and evaluated its performance and accuracy. In this paper, we present the design and implementation methodology of the WiMAX SR-ARQ simulation model in ns-2 and discuss its accuracy via extensive simulation studies. Our evaluation clearly shows that SR-ARQ achieves increased successful packet delivery ratio and goodput, which is true for both non-saturated channels and saturated channels. In each case a cost of increased bandwidth consumption and latency overhead for received packets is also quantitatively analyzed. We believe the implementation of SR-ARQ in the ns-2 simulation model and its evaluation studies will provide profound empirical values to WiMAX field test studies.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"116 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":"124601324","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信