{"title":"Performance Comparison of Opportunistic Routing Schemes in Wireless Sensor Networks","authors":"P. Spachos, Liang Song, D. Hatzinakos","doi":"10.1109/CNSR.2011.46","DOIUrl":"https://doi.org/10.1109/CNSR.2011.46","url":null,"abstract":"Opportunistic routing is considered a promising direction for improving the performance of wireless sensor networks (WSN). In opportunistic routing, the intermediate nodes collaborate on packet forwarding in order to achieve high throughput in the face of lossy links. That makes the next node selection process crucial. In this paper, we are presenting an opportunistic routing protocol for wireless sensor networks. We also examine three extensions of that protocol, based on different next node selection criterion. We illustrate how each extension works and we evaluate and compare their performance in terms of energy consumption, delivery ratio and packet latency.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"15 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":"117327281","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}
{"title":"On Threshold Selection for Principal Component Based Network Anomaly Detection","authors":"P. Djukic, B. Nandy","doi":"10.1109/CNSR.2011.25","DOIUrl":"https://doi.org/10.1109/CNSR.2011.25","url":null,"abstract":"Principal component based anomaly detection has emerged as an important statistical tool for network anomaly detection. It works by projecting summary network information onto a signal and noise sub-spaces and detecting anomalies in the noise sub-space. Recently some major problems where detected with this network anomaly approach. The chief among the problems is the difficulty in selecting a threshold used to declare that the energy in the noise sub-space contains a network anomaly. We show that the reason for this problem is that some of the assumption previously used to select the threshold, namely that the traffic follows a Normal distribution, do not fit the reality of the available network traces. Then, we show that the energy in the noise sub-space can be modeled with the long-tailed Cauchy distribution and use this approximation to calculate reliable thresholds. Our analysis of network traces indicates that the Cauchy distribution approximation of the energy distribution should significantly lower the false alarm rate.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"28 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":"116622829","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}
{"title":"A Structural Analysis of Network Delay","authors":"A. Abdelkefi, Yuming Jiang","doi":"10.1109/CNSR.2011.15","DOIUrl":"https://doi.org/10.1109/CNSR.2011.15","url":null,"abstract":"Network delay is a crucial metric for evaluating the state of the network. We present in this paper a structural analysis of network delay, based on delay measurements of aback bone network. This delay analysis is performed using a subspace method called Principal Component Analysis (PCA). The analysis reveals that the delay time series can be decomposed into two constituents: a smooth periodic trend and a set of sparse bursts. We call the former the \"normal\" component and the latter the \"abnormal\" component. While this structural decomposition is appealing and may be used to further infer other delay information of interest, we find that using PCA in delay analysis has the same challenges as used in traffic analysis. Particularly, it experiences performance degradation due to the so called \"perturbation phenomenon\".","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"105 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":"124443697","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}
{"title":"Performance of a Frequency-Hopped Real-Time Remote Control System in a Multiple Access Scenario","authors":"F. Cervantes, M. St-Hilaire","doi":"10.1109/CNSR.2011.49","DOIUrl":"https://doi.org/10.1109/CNSR.2011.49","url":null,"abstract":"The ubiquitous presence of powerful low-power wireless systems on chip (SoC) able to operate in the Industrial, Scientific and Medical (ISM) band has brought a new enhanced operational choice for real-time Radio Control (RC) applications such as aircrafts and cars in the hobby grade category. Frequency Hopping Spread Spectrum (FHSS) has become the dominant transmission technique for the previously mentioned hardware platform. Even though, FHSS provides for resilience to noise and interference, partial-band type of interference could be specially harmful with regards to the overall system performance. This is critical in real-time RC applications as it could increase system latency. The present paper characterizes the performance of a single real-time RC application, which operates in a realistic multi-user ISM environment by means of two main metrics: System Lag Occurrence Probability (SLOP) and Probability of Losing a Packet (PoLP). Both Synchronous FHSS Multiple Access (SFHSS-MA) and Asynchronous FHSS Multiple Access (AFHSSMA) environments have been modeled. Simulation results show the level of impact on system performance of key engineering parameters such as clock drift, number of co-located users, and variable data packet duty cycle.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"74 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":"127145636","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}
{"title":"Collaborative Spectrum Sensing in Cognitive Radio System - Performance Analysis of Weighted Gain Combining","authors":"T. Feng, G. Wang, Stephen Culver, M. Gidlund","doi":"10.1109/CNSR.2011.10","DOIUrl":"https://doi.org/10.1109/CNSR.2011.10","url":null,"abstract":"Cognitive radio (CR) is a novel approach to improving the spectral efficiency of licensed radio frequency bands by opportunistically accessing unused portions of the band without introducing interference to a licensed user. To reliably identify unused portions in a dynamic environment, a collaborative spectrum sensing (CSS) approach is known to be advantageous. In this article we will consider a weighted energy fusion scheme for secondary users with different sensing channel conditions and to analyze the performance we suggest a numerical approach by utilizing a result from probability density function of the weighted sum of noncentral chi-square random variables are used. Simulation experiments are provided to confirm the viability of the proposed numerical approach.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"53 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":"125191491","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}
M. Naldi, Antonio Pavignani, A. Grillo, Alessandro Lentini, G. Italiano
{"title":"The Competitor Busting Strategy in Keyword Auctions: Who's Worst Hit?","authors":"M. Naldi, Antonio Pavignani, A. Grillo, Alessandro Lentini, G. Italiano","doi":"10.1109/CNSR.2011.30","DOIUrl":"https://doi.org/10.1109/CNSR.2011.30","url":null,"abstract":"Search engines award their advertising space through keyword auctions. Some bidders may adopt an aggressive bidding strategy known as Competitor Busting, where they submit higher bids than what is strictly needed to win the auction so as to oust the other bidders. Despite the widespread concern for such practice, we show that the Competitor Busting strategy is largely ineffective. The lifetime of non-aggressive bidders, their presence in the auction, and the proportion of slots they are awarded are not affected by the presence of aggressive bidders. These conclusions are valid as long as the aggressive bidders do not have a significant budget advantage over non-aggressive ones.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"4 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":"122288441","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}
R. Shirani, M. St-Hilaire, T. Kunz, Yifeng Zhou, Jun Li, L. Lamont
{"title":"The Performance of Greedy Geographic Forwarding in Unmanned Aeronautical Ad-Hoc Networks","authors":"R. Shirani, M. St-Hilaire, T. Kunz, Yifeng Zhou, Jun Li, L. Lamont","doi":"10.1109/CNSR.2011.31","DOIUrl":"https://doi.org/10.1109/CNSR.2011.31","url":null,"abstract":"The availability of accurate location information (for airborne purposes) in unmanned aeronautical ad-hoc networks (UAANETs) makes it possible to deploy geographic routing mechanisms as the main communication protocol in such networks. However, the performance of geographic routing is not obvious, especially for sparse networks (i.e., networks with low connectivity levels). In this paper, the main goal is to explore the effects of network sparsity on the performance of greedy geographic forwarding and to determine in different scenarios the percentage of source-destination pairs that can successfully establish communication based on greedy geographic forwarding only. To that end, Monte Carlo simulations have been performed to collect statistics in estimating the performance of UAANETs in sparse situations. Simulation results show that greedy geographic forwarding can be used for less critical applications of UAANETs. However, for applications with guaranteed delivery requirements, other alternatives should be combined with greedy geographic forwarding.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"75 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":"122685745","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}
Gimer Cervera, M. Barbeau, Joaquín García, E. Kranakis
{"title":"Mitigation of Flooding Disruption Attacks in Hierarchical OLSR Networks","authors":"Gimer Cervera, M. Barbeau, Joaquín García, E. Kranakis","doi":"10.1109/CNSR.2011.32","DOIUrl":"https://doi.org/10.1109/CNSR.2011.32","url":null,"abstract":"The Hierarchical Optimized Link State Routing (HOLSR) protocol was designed to improve scalability of heterogeneous Mobile Ad-Hoc Networks (MANETs). HOLSR is derived from the OLSR protocol and implements Multipoint Relay (MPR) nodes as a flooding mechanism for distributing control information. Unlike OLSR, nodes are organized in clusters and implement Hierarchical Topology Control (HTC) messages for inter-cluster communications. Nevertheless, HOLSR was designed without security measures. Therefore, a misbehaving node can affect the topology map acquisition process by interrupting the flooding of control information or disturbing the MPR selection process. We present a taxonomy of flooding disruption attacks, that affect the topology map acquisition process in HOLSR networks, and preventive mechanisms to mitigate the effect of this kind of attacks.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"107 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":"124068328","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}
Suhel Patel, K. Saraç, R. Chandrasekaran, T. Korkmaz, N. Mittal
{"title":"Relay Assignment in AMT-Based Multicast Content Distribution","authors":"Suhel Patel, K. Saraç, R. Chandrasekaran, T. Korkmaz, N. Mittal","doi":"10.1109/CNSR.2011.45","DOIUrl":"https://doi.org/10.1109/CNSR.2011.45","url":null,"abstract":"Automatic IP Multicast Without Explicit Tunnels (AMT) has recently been proposed as an enabling technology to expand multicast content availability in the Internet. Using AMT, clients in unicast-only networks can establish tunnels to AMT relay servers to receive multicast content over unicast-only networks. In this paper, we study the task of mapping unicast clients to AMT relay servers in a way to minimize bandwidth use in the content providers' network while maintaining load balanced situation across relays. We formulate the relay assignment problem as an instance of NP-hard bin packing problem and propose different solutions for application scenarios with or without considering client-relay server proximity. Our evaluations demonstrate the potential benefits of the proposed solutions under different scenarios.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"29 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":"130411684","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}
{"title":"Efficient Wireless Access to Video-on-Demand Services","authors":"Z. Naor","doi":"10.1109/CNSR.2011.47","DOIUrl":"https://doi.org/10.1109/CNSR.2011.47","url":null,"abstract":"The problem of providing an efficient and low-cost video streaming service over wireless access networks is considered in this work. The usage of multicast content delivery combined with popularity-based video caching, enables to provide video-on-demand services over wireless networks. In order to tackle the \"last mile\" bottleneck for video delivery to the home, we propose a content-aware architecture, that incorporates popularity-dependent video caching and patching with application-enabled multicast content delivery. The proposed method offers a tremendous bandwidth saving, in comparison with the individual service currently exists in wireless networks. We analyze the conditions under which multicast content delivery offers a better QoS, in terms of service delay, over the individual service currently used for video streaming.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"57 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":"131223536","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}