2012 Third International Conference on Networking and Computing最新文献_第7页

Performance Evaluation of AODV and AOMDV with Probabilistic Relay in VANET Environments VANET环境下带概率中继的AODV和AOMDV性能评价

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.47

R. Anggoro, T. Kitasuka, Ryoji Nakamura, M. Aritsugi

{"title":"Performance Evaluation of AODV and AOMDV with Probabilistic Relay in VANET Environments","authors":"R. Anggoro, T. Kitasuka, Ryoji Nakamura, M. Aritsugi","doi":"10.1109/ICNC.2012.47","DOIUrl":"https://doi.org/10.1109/ICNC.2012.47","url":null,"abstract":"Vehicular ad hoc networks (VANETs) are the specific class of Mobile ad hoc networks (MANETs). Since vehicles tend to move in a high speed, the network topology is rapidly changed. Thus vehicle's connectivity problem is one of the interesting issues in VANETs. Ad hoc on-demand multipath distance vector (AOMDV) is the extended version of ad hoc on-demand distance vector (AODV). AOMDV is designed to overcome a connectivity problem due to highly dynamic network topology. It provides multipath for data packets delivery from the source to the destination. Although AOMDV outperforms AODV in packet delivery ratio, AOMDV's multipath establishment and maintenance generate more control packets than AODV's unipath. However increasing the vehicle speed will degrade their performance. Thus in this paper, we added probabilistic relay, which enables adjacent vehicles to probabilistically relay unsuccessful data packet transmission, into IEEE 802.11 as a MAC standard model and combined AODV with probabilistic relay (AODV-PR) and AOMDV with probabilistic relay (AOMDV-PR). Based on our simulation result, the addition of probabilistic relay clearly helps those protocols to improve their performances especially in packet delivery ratio even under a high speed. Moreover, probabilistic relay adds beacons, but no additional routing overhead. Probabilistic relay, clearly solved connectivity problem in highly dynamic topology of VANETs. We evaluate those protocol performances based on packet delivery ratio, routing overhead, and average delivery delay under variation of vehicle speed.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128059149","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}

引用次数: 27

A Fast Network-on-Chip Simulator with QEMU and SystemC 基于QEMU和SystemC的快速片上网络模拟器

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.55

K. Nakajima, Takuji Hieda, Ittetsu Taniguchi, H. Tomiyama, H. Takada

引用次数: 6

Automated Route Planning for Milk-run Transport Logistics Using Model Checking 基于模型检验的牛奶运输物流自动化路线规划

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.44

Takashi Kitamura, Keishi Okamoto

引用次数: 13

Place Recommendation from Check-in Spots on Location-Based Online Social Networks 在基于位置的在线社交网络上从签到点推荐地点

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.29

Hongbo Chen, Zhiming Chen, M. Arefin, Y. Morimoto

引用次数: 6

Graph Augmentation Problem with Diameter Requirements 具有直径要求的图增广问题

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.75

Toshimasa Ishii

引用次数: 1

The K Computer and its Application K 电脑及其应用

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.13

M. Yokokawa

引用次数: 4

A Mobile Agent Creation Mechanism for Service Collection and Dissemination in Heterogeneous MANETs 异构manet中服务收集与传播的移动代理创建机制

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.60

Shuhei Ishizuka, T. Ohta, Y. Kakuda

引用次数: 1

Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems 组合优化问题的计算复杂度分析与算法设计

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.12

Toshimasa Watanabe

引用次数: 0

Implementation and Evaluation of Modular Multiplication Based on Coarsely Integrated Operand Scanning 基于粗积分操作数扫描的模乘法的实现与评价

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.65

Satoru Tamura, Chikatoshi Yamada, S. Ichikawa

{"title":"Implementation and Evaluation of Modular Multiplication Based on Coarsely Integrated Operand Scanning","authors":"Satoru Tamura, Chikatoshi Yamada, S. Ichikawa","doi":"10.1109/ICNC.2012.65","DOIUrl":"https://doi.org/10.1109/ICNC.2012.65","url":null,"abstract":"RSA encryption is widely used in public crypto systems. However, according to recent development of computer processing, decipher can be executed in 512-bit key length. Therefore, it has been recommended to move to RSA 2048 from RSA 1024. However, as key length increases, the amount of computation is increased for encryption. Consequently, we consider hardware implementation of processing units. In hardware implementation, the processing speed and circuit size is a trade-off relationship. In embedded devices as the IC card reader, severe resource constraints will be imposed. In this paper, based on Coarsely Integrated Operand Scanning, which is one of Montgomery multiplication, we suggest the modular multiplication circuit architecture for adjusting the trade-off processing speed and circuit size. We design modular multiplication circuit using the proposed architecture at 4-radix. Utilization for the circuit as follows: 146 slices, 461 registers, 685 look-up tables, which allows a compact implementation on the FPGA with Spartan-6 XC6SLX45T. As results, maximum operating frequency is 213.022[MHz], processing time is 41.47[μs], it was achieved 30 times faster compared with software processing.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115128464","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

Efficient Implementations of the Approximate String Matching on the Memory Machine Models 内存机模型上近似字符串匹配的高效实现

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.43

K. Nakano

引用次数: 21