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

TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs TRACK:一种新的基于连通支配集的无线传感器网络Sink迁移模型

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

A. Srinivasan, Jie Wu

{"title":"TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs","authors":"A. Srinivasan, Jie Wu","doi":"10.1109/ICCCN.2008.ECP.127","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.127","url":null,"abstract":"The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK - a novel sink mobility model exploiting the connected dominating set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the minimum spanning tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"31 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":"130609178","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}

引用次数: 34

A Lightweight Solution for Defending Against Deauthentication/Disassociation Attacks on 802.11 Networks 802.11网络去认证/反关联攻击的轻量级防御方案

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

T. Nguyen, Duc H. M. Nguyen, B.N. Tran, H. Vu, N. Mittal

引用次数: 50

TCP Over Optical Burst Switching (OBS): To Split or Not To Split? TCP Over光突发交换(OBS):分割还是不分割?

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

Deepak Padmanabhan, Rajesh R. C. Bikram, V. Vokkarane

引用次数: 6

Autocorrelation-Based Spectrum Sensing Algorithms for Cognitive Radios 基于自相关的认知无线电频谱感知算法

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

T. Ikuma, M. Naraghi-Pour

引用次数: 12

Rule Hashing for Efficient Packet Classification in Network Intrusion Detection 用于网络入侵检测中高效数据包分类的规则加密

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

A. Yoshioka, Shariful Hasan Shaikot, Min Sik Kim

{"title":"Rule Hashing for Efficient Packet Classification in Network Intrusion Detection","authors":"A. Yoshioka, Shariful Hasan Shaikot, Min Sik Kim","doi":"10.1109/ICCCN.2008.ECP.120","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.120","url":null,"abstract":"A rule-based intrusion detection system compares the incoming packets against rule set in order to detect intrusion. Unfortunately, it spends the majority of CPU time in packet classification to search for rules that match each packet. A common approach is to build a graph such as rule trees or finite automata for a given rule set, and traverse it using a packet as an input string. Because of the increasing number of security threats and vulnerabilities, the number of rules often exceeds thousands requiring more than hundreds of megabytes of memory. Exploring such a huge graph becomes a major bottleneck in high-speed networks since each packet incurs many memory accesses with little locality. In this paper, we propose rule hashing for fast packet classification in intrusion detection systems. The rule hashing, combined with hierarchical rule trees, saves memory and reduce the number of memory accesses by allowing the whole working set to be accommodated in a cache in most of the time, and thus improves response times in finding matching rules. We implement our algorithm in Snort, a popular open-source intrusion detection system. Experimental results show that our implementation is faster than original Snort to deal with the same real packet traces while consuming an order of magnitude less memory.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"46 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":"128135608","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}

引用次数: 17

A Model for Differentiated Service Support in Wireless Multimedia Sensor Networks 无线多媒体传感器网络中差异化服务支持模型

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

M. Moghaddam, D. Adjeroh

{"title":"A Model for Differentiated Service Support in Wireless Multimedia Sensor Networks","authors":"M. Moghaddam, D. Adjeroh","doi":"10.1109/ICCCN.2008.ECP.164","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.164","url":null,"abstract":"Different network applications need different Quality of Service (QoS) requirements such as packet delay, packet loss, bandwidth and availability. It is important to develop a network architecture which is able to guaranty quality of service requirements for high priority traffic. In Wireless Multimedia Sensor Networks (WMSNs), a sensor node may have different kinds of sensor which gather different types of data, with differing levels of importance. We argue that the sensor networks should be willing to spend more resources in disseminating packets that carry more important information. Some applications of WMSNs need to send real time traffic toward the sink node. This real time traffic requires low latency and high reliability so that immediate remedial and defensive actions can be taken, where necessary. Similar to wired networks, service differentiation in wireless sensor networks is also very important. In this paper we propose a differentiated service model for WMSNs. The proposed model can provide requested quality of service for high priority real time classes. In the proposed model, we distinguish high priority real time traffic from the low priority non-real time traffic, and input traffic streams are then serviced based on their priorities. Simulation results confirm the efficiency of the proposed model.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"79 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":"126188118","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}

引用次数: 22

A System Architecture for Evolving Protocol Stacks (Invited Paper) 演进协议栈的系统架构(特邀论文)

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

A. Keller, T. Hossmann, M. May, Ghazi Bouabene, Christophe Jelger, C. Tschudin

引用次数: 8

NePTune: Optimizing Sensor Networks 海王星:优化传感器网络

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

S. K. Wahba, S. Dandamudi, Andrew R. Dalton, J. Hallstrom

引用次数: 5

CAC-RD: A Call Admission Control for UMTS Networks c - rd: UMTS网络的呼叫接纳控制

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

C. R. Storck, A. Ribeiro, Fátima Duarte-Figueiredo

引用次数: 5

ESD: A Novel Optimization Algorithm for Positioning Estimation in Wireless Sensor Networks - Analysis and Experimental Validation via a Testbed Platform 一种新的无线传感器网络定位估计优化算法——基于测试平台的分析与实验验证

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

S. Tennina, M. Renzo

{"title":"ESD: A Novel Optimization Algorithm for Positioning Estimation in Wireless Sensor Networks - Analysis and Experimental Validation via a Testbed Platform","authors":"S. Tennina, M. Renzo","doi":"10.1109/ICCCN.2008.ECP.166","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.166","url":null,"abstract":"In recent contributions [Tennina, S., et al., 2008], [Tennina, S., 2008], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and suggested an enhanced version of the steepest descent (ESD) algorithm, which we have shown to be competitive with well-known distributed localization algorithms in terms of estimation accuracy and numerical complexity. Moreover, in [Tennina, S., 2008] we have conducted a statistical characterization of the positioning error distribution of the ESD algorithm, and shown that the latter error can be well approximated by the family of Pearson distributions. However, the analysis in [Tennina, S., et al., 2008; Tennina, S., 2008; Tennina, S., 2008] is mainly based on numerical (i.e., computer-based) simulations, which only in part allows to predict the system performance in a realistic environment where sensor nodes are expected to operate. As a consequence, the aim of this contribution is twofold: i) to analyze the error performance of the ESD algorithm in a real testbed platform working in a typical indoor environment, and ii) to compare experimental and simulated results to substantiate via real measurements our previous findings useful for network setup and analysis. In particular, we will first report on the implementation issues related on mapping the ESD algorithm on the CrossBow's MICAz sensor node platform [http://www.xbow.com/Products/wproductsoverview.aspx.], and, then, we will investigate, via real experiments, on the effect of network topology and ranging errors in estimating the final position of an unknown sensor node.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 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":"129949480","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