• Title/Summary/Keyword: Secure Ad Hoc Network

Search Result 127, Processing Time 0.026 seconds

Dynamic Token Escrow Set Protocol for Secure Ad Hoc Networks (보안 애드 혹 네트워크를 위한 동적인 토큰 분배 프로토콜)

  • Lee, Jae Sik;Kim, Sung Chun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.457-458
    • /
    • 2009
  • 애드 혹 네트워크는 Wireless network의 특성 상 보안에 취약하고 또한 기존의 보안 솔루션을 적용하기 어렵다는 문제점을 가지고 있다. 이러한 애드 혹 네트워크에서의 보안 상 문제점을 해결하기 위한 Token Escrow방식을 살펴보고, 확장성 있는 Token 분배 방법을 통하여 발전된 기법을 제안한다.

Numerical Analysis of Authentication Algorithm using Randomized CA Groups in Mobile Ad Hoc Networks (모바일 애드혹 네트워크에서 랜덤 CA 그룹을 이용한 인증 알고리즘에 대한 성능 분석)

  • Lee, Yong;Lee, Goo-Yeon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.8
    • /
    • pp.22-33
    • /
    • 2009
  • Mobile Ad Hoc Networks (MANETs) are self-organized networks that do not rely in their operation on wired infrastructure. As in any networking technology, security is an essential element in MANET as well, for proliferation of this type of networks. But supporting secure communication in MANETs proved to be a significant challenge, mainly due to the fact that the set of nodes in the network can change frequently and rapidly and due to the lack of access to the wired infrastructure. In particular, the trust model and the authentication protocols, which were developed for wired and infrastructure-based networks, cannot be used in MANETs. In [1], we addressed the problem of efficient authentication of distributed mobile users in geographically large networks and proposed a new authentication scheme for this case of MANETs. The proposed scheme exploits randomized groups to efficiently share authentication information among nodes that together implement the function of a distributive Certification Authority(CA). In this paper, we analyze numerically the performance of authentication method using randomized groups and compare with the simulation result.

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.

Block-VN: A Distributed Blockchain Based Vehicular Network Architecture in Smart City

  • Sharma, Pradip Kumar;Moon, Seo Yeon;Park, Jong Hyuk
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.184-195
    • /
    • 2017
  • In recent decades, the ad hoc network for vehicles has been a core network technology to provide comfort and security to drivers in vehicle environments. However, emerging applications and services require major changes in underlying network models and computing that require new road network planning. Meanwhile, blockchain widely known as one of the disruptive technologies has emerged in recent years, is experiencing rapid development and has the potential to revolutionize intelligent transport systems. Blockchain can be used to build an intelligent, secure, distributed and autonomous transport system. It allows better utilization of the infrastructure and resources of intelligent transport systems, particularly effective for crowdsourcing technology. In this paper, we proposes a vehicle network architecture based on blockchain in the smart city (Block-VN). Block-VN is a reliable and secure architecture that operates in a distributed way to build the new distributed transport management system. We are considering a new network system of vehicles, Block-VN, above them. In addition, we examine how the network of vehicles evolves with paradigms focused on networking and vehicular information. Finally, we discuss service scenarios and design principles for Block-VN.

A Study on Secure and Efficient Wireless Network Management Scheme based Multi users for Ubiquitous Environment (유비쿼터스 환경을 위한 다중 사용자 기반의 안전하고 효율적인 무선 네트워크 관리 기법 제안)

  • Seo Dae-Hee;Lee Im-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.1-10
    • /
    • 2006
  • Ubiquitous computing, a new type of network environment has been generating much interest recently and has been actively studied. In ubiquitous computing, the sensor network which consists of low electric power ad-hoc network-based sensors and sensor nodes, is particularly the most important factor The sensor network serves as the mediator between ubiquitous computing and the actual environment. Related studies are focused on network . management through lightweight hardware using RFID. However, to apply these to actual environment, more practical scenarios as well as more secured studies equipped with secures and efficiency features are needed. Therefore, this study aims to build a wireless network based on PTD for multi users, which provides the largest utility in individual networks, and propose an appropriate management method. The proposed method is designed to enhance security and efficiency related to various services required in wireless networks, based on the reliable peripheral devices for users or pm. using pm, which has been applied to electronic commerce transactions in existing papers, this study also proposed an appropriate management method that is suitable for a dynamic environment and setting a temporary group to provide various services.

Energy Efficient IDS Node Distribution Algorithm using Minimum Spanning Tree in MANETs

  • Ha, Sung Chul;Kim, Hyun Woo
    • Smart Media Journal
    • /
    • v.5 no.4
    • /
    • pp.41-48
    • /
    • 2016
  • In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore, communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs are exposed to various threats because of a new node which can join the network at any time. There are various researches on security problems in MANETs and many researches have tried to make efficient schemes for reducing network power consumption. Power consumption is necessary to secure networks, however too much power consumption can be critical to network lifetime. This paper focuses on energy efficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannot use centralized infrastructure such as security systems of wired networks, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a network and enhance the network lifetime. Simulation results show that the proposed algorithm has better performance in comparison with the existing algorithms.

Delay-Tolerant Network Routing Algorithm for Periodical Mobile Nodes (주기적 이동 노드를 위한 Delay-Tolerant Network 라우팅 알고리즘)

  • Lee, Youngse;Lee, Gowoon;Joh, Hangki;Ryoo, Intae
    • Journal of Digital Contents Society
    • /
    • v.15 no.1
    • /
    • pp.1-9
    • /
    • 2014
  • Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

Trust-aware secure routing protocol for wireless sensor networks

  • Hu, Huangshui;Han, Youjia;Wang, Hongzhi;Yao, Meiqin;Wang, Chuhang
    • ETRI Journal
    • /
    • v.43 no.4
    • /
    • pp.674-683
    • /
    • 2021
  • A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

Authentication Scheme in Wireless Mobile Multi-hop Networks (무선 모바일 멀티 홉 네트워크에서의 인증 기법 고찰 및 개선)

  • Lee, Yong;Lee, Goo Yeon
    • Journal of Industrial Technology
    • /
    • v.27 no.B
    • /
    • pp.43-51
    • /
    • 2007
  • In mobile multi-hop wireless networks, the authentication between a base station and a mobile multi-hop node, between multi-hop nodes, and between user a station and a multi-hop node is needed for the reliable and secure network operation. In this paper, we survey various authentication schemes which can be considered to be adopted in mobile multi-hop wireless networks and propose a concept of novel mutual authentication scheme applicable to mobile multi-hop network architecture. The scheme should resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which are considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively.

  • PDF

The Design and Performance Analysis of Synchronization on Frequency Hopping Network Communication System (주파수도약 네트워크 통신 시스템의 구조설계 및 동기성능 분석)

  • Lim, So-Jin;Bae, Suk-Neung;Han, Sung-Woo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.6
    • /
    • pp.819-827
    • /
    • 2013
  • Compared to legacy frequency hopping communications, future radio communications are required the secure and high data rate, ad-hoc network communication. In this paper, we have designed the network communication structure on the frequency hopping mode, and analyzed the performance of synchronization on the frequency hopping network radio systems. The design results are shown the initial sync. phase of approximately 9 hops and the traffic packet phase of approximately 30 hops. Also, we have simulated the performance on the communication conditions which are carrier bandwidth of 50kHz, user data rate of 64kbps and OQPSK modulation scheme in AWGN. In the simulation, we analyzed the correlation and the performance of synchronization success. The result of simulation show 99% probability for synchronization success at $E_b/N_o$ -4dB.