2014 IEEE 13th International Symposium on Network Computing and Applications最新文献_第2页

Optimal Configuration for N-Dimensional Twin Torus Networks n维双环面网络的最优配置

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.14

Francisco J. Andújar, Juan A. Villar, J. L. Sánchez, F. J. Alfaro, J. Duato

引用次数: 0

A Sharing-Aware Greedy Algorithm for Virtual Machine Maximization 一种共享感知的虚拟机贪心算法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.24

Safraz Rampersaud, Daniel Grosu

引用次数: 15

A Resilient Hierarchical Distributed Loop Self-Scheduling Scheme for Cloud Systems 云系统中一种弹性分层分布式循环自调度方案

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.18

Yiming Han, Anthony T. Chronopoulos

引用次数: 7

A New Solution to Perform Automatic Meter Reading Using Unmanned Aerial Vehicle 一种利用无人机自动抄表的新方案

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.33

J. R. Neto, D. Guidoni, L. Villas

引用次数: 5

Secure Sensing over Named Data Networking 命名数据网络的安全感知

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.34

J. Burke, Paolo Gasti, N. Nathan, G. Tsudik

引用次数: 46

Strip Interoperability for Wireless Ad Hoc Routing Protocols 无线自组织路由协议的条带互操作性

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.9

Marco Antonio To, Gerardo Morales, S. Maag

引用次数: 4

An Adaptive Approach to Opportunistic Data Forwarding in Underwater Acoustic Sensor Networks 水声传感器网络中机会数据转发的自适应方法

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.41

N. Nowsheen, G. Karmakar, J. Kamruzzaman

{"title":"An Adaptive Approach to Opportunistic Data Forwarding in Underwater Acoustic Sensor Networks","authors":"N. Nowsheen, G. Karmakar, J. Kamruzzaman","doi":"10.1109/NCA.2014.41","DOIUrl":"https://doi.org/10.1109/NCA.2014.41","url":null,"abstract":"Reliable data transfer for underwater acoustic sensor networks (UASNs) is a major research challenge in applications such as pollution monitoring, oceanic data collection, and surveillance due to the long propagation delay and high error rate of the acoustic channel. To address this issue, an opportunistic data forwarding protocol was proposed which achieves high packet delivery success ratio with less routing overhead and energy consumption by selecting the next hop forwarder among a set of candidates based on its link reliability and data transfer reach ability. However, the protocol relies on fixed data hold time approach, i.e., Each node holds data packets for a fixed amount of time before a forwarder discovery process is initiated. Depending on the value of the fixed hold time and deployment contextual scenario, this may incur large end-to-end delay. Moreover, lack of consideration of network condition in hold time limits its performance. In this paper, we propose an adaptive technique to improve its performance. The adaptive approach calculates data hold time at each node dynamically considering a number of 'node and network' metrics including current buffer occupancy, delay experienced by stored data packets, arrival and service rate, neighbors' data transmissions and reachability. Simulation results show that compared with fixed hold time approach, our adaptive technique reduces end-to-end delay significantly, achieves considerably higher data delivery and less energy consumption per successful packet delivery.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124813962","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}

引用次数: 12

Hardware Implementation of Quasigroup Encryption for SCADA Networks SCADA网络准群加密的硬件实现

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.52

W. Mahoney, Abhishek Parakh, Matthew Battey

引用次数: 3

Entropy Adaptive On-Line Compression 熵自适应在线压缩

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.31

S. Dolev, S. Frenkel, M. Kopeetsky

{"title":"Entropy Adaptive On-Line Compression","authors":"S. Dolev, S. Frenkel, M. Kopeetsky","doi":"10.1109/NCA.2014.31","DOIUrl":"https://doi.org/10.1109/NCA.2014.31","url":null,"abstract":"Self-Organization is based on adaptivity. Adaptivity should start with the very basic fundamental communication tasks such as encoding the information to be transmitted or stored. Obviously, the less signal transmitted the less energy in transmission used. In this paper we present a novel on-line and entropy adaptive compression scheme for streaming unbounded length inputs. The scheme extends the window dictionary Lempel-Ziv compression, is adaptive and is tailored to on-line compress inputs with non stationary entropy. Specifically, the window dictionary size is changed in an adaptive manner to fit the current best compression rate for the input. On-line Entropy Adaptive Compression scheme (EAC), that is introduced and analyzed in this paper, examines all possible sliding window sizes over the next input portion to choose the optimal window size for this portion, a size that implies the best compression ratio. The size found is then used in the actual compression of this portion. We suggest an adaptive encoding scheme, which optimizes the parameters block by block, and base the compression performance on the optimality proof of Lempel Ziv algorithm when applied to blocks. The EAC scheme was tested over files of different types (docx, ppt, jpeg, xls) and over synthesized files that were generated as segments of homogeneous Markov Chains. Our experiments demonstrate that the EAC scheme typically provides a higher compression ratio than LZ77 does, when examined in the scope of on-line per-block compression of transmitted (or compressed) files.","PeriodicalId":399462,"journal":{"name":"2014 IEEE 13th International Symposium on Network Computing and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131379449","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

RLP: A Community Detection-Based Routing Protocol for Wireless Sensor Networks RLP:一种基于社区检测的无线传感器网络路由协议

2014 IEEE 13th International Symposium on Network Computing and Applications Pub Date : 2014-08-21 DOI: 10.1109/NCA.2014.42

M. A. D. Paulo, M. C. Nascimento, V. Rosset

引用次数: 3