• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.031 seconds

Advanced Information Security Management Evaluation System

  • Jo, Hea-Suk;Kim, Seung-Joo;Won, Dong-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.6
    • /
    • pp.1192-1213
    • /
    • 2011
  • Information security management systems (ISMSs) are used to manage information about their customers and themselves by governments or business organizations following advances in e-commerce, open networks, mobile networks, and Internet banking. This paper explains the existing ISMSs and presents a comparative analysis. The discussion deals with different types of ISMSs. We addressed issues within the existing ISMSs via analysis. Based on these analyses, then we proposes the development of an information security management evaluation system (ISMES). The method can be applied by a self-evaluation of the organization and an evaluation of the organization by the evaluation committee. The contribution of this study enables an organization to refer to and improve its information security levels. The case study can also provide a business organization with an easy method to build ISMS and the reduce cost of information security evaluation.

Efficient Resource Allocation with Multiple Practical Constraints in OFDM-based Cooperative Cognitive Radio Networks

  • Yang, Xuezhou;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2350-2364
    • /
    • 2014
  • This paper addresses the problem of resource allocation in amplify-and-forward (AF) relayed OFDM based cognitive radio networks (CRNs). The purpose of resource allocation is to maximize the overall throughput, while satisfying the constraints on the individual power and the interference induced to the primary users (PUs). Additionally, different from the conventional resource allocation problem, the rate-guarantee constraints of the subcarriers are considered. We formulate the problem as a mixed integer programming task and adopt the dual decomposition technique to obtain an asymptotically optimal power allocation, subcarrier pairing and relay selection. Moreover, we further design a suboptimal algorithm that sacrifices little on performance but could significantly reduce computational complexity. Numerical simulation results confirm the optimality of the proposed algorithms and demonstrate the impact of the different constraints.

Signal Processing Techniques Based on Adaptive Radial Basis Function Networks for Chemical Sensor Arrays

  • Byun, Hyung-Gi
    • Journal of Sensor Science and Technology
    • /
    • v.25 no.3
    • /
    • pp.161-172
    • /
    • 2016
  • The use of a chemical sensor array can help discriminate between chemicals when comparing one sample with another. The ability to classify pattern characteristics from relatively small pieces of information has led to growing interest in methods of sensor recognition. A variety of pattern recognition algorithms, including the adaptive radial basis function network (RBFN), may be applicable to gas and/ or odor classification. In this paper, we provide a broad review of approaches for various types of gas and/or odor identification techniques based on RBFN and drift compensation techniques caused by sensor poisoning and aging.

Improved Paired Cluster-Based Routing Protocol in Vehicular Ad-Hoc Networks

  • Kim, Wu Woan
    • International journal of advanced smart convergence
    • /
    • v.7 no.2
    • /
    • pp.22-32
    • /
    • 2018
  • In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

The CP-Cryptosystem for Multiuser in computer Network (컴퓨터 테트워크에서 다수 이용자를 위한 CP-암호 시스템)

  • 이상렬;박용진
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.5
    • /
    • pp.8-15
    • /
    • 1983
  • The use of conventional encryption algorithm or public-key encryption algorithm in existing computer networks can protect information on communication links which are subject to wiretapping. This paper presents the CP-cryptosystem of high system security by using both of these two algorithms in multiuser computer networks. It is proved by the protocols pro-posed in this paper that all of users in the CP-cryptosystem can not only communicate with others secretly but also affix their digital signature.

  • PDF

USN Security Considerations in Home Network (홈 네트워크에서의 USN 보안 고려 사항 분석)

  • Park, Woo-Chool;Park, Hyun-Mun;Lee, Myung-Soo;Yoon, Nyung-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.171-173
    • /
    • 2006
  • Because sensor networks use wireless communication, they are vulnerable to attacks which are more difficult launch in the wired domain. Many wired networks benefit from their inherent physical security properties. It is unlikely that an adversary will dig up the Internet backbone and splice into the line. However, wireless communications are difficult to protect; they are by nature a broadcast medium. In a broadcast medium, adversaries can easily eavesdrop on, intercept, inject, and alter transmitted data. In addition, adversaries are not restricted to using sensor network hardware. We have analyzed the IEEE 802.15.4, ZigBee specification which includes a number of security provisions and options. In this paper, we highlight places where USN security considerations and home network attack scenarios.

  • PDF

Design of ESN(Educational Sensor Network) for interpretation of the data

  • Park, In-Deok;Paek, Seung-Eun;Kim, Si-Kyung
    • The Journal of Information Technology
    • /
    • v.12 no.3
    • /
    • pp.1-6
    • /
    • 2009
  • This paper has focused on the development of an educational sensor network (ESN) based on wireless sensor networks(WSN) and pervasive monitoring systems for students' activity during scientific experiments. A number of WSN systems have been proposed with integrated wireless transmission, mounted sensor boards and local processing. However, there is no trail to employ WSN on the educational field. In this paper, to facilitate research and development using wireless sensor network and multi-sensor data fusion, the educational sensor network (ESN) hardware development platform is presented. The ESN project is conducted over one semester time period (Spring Semesters). It involves approximately twenty middle school students who enrolled a gifted program in Kongju National University. Though under prepared, these students are in general highly motivated to learning specially when presented with the ESN project. An ESN project such as this is expected to provide an excellent means for teaching and learning scientific and mathematical principles.

  • PDF

Location-aware Clustering for Efficient Data Gathering in Wireless Sensor Networks (무선 센서 네트워크에서 효율적인 데이터 수집을 위한 위치 기반의 클러스터링)

  • Chang, Hyeong-Jun;Lee, In-Chul;Park, Gwi-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1893-1894
    • /
    • 2008
  • Advances in hardware and wireless network technologies have placed us at the doorstep of a new era where small wireless devices will provide access to information anytime, anywhere as well as actively participate in creating smart environments. In this paper, we propose location-aware clustering method in wireless sensor networks. Previous clustering algorithm assumes that all nodes know its own location by GPS. But, it is unrealistic because of GPS module cost and large energy consumption. So, we operate localization ahead of cluster set-up phase. And Considering node density and geographic information, Cluster Heads are elected uniformly. Moreover, communication between CHs is prolonged network lifetime.

  • PDF

Call Admission Control in Wireless Ad-hoc Networks with Multiple Channels and Radios

  • Ko, Sung-Won
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.4
    • /
    • pp.104-114
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol that works in wireless Ad-hoc communication networks with multiple radios and multiple channels and that controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, the MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which allows full duplex transmission between wireless Ad-hoc nodes, and reduces intra interference on the route. Also, a fixed channel only for reception at each node enables the estimation of the available bandwidth, which is used to control the call admission for QoS provision. The performance of the MCQosR was verified by simulation.

Contour Plots of Objective Functions for Feed-Forward Neural Networks

  • Oh, Sang-Hoon
    • International Journal of Contents
    • /
    • v.8 no.4
    • /
    • pp.30-35
    • /
    • 2012
  • Error surfaces provide us with very important information for training of feed-forward neural networks (FNNs). In this paper, we draw the contour plots of various error or objective functions for training of FNNs. Firstly, when applying FNNs to classifications, the weakness of mean-squared error is explained with the viewpoint of error contour plot. And the classification figure of merit, mean log-square error, cross-entropy error, and n-th order extension of cross-entropy error objective functions are considered for the contour plots. Also, the recently proposed target node method is explained with the viewpoint of contour plot. Based on the contour plots, we can explain characteristics of various error or objective functions when training of FNNs proceeds.