• 제목/요약/키워드: Network Split

Search Result 183, Processing Time 0.025 seconds

Efficient Channel Split Strategy for System Stability in IP Based Macro/Femto Cellular Networks (IP 기반의 매크로/펨토 셀룰러 망에서 시스템의 안정성 향상을 위한 효과적인 채널 분배 기법)

  • Park, Kyung-Min;Kim, Young-Yong
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.2
    • /
    • pp.307-312
    • /
    • 2011
  • In the macro/femto cellular networks, the portion of channels assigned to each cell is a critical factor which sets the stability and the performance of the whole system. To grasp the concrete influence that the channel split portion have on the system, we present the queueing model for IP based macro/femto cellular networks, and find the stability conditions. Additionally we provide the strategy to decide the portion of channels allocated to each cell. Through the experiments, we prove that the proposed strategies operate feasibly in various network environments, and on the basis of these results we discuss the efficient system structure plan.

Split Password-Based Authenticated Key Exchange (분할된 패스워드 기반 인증된 키교환 프로토콜)

  • 류종호;염흥열
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.5
    • /
    • pp.23-36
    • /
    • 2004
  • This paper presents a password based authentication and key exchange protocol which can be used for both authenticating users and exchanging session keys for a subsequent secure communication over an untrusted network. Our idea is to increase a randomness of the password verification data, i.e., we split the password, and then amplify the split passwords in the high entropy-structured password verification data. And in order to prevent the verifier-compromised attack, we construct our system such that the password verification data is encrypted with the verifier's key and the private key of verifier used to encrypt it is stored in a secure place like a smart cards. Also we propose the distributed password authentication scheme utilizing many authentication servers in order to prevent the server-compromised attack occurred when only one server is used. Furthermore, the security analysis on the proposed protocol has been presented as a conclusion.

Performance Enhancement for Device-to-Device Under laying Cellular Network Using Coalition Formation Game

  • Radwan, Amr;Kim, Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.8
    • /
    • pp.1415-1423
    • /
    • 2016
  • Interference in device-to-device (D2D) communication underlaying cellular network needs to be elaborately investigated because of channel sharing. The objective is to improve the quality of D2D communications while maintaining high performance for cellular users. In this paper, we solve the above problem by jointly considering channel allocation and power control using coalition formation game. Our cooperative game theoric approach allows to enhance network-wide performance. We design a merge-and-split algorithm to deal with the complexity of the combinatorial structure in coalition formation problem. The analytical and numerical results show that our algorithm converges to a stable point which achieves high network performance.

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

  • Liao, Jianxin;Tian, Shengwen;Wang, Jingyu;Li, Tonghong;Qi, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.443-461
    • /
    • 2014
  • Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

Design Equations for the H-plane Power Divider with a Circular Post in a Rectangular Waveguide

  • Han Sang-Sin;Lee Sun-Young;Ko Han-Woong;Park Dong-Hee;Ahn Bierng-Chearl
    • Journal of electromagnetic engineering and science
    • /
    • v.4 no.4
    • /
    • pp.150-155
    • /
    • 2004
  • Universal design equations are presented for the H-plane T-junction power divider with a circular conducting post in a rectangular waveguide. For a given operating frequency and power split ratio, the post offset from the T-junction center line, the distance between the post and the waveguide wall, and the post diameter can be adjusted to obtain a minimum reflection at the input waveguide. Optimum values of the post offset are given in terms of the normalized frequency and the power split ratio. Corresponding values of the post diameter and the distance of the post from the waveguide wall are given in terms of the normalized frequency and the post offset.

Split Slant-End Stubs for the Design of Broadband Efficient Power Amplifiers

  • Park, Youngcheol;Kang, Taeggu
    • Journal of electromagnetic engineering and science
    • /
    • v.16 no.1
    • /
    • pp.52-56
    • /
    • 2016
  • This paper suggests a class-F power amplifier with split open-end stubs to provide a broadband high-efficiency operation. These stubs are designed to have wide bandwidth by splitting wide open-end stubs into narrower stubs connected in shunt in an output matching network for class-F operation. In contrast to conventional wideband class-F designs, which theoretically need a large number of matching lines, this method requires fewer transmission lines, resulting in a compact circuit implementation. In addition, the open-end stubs are designed with slant ends to achieve additional wide bandwidth. To verify the suggested design, a 10-W class-F power amplifier operating at 1.7 GHz was implemented using a commercial GaN transistor. The measurement results showed a peak drain efficiency of 82.1% and 750 MHz of bandwidth for an efficiency higher than 63%. Additionally, the maximum output power was 14.45 W at 1.7 GHz.

Fuzzy Adaptive Traffic Signal Control of Urban Traffic Network (퍼지 적응제어를 통한 도시교차로망의 교통신호제어)

  • 진현수;김성환
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.127-141
    • /
    • 1996
  • This paper presents a unique approach to urban traffic network signal control. This paper begins with an introduction to traffic control in general, and then goes on to describe the approach of fuzzy control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic network condition and adjacent intersection. The signal timing parameters evolve dynamically using only local information to improve traffic signal flow. The signal timing at an intersection is defined by three parameters : cycle time, phase split, off set. Fuzzy decision rules are used to adjust three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. In this paper the effectiveness of this method is showed through simulation of the traffic signal flow in a network of controlled intersection.

  • PDF

Enhanced Dynamic Management of Mobile Agent in Location Based Routing

  • Narahara, Yuichiro;Shiokawa, Shigeki
    • Journal of Multimedia Information System
    • /
    • v.3 no.4
    • /
    • pp.129-134
    • /
    • 2016
  • A routing protocol in mobile ad hoc networks is important, and a location based routing has attracted attention. We have proposed a method, in which plural mobile agents (MA) manage location information and construct a route and the number of MA dynamically changes depending on the network situation. However, the area where each MA manages is not always appropriate. This would increase the network load due to unnecessary split and mergence of MAs. To solve this problem, in this paper, we propose an enhanced method. In this method, the MA management area is properly determined based on distribution of nodes. From the performance evaluation, we show that the proposed method outperforms conventional methods in terms of packet delivery rate when network load is high.

Distributed Prevention Mechanism for Network Partitioning in Wireless Sensor Networks

  • Wang, Lili;Wu, Xiaobei
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.667-676
    • /
    • 2014
  • Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

Compact Dual-band CPW-fed Slot Antenna Using Split-Ring Resonator (분할 링 공진기를 이용한 소형 이중 대역 CPW-급전 슬롯 안테나)

  • Yeo, Junho;Park, Jin-Taek;Lee, Jong-Ig
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2526-2533
    • /
    • 2015
  • In this paper, a design method for a compact dual-band coplanar waveguide-fed slot antenna using SRR(split-ring resonator) conductor is studied. The SRR conductor is loaded inside a rectangular slot of the proposed antenna for dual-band operation. When the SRR conductor is inserted into the slot, the original rectangular slot is divided into a rectangular loop region and a rectangular slot region, and frequency bands are created by the loop and slot, separately. A prototype of the proposed dual-band slot antenna operating at 2.45 GHz WLAN band and 3.40-5.35 GHz band is fabricated on an FR4 substrate with a dimension of 30 mm by 30 mm. Experiment results show that the antenna has a desired impedance characteristic with a frequency band of 2.38-2.51 GHz and 3.32-5.38 GHz for a voltage standing wave < 2, and measured gain is 1.7 dBi at 2.45 GHz, and it ranges 2.4-3.2 dBi in the second band.