| Title | Scalability Issue of Ant-based Routing Algorithms for MANETs |
| Author | *Woo Jong Roh, Ngo Huu Dung, Miae Woo (Sejong University, Republic of Korea) |
| Page | pp. 257 - 260 |
| Keyword | Mobile Ad-Hoc Network, Ant Colony Optimization, Ant-based Routing, Performance evaluation, Scalability |
| Abstract | Ant-based routing algorithm is a class of ant colony optimization algorithms which are inspired by the behavior of ants in nature. We have been proposed an efficient ant-based routing algorithm (EAR) for mobile ad-hoc networks (MANETs) in order to support multi-path routes and to reduce overheads by managing ants efficiently. In this paper, we analyze the performance of EAR and AntHocNet to show how EAR outperforms AntHocNet in terms of scalability by varying the number of nodes in the network system. |
| Title | Challenges in Managing MobileIP Networks |
| Author | *Kazuhide Koide (Tohoku University, Japan), Glenn Mansfield Keeni (Cyber Solutions Inc., Japan), Norio Shiratori (Tohoku University, Japan) |
| Page | pp. 261 - 264 |
| Keyword | Network Management, Location, FCAPS |
| Abstract | Several of the implicit assumptions of traditional network management do not hold in networks supporting mobility. The location of a node changes, the RTT between two nodes may fluctuate over a relatively large range and unreachability is not a definite symptom of failure. In this work we propose FCAPS+L, an extension of the management framework, that supports mobility. We examine the management issues related to mobility, the information requirements to address these issues and the technology required to make the information available to a manager or management application. |
| Title | A Development of Efficient Packet Processing Unit for Scheduling Algorithm Method on IPv6 Router |
| Author | *Jeong-Uk Chang, Jin-Chun Kim, Chi-Ho Lin (School of Computer Science, Semyung University, Republic of Korea) |
| Page | pp. 265 - 268 |
| Keyword | Packet scheduling, Routing, Algorithm, Transmit method |
| Abstract | This paper proposed packet processing scheduling algorithm that is important part in traffic performance on IPv6 router for efficient packet processing unit development.
We apply proposing scheduling algorithm to packet scheduler in router that is important element in integration service model, enforce service differentiation between packets. An experiment carries out to divide by source of sensitive Video and Audio in latency time and cell damage and general Data's source each 3 sessions. We generate traffic in process that Source packet reaches destination. So, with existent algorithm, I measure delay time that happened during each transmission by general routing method and routing method that apply proposing algorithm.
We prove efficiency of proposing algorithm in this paper that see by measuring and compare maximum delay time and average delay time at each session. |
| Title | An Improvement of Twisted Ate Pairing Using Integer Variable with Small Hamming Weight |
| Author | *Yumi Sakemi, Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama University, Japan) |
| Page | pp. 269 - 272 |
| Keyword | twisted Ate pairing, BN curve, Hamming Weight |
| Abstract | Barreto-Naehrig (BN) curve has been introduced as a pairing-friendly elliptic curve over prime field Fp which has embedding degree 12.
Characteristic and Frobenius trace are given as polynomials of integer variable $\chi$.
This paper proposes an improvement of Miller's algorithm of twisted Ate pairing with BN curve by $\chi$ of small hamming weight.
Then, in order to show the efficiency of the proposed method, twisted Ate pairings with BN curve of order $r\approx 2^{158}$ and $r\approx 2^{254}$ are simulated and
it is shown that these twisted Ate pairings are carried out with 7.21 milliseconds and 16.5 milliseconds by Pentium4 (3.6GHz), respectively. |
| Title | Fast Squaring in TypeI All One Polynomial Field |
| Author | *Hidehiro Kato, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama University, Japan) |
| Page | pp. 273 - 276 |
| Keyword | fast squaring, extension field, bilinear pairing, cyclic vector multiplication algorithm |
| Abstract | In this paper, the authors propose a fast squaring on all one polynomial field and show some simulation results with characteristic p = 256-bit prime and extension degree k ∈ {2, 4, 6, 10, 12} implemented on a PentiumIV (2.6GHz) using the C programming language. The computer simula
tions showed that, on average, the proposed algorithm accelerated about 30% in Fp2 , 12% in Fp4 and 6% in Fp6 compared to the conventional squaring. |