• Title/Summary/Keyword: Ad-hoc Method

Search Result 460, Processing Time 0.025 seconds

A Composition of all Node Map Using Neighborhood Information in ad hoc Networks (Ad Hoc 네트워크에서 이웃노드 정보를 이용한 전체 노드 맵 구현)

  • Chang, Woo-Suck
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.221-226
    • /
    • 2006
  • An Ad hoc network, differently from wired networks, is a self organized network of mobile nodes in wireless environments. In this kind of routing and operation environments. link breaks occur frequently. Knowing positions of nodes may prevent or recover this type of phenomenon. Typically, GPS is used to detect position of nodes but high cost and complexity of construction limit applications. In this paper, we propose and design a method of construction nodes' position map using only information of all nodes without GPS. The proposed method complements and overcomes previous system with software solutions. Hence, construction and operation are simple, and can decrease cost of construction expenses.

  • PDF

A re-route method for reliable data transport in Ad Hoc Networks (Ad Hoc 망에서 신뢰성 있는 데이터 전송을 위한 경로 재설정 기법)

  • 한정안;백종근;김병기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3A
    • /
    • pp.276-287
    • /
    • 2004
  • An ad hoc network is infra(Base Sstation or Access Point) free wireless mobile communication technology. Mobile nodes function as routers and servers in ad hoc networks. Many routing protocols for ad hoc network have been proposed. If any route is broken owing to moving node, source must repair broken route again. But route repair technology after route collapses is not suitable to transmit real-time data packet for QoS guarantee. So this paper presents route repair technology that prevents route from breaking. If intermediate node moves to critical section, the node issues handoff packet and sends the packet to the next node. After next node receives handoff packet, the node broadcasts route request packet to the previous node for intermediate node. Finally, even if intermediate node moves out of the routing region, the source can continuously transmit data packets to the destination through the new path.

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.

A Study on Method of QoS Guarantee for Ad hoc network (Ad hoc 망의 QoS 보장 방안에 대한 연구)

  • 이광제;정진욱
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.129-132
    • /
    • 2003
  • In this paper, we propose the DQM - CBRP( Distributed QoS Monitoring - Cluster Based Routing Protocol ) routing protocol to provide Quality of Service guarantee for multimedia service in Ad hoc mobile network. This paper proves the DQM-CBRP can avoid message loss and is suitable to guarantee of QoS thru simulation of COMNET III.

  • PDF

A Comparative Study on Single Time Schemes Based on the FEM for the Analysis of Structural Transient Problems (구조물의 시간에 따른 거동 해석을 위한 유한요소법에 기초한 단일 스텝 시간 범주들의 비교연구)

  • Kim, Woo-Ram;Choi, Youn-Dae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.5
    • /
    • pp.957-964
    • /
    • 2011
  • New time schemes based on the FEM were developed and their performances were tested with 2D wave equation. The least-squares and weighted residual methods are used to construct new time schemes based on traditional residual minimization method. To overcome some drawbacks that time schemes based on the least-squares and weighted residual methods have, ad-hoc method is considered to minimize residuals multiplied by others residuals as a new approach. And variational method is used to get necessary conditions of ad-hoc minimization. A-stability was chosen to check the stability of newly developed time schemes. Specific values of new time schemes are presented along with their numerical solutions which were compared with analytic solution.

Collision Avoidance Method Based-on Directional Antenna in Vehicular Ad Hoc Networks (Vehicular Ad Hoc Networks에서 방향성 안테나기반 충돌 회피 기법)

  • Kim, Kyung-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.627-633
    • /
    • 2008
  • In the case of traffic accidents, the broadcasting methods used in the mobile ad hoc network (MANET) cannot applied to transmit reliable message since moving high-speed in vehicular ad hoc networks (VANET) environments. In this paper, in order to guarantee transmitting reliable messages, we propose a collision avoidance method based-on directional antenna in VANET. In order to reduce interference from omni-broadcasting and to avoid hidden node problem from moving high-speed, we employed a forward-handed and backward directional antenna. The authors simulated the proposed method based on directional antenna and showed that the proposed method has been improved in respect to network utilization compared to existing VANET protocols.

  • PDF

802.11 Ad Hoc LANs with Realistic Channels : Study of Packet Fragmentation

  • Kim, Chesoong;Lee, Seokjun;Lyakhov, Andrey;Vishnevsky , Vladimir
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.3
    • /
    • pp.381-392
    • /
    • 2007
  • In this paper, we present an analytical method for estimating the saturation throughput of an 802.11 ad hoc LAN in the presence of noise distorting transmitted frames. This is the first method that allows studying analytically the 802.11 network performance with consideration of correlated channel failures usually inherent to realistic wireless channels. With the study, we consider the possible packet fragmentation that can be adopted to reduce the performance degradation caused by noise-induced distortions. In addition to the throughput, our method allows estimating the probability of a packet rejection occurring when the number of packet transmission retries attains its limit. The obtained numerical results of investigating 802.11 LANs by the developed method are validated by simulation and show high estimation accuracy as well as the method efficiency in determining the optimal fragmentation threshold.

A Cluster Maintenance Scheme to Reduce the Control Overhead in Mobile Ad hoc Networks (Ad hoc 네트워크에서 제어메시지 부하를 감소시키는 클러스터 유지 방법)

  • 왕기철;방상원;조기환
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.62-69
    • /
    • 2004
  • The cluster structure reduces the number of retransmission messages, when a broadcast to all hosts in ad hoc network is needed. A cluster maintenance scheme is employed to preserve this advantage from time to time. However, most of the cluster maintenance schemes require additional control messages for cluster reformation as well as control messages for acquiring neighbor information. This mitigates the advantages of employing cluster structure in ad hoc network. In this paper, a cluster maintenance scheme which forces only clusterheads to broadcast control messages during hello time is proposed. When the cluster reformation is needed, the proposed scheme employs a strategy to reduce the control messages to a minimum. In these processes, the proposed scheme doesn't violate the definition of 2-cluster and produces the clusters in fully distributed method. The simulation results prove that our scheme is better than LCC(1).

Region-based Tree Multicasting Protocol in Wireless Ad-Hoc Networks (무선 에드혹 네트워크에서 지역 기반 트리를 이용한 멀티캐스팅 프로토콜)

  • Lim Jung-Eun;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.772-783
    • /
    • 2005
  • In this paper, we propose an effective multicasting protocol in wireless ad-hoc networks. Conventional wired and wireless network multicast protocols do not perform well in wireless ad hoc networks because they were designed without consideration of ad hoc environments such as node mobility, limited bandwidth, high error probability. To solve this problem, some multicasting protocols for ad hoc network have been proposed in the literature. However, these protocols can not provide high packet delivery ratio, low control packet overhead and low expended bandwidth at the same time. Therefore, in this paper, we propose RTMA that improves multicasting performance in wireless ad hoc networks. RTMA calculates its current region from its position information by using GPS in order to make tree among the multicast group nodes in the same region. The proposed region-based tree method is for high packet delivery ratio, low control packet overhead when many senders send data packets. RTMA makes a reliable tree by using speed information to fill a gap of the weak points of the tree structure. When searching the routing path, RTMA selects the reliable path excluding high speed nodes.

Design and Implementation of an Automatic Switching Technology Between Ad-Hoc and Infrastructure Modes in Wireless LANs (무선 LAN에서 Ad-Hoc과 Infrastructure 모드의 자동전환 기술 설계 및 구현)

  • Shin Taek-Su;Jo Sung-Min;Min Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.892-899
    • /
    • 2006
  • In this paper, we propose an automatic switching technology between the ad-hoc and the infrastructure modes without user intervention in the IEEE 802.11b wireless LAN. Also, we design our proposed technology and implemented on the Linux machine. For this operation, the area within an Access Point (AP) coverage is defined as a switching area, and a node without any transmission in this area is assumed to be able to relay frames between the AP and nodes in the shaded area that is outside the coverage and cannot reach the AP. By using the proposed technology, it is possible to provide the seamless Internet access service to nodes at the ad-hoc mode in the shaded area. In this paper, we explains the operation of the detection method of the switching area, presents the flowchart and implementation environment. To prove the operation of our technology, we obtain the results of captured packets transmitted between nodes and throughput results through ftp transmission experiment. Hence, we can see that our proposed scheme can be improve the wireless access service in wireless and mobile networks.