{"title":"Anchor selection and Topology Preserving Maps in WSNs — A Directional Virtual Coordinate based approach","authors":"Dulanjalie C. Dhanapala, A. Jayasumana","doi":"10.1109/LCN.2011.6115519","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115519","url":null,"abstract":"Virtual Coordinate Systems (VCS) characterize each node in a network by its hop distances to a subset of nodes called anchors. Performance of VCS based algorithms is highly sensitive to number of anchors and their placement. Extreme Node Search (ENS), a novel and efficient anchor placement scheme, is proposed that demonstrates significantly improved performance over state-of-the-art. ENS starts with two randomly placed anchors and then uses a Directional Virtual Coordinate (DVC) transformation, which restores the lost directionality in traditional VCS, to identify anchor candidates in a completely distributed manner. A vector-based representation is proposed for the DVC domain, which is then used to introduce the concept of angles between virtual directions in the transformed domain. Ability to specify cardinal directions and use angles is a radical change from the traditional VC system approaches. By selecting two anchor pairs with near orthogonal directional coordinates under the DVC transformation, a novel Topology Preserving Map (TPM) generation scheme is developed. This new TPM generation scheme requires significantly less computations than the existing PCA based method. Use of ENS significantly enhances the PCA based TPM generation as well. Simulation results for representative WSNs indicate that the ENS based anchor sets significantly improve performance of all prominent VC based routing schemes. For instance, Directional Virtual Coordinate Routing, when combined with ENS anchor placement strategy, outperforms even the geographic Greedy Perimeter Stateless Routing scheme that relies on exact physical node coordinates.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126378117","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":"Optical wireless sensor network design for a conducting chamber","authors":"A. Borkar, P. Ranjan","doi":"10.1109/LCN.2011.6115583","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115583","url":null,"abstract":"Now a day's majority of the wireless sensor networks (WSNs) are based on Radio Frequency (RF) communication technology. But RF when used in an environment like that of metallic, conducting chamber exhibits large amount of interference due to multipath effects which degrades the performance of the sensor network. Infrared (IR) communication technology which is capable of overcoming the drawbacks exhibited by RF can be used in sensor networks. Suitable IR link can provide high efficiency and mobility. The paper presents design of one such sensor network based on IR communication technology to be deployed in a device known as Tokamak, used to conduct controlled nuclear fusion.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124897977","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":"Smooth control of Adaptive Media Playout to acquire IDMS in cluster-based applications","authors":"F. Boronat, M. Montagud, Vicente Vidal","doi":"10.1109/LCN.2011.6115525","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115525","url":null,"abstract":"Many emerging multimedia applications enable independent groups (or clusters) of consumers to interact between them and share services within the context of simultaneous media content consumption. Owing to the semantic, spatial or temporal dependency among the involved media streams, concurrently synchronized playout points must be ensured so as not to spoil the user experience on such interaction. This paper presents the combination of an evolved Inter-Destination Multimedia Synchronization (IDMS) approach and a new designed Adaptive Media Playout (AMP) scheme that aims to smoothly adjust the playout timing of each one of the receivers in a specific cluster, if an asynchrony threshold between their playout states is exceeded. Simulation results prove the feasibility of such proposals, by employing several dynamic master selection policies, to maintain an overall synchronization status (within allowable limits) in each cluster, while minimizing the occurrence of long-term playout discontinuities (such as skips/pauses) which are subjectively more annoying to users than small variations in the media playout rate.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124144889","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":"Fault management for VoIP applications over wireless and wired NGN networks: An operational prospective","authors":"Luca Monacelli, R. Francescangeli","doi":"10.1109/LCN.2011.6115539","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115539","url":null,"abstract":"This paper shows the practical aspects to be considered in order to face the Fault Management problem in a network deploying VoIP services for both wireless and wired access. The real network analyzed includes all the entities necessary for implementing a plain VoIP service, according to the NGN architecture. We provide the KPI definition, along with a detailed description which refers to the practical experience of a real nation wide network, and their usage within a Fault management framework.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123631941","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":"Routing performance of Wireless Mesh Networks: A practical evaluation of BATMAN advanced","authors":"Daniel Seither, André König, M. Hollick","doi":"10.1109/LCN.2011.6115569","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115569","url":null,"abstract":"The performance of Wireless Mesh Networks under realistic conditions is not well understood. Given the huge design and parameter space for these networks, all-encompassing performance evaluations are unfeasible. We follow a practical approach and perform a targeted, in-depth investigation of the current state of the BATMAN Advanced (batman-adv) protocol in a realistic office environment, using the thoroughly studied AODV protocol as a baseline. In particular, we study the reachability, packet loss, delay and throughput of the network. We identify the main parameters influencing the routing performance and demonstrate failure modes of the studied protocols.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121697448","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":"Collecting router information for error diagnosis and troubleshooting in home networks","authors":"Andreas Müller, Gerhard Miinz, G. Carle","doi":"10.1109/LCN.2011.6115547","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115547","url":null,"abstract":"With the increasing number of heterogeneous devices that are connected to an average home network, troubleshooting in case of network problems becomes more and more complicated. This is not only because most home users are consumers and not experts in the field of networking, but also because it is usually hard to find the relevant information useful for a systematic error diagnosis. Potential sources of information, such as the web interface of a home router, are not standardized and usually not available to people, e.g. friends or help-lines, that are willing to help from outside of the home. However, many home routers run a Linux driven operating system and are therefore capable of providing a manifold amount of interesting data for debugging network related errors. This paper presents a tool which allows gathering highly customizable data on Linux based home routers using arbitrary textual sources, such as the proc-filesystem, command-line output and configuration files. Additionally, we describe the necessary steps for securely transferring the information to an external helper.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"450 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123230432","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":"Entropy based SYN flooding detection","authors":"L. Arshadi, A. Jahangir","doi":"10.1109/LCN.2011.6115171","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115171","url":null,"abstract":"In this paper we present a novel approach for detecting SYN flooding attacks by investigating the entropy of SYN packet inter-arrival times as a measure of randomness. We argue that normal SYN packets are almost independent leading to higher values of entropy while SYN flooding attacks consist of a high volume of related SYN packets and so the entropy of their inter-arrival times would be less than normal. We apply this entropy-based method on different data sets of network traffic both in off-line and real-time modes.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123789762","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":"PFS: Probabilistic filter scheduling against distributed denial-of-service attacks","authors":"Dongwon Seo, Heejo Lee, A. Perrig","doi":"10.1109/LCN.2011.6114645","DOIUrl":"https://doi.org/10.1109/LCN.2011.6114645","url":null,"abstract":"Distributed denial-of-service (DDoS) attacks continue to pose an important challenge to current networks. DDoS attacks can cause victim resource consumption and link congestion. A filter-based DDoS defense is considered as an effective approach, since it can defend against both attacks: victim resource consumption and link congestion. However, existing filter-based approaches do not address necessary properties for viable DDoS solutions: how to practically identify attack paths, how to propagate filters to the best locations (filter routers), and how to manage many filters to maximize the defense effectiveness. We propose a novel mechanism, termed PFS (Probabilistic Filter Scheduling), to efficiently defeat DDoS attacks and to satisfy the necessary properties. In PFS, filter routers identify attack paths using probabilistic packet marking, and maintain filters using a scheduling policy to maximize the defense effectiveness. Our experiments show that PFS achieves 44% higher effectiveness than other filter-based approaches. Furthermore, we vary PFS parameters in terms of the marking probability and deployment ratio, and find that 30% marking probability and 30% deployment rate maximize the attack blocking rate of PFS.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131289017","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":"Implementation of WFQ in a distributed open software router","authors":"Azeem J. Khan, A. Sahoo, D. Manjunath","doi":"10.1109/LCN.2011.6115515","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115515","url":null,"abstract":"There has been a considerable body of research devoted to the design and performance of PC based software routers running open source software. Most of the research on open software routers (OSRs) have focused on improving the performance of single PCs with a few proposals for a distributed design. Modern routers are equipped with enhanced functionality such as QoS features in addition to packet forwarding. However, providing enhanced functionality in distributed OSR architectures has largely remained unaddressed. A distributed design introduces challenges in its implementation due to looser coupling between different subsystems. WFQ is a widely used scheduler that enables QoS features in a router. The inherent centralized nature of the design of WFQ schedulers in most switches and routers creates several challenges when exported to distributed architectures. In this paper, we study the challenges of implementing WFQ in a distributed OSR, propose some novel techniques to address these challenges and compare the performance of our WFQ implementation in distributed OSR with that of a centralized WFQ scheme.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124619183","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}
André Sieber, R. Karnapke, J. Nolte, Thomas Martschei
{"title":"Using sensor technology to protect an endangered species: A case study","authors":"André Sieber, R. Karnapke, J. Nolte, Thomas Martschei","doi":"10.1109/LCN.2011.6115161","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115161","url":null,"abstract":"A lot of applications for wireless sensor networks have been proposed in the last years. Only a few of them have led to real, non-academic deployments, partially due to the differences between end user needs and academic assumptions. In this paper we discuss a real world problem arising from an ecological question (protection of an endangered species) and the theoretical solution as well as the deployed solution that actually works.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133817021","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}