Earticle

현재 위치 Home

International Journal of Grid and Distributed Computing

간행물 정보
  • 자료유형
    학술지
  • 발행기관
    보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
  • pISSN
    2005-4262
  • 간기
    격월간
  • 수록기간
    2008 ~ 2016
  • 주제분류
    공학 > 컴퓨터학
  • 십진분류
    KDC 505 DDC 605
vol.4 no.1 (5건)
No
1

Experience-Consistent Fuzzy Rule-Based System Modeling

Partab Rai, Witold Pedrycz

보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing vol.4 no.1 2011.03 pp.1-30

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

The paper is concerned with an experience - consistent development of fuzzy rule - based systems. This design of such fuzzy models involves some locally available data and then reconciles the constructed model with some previously acquired domain knowledge. This type of domain knowledge is captured in the format of several rule-based models constructed on a basis of some auxiliary data sets. To emphasize the nature of modeling being guided by this reconciliation mechanism, we refer to the resulting fuzzy model as experience – consistent identification. By forming a certain extended form of the optimized performance index, it is shown that the domain knowledge captured by the individual rule-based models play a similar role as a regularization component typically encountered in identification problems. We will show that a level of achieved experience-driven consistency can be quantified through fuzzy sets (fuzzy numbers) of the parameters of the local models standing in the conclusion parts of the rules. Experimental results involve both synthetic low - dimensional data and selected data coming from data available on the Web.

2

Modeling and Simulation Of Dynamic Intermediate Nodes And Performance Analysis in MANETS Reactive Routing protocols

Jahangir khan, Irfan Hyder, Malek Fakar Duani

보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing vol.4 no.1 2011.03 pp.31-56

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Loads of research work and efforts have been done since last decade to provide support and solution to different problems and challenges related to mobile ad hoc networks. But still the fast growing technology needs attention in many areas such as routing, bandwidth, security, power consumption, collisions, simulations, and topology control due to moving nodes. In mobile ad hoc network we cannot use the existing techniques for better quality as we are using in fixed wireless network for better efficiency. In this paper we not only compare the performance of ad-hoc routing protocols in order to prove its correctness, efficiency, traffic load and end to end delay in dynamic intermediate nodes senario but also to implement OPNET simulator in AODV and DSR routing protocols. we proposed OPNET simulator to check performance with respect to different parameters that mobility model changes have a significant impact on their performance in different ways to support QOS. By proposing OPNET which results the combined performance of both AODV and DSR routing protocol could be best solution for routing in MANET, instead of separate performance of both AODV and DSR and also in intermediate nodes data transfer rate from source to destination.

3

An Improved Security and Trusting Model for Computational Grid

P.Sivakami Priya, G.Sumathi

보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing vol.4 no.1 2011.03 pp.57-66

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

Grid Computing in today’s world is a boon for high speed computing. Grids are composed from intersection of clusters, which provide huge volume of computing power. An environment with broadly distributed resources is liable to various types of security attacks. To solve this problem, we use P-LEASEL algorithm, which provides secure multicast communications in grid environment. Kerberos is used for authentication. Trust computing is incorporated to perform trust evaluation for the nodes to prevent the entry of malicious nodes in a group.

4

Searching the Best Collaborating Agent for Query Answering Systems

Agnieszka Dardzinska

보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing vol.4 no.1 2011.03 pp.67-80

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

In this paper we assume a group of collaborating agents where each agent is defined as an Information System. The system is coupled with a Query Answering System and a knowledge base which is initially empty. Information Systems can be incomplete. A user issues a query to the local database S in search for objects in information system that match a desired description. In case when some components of the description are missing in S, the query cannot be answered. The client then has to contact other agents to get some definitions of missing parts of the query. Our goal is to find optimal agent for client, where by optimal we mean an agent of maximal precision and recall. From all the agents we have, we choose the agent with the minimal value of distance, which corresponds to the closest agent to client. The definition of distance d discovered at the closest agent to the client and stored in KB of the client will guarantee that Query Answering System connected with the client has maximal precision and recall in group of agents having attribute d.

5

Routing Load Analysis of Broadcast based Reactive Routing Protocols AODV, DSR and DYMO for MANET

Parma Nand, S.C. Sharma

보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing vol.4 no.1 2011.03 pp.81-92

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

The Mobile Ad-hoc Network (MANET) is a collection of self-configuring mobile node without any infrastructure. The mobile nodes with wireless radio interface are connected by wireless links where each device in a MANET is free to move independently and randomly with the capability of changing its links to other devices frequently. It is a multihop process because of the limited transmission range of energy constrained mobile nodes and thus each device in network topology acts as a router. Many protocols are reported in this field but it is difficult to decide which one is best in all scenarios. In this paper on demand routing protocols AODV, DSR and DYMO based on IEEE 802.11CSMA/CA MAC protocol are examined and characteristic summary of these routing protocols is presented. Their performance is analyzed and compared on performance measuring metrics throughput, packet delivery ratio, end-to-end delay, dropped packets due to non availability of routes, duplicate RREQ generated for route discovery and normalized routing load by varying CBR data traffic load using QualNet 5.0.2 network simulator.

 
페이지 저장