2015 International Conference on Computing, Networking and Communications (ICNC)最新文献

筛选
英文 中文
A heuristic algorithm for joint power-delay minimization in green wireless access networks 绿色无线接入网络联合功率延迟最小化的启发式算法
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069355
F. Moety, S. Lahoud, Bernard A. Cousin, K. Khawam
{"title":"A heuristic algorithm for joint power-delay minimization in green wireless access networks","authors":"F. Moety, S. Lahoud, Bernard A. Cousin, K. Khawam","doi":"10.1109/ICCNC.2015.7069355","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069355","url":null,"abstract":"In this paper, we seek to jointly minimize the network power consumption and the user transmission delays in green wireless access networks. We recently studied the case of a WLAN, where we evaluated the tradeoffs between these two minimization objectives using a Mixed Integer Linear Programming (MILP) formulation. However, the MILP formulation could not deliver solutions in a reasonable amount of time due to computational complexity issues. As a result, we propose here a heuristic algorithm for the power-delay minimization problem. The proposed heuristic aims to compute the transmit power level of the Access Points (APs) deployed in the network and associate users with these APs in a way that jointly minimizes the total network power and the total network delay. The simulation results show that the proposed algorithm has a low computational complexity, which makes it advantageous compared with the optimal scheme, particularly in dense networks. Moreover, the heuristic algorithm performs close to optimally and provides power savings of up to 45% compared with legacy networks.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123085587","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}
引用次数: 9
Inter-domain routing and name resolution using border nodes 使用边界节点的域间路由和名称解析
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069474
Sebastian Schellenberg, S. Krug, Thomas Finke, Peggy Begerow, J. Seitz
{"title":"Inter-domain routing and name resolution using border nodes","authors":"Sebastian Schellenberg, S. Krug, Thomas Finke, Peggy Begerow, J. Seitz","doi":"10.1109/ICCNC.2015.7069474","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069474","url":null,"abstract":"Stable and reliable communication is essential in disaster scenarios. Mobile Ad hoc Networks (MANETs) provide a network that is fast to setup and that works independently of possibly damaged infrastructure. This is important during disaster rescue and recovery missions. But single isolated MANETs are able to cover only a limited area. Therefore, it is necessary to interconnect these individual networks in order to provide communication throughout the whole disaster area. The resulting network is heterogeneous because each MANET might employ different routing protocols as well as other underlying network technologies. In this paper, we present an approach to couple such heterogeneous networks using multihomed border nodes. We show how network-wide route discovery and name resolution is achieved and also propose a solution to address possible collisions in such environments.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116041485","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}
引用次数: 4
Ethernet card discrimination using unintentional cable emissions and constellation-based fingerprinting 以太网卡使用非故意电缆发射和基于星座的指纹识别
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069371
T. Carbino, M. Temple, Trevor J. Bihl
{"title":"Ethernet card discrimination using unintentional cable emissions and constellation-based fingerprinting","authors":"T. Carbino, M. Temple, Trevor J. Bihl","doi":"10.1109/ICCNC.2015.7069371","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069371","url":null,"abstract":"Improved network security is addressed using device dependent physical-layer (PHY) based fingerprints from Ethernet cards to augment traditional MAC-based ID verification. The investigation uses unintentional Ethernet cable emissions and device fingerprints comprised of Constellation-Based, Distinct Native Attribute (CB-DNA) features. Near-field collection probe derivative effects dictated the need for developing a two-dimensional (2D) binary constellation for demodulation and CB-DNA extraction. Results show that the 2D constellation provides reliable demodulation (bit estimation) and device discrimination using symbol cluster statistics for CB-DNA. Bit Error Rate (BER) and Cross-Manufacturer Discrimination (CMD) results are provided for 16 devices from 4 different manufactures. Device discrimination is assessed using both Nearest Neighbor (NN) and Multiple Discriminant Analysis, Maximum Likelihood (MDA/ML) classifiers. Overall results are promising and include CMD average classification accuracy of %C = 76.73% (NN) and %C = 91.38% (MDA/ML).","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114558803","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}
引用次数: 20
Compressive sensing and reception for MIMO-OFDM based cognitive radio 基于MIMO-OFDM的认知无线电压缩感知与接收
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069463
Jingwei Xu, G. Choi
{"title":"Compressive sensing and reception for MIMO-OFDM based cognitive radio","authors":"Jingwei Xu, G. Choi","doi":"10.1109/ICCNC.2015.7069463","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069463","url":null,"abstract":"This paper explores a novel receiver architecture for multiple-input multiple-output (MIMO) and orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) that utilizes compressive sensing (CS) technique. Assuming that a limited number of subcarriers are used simultaneously in one MIMO-OFDM channel, we show that the conventional MIMO receiver can be replaced with the proposed receiver to compressively sample signals. In the proposed reception architecture, signals from multiple antennas are mixed and sampled with less hardware by exploiting the sparsity in the OFDM channel usage. Applying the CS technology to the receiver directly reduces the power consumption in mixed signal circuit which is attributable to less number of analog-to-digital converters (ADCs). A new streamlined algorithm for digital signal processing (DSP) to recover the compressively sensed data is also devised. Besides the simplification of the signal sensing, the simulation results also show that the reception fidelity of the proposed architecture outperforms that of the conventional maximum likelihood (ML) MIMO detector when the channel is lightly loaded.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"601 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116305056","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}
引用次数: 11
Secure communication scheme for wireless sensor networks to maintain anonymity 无线传感器网络保持匿名性的安全通信方案
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069511
K. Gagneja
{"title":"Secure communication scheme for wireless sensor networks to maintain anonymity","authors":"K. Gagneja","doi":"10.1109/ICCNC.2015.7069511","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069511","url":null,"abstract":"In wireless sensor networks it is becoming more and more important for sensor nodes to maintain anonymity while communicating data because of security reasons. Anonymous communication among sensor nodes is important, because sensor nodes want to conceal their identities either being a base station or being a source node. Anonymous communication in wireless sensor networks includes numerous important aspects, for instance base station anonymity, communication association anonymity, and source node anonymity. From the literature, we can observe that existing anonymity schemes for wireless sensor networks either cannot realize the complete anonymities, or they are suffering from various overheads such as enormous memory usage, complex computation, and long communications. This paper is presenting an efficient secure anonymity communication protocol (SACP) for wireless sensor networks that can realize complete anonymities offering minimal overheads with respect to storage, computation and communication costs. The given secure anonymity communication protocol is compared with various existing anonymity protocols, and the performance analysis shows that our protocol accomplishes all three anonymities: sender node anonymity, base station anonymity, and communication association anonymity while using little memory, low communication cost, and small computation costs.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760041","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
On the reliability in d-dimensional broadcast wireless networks d维广播无线网络可靠性研究
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069475
Xiaomin Ma, Gregory Butron
{"title":"On the reliability in d-dimensional broadcast wireless networks","authors":"Xiaomin Ma, Gregory Butron","doi":"10.1109/ICCNC.2015.7069475","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069475","url":null,"abstract":"In this paper, we present a new analytic derivation of two reliability indices, packet delivery ratio (PDR) and packet reception ratio (PRR), for d-dimensional (d-D) broadcast wireless networks where nodes are distributed according to a homogeneous Poisson point process. Given a point-to-point node packet reception probability (NRP) as a function of distance, PDR of nodes on d-D area is derived from PDR in a 1-D network by converting d-D Poisson Euclidean distance ordered node distribution to a type of one-dimensional (1-D) Poisson distribution so that the joint probability density function of nodes' positions in the d-D area is transformed as the joint probability density function on a 1-D line. PRR over a coverage area is derived by integrating the NRPs for different nodes over the coverage area. The approach is applied to a broadcast wireless network with Nakagami fading channel and ALOHA channel with Raleigh fading and intederence. The analytic derivation is verified by NS2 simulations.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122167669","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}
引用次数: 2
A preliminary 3D mm wave indoor office channel model 一个初步的三维毫米波室内办公室通道模型
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069289
Shu Sun, T. Rappaport, T. Thomas, Amitava Ghosh
{"title":"A preliminary 3D mm wave indoor office channel model","authors":"Shu Sun, T. Rappaport, T. Thomas, Amitava Ghosh","doi":"10.1109/ICCNC.2015.7069289","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069289","url":null,"abstract":"With the ever increasing demands in higher data rate, there is a growing interest in exploiting the millimeter wave (mmWave) spectrum for future access communications. Aiming at characterizing the mmWave indoor propagation channel, a wideband measurement campaign using directional antennas has been conducted at 73 GHz in New York City in an office-type environment. In addition, ray-tracing using a database with the same environment has been performed to predict channel parameter statistics in conjunction with the measured data. A preliminary 3GPP-like 3D mmWave indoor channel model is proposed including the distance-dependent elevation model. The estimated channel characteristics such as delay spread and angular spread are validated with the measurements. The proposed channel model can be used in simulating mmWave indoor communications in office-type environments using multi-input multi-output (MIMO) antenna arrays.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131451616","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
VIP: Joint traffic engineering and caching in Named Data Networks VIP:命名数据网络中的联合流量工程和缓存
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069430
E. Yeh, T. Ho, Ying Cui, Michael Burd, Ran Liu, Derek Leong
{"title":"VIP: Joint traffic engineering and caching in Named Data Networks","authors":"E. Yeh, T. Ho, Ying Cui, Michael Burd, Ran Liu, Derek Leong","doi":"10.1109/ICCNC.2015.7069430","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069430","url":null,"abstract":"Emerging information-centric networking architectures seek to optimally utilize both bandwidth and storage for efficient content distribution. This highlights the need for joint design of traffic engineering and caching strategies. We present a systematic framework for joint dynamic interest request forwarding and dynamic cache placement and eviction, within the context of the Named Data Networking (NDN) architecture. The framework employs a virtual control plane which operates on the user demand rate for data objects in the network, and an actual plane which handles Interest Packets and Data Packets. We develop distributed algorithms within the virtual plane to achieve network load balancing through dynamic forwarding and caching, thereby maximizing the user demand rate that the NDN network can satisfy. Numerical experiments demonstrate the superior performance of the resulting algorithms for the actual plane in terms of low user delay.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123304267","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}
引用次数: 11
CORB: Context-aware opportunistic resource-based routing for stationary wireless sensor networks CORB:固定无线传感器网络的上下文感知机会资源路由
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069335
M. Elias, Ahmed K. F. Khattab, K. Elsayed
{"title":"CORB: Context-aware opportunistic resource-based routing for stationary wireless sensor networks","authors":"M. Elias, Ahmed K. F. Khattab, K. Elsayed","doi":"10.1109/ICCNC.2015.7069335","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069335","url":null,"abstract":"In this paper, we present the Context-Aware Opportunistic Resource-Based Routing Protocol (CORB) for intermittently-connected stationary wireless sensor networks. This protocol targets domains such as ambiance control in smart buildings. Unlike existing context-aware routing approaches which consider node mobility as the main source of disconnection, CORB only considers the nodes' limited resources and context as the reasons for intermittent connection. Performance evaluation results show that the proposed CORB protocol does not only outperform existing context-aware routing protocols but also significantly outperforms the IP Ripple Routing Protocol (RPL) designed specifically for low power and lossy networks. In grid topologies (sink-centered topologies), the delivery ratio of CORB under heavy loads is up to 404% and 296% (143% and 46.6%) of the original context-aware routing protocol and IPv6 RPL, respectively.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116479043","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
Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms 具有最短路径路由的环中的频谱分配:复杂性和近似算法
2015 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2015-03-30 DOI: 10.1109/ICCNC.2015.7069420
S. Talebi, F. Alam, Iyad A. Katib, G. Rouskas
{"title":"Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms","authors":"S. Talebi, F. Alam, Iyad A. Katib, G. Rouskas","doi":"10.1109/ICCNC.2015.7069420","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069420","url":null,"abstract":"We study the spectrum assignment (SA) problem in ring networks with shortest path (or, more generally, fixed) routing. With fixed routing, each traffic demand follows a predetermined path to its destination. In earlier work, we have shown that the SA problem can be viewed as a multiprocessor problem. Based on this insight, we prove that, under the shortest path assumption, the SA problem can be solved in polynomial time in small rings, and we develop constant-ratio approximation algorithms for large rings. For rings of size up to 16 nodes (the maximum size of a SONET/SDH ring), the approximation ratios of our algorithms are strictly smaller than the best known ratio to date.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130800456","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书