2008 Proceedings of 17th International Conference on Computer Communications and Networks最新文献_第4页

Anonymity-Preserving Location Data Publishing 匿名保存位置数据发布

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.111

Girish Lingappa, Ying Cai

引用次数: 0

Using Optical Signal Processing to Provide Information Security in Data Networks 利用光信号处理提供数据网络中的信息安全

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.175

P. Prucnal, M. Fok, K. Kravtsov, Yanhua Deng, Zhenxing Wang, N. Kostinski

引用次数: 4

Revisiting p-Cycles / FIPP p-Cycles vs. Shared Link / Path Protection 重访p-Cycles / FIPP p-Cycles vs.共享链路/路径保护

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.93

Caroline Rocha, B. Jaumard

引用次数: 34

Fair Randomized Antenna Allocation in Asynchronous MIMO Multi-Hop Networks 异步MIMO多跳网络中的公平随机天线分配

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.39

Ahmed K. F. Khattab, A. Sabharwal, E. Knightly

引用次数: 10

Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks 基于能量高效生成树的无线传感器网络数据聚合

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.152

Z. Eskandari, M. Moghaddam, A. Mohajerzadeh

{"title":"Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks","authors":"Z. Eskandari, M. Moghaddam, A. Mohajerzadeh","doi":"10.1109/ICCCN.2008.ECP.152","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.152","url":null,"abstract":"Wireless sensor networks (WSN) consist of some nodes that have limited processing power, memory and energy source. These constraints cause the algorithms that presented in this field focus on these constraints. Data aggregation is any process in which information is gathered and expressed in a summary form. Data aggregation has been put forward as an essential paradigm for wireless routing in sensor networks. The idea is to combine the data coming from different sources, eliminating redundancy, minimizing the number of transmissions and thus saving energy. For this purpose, sensor nodes must form aggregation tree, then forward sensed data to the root of this tree. Data is aggregated in intermediate nodes and the results are sent toward the root. In this paper we propose an energy aware algorithm for construction the aggregation tree. The proposed algorithm considers both the energy and distance parameters to construct the tree. Simulation results show that the proposed algorithm has better performance in terms of energy efficiency and number of failed nodes which increases the network lifetime.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928785","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

Sources and Monitors: A Trust Model for Peer-to-Peer Networks 源和监视器:点对点网络的信任模型

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.67

Yan Li, M. Gouda

{"title":"Sources and Monitors: A Trust Model for Peer-to-Peer Networks","authors":"Yan Li, M. Gouda","doi":"10.1109/ICCCN.2008.ECP.67","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.67","url":null,"abstract":"In this paper, we introduce an objective model of trust in peer-to-peer networks. Based on this model, we develop protocols that can be used by the peers in a peer-to-peer network to compute the trust values of other peers in these networks. According to our model, the trust value of a peer is the probability that this peer sends correct messages to other peers, provided that this probability is at least 0.6. (A peer whose probability of sending correct messages is less than 0.6 is regarded as a bad peer that cannot be trusted by other peers in the network.) Each peer actively monitors several good peers in the network and accurately estimates the trust values of each of them. The peers then exchange messages about the trust values of the good peers that they have monitored, and each of them ends up accurately computing the trust values of many good peers in the network, even though many of the exchanged messages are arbitrarily wrong. Through analysis and simulation, we show that a peer in a network can compute the trust values of about 100 good peers in the network, while keeping the error in computing these trust values below 10-4.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128731991","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

A Message Complexity Oriented Design of Distributed Algorithm for Long-Lived Multicasting in Wireless Sensor Networks 面向消息复杂度的无线传感器网络长寿命组播分布式算法设计

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1504/IJSNET.2009.029394

Song Guo, M. Guo, Victor C. M. Leung

引用次数: 5

Top K-Leader Election in Wireless Ad Hoc Networks 无线自组织网络中的K-Leader选举

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.35

V. Raychoudhury, Jiannong Cao, Weigang Wu

引用次数: 19

A Preliminary Look at the Privacy of SSH Tunnels 浅谈SSH隧道的隐私性

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.122

M. Dusi, F. Gringoli, L. Salgarelli

引用次数: 23

Policy Distribution Methods for Function Parallel Firewalls 功能并行防火墙的策略分发方法

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.121

Michael R. Horvath, E. Fulp, Patrick S. Wheeler

{"title":"Policy Distribution Methods for Function Parallel Firewalls","authors":"Michael R. Horvath, E. Fulp, Patrick S. Wheeler","doi":"10.1109/ICCCN.2008.ECP.121","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.121","url":null,"abstract":"Parallel firewalls offer a scalable low latency design for inspecting packets at high speeds. Typically consisting of an array of m firewalls, these systems filter arriving packets according to a security policy. Given the firewall array, the rules can be distributed in two fashions. Data parallel copies the entire policy to each firewall and distributes packets. In contrast, function parallel distributes the rules and duplicates packets. The function parallel design can provide significantly lower delays than an equivalent data parallel design, however performance is dependent on how the rules are distributed. Therefore, policy management is vital to the performance of the function parallel firewall system. This paper describes the guidelines necessary to maintain policy integrity, which guarantees that a function parallel and a traditional firewall provide the same action for a packet. Based on these requirements, a policy can be divided into autonomous chains (sub-policies) that can be distributed across the firewall array. Although determining the optimal distribution was shown to be NP-hard, an effective algorithm was described. Simulation results indicate the distribution algorithm can provide an 86% reduction in the average processing delay as compared to previous distribution methods.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123859828","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