• Title/Summary/Keyword: networking scheme

Search Result 478, Processing Time 0.021 seconds

Secure and Efficient Protocol for Vehicular Communication with Privacy Preservation (프라이버시를 보호하며 안전하고 효율적인 차량간 통신 프로토콜)

  • Kim, In-Hwan;Choi, Hyoung-Kee;Kim, Jung-Yoon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.6
    • /
    • pp.420-430
    • /
    • 2010
  • Due to increasing demand for improving road safety and optimizing road traffic, Vehicular Ad-Hoc Networks (VANET) have been subject to extensive attentions from all aspects of commercial industry and academic community. Security and user privacy are fundamental issues for all possible promising applications in VANET. Most of the existing security proposals for secure VANET concentrate authentication with privacy preservation in vehicle-to-vehicle (V2V) and vehicle-to-roadside infrastructure (V2I) communications and require huge storage and network capacity for management of revocation list. Motivated by the fact, we propose a new scheme with security and privacy preservation which combines V2V and V2I communication. With our proposed scheme, the communication and computational delay for authentication and overhead for management of revocation list can be significantly reduced due to mutual authentication between a vehicle and a Roadside Unit (RSU) requires only two messages, and the RSU issues the anonymous certificate for the vehicle on behalf of the Trust Authority (TA). We demonstrate that the proposed protocol cannot only guarantee the requirements of security and privacy but can also provide efficiency of authentication and management of revocation list.

An Efficient Location Management Scheme for High-speed Mobile Nodes (고속으로 이동하는 노드들을 위한 효율적인 위치 갱신 기법)

  • 송의성;길준민;황종선
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.581-594
    • /
    • 2003
  • Recently, a location management is being more important in mobile communication systems due to an explosive increase of mobile users. Current systems have used a concept of location area. Based on this concept, a mobile user performs a location update whenever it moves into a new location area. However, this scheme can not avoid unnecessary location updates when a mobile user moves around with high movement rate as compared to call arrival rate. That results in tremendous location management cost. To overcome this drawback, our proposal divides service areas into two sets: One is a set of areas that mobile users move with high speed and another is a set of areas that they move with low speed. After establishing these two sets, this paper employs different location tracking schemes for each sets. Generally, most mobile users with high speed have a low CMR and a regular direction until they arrive at their destination. Using such the moving behavior, systems can predict a mobile user's next location area in advance. When the mobile user moves into the predicted location, our proposal does not perform a location update. Thus, it can reduce overall location management cost. The Markov model is used to analyze the performance of our proposal. Using the model, this paper compares our proposal with IS-41 and TLA. The analytic results show that as CMR grows lower, an overall cost of our proposal becomes less, particularly if a mobile user frequently moves into the specific location are predicted by mobile systems. Also, our proposal has a better performance than other two schemes when the communication cost between HLR and VLR is high.

A RBAC-based Access Control Framework in OSGi Service Platform (OSGi 서비스 플랫폼에서 RBAC 기반의 사용자 접근제어 프레임워크)

  • Cho, Eun-Ae;Moon, Chang-Joo;Baik, Doo-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.405-422
    • /
    • 2007
  • Recently, according to the network environment, there are many researches for home network. Nowadays, in home network, the method that access control policy is managed for each home device by using ACL is popular, and EAM (Extranet access management) is applied as a solution. In addition, the research about secure OS is ongoing based on open operating system and the research of user authentication mechanisms for home network using home server is also in progress. However, these researches have some problems as follows; First, the transmission scope of expected access technology in home network is wide, so unauthenticated outside terminal can access the home network. Second, user is inconvenient because user need to set the necessary information for each device. Third, user privacy and convenience are not considered. OSGi provides a service platform for heterogeneous technologies in home network environment. Here, user access control is one of the core parts which should have no problems such as above items, but there are no concrete researches yet. Thus in this paper, we propose an access control policy management framework and access control operation based on RBAC for user access control in home network environment in which OSGi service platform is operated. First, we list the consideration which is not clearly mentioned in OSGi standard, and then we solve these above problems through new framework. In addition, we propose the effective and economical operation method which reduces the policy change frequency for user access control by using RBAC concept though limited resource of home gateway. Besides, in this paper, these proposed policies are defined separately as user-role assignment policy and permission-role assignment policy, and user decide their own policies. In conclusion, we provide the scheme to enhance the user convenience and to solve the privacy problem.

A Secure Route Optimization Mechanism for Mobile VPN users in Foreign Networks (모바일 VPN 사용자를 위한 보안 강화 경로 최적화 방안)

  • Kim, Kyoung-Min;Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.348-359
    • /
    • 2007
  • The conventional mobile VPN services assumed the mobile communications occur between the MN in foreign networks and the CN in the home network. However, if a MN wants to communicate with another MN in a foreign network, it could degrade the performance of the mobile VPN service because of the triangular routing problem. In this paper, we propose a route optimization mechanism based on the mobile VPN using an x-HA allocated by diameter MIP in order to support the efficient communication between the mobile VPN users in foreign networks. The i-HA maintains the VPN-TIA as well as the x-HoA as the CoAs to solve the security problem and to provide an efficient route optimization simultaneously. Moreover, we proposed revised IPSec tunnel configuration to reduce the IPSec tunnel overheads at a MN when the MN communicates with several MNs in the foreign networks at the same time. The VPN server, a security management entity in the home network, notifies an additional IPSec tunnel establishment between the x-HAs where the communication peers are registered. The simulation result showed that the proposed scheme decreases the end-to-end packet delay time and improves the throughput after the handoff compared to the existing mechanism.

Prolonging Lifetime of the LEACH Based Wireless Sensor Network Using Energy Efficient Data Collection (에너지 효율적인 데이터 수집을 이용한 LEACH 기반 무전 센서 네트워크의 수명 연장)

  • Park, Ji-Won;Moh, Sang-Man;Chung, Il-Yong;Bae, Yong-Geun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.175-183
    • /
    • 2008
  • In wireless sensor networks with ad hoc networking capability, sensor nodes are battery operated and are usually disposable once deployed. As a result, each sensor node senses and communicates with limited energy and, thus, energy efficiency has been studied as a key design factor which determines lifetime of a wireless sensor network, and it is more improved recently by using so-called cross-layer optimization technique. In this paper, we propose and implement a new energy saving mechanism that reduces energy consumption during data collection by controlling transmission power at sensor nodes and then measure its performance in terms of lifetime improvement for the wireless sensor network platform ZigbeX. When every sensor node transmits sensed data to its clusterhead, it controls its transmission power down to as low level as communication is possible, resulting in energy saving. Each sensor node controls its transmission power based on RSSI(Received Signal Strength Indicator) of the packet received from its clusterhead. In other words, the sensor node can save energy by controlling its transmission power down to an appropriate level that its clusterhead safely receives the packet it transmits. According to the repetitive experiment of the proposed scheme on the ZigbeX platform using the packet analyzer developed by us, it is observed that the network lifetime is prolonged by up to 21.9% by saying energy during the data collection occupying most amount of network traffic.

Location Privacy Enhanced Routing for Sensor Networks in the Presence of Dormant Sources (휴면 소오스들이 존재하는 환경의 센서 네트워크를 위한 위치 보호 강화 라우팅)

  • Yang, Gi-Won;Lim, Hwa-Jung;Tscha, Yeong-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.12-23
    • /
    • 2009
  • Sensor networks deployed in battlefields to support military operations or deployed in natural habitats to monitor the rare wildlifes must take account of protection of the location of valuable assets(i.e., soldiers or wildlifes) from an adversary or malicious tracing as well as the security of messages in transit. In this paper we propose a routing protocol GSLP(GPSR-based Source-Location Privacy) that is capable of enhancing the location privacy of an active source node(i.e., message-originating node) in the presence of multiple dormant sources(i.e., nodes lying nearby an asset whose location needs to be secured). Extended is a simple, yet scalable, routing scheme GPSR(greedy perimeter stateless routing) to select randomly a next-hop node with a certain probability for randomizing paths and to perform perimeter routing for detouring dormant sources so that the privacy strength of the active source, defined as safety period, keeps enhanced. The simulation results obtained by increasing the number of dormant sources up to 1.0% of the total number of nodes show that GSLP yields increased and nearly invariant safety periods, while those of PR-SP(Phantom Routing, Single Path), a notable existing protocol for source-location privacy, rapidly drop off as the number of dormant sources increases. It turns out that delivery latencies of GSLP are roughly less than two-fold of the shortest path length between the active source and the destination.

Proximity-based Overlay Network Routing for Service Discovery in Mobile Ad-Hoc Network (이동 애드혹 망에서의 서비스 검색을 위한 근접성 기반 오버레이 네트워크 라우팅)

  • Yoon Hyeon-Ju;Lee Eunju;Jeong Hyunku;Kim Jin-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.643-658
    • /
    • 2004
  • Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.

An Effective Coverage Extension Scheme for Trisector Cellular Systems using Multi-hop Relay based on IEEE 802.16j (IEEE 802.16j 기반의 중계기를 도입한 3섹터 셀룰러 시스템에서 효율적인 기지국 커버리지 확장 기법)

  • Yoo, Chang-Jin;Kim, Seung-Yeon;Cho, Choong-Ho;Lee, Hyong-Woo;Ryu, Seung-Wan
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.294-300
    • /
    • 2010
  • In this paper, We analysis of effective coverage extension for Tri-sector cellular systems using Multi-hop Relay based on IEEE802.16j system. In the proposed international standard of IEEE 802.16j MMR (Mobile Multi-hop Relay) use of the omni-directional antenna, 3-sector and 6-sector antenna is considered to Base Station and Relay Station. Omni-directional antenna service can offer as all directions but a throughput decreases due to the signal interference of near Relay Stations. In the directional antenna, cause of an interference with the base station which it arranges an antenna so that a beam can have the direct and does with neighbor Base Station and Relay Station can be reduced interference, therefore the effective throughput is higher than the omni-directional antenna system. But, In case of Base Station and Relay Station use the directional antenna, the efficiency which the directional antenna has the Co-channel interference due to in the different cell by the channel reuse is decreased. In this study, we propose the structure of arranging the Base Station and Relay Station having the directional antenna in the NBTC, WBTC antenna in a multi-tier. It compared and analyzed with the mode that the multi-hop Relay Station has the omni-directional antenna, Relay Station are used the NBTC antenna and the WBTC antenna system also, We analyze a relation between the performance degradation and the cell coverage extension which it follows because the number of hop in the multi-hop Relay Station.

The DSRR Organizing Algorithm for Efficient Mobility Management in the SIP (SIP에서의 효율적인 이동성 관리를 위한 방향성 사전등록영역 구성 알고리즘)

  • 서혜숙;한상범;이근호;황종선
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.490-500
    • /
    • 2004
  • In mobile/wireless environment, mobility management is widely being focused as one popular researches. But, disruption happens when messages are exchanged between nodes as registration is made after handoff, and unnecessary traffic occurs because of the use of the Random-walk model, in which the probability for MN to move to neighboring cells is equal. In order to solve these problems, this study proposes a technique and algorithm for composing Directional Shadow Registration Region (DSRR) that provides seamless mobility. The core of DSRR is to prevent disruption and unnecessary traffic by minimizing the number o) neighboring cells with a high probability of handoff (AAAF). This study sensed the optimal time for handoff through regional cell division by introducing a division scheme, and then decided DSRR, the region for shadow registration, by applying direction vector (DV) obtained through directional cell sectoring. According to the result of the experiment, the proposed DSRR processes message exchange between nodes within the intra-domain, the frequency of disruptions decreased significantly compared to that in previous researches that process in inter-domain environment. In addition, traffic that occurs at every handoff happened twice in DSRR compared to n (the number of neighboring cells) times in Previous researches. As an additional effect, divided regions obtained from the process of composing DSRR filter MN that moves regardless of handoff.

Reducing Flooding Latency in Power Save Mode of IEEE 802.11-based Mobile Ad hoc Networks (IEEE 802.11 기반 이동 애드혹 망의 전력 절감 모드에서 플러딩 지연의 개선)

  • 윤현주;서명환;마중수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.532-543
    • /
    • 2004
  • Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.