{"title":"Putting Sense inside Sensor Systems: A Coordinated Approach to Messaging","authors":"K. Thoelen, W. Joosen, D. Hughes","doi":"10.1109/NCA.2015.20","DOIUrl":"https://doi.org/10.1109/NCA.2015.20","url":null,"abstract":"Sensor network deployments, such as smart cities and smart logistics, are evolving towards open infrastructure on top of which multiple parties deploy and make use of each other's application software. Of vital importance in such distributed settings, is an agreement on message semantics and contents. Yet, the current state-of-the-art in sensor programming typically remains low-level in terms of messaging, and lacks support for coordination across platforms and stakeholders. We present Talk Sens, a message definition framework that facilitates development of correctly interacting application logic by means of a shared data model, a message description language and serialisation code generation. Additionally, integration of Talk Sens with an existing component model results in run-time retrievable message definitions that facilitate third-party interactions. Our evaluation shows that message sizes, software sizes and middleware overhead remain well within the bounds of sensor network resource constraints.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497770","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":"Adaptability and Stability in Dynamic Integration of Body Sensor Networks with Clouds","authors":"Y. Ren, J. Suzuki, Shingo Omura, Ryuichi Hosoya","doi":"10.1109/NCA.2015.53","DOIUrl":"https://doi.org/10.1109/NCA.2015.53","url":null,"abstract":"This paper considers a multi-tier architecture for cloud-integrated body sensor networks (BSNs), called Body-in-the-Cloud (BitC), which is designed for home healthcare with on-body physiological and activity monitoring sensors. This paper formulates an optimization problem to integrate BSNs with a cloud in BitC and approaches the problem with an evolutionary game theoretic algorithm. BitC allows BSNs to adapt their configurations (i.e., sensing intervals) to operational conditions (e.g., data request patterns) with respect to multiple performance objectives such as resource consumption and data yield. BitC theoretically guarantees that each BSN performs an evolutionarily stable configuration strategy, which is an equilibrium solution under given operational conditions. Simulation results verify this theoretical analysis; BSNs seek equilibria to perform adaptive and evolutionarily stable configuration strategies under dynamic changes of operational conditions. BitC outperforms NSGA-III in optimality, stability, convergence speed and execution time.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130974357","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":"An Empirical Evaluation Methodology for iSCSI Storage Networking","authors":"V. Salmani, S. Shin","doi":"10.1109/NCA.2015.29","DOIUrl":"https://doi.org/10.1109/NCA.2015.29","url":null,"abstract":"Cloud centric environments fueled by Ethernet dominant networking increasingly use iSCSI as a prevalent storage networking protocol among highly distributed and interconnected servers and storage devices. Numerous advances such as faster multi-core CPUs, hardware offloading engines, higher bandwidth networking and faster storage devices mandate a re-evaluation of iSCSI implementations and performance techniques. In this paper, we present a performance evaluation methodology targeting multiple layers in the protocol stack. Our evaluations include both software and hardware-accelerated implementations with a discussion on their pros and cons. The outcome of our work is an empirical study of the iSCSI protocol from several aspects which, to our best knowledge, is the first comprehensive profile on its performance based on real-world implementations.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114436412","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}
Rudyar Cortés, O. Marin, Xavier Bonnaire, L. Arantes, Pierre Sens
{"title":"A Scalable Architecture for Spatio-Temporal Range Queries over Big Location Data","authors":"Rudyar Cortés, O. Marin, Xavier Bonnaire, L. Arantes, Pierre Sens","doi":"10.1109/NCA.2015.17","DOIUrl":"https://doi.org/10.1109/NCA.2015.17","url":null,"abstract":"Spatio-temporal range queries over Big Location Data aim to extract and analyze relevant data items generated around a given location and time. They require concurrent processing of massive and dynamic data flows. Current solutions for Big Location Data are ill-suited for continuous spatio-temporal processing because (i) most of them follow a batch processing model and (ii) they rely on spatial indexing structures maintained on a central master server. In this paper, we propose a scalable architecture for continuous spatio-temporal range queries built by coalescing multiple computing nodes on top of a Distributed Hash Table. The key component of our architecture is a distributed spatio-temporal indexing structure which exhibits low insertion and low index maintenance costs. We assess our solution with a public data set released by Yahoo! which comprises millions of geotagged multimedia files.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130459436","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}
Yves Mocquard, E. Anceaume, J. Aspnes, Yann Busnel, B. Sericola
{"title":"Counting with Population Protocols","authors":"Yves Mocquard, E. Anceaume, J. Aspnes, Yann Busnel, B. Sericola","doi":"10.1109/NCA.2015.35","DOIUrl":"https://doi.org/10.1109/NCA.2015.35","url":null,"abstract":"The population protocol model provides theoretical foundations for analyzing the properties emerging from simple and pair wise interactions among a very large number n of anonymous agents. The problem tackled in this paper is the following one: is there an efficient population protocol that exactly counts the difference k between the number of agents that initially and independently set their state to \"A\" and the one that initially set it to \"B\", assuming that each agent only uses a finite set of states? We propose a solution which guarantees with any high probability that after O(log n) interactions any agent outputs the exact value of k. Simulation results illustrate our theoretical analysis.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124624280","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 Skyline Computation with Collaborative Filtering Techniques for QoS-Based Web Services Selection","authors":"Fatma Rhimi, S. B. Yahia, S. Ahmed","doi":"10.1109/NCA.2015.18","DOIUrl":"https://doi.org/10.1109/NCA.2015.18","url":null,"abstract":"The tremendous growth in the amount of available web services raised many challenges in service computing and made the process of choosing the best service candidates an important challenge. Skyline is a technique that helps reducing the size of our search space and comes as a complementary approach to the optimization methods. In fact, Skyline consists in preselecting the best candidates in the search space according to their non-functional criteria. Those web services are considered optimal as they are not dominated by any other point in the search space. However, the data sparsity and the looseness of the dominance relationship used in comparing services pose some issues as the size of the Skyline may be still too large. Recommendation systems can overcome the limitations of Skyline computation by suggesting to the user the most relevant services according to his preferences. In this paper, we propose a new approach using collaborative filtering techniques to recommend to the users the best services according to the submitted request. Experimental evaluation demonstrates the effectiveness of the proposed concept and the efficiency of our implementation.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115058299","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. H. S. Oliveira, Y. Ghamri-Doudane, Carlos Eduardo F. Brito, S. Lohier
{"title":"Optimal Network Coding-Based In-Network Data Storage and Data Retrieval for IoT/WSNs","authors":"C. H. S. Oliveira, Y. Ghamri-Doudane, Carlos Eduardo F. Brito, S. Lohier","doi":"10.1109/NCA.2015.22","DOIUrl":"https://doi.org/10.1109/NCA.2015.22","url":null,"abstract":"The evolution of the Internet of Things (IoT) allows the development of new services and applications but triggers as well a full set of new issues to be solved. Among them, there are the problems related to the integration of the WSNs in the IoT realm including those related to data access. In this paper, we address more precisely the in-network data storage and data retrieval performed in a WSN integrated in the IoT realm. In order to develop an adequate data storage scheme for this scenario, we first design a system that integrates the Virtual Broking Coding (VBC) data storage scheme in the IoT realm. Then, we propose an algorithm called Dynamic Adaptive Virtual Broking Coding (DA-VBC) that adapts dynamically the packet redundancy level adopted in VBC to the optimal redundancy level, regarding the actual condition of the network, in order to ensure a reliable data storage and data retrieval. To do so, we model the choice of the optimal redundancy level as a Markov Decision Process (MDP) problem. Using the optimal policy found by the MDP, DA-VBC always performs with the minimum cost-benefit for the network which means allowing more packet to be retrieved without overload the energy consumption. The simulation results confirm that the dynamic adaptation of the redundancy level improves the reliability of the data storage scheme while achieving an energy consumption comparable to the solution that does not use any redundancy. Besides, they show that the optimization of the cost-benefit metric is far more efficient than optimizing only one metric (for instance the cost or the packet delivery ratio), or using a fixed redundancy level.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132852742","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 Congestion Control Scheme Based on Fuzzy Logic in Wireless Body Area Networks","authors":"Sara Ghanavati, Jemal H. Abawaji, D. Izadi","doi":"10.1109/NCA.2015.38","DOIUrl":"https://doi.org/10.1109/NCA.2015.38","url":null,"abstract":"One of the major challenges in healthcare wireless body area network (WBAN) applications is to control congestion. Unpredictable traffic load, many-to-one communication nature and limited bandwidth occupancy are among major reasons that can cause congestion in such applications. Congestion has negative impacts on the overall network performance such as packet losses, increasing end-to-end delay and wasting energy consumption due to a large number of retransmissions. In life-critical applications, any delay in transmitting vital signals may lead to death of a patient. Therefore, in order to enhance the network quality of service (QoS), developing a solution for congestion estimation and control is imperative. In this paper, we propose a new congestion detection and control protocol for remote monitoring of patients health status using WBANs. The proposed system is able to detect congestion by considering local information such as buffer capacity and node rate. In case of congestion, the proposed system differentiates between vital signals and assigns priorities to them based on their level of importance. As a result, the proposed approach provides a better quality of service for transmitting highly important vital signs.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122592841","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}
João Bruno Rodrigues Roque e Silva, Xavier Vilaça, Hugo M. Miranda, L. Rodrigues
{"title":"Efficient Free-Rider Detection Using Symmetric Overlays","authors":"João Bruno Rodrigues Roque e Silva, Xavier Vilaça, Hugo M. Miranda, L. Rodrigues","doi":"10.1109/NCA.2015.21","DOIUrl":"https://doi.org/10.1109/NCA.2015.21","url":null,"abstract":"Edge-computing is one of the most promising techniques to leverage the excess capacity that exists at users' premises. Unfortunately, it may be vulnerable to free-riding, i.e., To nodes that attempt to benefit from the infrastructure without providing any service in return. In this short paper we address free-riding in the context of edge-assisted streaming and propose the use of carefully crafted symmetric overlays to support message dissemination and efficient free-rider detection.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013769","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}
E. Anceaume, F. Castella, A. Mostéfaoui, B. Sericola
{"title":"A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object","authors":"E. Anceaume, F. Castella, A. Mostéfaoui, B. Sericola","doi":"10.1109/NCA.2015.27","DOIUrl":"https://doi.org/10.1109/NCA.2015.27","url":null,"abstract":"This paper presents a solution to the well-known Test-and-Set operation in asynchronous systems prone to process crashes. Test-and-Set is a synchronization operation that, when invoked by a set of processes, returns \"yes\" to a unique process and returns \"no\" to all the others. Recently many advances in implementing Test and Set objects have been achieved, however all of them uniquely target the shared memory model. In this paper we propose an implementation of a Test-and-Set object for message passing distributed systems. This implementation can be invoked by any number p of processes. It has an expected step complexity in O(p) and an expected message complexity in O(np), where n is the total number of processes in the system. The proposed Test and Set object is built atop a new basic building block that allows to select a winning group among two groups of processes.","PeriodicalId":222162,"journal":{"name":"2015 IEEE 14th International Symposium on Network Computing and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133402590","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}