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

Autonomous dynamic transmission scheduling based on neighbor node behavior for multihop wireless networks 基于邻居节点行为的多跳无线网络自主动态传输调度

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

Daiki Nobayashi, Y. Fukuda, T. Ikenaga

引用次数: 1

On the feasibility of secure application-layer communications on the Web of Things 物联网中安全应用层通信的可行性研究

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

J. Granjal, E. Monteiro, J. Silva

引用次数: 19

Distributed data filtering in logistics wireless sensor networks based on transmission relevance 基于传输相关性的物流无线传感器网络分布式数据过滤

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

Sebastian Zöller, A. Reinhardt, R. Steinmetz

引用次数: 4

MP-DNA: A novel distributed replica placement heuristic for WMNs MP-DNA:一种新的分布式副本放置启发式方法

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

Zakwan Al-Arnaout, Jonathan Hart, Q. Fu, Marcus Frean

{"title":"MP-DNA: A novel distributed replica placement heuristic for WMNs","authors":"Zakwan Al-Arnaout, Jonathan Hart, Q. Fu, Marcus Frean","doi":"10.1109/LCN.2012.6423679","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423679","url":null,"abstract":"Content replication and placement is an area that has been well explored in the scope of Content Delivery Networks (CDNs), but has received relatively less attention from the research community when it comes to Wireless Mesh Networks (WMNs). There are a number of Replica Placement Algorithms (RPAs) that are specifically designed for CDNs. But they do not consider the special features of wireless networks. In this paper, we propose a new heuristic called MP-DNA (Multiple Partitions per Delegate Node Assignment). We study the problem of optimal content replication and placement in WMNs. In our model, each mesh router acts as a replica server with limited storage capacity. The challenge is to replicate content as close as possible to the requesting clients and thus reduce the access latency per object, while minimizing the number of replicas. We formulate this problem in terms of combinatorial optimization and propose a novel, distributed, scalable heuristic for content replication. Using simulation tests, we demonstrate that MP-DNA is scalable, performing well with respect to the number of replica servers and the number of objects. Furthermore, MP-DNA can achieve a performance close to the Greedy-Global heuristic, with a significant reduction in running time, mean throughput and storage space required.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"7 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":"130769895","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}

引用次数: 7

Monitoring Traffic Activity Graphs with low-rank matrix approximation 低秩矩阵逼近监控交通活动图

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

Yang Liu, Wenji Chen, Y. Guan

引用次数: 2

On the distribution of inter contact time for DTNs ddn间接触时间分布的研究

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

Yuting Hu, Haiquan Wang, Chunhe Xia, Weiguo Li, Ying Yang

引用次数: 6

Detecting protocol switching covert channels 检测协议切换隐蔽通道

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

S. Wendzel, S. Zander

引用次数: 16

Novel assessment metric and countermeasures for traffic attack threats in wireless sensor networks 无线传感器网络中流量攻击威胁的评估度量与对策

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

Yousef Ebrahimi, M. Younis

{"title":"Novel assessment metric and countermeasures for traffic attack threats in wireless sensor networks","authors":"Yousef Ebrahimi, M. Younis","doi":"10.1109/LCN.2012.6423644","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423644","url":null,"abstract":"In wireless sensor networks, all data packets are routed from the individual sensor nodes towards an in-situ base-station (BS). Such traffic pattern makes the BS vulnerable to adversary's attack. Basically, an adversary would intercept the ongoing transmissions and localize their sources. Then by employing traffic analysis techniques, an adversary would correlate the intercepted transmissions to uncover the data path which may lead to the location of the BS. Evidence theory is a well-known scheme that an adversary might use for traffic analysis. However, prior work considered only intercepted transmissions as evidences in the correlation process without factoring in the time of interception. In this paper, we argue that time-based correlation increases the accuracy of the traffic analysis and makes contemporary countermeasures ineffective. A novel technique is proposed to counter the time correlation and boost the anonymity of the BS. The technique imposes buffering delay at each relaying node on the data route in order to disturb the time correlation among consecutive transmissions. Our technique is validated through simulation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"45 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":"124749070","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

Modeling visitor movement in theme parks 模拟主题公园的游客运动

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

Gürkan Solmaz, M. Akbaş, D. Turgut

{"title":"Modeling visitor movement in theme parks","authors":"Gürkan Solmaz, M. Akbaş, D. Turgut","doi":"10.1109/LCN.2012.6423650","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423650","url":null,"abstract":"Realistic modeling of the movement of people in an environment is critical for evaluating the performance of mobile wireless systems such as urban sensing or mobile sensor networks. Existing human movement models are either fully synthetic or rely on traces of actual human movement. There are many situations where we cannot perform an accurate simulation without taking into account what the people are actually doing. For instance, in theme parks, the movement of people is strongly tied to the locations of the attractions and is synchronized with major external events. For these situations, we need to develop scenario specific models. In this paper, we present a model of the movement of visitors in a theme park. The nondeterministic behavior of the human walking pattern is combined with the deterministic behavior of attractions in the theme park. The attractions are divided into groups of rides, restaurants and live shows. The time spent by visitors at different attractions is calculated using specialized queuing-theoretic models. We compare the realism of the model by comparing its simulations to the statistics of the theme parks and to real-world GPS traces of visitor movement. We found that our model provides a better match to the real-world data compared to current state-of-the-art movement models.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"4 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":"115884721","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}

引用次数: 16

Comparison of Anchor Selection algorithms for improvement of position estimation during the Wi-Fi localization process in disaster scenario 灾难场景下Wi-Fi定位过程中改进位置估计的锚点选择算法比较

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

O. Artemenko, T. Simon, A. Mitschele-Thiel, D. Schulz, R. Ta

引用次数: 13