|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
ICGST-CNIR, Volume 10, Issue (I), December 2010 |
| @ARTICLE | {P1140928803, |
| AUTHOR = | { D.Kavitha and K.E.Sreenivasa Murthy and B.Sathyanarayana and V.Raghunatha Reddy and S.Zahor ul Huq }, |
| TITLE = | { Securing Binding Updates in Routing Optimizaton of Mobile IPv6 }, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {1--6}, |
| ABSTRACT= |
{ Mobile IPv6 (mipv6) is an internet protocol that allows mobile nodes to have continuous network connectivity to the internet without changing their ip addresses while moving to other networks. The packets sent from correspondent node (CN) to a mobile node (MN) go first through the mobile node's home agent (HA). Then the HA tunnels them to the MN's foreign network. This process of delivering the packets to CN is called triangle routing. Triangle routing problem appears when the indirect path between CN and MN through the HA is longer than the direct path. To overcome triangle routing, route optimization(RO) method is added in mobile Pv6. In route optimization , when MN changes its location, it sends a binding update(BU) to CN informing its CoA. To secure these Binding Updates , we present a new protocol called “Certificate Based Inquisition Approach” for securing Binding Updates in RO. Performance analysis of this shows that it is computationally efficient than RR protocol and is not susceptible to any security attacks. To show the effectiveness of the proposed technique, it is compared with the state of art of other RO protocols. Simulation results presented in this paper are based on the ns2 mobility software on linux platform. The simulations results show that our proposed technique achieves better performance than the Return Routability(RR) , Certificate Based Binding Update protocol (CBU) , Hierarchical Certificate Based Binding Update protocol (HCBU)}, |
| NOTE= | { Mobile IPv6; Route optimization; Security; Binding Updates; Authentication } } |
| @ARTICLE | {P1141011025, |
| AUTHOR = | {KHALID ABDULMOHSIN BURAGGA}, |
| TITLE = | {Effectiveness of Accessibility and Usability of Saudi E-Government: an Objective Study}, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {7--19}, |
| ABSTRACT= |
{Almost all countries around the globe are striving to avail optimum use of information and communication technology. The increasing demand of electronic services has forced governments all around the world to provide online services to their citizens and residents. The government of Saudi Arabia has also realized the need of such services and it is working on an accelerating pace to provide excellent electronic services infrastructure to its citizens. Internet is an exciting technological tool that requires innovative design in order to be accessible to everyone. The government of Saudi Arabia has taken a large number of initiatives to facilitate its citizens and residents by providing services online. However, online services sometimes are either unavailable or less useful due to incomplete information or functionality. The current research has been undertaken to evaluate the effectiveness of accessibility and usability of e-government websites of Saudi Arabia. The study will aid government agencies to improve websites to providing good and updated services to their citizens. A subjective assessments method has been used to carryout the study. The results of the study have been compared with web accessibility tools. This study investigates the issues that are required to make a website accessible and examines accessibility guidelines. It also evaluates the Saudi government websites in context of W3C Web Content Accessibility Guidelines. The present study also presents some suggestions for improving e-government websites to be more effective and beneficial to general public}, |
| NOTE= | {Accessibility, E-government, Saudi Arabia, Saudi e-government, Saudi Websites, Usability} } |
| @ARTICLE | {P1141011024, |
| AUTHOR = | {Ghada Abdelmouez M and Fathy S. Helail and Abdellatif A. Elkouny}, |
| TITLE = | {Elliptic Curve Cryptographic Based DES Reinforcement}, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {21--30}, |
| ABSTRACT= |
{ Elliptic curve (EC) has proved to be a good choice for building asymmetric encryption system. Also EC has been used to enhance the asymmetric systems to minimize the private key such as RSA, Diffie-Hellman and ElGamal systems. Although most of the symmetric systems have been broken, we can use EC to create a new system that has the same properties of the symmetric encryption systems and at the same time, it has the strength of elliptic curves in encryption. This paper presents new symmetric algorithm using the Fiestel function and S-boxes like DES but each stage in this algorithm will be based on elliptic curve (EC) so we will call it “New DES based on EC”. The new algorithm has been accomplished through three stages that will be explained in the next sections. This study provides a comparison between the regular DES and the presented new DES. A comparison has been conducted for those encryption algorithms at different settings for each algorithm such as the key size, block size, speed, security, time and space complexity, and encryption/decryption execution time. As AES is the most widely used symmetric cipher today, so we will compare between the new DES based on EC and AES as a benchmarking for our algorithm. Also we will study some of cryptanalysis techniques like the strict avalanche criterion (SAC) that is a desirable property of any cryptographic algorithm. Also we will introduce the brute force attack for the suggested algorithm. Brute force attack is considered as a measure for the quality and the strength of the cryptographic algorithms. , |
| NOTE= | { AES, Brute force attack, DES, EC, S-boxes, SAC, symmetric encryption, time and space complexity } } |
| @ARTICLE | {P1121015047, |
| AUTHOR = | {Ahmad Ali Al-Zubi}, |
| TITLE = | {Identification of Information Systems Threats Sources: An Analytical Study}, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {31--37}, |
| ABSTRACT= |
{Threats to information systems and cyber-based critical infrastructures are evolving and growing. These threats can be unintentional and intentional, targeted or no targeted, and can come from a variety of sources, such as information warfare, criminals, hackers, virus writers, and disgruntled employees and contractors working within an organization. Moreover, these groups and individuals have a variety of attack techniques at their disposal, and cyber exploitation activity has grown more sophisticated, more targeted, and more serious. As government, private sector, and personal activities continue to move to networked operations, as digital systems add ever more capabilities, as wireless systems become more ubiquitous, and as the design, manufacture, and service of information technology have moved overseas, the threat will continue to grow. In the absence of robust security programs, agencies have experienced a wide range of incidents involving data loss or theft, computer intrusions, and privacy breaches, underscoring the need for improved security practices. These developments have led government officials to become increasingly concerned about the potential for a cyber attack. This article proposed a new approach for identifying the source of threats so some action could be taken against them and therefore information will be protected against loss or theft}, |
| NOTE= | {Information Security, Threat Source, Vulnerability, Attack, Protection, Control, Information System} } |
(Status: Accepted Full Paper)
| @ARTICLE | {P1141038308, |
| AUTHOR = | {A. Milenkoski}, |
| TITLE = | {Assessment of the Diversity of the TCP Congestion Control Evaluation Techniques, an Academic Survey of Articles (1989-2009), |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {39--47}, |
| ABSTRACT= |
{ The aim of this paper is to statistically analyze the simulation methods and the approach to Transmission Control Protocol (TCP) congestion control schemes evaluation during the year interval of 1989-2009. This work analyzes several evaluation metrics (throughput, intra and inter-protocol fairness, responsiveness, convergence and stability) of some of the most popular congestion control TCP variants published in that period. These metrics are analyzed in terms of total percentage of evaluation, diversity of used units and ways of measurement. Additionally, through specially crafted formulas, the effect of published papers discussing background and reverse traffic and phase effect is quantified. It is clearly visible through the obtained results that often these very important simulation parameters have been neglected. Moreover, the huge diversity in units and aspects of evaluation is quantified}, |
| NOTE= | { TCP simulation, evaluation metrics, evaluation survey, simulation methodology} } |
(Status: Accepted Full Paper)
| @ARTICLE | {P1141038307, |
| AUTHOR = | {Shrirang Ambaji Kulkarni and G. Raghavendra Rao}, |
| TITLE = | {Applying Optimized Mobility Model for Reinforcement Learning Based Routing Algorithm for Mobile Ad Hoc Network}, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {49--57}, |
| ABSTRACT= |
{Mobile ad hoc networks are characterized by nodes which are moving continuously. This characterization of node movement is usually done by mobility models which mimic the movement of nodes in real world. Routing algorithms play a vital role in the working of ad hoc networks. Ad hoc networks are constrained by congestion, limited bandwidth, energy and security. To achieve performance optimization under these dynamic scenarios, we consider a reinforcement learning routing algorithm and compare its performance with traditional routing algorithms like dynamic source routing and ad-hoc on demand distance vector. Most of the simulation based studies involve Random Waypoint Model which is far away from realism. Also most of the research in mobility characterization has been for individual nodes rather than group of nodes. Thus we propose a novel realistic group mobility model based on City Section and achieve the performance optimization of reinforcement learning based routing algorithm in the presence of increasing traffic and high speed mobility conditions}, |
| NOTE= | {Mobile ad hoc networks, mobility models, reinforcement learning, routing protocols, optimization} } |
(Status: Accepted Full
Paper)
| @ARTICLE | {P1141052911, |
| AUTHOR = | {R. Maheswar and R. Jayaparvathy}, |
| TITLE = | {Performance Analysis using Contention Based Queueing Model for Wireless Sensor Networks}, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {59--65}, |
| ABSTRACT= |
{A
critical issue in wireless sensor networks is the limited availability
of energy and hence optimizing energy is very important. In any sensor
node, most of |
| NOTE= | {Average energy consumption, cluster, mean delay, queue threshold, wireless sensor network}} |
| @ARTICLE | {P1141052912, |
| AUTHOR = | {S.Geetha and R.Jayaparvathy}, |
| TITLE = | {Generalized Stochastic Petri net Approach to model bandwidth allocation in IEEE 802.20 MAC}, |
| JOURNAL = | {ICGST International Journal on Computer Network and Internet Research, CNIR}, |
| YEAR = | {2010}, |
| MONTH= | {December}, |
| VOLUME = | {10}, |
| ISSUE = | {I}, |
| PAGES= | {67--76}, |
| ABSTRACT= |
{This paper presents a generalized stochastic petri net (GSPN) approach to model bandwidth allocation in IEEE 802.20 mobile broadband wireless access networks (MBWA) with multiple traffic classes. The GSPN model captures the quality of service (QoS) requirements of traffic classes. Also, a dynamic weight assignment mechanism is proposed to enable fair resource allocation among the competing traffic classes. Performance of the weight assignment mechanism is analytically evaluated using the GSPN model developed. Results show performance improvement in terms of mean delay and normalized throughput of traffic classes compared with existing mechanisms. Analytical results are validated using simulations}, |
| NOTE= | {IEEE 802.20, MBWA, bandwidth allocation, GSPN}} |
 |
 |
