2011 Ninth Annual Communication Networks and Services Research Conference最新文献

Adaptive Load Balancing for the Agile All-Photonic Network 敏捷全光子网络的自适应负载均衡

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.34

I. Khazali, A. Agarwal, L. Kencl

引用次数: 2

A Robust Anomaly Detection Technique Using Combined Statistical Methods 一种结合统计方法的鲁棒异常检测技术

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.23

Joseph Ndong, Kave Salamatian

{"title":"A Robust Anomaly Detection Technique Using Combined Statistical Methods","authors":"Joseph Ndong, Kave Salamatian","doi":"10.1109/CNSR.2011.23","DOIUrl":"https://doi.org/10.1109/CNSR.2011.23","url":null,"abstract":"Parametric anomaly detection is generally a three steps process where, in the first step a model of normal behavior is calibrated and thereafter, the obtained model is used in order to reduce the entropy of the observation. The second step generates an innovation process that is used in the third step to make a decision on the existence or not of an anomaly in the observed data. Under favorable conditions the innovation process is expected to be a Gaussian white noise. However, in practice, this is hardly the case as frequently the observed signals are not gaussian themselves. Moreover long range dependencies, as well as heavy tail in the observation can lead to important deviation from the normality and the independence in the innovation processes. This, results in the frequent observation that the decisions made assuming that the innovation process is a white and Gaussian results in a large false positive rate. In this paper we deal with the above issue. Our approach consists of not assuming anymore that the innovation process is Gaussian and white. In place we are assuming that the real distribution of the process is a mixture of Gaussian and that there are some time dependency in the innovation that we will capture by using a Hidden Markov Model. We therefore derive a new decision process and we show that this approach results into an important decrease of false alarm rates. We validate this approach over realistic traces.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128227952","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

Cluster Size Optimization in Cooperative Spectrum Sensing 协同频谱感知中的聚类大小优化

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.11

E. Karami, A. Banihashemi

{"title":"Cluster Size Optimization in Cooperative Spectrum Sensing","authors":"E. Karami, A. Banihashemi","doi":"10.1109/CNSR.2011.11","DOIUrl":"https://doi.org/10.1109/CNSR.2011.11","url":null,"abstract":"In this paper, we study and optimize the cooperation cluster size in cooperative spectrum sensing to maximize the throughput of secondary users (SUs). To calculate the effective throughput, we assume each SU spends just 1 symbol to negotiate with the other SUs in its transmission range. This is the minimum overhead required for each SU to broadcast its sensing decision to the other members of the cluster. When the number of SUs is large, the throughput spent for the negotiation is noticeable and therefore increasing the cooperation cluster size does not improve the effective throughput anymore. In this paper, we calculate the effective throughput as a function of the cooperation cluster size, and then we maximize the throughput by finding the optimal cluster size. Various numerical results show that when decisions are combined by the OR-rule, the optimum cooperation cluster size is less than when the AND-rule is used. On the other hand, the optimum cluster size monotonically decreases with the increase in the average SNR of the SUs. Another interesting result is that when the cluster size is optimized the OR-rule always outperforms the AND-rule.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126320818","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

Context Aware Middleware Services for Disconnection Tolerant Mobile Applications 允许断开连接的移动应用的上下文感知中间件服务

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.29

Sangwhan Cha, W. Du

引用次数: 4

RWA and p-Cycles RWA和p-Cycles

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.36

Hai Anh Hoang, B. Jaumard

{"title":"RWA and p-Cycles","authors":"Hai Anh Hoang, B. Jaumard","doi":"10.1109/CNSR.2011.36","DOIUrl":"https://doi.org/10.1109/CNSR.2011.36","url":null,"abstract":"While there has been many studies on the efficient design of p-cycles focusing on optimizing their spare capacity efficiency, few of them consider such a design under the wavelength continuity assumption, i.e., no wavelength converter at any node. Consequently, few authors look at the routing and wavelength assignment in the context of p-cycles, where p-cycles have to be assigned the same wavelength as the paths of which they protect at least one link. In this paper, we propose to investigate thoroughly the issue of wavelength conversion vs. wavelength continuity for p-cycles, with large scale optimization tools (decomposition techniques) in order to get an exact estimate of the consequences of the wavelength continuity assumption on the spare capacity requirements and on the provisioning cost. The recourse to decomposition techniques allows the design of exact efficient scalable models contrarily to heuristics which ensure scalability but no accuracy guarantee. In particular, it allows an on-line generation of improving p-cycles, one after the other with respect to the objective, instead of a costly computing time off-line generation of p-cycles as in previous studies, a key issue for a scalable solution. Numerical results show that the difference between the capacity requirement under wavelength conversion vs. under wavelength continuity is meaningless. Consequently, in view of the reduced provisioning cost (saving at least on the converters), we advocate the design of p-cycles under a wavelength continuity assumption.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133754707","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}

引用次数: 1

Credit-Based Flow Control for Multihop Wireless Networks and Stochastic Petri Nets Analysis 基于信用的多跳无线网络流量控制及随机Petri网分析

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.48

R. Schoenen

引用次数: 10

Using Traffic Shaping to Improve Performance for Raw Data Transfer and Video Streaming 使用流量整形来提高原始数据传输和视频流的性能

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.16

A. Hutanu, Sandeep Nimmagadda

引用次数: 3

Sensor Web Adaptation to Dynamic Sensor Networks 传感器网络适应动态传感器网络

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.28

Gunita Saini, B. Nickerson

{"title":"Sensor Web Adaptation to Dynamic Sensor Networks","authors":"Gunita Saini, B. Nickerson","doi":"10.1109/CNSR.2011.28","DOIUrl":"https://doi.org/10.1109/CNSR.2011.28","url":null,"abstract":"As nodes appear and disappear in a Wireless Sensor Network (WSN), communication protocols acting in the data link, network and transport layers adapt dynamically to the new network structure. We present an extension of the dynamic nature of WSNs to the web via an adaptive communication protocol called the adaptive Sensor Web Language (SWL). Adaptive SWL provides a web application with a reliable mechanism for automatically tracking and displaying changes in sensor network architecture. New nodes automatically appear in web-based applications. A color fading mechanism is also provided to differentiate sensor nodes which have not communicated within the expected time frame. Two new message types, Request Announce and Announce are added to SWL to support this adaptation. All software layers, including sensor nodes, gateway, base station (including the database) and the web applications were updated. Two web applications were implemented to clearly demonstrate web application adaptation to dynamic WSNs. The Open Geospatial Consortium's (OGC) standard Sensor Observation Service (SOS) was integrated with Google maps to show the spatial context of changing WSN structure. A test network was established using 6 sensor nodes and 10 sensors (6 battery voltage sensors, 2 air temperature sensors and 2 solar radiation sensors), and 1 gateway. Each node was added one by one over 4 hours in the network, then removed one by one from the network over 4 hours. Testing indicates appearance of a node in the web application within about 13 seconds of being added to the WSN with a system latency of 47.5 seconds averaged over 40 tests.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122758097","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}

引用次数: 1

Opportunistic Network Coding for Energy Conservation in Wireless Sensor Networks 面向无线传感器网络节能的机会网络编码

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.42

Philipp M. Glatz, L. Hörmann, C. Steger, R. Weiss

{"title":"Opportunistic Network Coding for Energy Conservation in Wireless Sensor Networks","authors":"Philipp M. Glatz, L. Hörmann, C. Steger, R. Weiss","doi":"10.1109/CNSR.2011.42","DOIUrl":"https://doi.org/10.1109/CNSR.2011.42","url":null,"abstract":"Wireless sensor networks (WSN) continuously enhance processing capabilities and miniaturization. However, there exists a design gap to energy and bandwidth availability. Especially battery technology cannot keep pace with demands of novel versatile services. A common approach for conserving channel capacity and energy is optimizing power-aware routing and different kind of duty cycling (DC) and harvesting technology. While these optimizations are usually dealt with separately, we provide a novel framework with integrating and analyzing these different aspects in a practical TinyOS implementation at the same time. We implement the essential combination of energy harvesting aware routing (EHAR) together with radio and application DC and we add the novel approach of opportunistic network coding (ONC) for WSNs. We give detailed analysis of the applicability of application-level DC compared to low-power MAC and power save modes for state-of-the-art WSN and harvesting system hardware. We elaborate static and dynamic aspects of EHAR, scalable network coding (SNC) and ONC. Combining analytical models, comprehensive simulation and detailed highly accurate hardware power profiling measurement results, we demonstrate energy conservation from 13% to 50% when applying ONC and SNC.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121786498","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}

引用次数: 12

Random Network Coding Effects on CDMA/TDD Mesh Networks 随机网络编码对CDMA/TDD网状网络的影响

2011 Ninth Annual Communication Networks and Services Research Conference Pub Date : 2011-05-02 DOI: 10.1109/CNSR.2011.40

J. Saleh, A. Elhakeem

引用次数: 1