• Title/Summary/Keyword: Ad-hot network

Search Result 12, Processing Time 0.025 seconds

A study of performance improvement scheme in MIPv6 based on Ad-hoc (Ad-hoc 기반 MIPv6망에서 성능향상 기법 연구)

  • Jo Young-Jun;Ye Hwi-Jin;Moon Tae-Wook;Cho Sung-Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.402-405
    • /
    • 2006
  • Mobile IP has been designed to have mobile host users move from place to plate without changing their IP address. Ad-hoc network is a provisional network whose mobile host users construct networks by themselves without any assistance of infra structure network, using wireless interface. In this paper we discuss the scheme with which Ad-hoc network users ran access the Internet freely, using mobile IP protocol, and Ad-hot networks are access networks in the spotlight. In this paper we propose algorithm that support enhanced mobility between two Ad-hoc networks applying mobile IP at Ad-hoc routing protocol.

  • PDF

MANET Certificate Model Using Distributed Partial-Certificate with Cooperation of Cluster Member Node (MANET 환경 하에서 멤버 노드간의 협력에 의해 분산된 인증서를 이용한 인증서비스에 관한 연구)

  • Lee, Dae-Young;Song, Sang-Hoon;Bae, Sang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.206-215
    • /
    • 2007
  • Ad-Hoc network technology is a mobile internet technology of the future that will be used widely not only in Mobile Network but also in Wireless Personal Area Network (WPAN) and Ubiquitous Network For this to occur, distributed routing protocol design, loop prevention for link information reduction in overhead for control messages and route restoration algorithm must be improved or complemented. Security techniques that can guarantee safe com-munication between Ad-Hot nodes net also be provided. This study proposes and evaluates a new authentication mechanism for MANET. The mechanism segregates the roles of certification authority to keep with the dynamic mobility of nodes and handle rapid and random topological changes with minimal over-head. That is, this model is characterized by its high expandability that allows the network to perform authentication service without the influence of joining and leaving nodes. The efficiency and security of this concept was evaluated through simulation.

Analysis the Energy Consumption of a Wireless Network Interface in broadcast and point-to-point Environment (브로드캐스트와 Point-to-Point환경에서 무선 네트워크 인터페이스의 에너지 소비 측정 분석)

  • Choi Ji-Hoon;Kim Kwang-Deok;Kim Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.111-114
    • /
    • 2006
  • This paper describes measurement of energy consumption when various size of data packets, on the both broadcast and point-to-point of Wireless network interface, are transmitted, received and discarded in the environment of Ad-hoc network. This experiment measures energy consumption using IEEE 802.11 wireless network interface with each condition. Since the measurements induces linear equation, it can provide useful information for protocol designer and developer. And this paper analyzes the information of behavior of energy consumption for the energy-aware design and the evaluation of network protocol on the practical wireless environment.

  • PDF

Analysis of VANET Authentication Protocol using Casper in the Formal Verification (정형검증 도구인 Casper를 이용한 VANET 인증 프로토콜 분석)

  • Lee, Su-Youn;Ahn, Hyo-Beom
    • Convergence Security Journal
    • /
    • v.12 no.1
    • /
    • pp.27-33
    • /
    • 2012
  • VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many fields. It provide traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. Also, in VANET, vehiculars sho uld be able to authenticate each other to securely communicate with network-based infrastructure, and their location s and identifiers should not be exposed from the communication messages. This paper explains V2I authentication pr otocol using a hash function that preserves the user privacy. In addition, we analyze the security stability of the V2I authentication protocol using Casper in the formal verification technique. As a result, V2I authentication protocol us ing hash function prove a stability.

V2I Authentication Protocol using Error Correcting Code in VANET Environment (VANET 환경에서 오류수정부호를 사용한 V2I 인증 프로토콜)

  • Lee, Su-Youn
    • Convergence Security Journal
    • /
    • v.11 no.6
    • /
    • pp.37-44
    • /
    • 2011
  • VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many field. It provide traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. Also, in VANET, vehicles shoul d be able to authenticate each other to securely communicate with network-based infrastructure, and their locations and identifiers should not be exposed from the communication messages. This paper proposes V2I(Vehicular to Infra structure) authentication protocol that anonymity and untraceability of vehicular using Error Correcting Code that ge nerate encoding certification using generation matrix. The proposed scheme based on ECC resolves overhead problems of vehicular secure key management of KDC.

MADF: Mobile-Assisted Data Forwarding for Wireless Data Networks

  • Xiaoxin;Gary, Shueng-Han;Biswanath;Bharat
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.216-225
    • /
    • 2004
  • In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

An Efficient Group Key Management Scheme using Counting Bloom Filter in VANET (VANET에서 카운팅 블룸 필터를 사용한 효율적인 그룹 키 관리 기법)

  • Lee, SuYoun;Ahn, HyoBeom
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.47-52
    • /
    • 2013
  • VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks which is consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many fields. It provides traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. In VANET, it has been studies that group signature method for user privacy. However, among a group of group key generation phase and group key update phase, RSU(Road-Side Unit) and the computational overhead of the vehicle occur. In this paper, we propose an efficient group key management techniques with CBF(Counting Bloom Filter). Our group key management method is reduced to the computational overhead of RSU and vehicles at the group key generation and renewal stage. In addition, our method is a technique to update group key itself.

Minimizing non-optimal paths in multi-hop ad hoc network adopted IEEE 802.11 PSM (IEEE 802.11 PSM을 적용한 다중 홉애드 혹 네트워크에서 우회경로의 최소화)

  • Whang, Do-Hyeon;Lee, Jang-Su;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.583-588
    • /
    • 2007
  • It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

Area Aware-DSDV Routing Protocol on Ad hoc Networking (Ad Hoc 망에서 AA-DSDV 라우팅 프로토콜)

  • Cho, Se-Hyun;Park, Hea-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.590-593
    • /
    • 2011
  • Time goes on, Ad Hoc network is hot issues. So far, there are a lot of protocols have been proposed for Ad Hoc routing protocol to support the mobility. This paper presents an enhanced DSDV(Destination-Sequenced Distance Vector) routing protocol which nominates one node to take care of a specific area. Simply Area-Aware(AA) DSDV routing protocol has one nominee to take care of some area. It has two jobs. One is to take care of its neighbour and another is to transfer the routing table to its other node as it works. It is called as Area Nominee(AN). The new scheme extends the routing table to include the nominee in the area. The general node is the same as the previous DSDV routing protocol. In the other hands, the node which is nominated has two routing protocols. One is for Regional Routing(RR) table which is the same routing table in DSDV. Another is Global Routing(GR) table which is about the area round its area which it cares nearby. GR table is the table for the designated node like the nominee. Each area has one nominee to transfer between ANs. It has only nominee's information about every area. This concept decreases the topology size and makes the information of topology more accurate.

A Performance Analysis of Region-based Overlay Multicast Routing Protocol for Ad Hoc Networks (Ad Hoc 네트워크를 위한 지역기반 오버레이 멀티캐스트 라우팅 프로토콜의 성능 분석)

  • Kim Kap-Dong;Park Jun-Hee;Lee Kwang-Il;Kim Hag-Young;Kim Sang-Ha
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1037-1040
    • /
    • 2006
  • This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

  • PDF