{"title":"A modular and power-intelligent architecture for wireless sensor nodes","authors":"David Riley, M. Younis","doi":"10.1109/LCN.2012.6423635","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423635","url":null,"abstract":"The current state of the art in wireless sensor nodes, both in academia and industry, is a fractured landscape of designs mostly addressing individual problems. The most common commercial design derives directly from a mote developed at the University of California, Berkeley around 1999, and presents only moderate, incremental improvements over the original design. No designs yet present a comprehensive, intelligent solution befitting a modern system. By using dynamic power management, deep system configurability, autonomous peripheral modules, and multiple CPU architectures, this paper presents a flexible and efficient node architecture. Modules on a sensor node communicate with each other to coordinate their activities and power levels. Special attention is given to power sourcing and distribution. The platform may be configured to efficiently work with most networks, sensor types and power sources due to its improved connectivity and hierarchical design. The resulting Configurable Sensor Node (CoSeN) architecture is competitive with existing designs on price, size and power while greatly exceeding most of them on performance, configurability and application potential. CoSeN is validated through prototype implementation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125353","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":"Applying temporal feedback to rapid identification of BitTorrent traffic","authors":"J. But, P. Branch","doi":"10.1109/LCN.2012.6423609","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423609","url":null,"abstract":"BitTorrent is one of the dominant traffic generating applications in the Internet. The ability to identify BitTorrent traffic in real-time could allow network operators to manage network traffic more effectively. In this paper we demonstrate that erroneous output of a Machine Learning based classifier is randomly distributed within a flow, allowing the application of temporal feedback to improve the overall classifier performance. We propose and evaluate a number of feedback algorithms. Our results show that we are able to improve classification outcomes (Recall by 2.4% and Precision by 0.1%) whilst both improving classification timeliness from three to two minutes, and improving robustness against future changes to the BitTorrent protocol.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127379035","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":"Impact of network conditions on delay-stable communications in closed industrial control networks","authors":"David A. Miller, A. Kamal","doi":"10.1109/LCN.2012.6423673","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423673","url":null,"abstract":"To properly operate closed industrial control networks, it is required that communication with nearly constant delay bounds be supported. In [9] the authors introduced FlexTDMA in order to provide this support, and with minimal delay-jitter in an asynchronous network, under unicast communication. In this paper we consider how periodic on-off traffic and frame loss are managed in the presence of network component clock drifts and bandwidth loads, and introduce the FlexTDMA+ protocol. This protocol includes three improvements over FlexTDMA: baseline preemption, partial baselining and baseline deadline density control. In this paper we consider the relative value of each of these improvements, individually and in combination, has in handling these network conditions.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115715986","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 the performance of sensor node repositioning under realistic terrain constraints","authors":"I. Senturk, K. Akkaya","doi":"10.1109/LCN.2012.6423643","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423643","url":null,"abstract":"Node mobility has been exploited in many context of Mobile Sensor Networks (MSNs) and Wireless Sensor and Actor Networks (WSANs) to improve network performance. In particular, network partitioning due to node failures has been addressed via repositioning of some of the mobile nodes. In all of these studies, the application terrain is assumed to be obstacle free and the movements are performed by following the direct path from the source to destination. However, in reality, this is not the case since the terrains would not be obstacle free and the nodes cannot move freely and smoothly to every requested location. The terrain type, elevation as well as the obstacles should be taken into account before the nodes start moving. In this paper, we claim that most of the existing approaches would either not work or produce wrong results if realistic assumptions regarding the terrain are not considered. To demonstrate our claims regarding the mobility issues, we consider two of the existing heuristics on the connectivity restoration problem in disjoint MSNs. Rather than following the direct path for movement as done in these works, we propose to use a path planning algorithm for determining the least-cost path in terms of energy consumption. In the experiments, we simulate several varieties of terrain types, obstacles and elevations in the region. Simulation results indicate that the movement cost is significantly higher and this should be taken into account to redesign the existing approaches.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114185523","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}
C. Farias, L. Pirmez, Flávia Coimbra Delicato, I. L. Santos, Albert Y. Zomaya
{"title":"Information fusion techniques applied to Shared Sensor and Actuator Networks","authors":"C. Farias, L. Pirmez, Flávia Coimbra Delicato, I. L. Santos, Albert Y. Zomaya","doi":"10.1109/LCN.2012.6423603","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423603","url":null,"abstract":"This work presents an adaptation (and enhancement) of a well-known fusion technique in order to deal with multiple applications simultaneously in a context of Shared Sensor and Actuator Networks (SSAN). SSAN allow the sensing infrastructure to be shared among multiple applications that can potentially belong to different users instead of assuming an application-specific network design. We also present simulation and tests conducted with the proposed solution on real nodes to validate our proposal.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123822970","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":"Achieving end-to-end goals of WSN using Weighted Cognitive Maps","authors":"Amr H. El Mougy, M. Ibnkahla","doi":"10.1109/LCN.2012.6423641","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423641","url":null,"abstract":"In this paper, a novel cognitive engine for Wireless Sensor Networks (WSN) is proposed in order to achieve its end-to-end goals. This engine is designed using the tool known as Weighted Cognitive Maps (WCM). WCMs have the advantage of being able to consider multiple conflicting objectives and constraints with low complexity. Their inference properties also allow them to resolve complex network interactions using simple mathematical operations. Methods for designing the WCM system are illustrated. The performance of the proposed system is evaluated using computer simulations. Simulation results show that the WCM system outperforms its existing counterparts in metrics of network lifetime, throughput, and PLR.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123885771","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":"TOMP: Opportunistic traffic offloading using movement predictions","authors":"P. Baier, Frank Dürr, K. Rothermel","doi":"10.1109/LCN.2012.6423668","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423668","url":null,"abstract":"Recent forecasts predict that the amount of cellular data traffic will significantly increase within the next few years. The reason for this trend is on the one hand the high growth rate of mobile Internet users and on the other hand the growing popularity of high bandwidth streaming applications. Given the fact that cellular networks (e.g. UMTS) have only limited capacity, the existing network infrastructure will soon reach its limits. As a result, the concept of traffic offloading attracts more and more attention in research since it aims at the reduction of cellular traffic by shifting it to local-area networks like Wifi. One particular form of traffic offloading is known as opportunistic traffic offloading and follows the basic idea to shift traffic from the cellular network to the level of inter-device communication of mobile devices. To perform opportunistic traffic offloading in an efficient way, assumptions about the prospective inter-device connectivity of the mobile devices have to be made. In general, the more inter-device connections are possible the more traffic can be offloaded. To utilize this fact, we developed the TOMP system. TOMP is the first opportunistic traffic offloading system that uses movement predictions of mobile users to analyze the prospective inter-device connectivity. In this paper we propose three different metrics for analyzing movement predictions and present an algorithm, which uses these metrics to utilize an efficient opportunistic traffic offloading. To evaluate TOMP, we show by simulation that we can save up to 40% of cellular messages in comparison to a typical cellular network.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125276017","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":"Inference in wireless sensor networks based on information structure optimization","authors":"Wei Zhao, Yao Liang","doi":"10.1109/LCN.2012.6423674","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423674","url":null,"abstract":"Distributed in-network inference plays a significant role in large-scale wireless sensor networks (WSNs) in applications for distributed detection and estimation. Belief propagation (BP) holds great potential for forming an essential and powerful underlying mechanism for such distributed inferences in WSNs. However, it has been recognized that many challenges exist in the context of WSN distributed inference. One such challenge is how to systematically develop a graphical model of WSN, upon which BP-based distributed inference can be effectively and efficiently performed, rather than ad hoc. This paper investigates this challenge and proposes a general and rigorous data-driven approach to building a solid and practical graphical model of WSN, given prior observations, based on graphical model optimization. The proposed approach is empirically evaluated using real-world sensor network data. We show that our approach can significantly reduce the energy consumption in BP-based distributed inference in WSNs and also improve the inference accuracy, when compared to the current practice of distributed inference in WSNs.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"6 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116870180","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 new design of the IEEE 802.11 MAC layer to enhance the scalability of the DMS service","authors":"Yousri Daldoul, Djamal-Eddine Meddour, T. Ahmed","doi":"10.1109/LCN.2012.6423596","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423596","url":null,"abstract":"The IEEE 802.11v defines the Directed Multicast Service (DMS) in order to enhance the reliability of the multicast transport. This service converts multicast traffic into several unicast streams. Therefore DMS can be used to serve a limited number of receivers. In this paper, we show that using DMS, losses caused by queue rejections may exceed the packet loss rate of the legacy multicast. To resolve the limited scalability of DMS, we define a new scalable version called S-DMS. This version is appropriate for layered streams like H264/SVC and is able to avoid queue overflows. S-DMS delivers the base layer of a video traffic using DMS and transmits the enhancement layer using either DMS or the legacy multicast, depending on the available bandwidth. We show that S-DMS is able to increase considerably the number of admitted multicast members.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126312490","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":"Enhancing TCP with cross-layer notifications and capacity estimation in heterogeneous access networks","authors":"L. Daniel, M. Kojo","doi":"10.1109/LCN.2012.6423653","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423653","url":null,"abstract":"Finding the available network capacity for a TCP connection is an important research problem as it allows the connection to improve its throughput and fairness in addition to reducing packet losses. As flows arrive and depart randomly in the network, the state of a TCP connection at any instant is very dynamic and a good estimate of the available capacity can enable TCP to quickly adapt to the actual available capacity in the network. This is especially relevant to heterogeneous access network environments where the end-to-end path characteristics of a TCP connection may abruptly change due to the changes in the access link characteristics after a vertical handoff. In this paper, we present an approach that combines available network capacity estimation with cross-layer notifications to TCP about the access link bandwidth and delay to quickly determine a rough estimate of the available capacity for a TCP connection. Using simulation experiments we evaluate our algorithms in the different phases of a TCP connection where the available capacity is unknown such as in the beginning of a TCP connection and after a vertical handoff. Our results show that the proposed algorithms improve TCP throughput and reduce the transfer time after a vertical handoff in heterogeneous access networks.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122468518","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}