Proceedings of the Third International Conference on Contemporary

Issues in Computer and Information Sciences

Edited by Bahram Sadeghi Bigham

BrownWalker Press

Boca Raton

Proceedings of the Third International Conference on Contemporary Issues in Computer and Information Sciences

Copyright © 2012 Department of Computer Science and IT, Institute for Advanced Studies in Basic Sciences All rights reserved. No part of this book may be reproduced or transmitted in any form or by any means, electronic

or mechanical, including photocopying, recording, or by any information storage and retrieval system, without written permission from the publisher.

BrownWalker Press Boca Raton, Florida

USA • 2012

ISBN-10: 1-61233-623-X ISBN-13: 978-1-61233-623-7

www.brownwalker.com

Cover image © Can Stock Photo Inc./kentoh

Foreword

The Department of Computer Science and Information Technology at the Institute for

Advanced Studies in Basic Sciences (IASBS) is very proud for holding the International

Conference on Contemporary Issues in Computer and Information Sciences (CICIS) for the

third successive year.

Our aim for CICIS, besides special attention to the scientific progress in the related subjects,

has always been aimed towards bringing the highest level of interaction between different

areas of computer science and everyday life. We acknowledge this fraternity a must for the

progress of the society. With the delightful presence of a great number of fellow scholars, this

important goal has been satisfied and we believe will be better met in the coming years.

Having this approach, the CICIS pays direct attention to several applicatory aspects of

computer science and information technology. The third conference, in addition to all related

areas, was held with special concentration on Graph and Geometrical Algorithms,

Intelligent Systems, Bioinformatics and also IT and the Society.

What makes us even more glorious is the coincidence of this conference with the 20th

anniversary of the foundation of IASBS, where outstanding scientific achievements has been

carried out in a truly friendly environment. This would have never happened without the help

of The Almighty God and notable effort of the directors, teachers, researchers and students of

IASBS.

This year, we had 277 submitted papers, which indicate your kind feedback and makes us

more determined. Of the 277 submitted papers, 45 papers (16.24 %) were accepted as oral

presentation, 77 papers (27.79 %) as poster presentation and 155 papers were rejected. We

need to indicate here that the rejected papers could have also been very outstanding, but

irrelevant to the special topics, or gained lower scores in the reviewing process. This year’s

conference, the Computer Society of Iran, Iranian branch of IEEE and also University of

Zanjan have collaborated and supported us in IASBS. We believe this collaboration has

improved the scientific aspects of this year’s conference.

We would like to pay a high respect to our sponsors for their outstanding help and

financial support: Information Technology and Digital Media Development Center, Statistics

and Informatics department of Sanjesh Organization, Arameh Innovative Researchers. A

special thanks to Brown Walker Publisher for their effort and help in publishing the

proceeding, and looking forward for further collaboration.

Bahram Sadeghi Bigham

General Chair

CICIS 2012 Committee

Honorary Chairs:

Khodabakhsh, Rasoul, Professor, Institute for Advanced Studies in Basic

Sciences (IASBS), Iran.

General Conference Chairman:

Sadeghi Bigham, Bahram, Assistant Professor, Institute for Advanced

Studies in Basic Sciences (IASBS), Iran.

Scientific Committees:

Sadeghi Bigham, Bahram, Assistant Professor, Institute for Advanced

Studies in Basic Sciences (IASBS), Iran.

Vasighi, Mehdi, Assistant Professor, Institute for Advanced Studies in Basic

Sciences (IASBS), Iran.

Afsharchi, Mohsen, Assistant Professor, University of Zanjan, Iran.

Abasi, Davoud, Assistant Professor, University of Zanajn, Iran

Zaker, Manouchehr, Associate Professor, Institute for Advanced Studies in

Basic Sciences (IASBS), Iran.

Foroush Bastani, Ali, Assistant Professor, Institute for Advanced Studies in

Basic Sciences (IASBS), Iran.

Taherkhani, Ali, Assistant Professor, Institute for Advanced Studies in

Basic Sciences (IASBS), Iran.

CICIS 2012 Organization Committee

Dr. Bahram Sadeghi Bigham

Dr. Mahdi Vasighi

Dr. Mohsen Afsharchi

Mahmoud Shirazi

Mahdi Khosravian

Farshad Bakhshandegan Moghaddam

Ebrahim Ehsanfar

Armin Ghasem Azar

Mojtaba Shahidi

Shahrokh Rahmani

Zahra Barari

Farideh Saadati

Mahdi Heidari

Hossein Khedmati Hampa

Contents

Reducing Packet Overhead by Improved Tunneling-based Route

Optimization Mechanism

Hooshiar Zolfagharnasab 1

Neural Network Learning based on Football Optimization Algorithm

Payam Hatamzadeh and Mohammad Reza Khayyambashi 8

Evaluating XML Retrieval Systems Using Methods of Averaging Precision

and Recall at Rank Cut-offs

Marzieh Javadi and Hassan Naderi 15

Performability Improvement in Grid Computing with Artificial Bee Colony

Optimization Algorithm

Neda Azadi and Mohammad Kalantari 19

Security Enforcement with Language-Based Security

Ali Ahmadian Ramaki, Shahin Shirmohammadzadeh Sahraeii and Reza Ebrahimi

Atani 26

Application of the PSO-ANFIS Model for Time Series Prediction of Interior

Daylight Illuminance

Hossein Babaee and Alireza Khosravi 30

Evaluating the impact of using several criteria for buffer management in

VDTNs

Zhaleh Sadreddini, Mohammad Ali Jabraeil Jamali and Ali Asghar Pourhaji

Kazem 36

Improvement of VDTNs Performance with Effective Scheduling Policy

Masumeh Marzaei Afshord, Mohammad Ali Jabraeil Jamali and Ali Asghar

Pourhaji Kazem 40

Classification of Gene Expression Data using Multiple Ranker Evaluators

and Neural Network

Zahra Roozbahani and Ali Katanforoush 44

Data mining with learning decision tree and Bayesian network for data

replication in Data Grid

Farzaneh Veghari Baheri, Farnaz Davardoost and Vahid Ahmadzadeh 49

Design and Implementation of a three-node Wireless Network

Roya Derakhshanfar, Maisam M.Bassiri and S.Kamaledin Setarehdan 54

CEA Framework: A Comprehensive Enterprise Architecture Framework

for middle-sized company

Elahe Najafi and Ahmad Baraani 58

Thick non-crossing paths in a polygon with one hole

Maryam Tahmasbi and Narges Mirehi 64

A Note on the 3-Sum Problem

Keivan Borna and Zahra Jalalian 69

Voronoi Diagrams and Inversion Geometry

Zahra Nilforoushan, Abolghasem Laleh and Ali Mohades 74

Selection of Effective Factors in Estimating of Costumers Respond to Mobile

Advertising by Using AHP

Mehdi Seyyed Hamzeh, Bahram Sadeghi Bigham and Reza Askari Moghadam 80

An Obstacle Avoiding Approach for Solving Steiner Tree Problem on Urban

Transportation Network

Ali Nourollah and Fatemeh Ghadimi 84

Black Hole Attack in Mobile Ad Hoc Networks

Kamal Bazargan 89

Improvement of the Modeling Airport Assignment Gate System Using Self-

Adaptive Methodology

Masoud Arabfard, Mohamad Mehdi Morovati and Masoud Karimian Ravandi 95

A new model for solving capacitated facility location problem with overall

cost of losing any facility and comparison of Particle Swarm Optimization,

Simulated Annealing and Genetic Algorithm

Samirasadat jamali Dinan, Fatemeh Taheri and Farhad Maleki 100

A hybrid method for collusion attack detection in OLSR based MANETs

Hojjat Gohargazi and Saeed Jalili 104

A Statistical Test Suite for Windows to Cryptography Purposes

R. Ebrahimi Atani, N. Karimpour Darav and S. Arabani Mostaghim 109

An Empirical Evaluation of Hybrid Neural Networks for Customer Churn

Prediction

Razieh Qiasi, Zahra Roozbahani and Behrooz Minaei-Bidgoli 114

A Clustering Based Model for Class Responsibility Assignment Problem

Hamid Masoud, Saeed Jalili and S.M.Hossein Hasheminejad 118

A Power-Aware Multi-Constrained Routing Protocol for Wireless

Multimedia Sensor Networks

Babak Namazi and Karim Faez 123

Mobile Learning- Features, Approaches and Opportunities

Faranak Fotouhi-Ghazvini and Ali Moeini 127

Predicting Crude Oil Price Using Particle Swarm Optimization (PSO) Based

Method

Zahra Salahshoor Mottaghi, Ahmad Bagheri and Mehrgan Mahdavi 131

Image Steganalysis Based On Color Channels Correlation In Homogeneous

Areas In Color Images

SeyyedMohammadAli Javadi and Maryam Hasanzadeh 134

Online Prediction of Deadlocks in Concurrent Processes

Elmira Hasanzade and Seyed Morteza Babamir 138

Fisher Based Eigenvector Selection in Spectral Clustering Using Google's

Page Rank Procedure

Amin Allahyar, Hadi Sadoghi Yazdi and Soheila Ashkezari Toussi 146

Imperialist Competitive Algorithm for Neighbor Selection in Peer-to-Peer

Networks

Shabnam Ebadi and Abolfazl Toroghi Haghighat 151

Different Approaches For Multi Step Ahead Traffic Prediction Based on

Modified ANFIS

Shiva Rahimipour, Mahnaz Agha-Mohaqeq and Seyyed Mehdi Tashakkori

Hashemi 156

E-service Quality Management in B2B e-Commerce Environment

Parvaneh Hajinazari and Abbass Asosheh 161

Calibration of METANET Model for Real-Time Coordinated and

Integrated Highway Traffic Control using Genetic Algorithm: Tehran Case

Study

Mahnaz Aghamohaqeqi, Shiva Rahimipour, Masoud Safilian and S.Mehdi

Tashakori Hashemi 165

Designing An Expert System To Diagnose And Propose About Therapy Of

Leukemia

Zohreh Mohammad Alizadeh Bakhshmandi and Armin Ghasem Azar 171

A Basic Proof Method For The Verification, Validation And Evaluation Of

Expert Systems

Armin Ghasem Azar and Zohreh Mohammad Alizadeh Bakhshmandi 175

Point set embedding of some graphs with small number of bends

Maryam Tahmasbi and Zahra Abdi reyhan 180

On The Pairwise Sums

Keivan Borna and Zahra Jalalian 184

Hyperbolic Voronoi Diagram: A Fast Method

Zahra Nilforoushan, Ali Mohades, Amin Gheibi and Sina Khakabi 187

Solving Systems of Nonlinear Equations Using The Cuckoo Optimization

Algorithm

Mahdi Abdollahi, Shahriar Lotfi and Davoud Abdollahi 191

A Novel Model-Based Slicing Approach For Adaptive Softwares

Sanaz Sheikhi and Seyed Morteza Babamir 195

A novel approach to multiple resource discoveries in grid environment

Leyli Mohammad khanli, Saeed Kargar and Hossein Kargar 200

HTML5 Security: Offline Web Application

Abdolmajid Shahgholi, HamidReza Barzegar and G.Praveen Babu 205

Earthquake Prediction by Study on Vital Signs of Animals in Wireless

Sensor Network by using Multi Agent System

Media Aminian, Amin Moradi and Hamid Reza Naji 209

Availability analysis and improvement with Software Rejuvenation

Zahra Rahmani Ghobadi and Baharak Shakeri Aski 213

A fuzzy neuro-chaotic network for storing and retrieving pattern

Nasrin Shourie and Amir Homayoun Jafari 219

GSM Technology and security impact Ahmad Sharifi and Mohsen Khosravi 224

MicTSP: An Efficient Microaggregation Algorithm Based On TSP

Reza Mortazavi and Saeed Jalili 228

Proposing a new method for selecting a model to evaluate effective factors

on job production capabilities of central province industrial cooperatives

using Data mining and BSC techniques

Peyman Gholami and Davood Noshirvani Baboli 233

A Complex Scheme For Target Tracking And Recovery Of Lost Targets In

Cluster-Based Wireless Sensor Networks

Behrouz Mahmoudzadeh and Karim Faez 237

A Measure of Quality for Evaluation of Image Segmentation

Hakimeh Vojodi and Amir Masoud Eftekhary Moghadam 241

An Unsupervised Evaluation Method for Image Segmentation Algorithms

Hakimeh Vojodi and Amir Masoud Eftekhary Moghadam 246

Evaluate and improve the SPEA using fuzzy c-mean clustering algorithm

Pezhman Gholamnezhad and Mohammad mehdi Ebadzadeh 251

Hypercube Data Grid: a new method for data replication and replica

consistency in data gird

Tayebeh Khalvandi, Amir Masoud Rahmani and Seyyed Mohsen Hashemi 255

Exploiting Parameters of SLA to Allocate Resources for Bag of Task

Applications in Cloud Environment

Masoud Salehpour and Asadollah Shahbahrami 262

Bus Arrival Time Prediction Using Bayesian Learning for Neural Networks

Farshad Bakhshandegan Moghaddam, Alireza Khanteimoory and Fatemeh

Forutan Eghlidi 267

SRank: Shortest Path-Based Ranking in Semantic Network

Hadi Khosravi-Farsani, Mohammadali Nematbakhsh and George Lausen 271

RL Rank: A Connectivity-based Ranking Algorithm Using Reinforcement

Learning

Elahe Khodadadian, Mohammad Ghasemzadeh and Vali Derhami 276

YABAC4.5: Yet Another Boosting Approach for C4.5 Algorithm

B.Shabani and H.Sajedi 281

A New Method for Automatic Language Identification In Trilingual

documents of Arabic, English, and Chinese with Different Fonts

Einolah Hatami and Karim Faez 286

Clustering in backtracking for solution of N-queen Problem

Samaneh Ahmadi, Vishal Kesri and Vaibhav Kesri 290

An Improved Phone Lattice Search Method for Triphone Based Keyword

Spotting in Online Persian Telephony Speech

Maria Rajabzadeh, Shima Tabibian, Ahmad Akbari and Babak Nasersharif 294

Adaptive Gaussian Estimation of Distribution Algorithm

Shahram Shahraki and Mohammad-R. Akbarzadeh-T 300

A New Feature Transformation Method Based On Genetic Algorithm

Hannane Mahdavinataj and Babak Nasersharif 304

Evaluating the performance of energy aware tag anti collision protocols in

RFID systems

Milad Haj Mirzaei and Masoud Ghiasbeigi 310

GPS GDOP Classification via Advanced Neural Network Training

H. Azami, S. Sanei and H. Alizadeh 315

Improving Performance of Software Fault Tolerance Techniques Using

Multi-Core Architecture

Hoda Banki, Seyed Morteza Babamir, Azam Farokh and Mohamad Mehdi

Morovati 320

An Introduction to an Architecture for a Digital-Traditional Museum

Reza Asad Nejhad, Mina Serajian, Mohsen Vahed and Seyyed Peyman Emadi 326

A Comparison of Transform-Domain Digital Image Watermarking

Algorithms

Asadollah Shahbahrami, Mitra Abbasfard and Reza Hassanpour 329

Polygon partitioning for minimizing the maximum of geodesic diameters

Zahra Mirzaei Rad and Ali Mohades 336

Automatic Path-oriented Test Case Generation by considering Infeasible

Paths Shahram Moadab, Hasan Rashidi and Eslam Nazemi 340

Control Topology based on delay and traffic in wireless sensor networks

Bahareh Gholamiyan Yosef Abad and Masuod Sabaei 345

Two-stage Layout of workstations in an organization based clustering and

using an evolutionary approach Rana ChaieAsl, Shahriar Lotfi and Reza Askari Moghadam 350

CAB : Channel Available Bandwidth Routing Metric for Wireless Mesh

Networks

Majid Akbari and Abolfazl Toroghi Haghighat 355

A PSO Inspired Harmony Search Algorithm

Farhad Maleki, Ali Mohades, F. Zare-Mirakabad, M. E. Shiri and Afsane Bijari 360

Repairing Broken RDF Links in the Web of Data by Superiors and Inferiors

sets

Mohammad Pourzaferani and Mohammad Ali Nematbakhsh 365

Palmprint Authentication Based on HOG and Kullback Leibler

Ma.Yazdani, F. Moayyedi and Mi. Yazdani 370

A Simple and Efficient Fusion Model based on the Majority Criteria for

Human Skin Segmentation

S. Mostafa Sheikholslam, Asadollah Shahbahrami, Reza PR Hasanzadeh and

Nima Karimpour Darav 374

A New Memetic Fuzzy C-Means Algorithm For Fuzzy Clustering

Fatemeh Golichenari and Mohammad Saniee Abadeh 380

Cross-Layer Architecture Design for long-range Quantum Nanonetworks

Aso Shojaie, Mehdi Dehghan Takhtfooladi,Mohsen Safaeinezhad and Ebrahim

SaeediNia 385

Generation And Configuration Of PKI Based Digital Certificate Based On

Robust OpenCA Web Interface

Parisa Taherian and Mohammad Hossein Karimi 391

Network Intrusion Detection Using Tree Augmented Naive-Bayes

R. Najafi and Mohsen Afsharchi 396

Dynamic Fixed-Point Arithmetic: Algorithm and VLSI Implementation

Mohammad Haji Seyed Javadi, Hamid Reza Mahdiani and Esmaeil Zeinali Kh. 403

Cost of Time-shared Policy in Cloud Environment GhDastghibyfard and Abbas Horri 408

Using Fuzzy Classification System for Diagnosis of Breast Cancer

Maryam Sadat Mahmoodi, Bahram Sadeghi Bigham and Adel Najafi-Aghblagh

Rostam Khan 412

Government above the Clouds: Cloud Computing Based Approach to

Implement E-Government

Toofan Samapour and Mohsen Solhnia 417

Human Tracking-by-Detection using Adaptive Particle Filter based on HOG

and Color Histogram

Fatemeh Rezaei and Babak H.Khalaj 422

Use of multi-agent system approach for concurrency control of transactions

in distributed databases

Seyed Mehrzad Almasi, Hamid Reza Naji and Reza Ebrahimi Atani 426

Multi-scale Local Average Binary Pattern based Genetic algorithm

(MLABPG) for face recognition

A. Hazrati Bishak and K. faez 430

A Novel Method for Function Approximation in Reinforcement Learning

Bahar Haghighat, Saeed Bagheri Shouraki and Mohsen Firouzi 435

An Intelligent Hybrid Data Mining Method for Car-Parking Management

Sevila Sojudi, Susan Fatemieparsa, Reza Mahini, Parisa YosefZadehfard and Somayeh Ahmadzadeh 443

Iris Recognition with Parallel Algorithms Using GPUs

Meisam Askari, Reyhane azimi and Hossein Ebrahimpour Komle 448

Improving Performance of Mandelbrot Set Using Windows HPC Cluster

and MPI.NET

Azam Farokh, Hoda Banki, Mohamad Mehdi Morovati and Hossein

Ebrahimpour Komle 453

The study of indices and spheres for implementation and development of

trade single window in Iran

Elham Esmaeilpour and Noor Mohammad Yaghobi 458

Web Anomaly Detection Using Artificial Immune System and Web Usage

Mining Approach

Masoumeh Raji, Vali Derhami and Reza Azmi 462

A Fast and Robust Face Recognition Approach Using Weighted Haar And

Weighted LBP Histogram

Mohsen Biglari, F. Mirzaei and H. Ebrahimpour-Komleh 467

An Unsupervised Method for Change Detection in Breast MRI Images

based on SOFM

Marzieh Salehi, Reza Azmi and Narges Norozi 473

A new image steganography method based on LSB replacement using

Genetic Algorithm and chaos theory

Amirreza Falahi and Maryam Hasanzadeh 478

Providing a CACP Model for Web Services Composition

Parinaz Mobedi and Mehregan Mahdavi 482

Using Collaborative Filtering for Rate Prediction

Sonia Ghiasifard and Amin Nikanjam 487

A New Backbone Formation Algorithm For Wireless Ad-Hoc Networks

Based On Cellular Learning Automata

Maryam Gholami, Mohammad Reza Meybodi and Ali Nourollah 492

Solving Dominating Set Problem In Unit Disk Graphs By Genetic

Algorithms

Azadeh Gholami, Mahmoud Shirazi and Bahram Sadeghi Bigham 498

Conflict Detection and Resolution in Air Traffic Management based on

Graph Coloring Problem using Prioritization Method

Hojjat Emami and Farnaz Derakhshan 504

A Review of M-Health Approach for Chronic Disease Management

Marva Mirabolghasemi, N.A.Iahadi, Maziar Mirabolghasemi and Vida

Zakerifardi 509

A New IIR Modeling by means of Genetic Algorithm

Tayebeh Mostajabi and Javad Poshtan 514

A New Similarity Measure for Improving Recommender Systems Based on

Fuzzy Clustering and Genetic Algorithm

Fereshteh Kiasat and Parham Moradi 518

The lattice structure of Signed chip firing games and related models

A. Dolati, S. Taromi and B. Bakhshayesh 525

Tiling Finite Planes

Jalal Khairabadi ,Rebvar Hosseini, Zohreh Mohammad Alizadeh and Bahram

Sadeghi Bigham 528

J2ME And Mobile Database Design

Seyed Rebvar Hosseini, Lida Ahmadi, Bahram Sadeghi Bigham and Jalal

Khairabadi 532

IIR Modeling via Skimpy Data and Genetic Algorithm

Tayebeh Mostajabi and Javad Poshtan 536

Concurrent overlap partitioning, A new Parallel Framework for Haplotype

inference with Maximum parsimonious

Mohsen Taheri, Alireza Meshkin and Mehdi Sadeghi 540

A Bayesian Neural Network for Price Prediction in Stock Markets

Sara Amini, Farzaneh Yahyanejad and Alireza Khanteymoori 548

Maintaining the Envelope of an Arrangement Fixed

Marzieh Eskandari and Marjan Abedin 553

Investigating and Recognizing the Barriers of Exerting E-Insurance in Iran

Insurance Company According to the Model of Mirzai Ahar Najai (Case

Study: Iran Insurance Company in Orumieh City)

Parisa Jafari, Hamed Hagtalab, Morteza Shokrzadeh and Hasan Danaie 557

Identifying and Prioritizing Effective Factors in Electronic Readiness of the

Organizations for Accepting and Using Teleworking by Fuzzy AHP

Technique

(Case Study: Governmental and Semi-Governmental Organizations in

Tabriz City)

Morteza Shokrzadeh, Naser Norouzi, Jabrael Marzi Alamdari and Alireza

Rasouli

561

Hybrid Harmony Search for the Hop Constrained Connected Facility

Location Problem

Bahareh khazaei, Farzane Yahyanejad, Angeh Aslanian and S. Mehdi Hashemi 566

Gene Selection using Tabu Search in Prostate Cancer Microarray Data

Farzane Yahyanejad, Mehdi Vasighi, Angeh Aslanian and Bahareh khazaei 571

BI Capabilities and Decision Environment in BI Success

Zahra Jafari, Mahmoud Shirazi and Mohammad Hosseion Hayati 575

Computation in Logic and Logic in Computation

Saeed Salehi 580

Rating System for Software based on International Standard Set 25000

ISO/IEC

Hassan Alizadeh, Hossein Afsari and Bahram Sadeghi Bigham 584

TOMSAGA: TOolbox for Multiple Sequence Alignment using Genetic

Algorithm

Farshad Bakhshandegan Moghaddam, Mahdi Vasighi 589

To enrich the life book of IT specialists through shaping living schema

Strategy based on Balance-oriented Model

Mostafa Jafari 595

Reducing Packet Overhead by Improved Tunneling-based Route

Optimization Mechanism

Hooshiar Zolfagharnasab ∗

Department of Computer Engineering

University of Isfahan

Department of IT, Soroush Educational Complex

hoppico@eng.ui.ac.ir

Abstract: Common Mobile IPv6 mechanisms, bidirectional tunneling and route optimization,show inefficient packet overhead when both nodes are mobile. Researchers have proposed methodsto reduce per-packet overhead regarding to maintain compatible with standard mechanisms. In thispaper, three mechanisms in Mobile IPv6 are discussed to show their efficiency and performance.Following discussion, a new mechanism called improved tunneling-based route optimization is pro-posed and due to performance analysis on packet overhead, it is shown that proposed mechanismhas less overhead comparing to others. Analytical results indicate that improved tunneling-basedroute optimization transmits more payloads due to send packets with less overhead.

Keywords: Mobile IP; Route Optimization; Bidirectional Tunneling; Packet Overhead.

1 Introduction

Mobile IP is a technique enables nodes to maintainpermanent IP address while they are moving throughnetworks [1]. Due to Mobile IP protocol, a communica-tion can be established between a Mobile Node (MN)and a Corresponding Node (CN) regardless to their lo-cations.

The Mobile IP protocol supports transparencyabove the network layer including transport layerwhich consists of the maintenance of active TCP con-nections and UDP port bindings, and application layer.Mobile IP is most often found in wireless WAN environ-ments where users need to carry their mobile devicesacross multiple LANs with different IP addresses [2]–[4]. Mobile IP is implemented in IPv6 via two mech-anisms called bidirectional tunneling and route opti-mization [1], [8].

In order to enable mobility over IP protocols, net-work layer of mobile devices should send messages to

inform other devices about location and network theyare wandering. Original packets from the network up-per layers are embedded in packets containing mobilerouting headers. Reducing mobility overhead causesmore data to be sent with each packet. Therefore somemechanisms are used to reduce mobility overhead. Inthis paper, a new mechanism is proposed to reduce mo-bility overhead by reusing address field of IP addresstwice.

2 Related Works

Some attempts have been performed to improve secu-rity and performance in Mobile IP. C. Perkins proposeda security mechanism in binding updates between CNand MN in [5]. C. Vogt et al. in [6] proposed a proac-tive address testing in route optimization.

In other aspect, D. Le and J. Chang suggested re-ducing bandwidth usage due to use tunnel header in-stead of route optimization header when both MN and

∗Corresponding Author: IT Manager at Soroush Educational Complex, Tehran, Iran, Tel: (+98) 912 539-4829

1

CICIS’12, IASBS, Zanjan, Iran, May 29-31, 2012

CN are mobile nodes [7].

It should be noted few papers focused on band-width reduction in Mobile IP while a lot of suggestionsare proposed to solve issues in security and delay. Inthis paper, we are going to present a new technique toreduce bandwidth by diminishing overhead of packetswhen both MN and CN are mobile nodes.

3 Mobile IPv6

Discussing about bidirectional and route optimization,we will talk about their advantages and disadvantages.Later, a method presented in [7], is explained to coversome disadvantages of standard mechanisms.

3.1 Bidirectional Tunneling

In Bidirectional Tunneling, MN and HA are connectedto each other via a tunnel, so signaling is required toconstruct a tunnel between MN and CN. Packets sentfrom CN to MN passes through HA before deliveranceto MN. Intercepting all packets destined to MN, HAdetects by Proxy Neighbor Discovery [9]. Since MNis not present in home network and assuming noticedtunnel is constructed, HA encapsulates each detectedpacket in a new packet addressed to MN’s new care-of address (CoA) and sends them through the tunnel[10]. At the end of the tunnel, the tunneled packetis de-capsulated by MN’s network layer before beingsurrendered to MN’s upper layers.

Similar encapsulation is performed when MN sendspackets. Encapsulated packets are tunneled to HA,that is called reverse tunneling, by adding 40 bytes astunnel header, addressed from MN’s CoA to HA. Beingde-capsulated by HA, tunneling header is removed andmodified packet is sent to CN through the Internet.

3.2 Route Optimization (RO)

In Route Optimization mechanism, packets are trans-mitted between MN and CN directly [3]. Binding Up-date (BU) messages are sent not only to HA, but also toall connected CNs to bind MN’s current address to itsHoA. Each CN has a table called Binding Cache to keeptrack of all corresponding MNs’ CoA and their HoA.Similar table is kept in MN to determine whether aCN uses bidirectional tunneling or route optimization.

Also it is important to update CNs’ binding cache bysending BU messages frequently.

Route Optimization mechanism uses Home AddressOption header extension to carry MN’s HoA when apacket is sent from MN to CN. Reversely when a packetis sent from CN to MN, another header extension calledType 2 Routing header is used.

In a scenario that both MN and CN are mobilenodes, route optimization can be implemented, too[1]. Since both MN and CN have HoA and CoA,packet routing requires both extension headers to carryenough information for the pair’s network layer. There-fore, to transmit a packet from MN to CN, not onlyHome Address Option header, but also Type 2 Rout-ing header should be filled with appropriate addresses.Since each extension header is 24 bytes, total overheadto transmit a packet between two mobile nodes is 48bytes.

3.3 Tunneling-based Route Optimiza-tion (TRO)

As discussed before, in a scenario when both MN andCN are mobile nodes, total overhead to carry a packetbetween nodes is 48 bytes in route optimization. To re-duce the overhead, D. le and J. Chang in [7] proposeda mechanism called Tunneling-based Route Optimiza-tion. Like standard route optimization, TRO constructa tunnel to transfer packets directly between MN andCN. But in their proposed method, a Tunnel Manageris controlling packets. Not only tunnel manager is intouch with binding cache, but also it manipulates pack-ets importing and exporting from the network layer.

As long as MN’s transport layer create a packetfrom MN’s HoA destined to CN’s HoA, the packetis surrendered to MN’s tunnel manager before it issent. Since tunnel manager is aware of CN’s mobility,it encapsulates the packet in a new packet addressedfrom MN’s CoA to CN’s CoA. Later the packet is sentthrough the tunnel to CN. At the other side of tunnel,CN’s tunnel manger de-capsulate the packet, extract-ing the original packet addressed from MN’s HoA toCN’s HoA. Then the packet is surrendered to trans-port layer which is still unaware of mobility.

To maintain compatible with previous mechanisms,BU messages are changed. By using a flag called ROT,tunnel manager decides whether to use tunneling-basedroute optimization or standard route optimization [7].

TRO mechanism benefits from using 40 bytes tun-

2

The Third International Conference on Contemporary Issues in Computer and Information Sciences

Figure 1: Protocol model for route optimization and packets passing between layers

nel header instead of using 48 bytes extension headerwhen standard route optimization is used.Result pre-sented in [7] shows that TRO can increase performancein Mobile IP comparing to standard mechanisms.

4 Improved Tunneling-basedRoute Optimization (ITRO)

More reduction can be accessed in order to spend lessheader overhead in communication between MN andCN, when they are both mobile nodes. Each nodeconstructs a binding cache to keep the address of theother, so there is no necessity to send HoA of the otherpair via header extension because it can be obtainedfrom binding cache by the help of CoA included inpacket. In other words, header overhead is reducedby using IPv6 address fields twice, both for the In-ternet addressing and mobile addressing. Instead, atunnel manager should be embedded not only to con-trol binding cache, but also change the packet header.The tunnel manager should control whether IPv6 ad-dress header is used for Internet addressing or mobileaddressing. Later in this section, we discuss about Im-proved Tunneling-based Route Optimization method.

4.1 Protocol Model in End-Points

Mobile IPv6 protocol should change a little to supportoverhead reduction. Both nodes should be devised witha tunnel manager which control and change all packetsswitched between MN and CN. Also the noticed tun-nel manger should be allowed to access binding cachein order to find corresponding HoA of a node. Fig. 1

depicts the protocol model in sender and receiver.

4.2 Improved Tunneling-based RouteOptimization Routing

Below, we discuss two scenarios to explain our pro-posed method. It should be mentioned that a tunnelbetween MN and CN should be initiated at first. AlsoBU messages have been sent to construct binding cachein both CoA and HoA.

As long as MN wants to send a packet to CN, sincemobility is transparent to upper layers in nodes, MN’snetwork layer sets both source of the packet to MN’HoA and destination to CN’s HoA. In the next step,when tunnel manager gets the packet, it updates thepacket by changing both packet’s source and destina-tion. Since MN is in a foreign network, it changes thesource field from its HoA to its CoA. Later, searchingbinding cache (by the help of CN’s HoA), it finds CN’scorresponding CoA and then writes it in the destina-tion address field. Altered packet is sent directly toCN through the tunnel.

By reception of packet to the other side of the tun-nel, CN’s tunnel manager manipulates the packet tomake it ready for upper layers. First manipulation isperformed by changing the packet’s destination fromCN’ CoA to CN’s HoA. Next step is followed by search-ing binding cache with MN’s CoA to find correspond-ing HoA. Later, the CN’s tunnel manger then changepacket’s source from MN’s CoA to what has just beenfound, MN’s HoA. As long as changes are finished, the

3

CICIS’12, IASBS, Zanjan, Iran, May 29-31, 2012

Figure 2: Improved tunneling-based route optimizationpackets due to Fig. 1

updated packet is surrendered to upper layers. Due toFig. 1, packets sent from MN to CN are addressed asshown in Fig. 2.

Same action is performed when a packet is sent fromCN to MN. Since CN’s network upper layers are un-aware of mobility, a packet is constructed which is ad-dressed from CN’s HoA to MN’s HoA. As the packet ispassed to CN’s tunnel manger, due to binding cache,

the destination of the packet is changed from MN’sHoA to MN’s CoA. Since CN knows its CoA, tunnelmanger updates the packet’s source from its HoA toCoA. Then the packet is tunneled to MN.

Similarly, MN’s tunnel manager changes the pack-ets destination from MN’s CoA to MN’s HoA. Later,searching binding cache, the packets source is alsochanged from CN’s CoA to CN’s HoA.

4.3 Changing BU messages

To maintain compatible with other MIPv6 mecha-nisms, binding messages should change. We proposeto use two flags in order to distinguish three differentmechanisms. Calling ROT0 and ROT1, these flags in-dicate whether route optimization or tunneling-basedroute optimization or improved tunneling-based routeoptimization is used. Routing mechanisms due toROT0 and ROT1 are listed in table 1.

Table 1: Routing mechanism due to ROT flags

Mechanism ROT1 ROT0

Route Optimization 0 0

Tunneling-based Route Optimization 0 1

Improved Tunneling-based RouteOptimization (proposed method) 1 1 or 0

5 Evaluation

We have evaluated our proposed mechanism via com-parison to three other mechanisms. Since improvedtunneling-based route optimization mechanism intendsto reduce header overhead, main comparison metricis bytes consumed to establish mobile communication.We used relation 1 proposed in [7] to calculate mobilityoverhead. It should be noted that mobility overheadis bytes used to route packets from one mobile node toanother, and is different from overhead used to routepackets through network layer.

Mobility Overhead Ratio =Mobility Addition Size

Original Packet Size,

(1)

Also, comparing to bidirectional tunneling mecha-nism, communicating time is also mentioned which isdefined as total time for a packet to deliver from sourceto destination.

Moreover, packets are assumed to be 1500 bytesthat is maximum transmission unit size in Ethernet,containing IPv6 packets, extension header if neededand tunneling overhead.

5.1 Comparing to Bidirectional Tun-neling

As mentioned before, in bidirectional tunneling, pack-ets from CN should be tunneled from HA to MN andare replied in the same tunnel from MN to HA, calledreverse tunneling. For each time a packet is tunneled,40 bytes are used additionally to route the packet tothe other side of tunnel. As a packet is tunneled twiceto reach to destination, 80 bytes are consumed in twodifferent communications. Total bandwidth which isused to carry a packet from source to destination iscalculated as follows:

Mobility Overhead Ratio =Tunnel Header SizeHA→MN

Original Packet Size

+Tunnel Header SizeMN→HA

Original Packet Size

=40

1500 − 40+

40

1500 − 40= 5.48%, (2)

Also in bidirectional tunneling, each routing elapsesone Internet routing time [11] because each node canbe anywhere in the Internet. Due to Fig. 3, total delay

4

The Third International Conference on Contemporary Issues in Computer and Information Sciences

Figure 3: Comparing delay time for bidirectional tun-neling mechanism and route optimization based mech-anisms

consists of three Internet routing time that is com-puted from:

Total time =TMN→HAMN + THAMN→HACN+ THACN→CN

∼= 3 TInternet, (3)

In improved tunneling-based route optimization,since nodes are connected to each other through a tun-nel, there is no need to tunnel packets twice betweenMN and HA. Also address field of packet issued bothfor tunnel and IPv6 header. Therefore, reduction inboth overhead and delay are sensible. Mobility Over-head Ratio is calculated as follows:

Mobility Overhead Ratio =0 BIPv6 tunnel header

1500 − 0

=0

1500= 0%, (4)

Also delay in proposed mechanism is computedfrom:

Total time = TMN→CN ∼= TInternet, (5)

It means in Improved Tunneling-based Route Opti-mization mechanism s more efficient both in overheadand delay.

Figure 4: Route optimization packets due to Fig. 1

5.2 Comparing to Route Optimization

Although both route optimization and proposed mech-anisms construct a tunnel to reduce delay time andoverhead needed to communicate two mobile nodes,different overheads are used to route a packet in con-structed tunnel. In the situation when both nodes aremobile, route optimization uses Home Address Optionand Type 2 routing extension headers as it is depictedin Fig. 4. Since each extension header is 24 bytes insize, total mobility header added to IPv6 packet is48 bytes. So mobility overhead ratio is calculated asfollows:

Mobility Overhead Ratio =24 Btype 2 + 24 BHOA Option

1500 − 48

=48

1452= 3.3%, (6)

Since packets are tunneled directly to each node,one Internet time is required (Equation. 5).

Because improved tunneling-based route optimiza-tion uses address field of packet both for tunneling andIPv6 routing, as it calculated before, it uses 0% of totalpacket size.

Using same tunnel for transmitting packets, totaldelay time is same for both route optimization and pro-posed method.

5.3 Comparing to Tunneling-basedRoute Optimization

Tunneling-based Route Optimization is proposed notonly to decrease communication delay, but also to re-duce overhead. It benefits from both tunneling ideaused in bidirectional tunneling and connecting directlyused in Route Optimization. Tunneling header whichis 40 bytes is added to IPv6 packet duo to reduce 48bytes of extension headers. Fig. 5 shows packets A andB due to Fig. 1 when tunneling-based route optimiza-tion mechanism is used. Also, mobility overhead ratiois calculated as follows:

5

CICIS’12, IASBS, Zanjan, Iran, May 29-31, 2012

Figure 5: Tunneling-based route optimization packetsdue to Fig. 1

Table 2: Comparison between Mobile IPv6 mecha-nisms

Mechanism Packet Delay

Overhead (Internet

(%) Time)

Bidirectional Tunneling 6.6 3

Route Optimization 3.3 1

Tunneling-based RouteOptimization 2.74 1

Improved Tunneling-basedRoute Optimization(proposed method) 0 1

Mobility Overhead Ratio =40 BIPv6 tunnel header

1500 − 40

=40

1460= 2.74%, (7)

Total delay is equal to one Internet Time, becausepackets should pass a tunnel same as the tunnel usedin Route Optimization.

Comparing to improved tunneling-based route op-timization mechanism, proposed method has no over-head in header used in mobile communication. Andtotal delay is the same to route optimization mecha-nism.

Listed in table 2, Mobile IPv6 mechanisms are com-pared to each other. All in all it is obvious that pro-posed method can reduce both delay and bandwidthused in mobile nodes’ communication.

6 Conclusion

In this paper, performance of both standard MobileIPv6 routing mechanisms and Tunneling-based RouteOptimization are analyzed. To reduce packet overhead,we proposed Improved Tunneling-based Route Opti-mization mechanism. In order to maintain compatible

with standard mechanisms, not only the tunnel man-ager should be changed, but also Binding Update mes-sages must be altered. Comparison to BidirectionalTunneling, Route Optimization and Tunneling-basedRoute Optimization shows that the packet overhead ofproposed mechanism is reduced significantly compar-ing to previous mechanisms. Therefore regarding toless overhead for each packet, more data can be trans-mitted through network via a Mobile IP communica-tion.

Acknowledgement

I would like to thank Soroush Educational Complexand especially Mr. Adbullah Shirazi for financial sup-port and assistance. Also I should thank Mr. SeyedMorteza Hosseini for preparing final version of PDFusing LATEX 2ε.

Refrences

[1] D. Johnson, C. Perkins, and J. Arkko, Mobility Supportin IPv6, Internet Draft (work in progress), IETF (2009),[Online] Available: http://tools.ietf.org/id/draft-ietf-mext-rfc3775bis-05.txt.

[2] R. Koodli, Mobile IPv6 Fast Handovers,RFC 5568, IETF (2009), [Online] Available:http://www.ietf.org/rfc/rfc5568.txt.

[3] A. Muhanna, M. Khalil, S. Gundavelli, K. Chowdhury,and P. Yegani, Binding Revocation for IPv6 Mobility, In-ternet Draft (work in progress), IETF (2009), [Online]Available: http://www.ietf.org/id/draft-ietf-mext-binding-revocation-14.txt.

[4] M. Liebsch, A. Muhanna, and M. Blume, Tran-sient Binding for Proxy Mobile IPv6, Internet Draft(work in progress), IETF (2009), [Online] Available:http://www.ietf.org/id/draft-ietf-mipshop-transient-bcepmipv6-04.txt.

[5] C. Perkins, Securing Mobile IPv6 Route Optimization Us-ing a Static Shared Key, RFC 4449, IETF (2006), [Online]Available: http://www.ietf.org/rfc/rfc4449.txt.

[6] C. Vogt, R. Bless, M. Doll, and T. Kuefner, Early BindingUpdates for Mobile IPv6, in Proceedings of IEEE WirelessCommunications and Networking Conference (WCNC’05) 3(2005), 1440–1445.

[7] D. Le and J. Chang, Tunneling-based route optimizationfor mobile IPv6, in Proceedings of IEEE Wireless Commu-nications, Networking and Information Security (WCNIS)(2010), 509–513.

[8] C. Perkins, IP Mobility Support for IPv4,RFC 3344, IETF (2002), [Online] Available:http://www.ietf.org/rfc/rfc3344.txt.

[9] T. Narten, E. Nordmark, and W. Simpson, Neighbor Dis-covery for IP Version 6 (IPv6), RFC 4861, IETF (2007),[Online] Available: http://www.ietf.org/rfc/rfc4861.txt.

[10] A. Conta and S. Deering, Generic Packet Tunnelling inIPv6 Specification, RFC 2473, IETF (1998), [Online] Avail-able: http://www.ietf.org/rfc/rfc2473.txt.

6

cicis12_proceeding_frontCICIS'12 Proceeding.pdfMain Proceeding.pdf023.pdf024026029031032033036037041042048049050052054055056057063065067068069070071072073074075076078079080081082083085086088090093094103106109110114115117118119120121122123127140141142143144146147148156163164170171172195196200230231232236237238240242244245246252257259261262263264265266268269271272273274275276281282283284285287289291292293294295296298299302304305306307

cicis12_proceeding_backPROCEEDING.pdfCICIS'12 Proceeding.pdfcicis12_proceeding_frontCICIS'12 Proceeding.pdfMain Proceeding.pdf023.pdf024026029031032033036037041042048049050052054055056057063065067068069070071072073074075076078079080081082083085086088090093094103106109110114115117118119120121122123127140141142143144146147148156163164170171172195196200230231232236237238240242244245246252257259261262263264265266268269271272273274275276281282283284285287289291292293294295296298299302304305306307

cicis12_proceeding_back

Proceeding Armin Part.pdfcicis12_proceeding_frontCICIS'12 Proceeding.pdfMain Proceeding.pdf023.pdf024026029031032033036037041042048049050052054055056057063065067068069070071072073074075076078079080081082083085086088090093094103106109110114115117118119120121122123127140141142143144146147148156163164170171172195196200230231232236237238240242244245246252257259261262263264265266268269271272273274275276281282283284285287289291292293294295296298299302304305306307

cicis12_proceeding_back

Proceeding Armin Part.pdfcicis12_proceeding_frontCICIS'12 Proceeding.pdfMain Proceeding.pdf023.pdf024026029031032033036037041042048049050052054055056057063065067068069070071072073074075076078079080081082083085086088090093094103106109110114115117118119120121122123127140141142143144146147148156163164170171172195196200230231232236237238240242244245246252257259261262263264265266268269271272273274275276281282283284285287289291292293294295296298299302304305306307

cicis12_proceeding_back