2016 8th International Conference on Communication Systems and Networks (COMSNETS)最新文献_第8页

HOLA: Heuristic and opportunistic link selection algorithm for energy efficiency in Industrial Internet of Things (IIoT) systems HOLA:工业物联网(IIoT)系统能源效率的启发式和机会主义链路选择算法

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439960

K. Dhondge, R. Shorey, J. Tew

{"title":"HOLA: Heuristic and opportunistic link selection algorithm for energy efficiency in Industrial Internet of Things (IIoT) systems","authors":"K. Dhondge, R. Shorey, J. Tew","doi":"10.1109/COMSNETS.2016.7439960","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439960","url":null,"abstract":"Internet of Things (IoT) promises to be a key enabler in Smart Manufacturing and Smart Supply Chain. The IoT systems are responsible for enabling and improving the operational efficiencies of factories, plant floors, including assembly plants. These systems are characterized by reliable sensing and reporting of multiple parameters within the factory floor. Such sensing activities offer safe, efficient and optimized performance of not only the machines manufacturing the products, but also the workforce operating them. Industrial IoT (IIoT) systems could suffer from high and uneven energy consumption due to the nature of the network deployment. Such behavior is unacceptable as it not only increases the carbon footprint of the plant, but also makes the planned maintenance of IoT devices for battery replacement a huge challenge. In this paper, we propose a heuristic and opportunistic link selection algorithm, HOLA, which not only reduces the overall energy consumption of the IoT network but also balances it across the network. HOLA achieves this energy-efficiency by opportunistically offloading the IoT device data to smart-devices being carried by the workforce in the factory settings. Further, these smart-devices with multiple radio links such as Bluetooth, Wi-Fi, and 3G/4G LTE heuristically determine the best link to transmit the data to the Cloud based on the quality and energy cost of the link. Our experimental and simulation studies validate that HOLA can improve the energy efficiency of IIoT systems by reducing the overall energy consumption and balancing it across the network.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121255005","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}

引用次数: 23

The importance of including carcinogenic benzene in real-time ambient air quality data in Delhi 将致癌物苯纳入德里实时环境空气质量数据的重要性

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7440018

Nancy Agrawal, Arushi Baboota

引用次数: 1

Performance modeling and analysis of high throughput wireless media access with QoS in noisy channel for different traffic conditions 噪声信道下具有QoS的高吞吐量无线媒体接入性能建模与分析

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439970

Raja Karmakar, Pravati Swain, Samiran Chattopadhyay, Sandip Chakraborty

{"title":"Performance modeling and analysis of high throughput wireless media access with QoS in noisy channel for different traffic conditions","authors":"Raja Karmakar, Pravati Swain, Samiran Chattopadhyay, Sandip Chakraborty","doi":"10.1109/COMSNETS.2016.7439970","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439970","url":null,"abstract":"The high throughput wireless extensions based on IEEE 802.11 or wireless-fidelity (Wi-Fi) support varieties of physical and media access control (MAC) sublayer features to boost up the physical data rate in wireless media. These include multiple input multiple out (MIMO) spatial multiplexing and spatial diversity, channel bonding, short guard intervals, advanced modulation and coding schemes (MCS), frame aggregations and block acknowledgements; for different Wi-Fi extensions like IEEE 802.11n, IEEE 802.11ac and IEEE 802.11ad. The existing studies show that although such physical extensions improve data rates, they have internal trade-offs in channel error and sustainability that directly impact the MAC layer frame aggregation and block acknowledgement performance. In this paper, we model the impact of the channel errors over MAC layer channel access with frame aggregation and block acknowledgement, considering the standard IEEE 802.11 service class differentiation for quality of service (QoS). The evolution of aggregated frame transmission has been modeled using a three dimension Markov chain diagram, considering channel error from physical layer and different traffic conditions. The model is validated through simulation results. The mathematical model is further explored to observe and analyze the impact of channel error over the aggregated frame based MAC scheduling with different QoS performance parameters, like channel throughput, frame loss probability and channel access delay. We observe that frame aggregation sometimes shows negative impact on channel access performance that demands the need for designing an adaptive aggregation strategy.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127766979","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}

引用次数: 6

DistNSE: Distributed network service embedding across multiple providers DistNSE:跨多个提供者的分布式网络服务嵌入

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439948

Ahmed Abujoda, Panagiotis Papadimitriou

{"title":"DistNSE: Distributed network service embedding across multiple providers","authors":"Ahmed Abujoda, Panagiotis Papadimitriou","doi":"10.1109/COMSNETS.2016.7439948","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439948","url":null,"abstract":"Network function virtualization (NFV) brings significant benefits by outsourcing network functions (NFs) to virtualized datacenters and enabling new business models, e.g. NF as a service (NFaaS). In this respect, network service embedding (i.e., the mapping of service chains) raises significant challenges due to the need to preserve correctness and satisfy NF location dependencies. The latter creates the need for service mapping across multiple NF Providers (NFPs), given the limited footprint of each NFP. This further exacerbates the network service embedding (NSE) problem, due to the NFPs' local policies and the confidentiality of network topology and resource availability. To address these issues, we present DistNSE, a distributed NSE framework that enables the collaboration among NFPs for NSE, while maintaining the privacy and autonomy of each NFP. DistNSE ensures competitive pricing by letting different NFPs compete for different NFs of a service chain. To this end, DistNSE decomposes NSE in two steps: (i) service chain partitioning using an algorithm that fosters competition across NFPs, and (ii) the assignment of chain segments to datacenter networks, while ensuring compliance with the NFP's policy. We further couple the proposed embedding methods with a communication protocol for interoperability and collaboration among the participating NFPs. We use simulations to assess the efficiency of DistNSE and identify significant gains over an existing distributed embedding framework (i.e., Polyvine).","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126989510","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}

引用次数: 38

Congestion analysis of unsignalized intersections 无信号交叉口的拥塞分析

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-23 DOI: 10.1109/COMSNETS.2016.7439951

Abhishek, M. Mandjes, M. Boon, R. N. Queija

{"title":"Congestion analysis of unsignalized intersections","authors":"Abhishek, M. Mandjes, M. Boon, R. N. Queija","doi":"10.1109/COMSNETS.2016.7439951","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439951","url":null,"abstract":"This paper considers an unsignalized intersection used by two traffic streams. A stream of cars is using a primary road, and has priority over the other, low-priority, stream. Cars belonging to the latter stream cross the primary road if the gaps between two subsequent cars on the primary road is larger than their critical headways. Questions that naturally arise are: given the arrival pattern of the cars on the primary road, what is the maximum arrival rate of low-priority cars such that the number of such cars remains stable? In the second place, what can be said about the delay experienced by a typical car at the secondary road? This paper addresses such issues by considering a compact model that sheds light on the dynamics of the considered unsignalized intersection. The model, which is of a queueing-theoretic nature, reveals interesting insights into the impact of the user behavior on the above stability and delay issues. The contribution of this paper is twofold. First, we obtain new results for the aforementioned model with driver impatience. Secondly, we reveal some surprising aspects that have remained unobserved in the existing literature so far, many of which are caused by the fact that the capacity of the minor road cannot be expressed in terms of the mean gap size; instead more detailed characteristics of the critical headway distribution play a role.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132862023","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

Game theoretic analysis of tree based referrals for crowd sensing social systems with passive rewards 具有被动奖励的群体感知社会系统树型推荐的博弈论分析

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-01-27 DOI: 10.1109/COMSNETS.2016.7439947

Kundan Kandhway, Bhushan Kotnis

{"title":"Game theoretic analysis of tree based referrals for crowd sensing social systems with passive rewards","authors":"Kundan Kandhway, Bhushan Kotnis","doi":"10.1109/COMSNETS.2016.7439947","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439947","url":null,"abstract":"Participatory crowd sensing social systems rely on the participation of large number of individuals. Since humans are strategic by nature, effective incentive mechanisms are needed to encourage participation. A popular mechanism to recruit individuals is through referrals and passive incentives such as geometric incentive mechanisms used by the winning team in the 2009 DARPA Network Challenge and in multi level marketing schemes. The effect of such recruitment schemes on the effort put in by recruited strategic individuals is not clear. This paper attempts to fill this gap. Given a referral tree and the direct and passive reward mechanism, we formulate a network game where agents compete for finishing crowd sensing tasks. We characterize the Nash equilibrium efforts put in by the agents and derive closed form expressions for the same. We discover free riding behavior among nodes who obtain large passive rewards. This work has implications on designing effective recruitment mechanisms for crowd sourced tasks. For example, usage of geometric incentive mechanisms to recruit large number of individuals may not result in proportionate effort because of free riding.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823550","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

Secure web Push system 安全的网页推送系统

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-01-01 DOI: 10.1109/COMSNETS.2016.7439931

Girija Saride, Jaya Balan Aaron, Joy Bose

引用次数: 2

Fast training on large genomics data using distributed Support Vector Machines 使用分布式支持向量机对大型基因组数据进行快速训练

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-01-01 DOI: 10.1109/COMSNETS.2016.7439943

Nawanol Theera-Ampornpunt, Seong Gon Kim, Asish Ghoshal, S. Bagchi, A. Grama, S. Chaterji

{"title":"Fast training on large genomics data using distributed Support Vector Machines","authors":"Nawanol Theera-Ampornpunt, Seong Gon Kim, Asish Ghoshal, S. Bagchi, A. Grama, S. Chaterji","doi":"10.1109/COMSNETS.2016.7439943","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439943","url":null,"abstract":"The field of genomics has seen a glorious explosion of high-quality data, with tremendous strides having been made in genomic sequencing instruments and computational genomics applications meant to make sense of the data. A common use case for genomics data is to answer the question if a specific genetic signature is correlated with some disease manifestations. Support Vector Machine (SVM) is a widely used classifier in computational literature. Previous studies have shown success in using these SVMs for the above use case of genomics data. However, SVMs suffer from a widely-recognized scalability problem in both memory use and computational time. It is as yet an unanswered question if training such classifiers can scale to the massive sizes that characterize many of the genomics data sets. We answer that question here for a specific dataset, in order to decipher whether some regulatory module of a particular combinatorial epigenetic “pattern” will regulate the expression of a gene. However, the specifics of the dataset is likely of less relevance to the claims of our work. We take a proposed theoretical technique for efficient training of SVM, namely Cascade SVM, create our classifier called EP-SVM, and empirically evaluate how it scales to the large genomics dataset. We implement Cascade SVM on the Apache Spark platform and open source this implementation1. Through our evaluation, we bring out the computational cost on each application process, the way of distributing the overall workload among multiple processes, which can potentially execute on different cores or different machines, and the cost of data transfer to different cores or different machines. We believe we are the first to shed light on the computational and network costs of training an SVM on a multi-dimensional genomics dataset. We also evaluate the accuracy of the classifier result as a function of the parameters of the SVM model.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122102404","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}

引用次数: 3

Energy efficient rate coverage with base station switching and load sharing in cellular networks 蜂窝网络中具有基站交换和负载共享的节能率覆盖

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-01-01 DOI: 10.1109/COMSNETS.2016.7440001

S. Kumar, Abhinav Kumar

引用次数: 4

Evolving models for meso-scale structures 中尺度结构的演化模式

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2015-11-29 DOI: 10.1109/COMSNETS.2016.7439976

A. Saxena, S. Iyengar

引用次数: 13