• Title/Summary/Keyword: ad hoc communication

Search Result 808, Processing Time 0.026 seconds

A study on the network coding enabled cooperative MAC protocol at Ad Hoc networks (네트워크 코딩 기능을 갖춘 협력통신용 MAC 프로토콜에 관한 연구)

  • Jang, Jae-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1819-1828
    • /
    • 2009
  • Until now, much research on cooperative communications to increase system throughput at Ad Hoc networks has been provided. In this paper, in order to enhance system throughput much more at Ad Hoc networks, a network coding-enabled new MAC protocol, called NC-MAC protocol, is proposed and its performance is evaluated with a mathematical approach. Numerical results show that this scheme provides conspicuously enhanced system throughput compared to DCF scheme, and more increased system throughput by 48% than rDCF and CO-MAC schemes.

Transmission of Multimedia Traffic over Mobile Ad-hoc Networks (모바일 ad-hoc 네트워크에서 멀티미디어 트래픽 전송)

  • Kim, Young-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.95-101
    • /
    • 2005
  • In this paper, some performance characteristics of multimedia traffic for mobile ad-hoc networks is studied with simulations. Synthetic streaming video is considered as the multimedia traffic for MPEG-coded video in the simulation. The synthetic video stream is generated with a video stream generation algorithm. The algorithm generate VBR traffics for MPEG video streams with special predefined GOP(group of pictures) patterns that is consisted of a sequence of I(intra-coded), P(predicted-coded) and B(bidirectional-coded) frames. The synthetic VBR streams is transmitted through UDP protocol with on-demand mobile ad-hoc network routing protocols like as AODV and DSR. And performances for video streams through mobile ad-hoc networks is evaluated, the throughputs is compared between data and video traffics.

A Study on Authentication ID using Identifier in Ad-hoc Network (Ad-hoc 네트워크에서 식별자를 이용한 인증 아이디에 관한 연구)

  • Moon, Jong-Sik;Byeon, Sang-Gu;Lee, Im-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1202-1211
    • /
    • 2010
  • The connection between devices in Ad-hoc network a network based on trust. Because a temporary device frequently join or leave, the authentication and security technology should be prepared for malicious device of a third-party attacks. The authentication scheme with the existing certification and ID, and the security technology using symmetric key and the public key is used. Therefore, in this paper we proposed two devices not having shared information use to generate each other's authentication ID. The use of authentication ID can establish the mutual trust and, provide security and efficiency for communication uses to generate a symmetric key.

Efficient Fault Tolerant Key Agreement for Ad-Hoc (Ad-Hoc 네트워크에서 링크 장애를 고려한 효율적인 키 협정 방법)

  • Lee, Young-Jun;Min, Sung-Gi;Lee, Sung-Jun
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.1
    • /
    • pp.45-53
    • /
    • 2004
  • Ad-Hoc network is wireless network architecture without infrastructure. We encounter new types of security problems in Ad-Hoc networks because such networks have little or no support from infrastructure. Thus, wireless communications need security mechanisms in order to guarantee the integrity and the privacy of the communication, as well as the authentication of the entities involved. Many practical systems have been proposed. The most familiar system is the Diffie-Hellman key distribution system. This algorithm allows the establishment of a cryptographic secret key between two entities. If more than two users want to compute a common key, then a group key agreement system is used. This paper discusses several group key agreement systems and presents two efficient fault tolerant methods to perform successful group key agreement.

  • PDF

TCP Performance Analysis over Mobile ad-hoc Networks (모바일 ad-hoc 네트워크에서 TCP 성능 분석)

  • Nam, Ho-Seok;Cho, Sol;Lee, Tae-Hoon;Kim, Jun-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.800-808
    • /
    • 2007
  • With the development of wireless data communication technology, all IP-based network will become compositions of wired and wireless networks. TCP is a connection-oriented, reliable transport protocol and has been used as de facto standard in most wired networks. Because TCP's congestion control algorithm could not distinguish congestion from BER, link failure and frequent route changes, TCP shows a poor performance over mobile ad-hoc networks. In this paper, the theoretical feature of TCP was studied and the performance of TCP over mobile ad-hoc networks was analyzed with ns2.

An Efficient Detection and Management Technique of Misbehavior nodes in Ad-hoc Networks (Ad-hoc 네트워크에서의 효율적인 비정상행위 노드 탐지 및 관리 기법)

  • Lee, Yun-Ho;Lee, Soo-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.5
    • /
    • pp.71-80
    • /
    • 2009
  • Ad-hoc network consists f mobile nodes, which they are together in the communication. However, if some misbehaving nodes are in network, it is faced to many threats. Therefore, detection and management of misbehaving node are necessary to make confident in Ad-hoc networks. To solve this problem, we use Node Weight Management Server(NWMS), which it manage each node's weight in local area. When NWMS detect misbehaving node, it adds the node's weight and if the node's weight exceeds threshold then NWMS broadcasts the node's information to isolate in network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

Mobility-Aware Ad Hoc Routing Protocols for Networking Mobile Robot Teams

  • Das, Saumitra M.;Hu, Y. Charlie;Lee, C.S. George;Lu, Yung-Hsiang
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.296-311
    • /
    • 2007
  • Mobile multi-robot teams are useful in many critical applications such as search and rescue. Explicit communication among robots in such mobile multi-robot teams is useful for the coordination of such teams as well as exchanging data. Since many applications for mobile robots involve scenarios in which communication infrastructure may be damaged or unavailable, mobile robot teams frequently need to communicate with each other via ad hoc networking. In such scenarios, low-overhead and energy-efficient routing protocols for delivering messages among robots are a key requirement. Two important primitives for communication are essential for enabling a wide variety of mobile robot applications. First, unicast communication (between two robots) needs to be provided to enable coordination and data exchange. Second, in many applications, group communication is required for flexible control, organization, and management of the mobile robots. Multicast provides a bandwidth-efficient communication method between a source and a group of robots. In this paper, we first propose and evaluate two unicast routing protocols tailored for use in ad hoc networks formed by mobile multi-robot teams: Mobile robot distance vector (MRDV) and mobile robot source routing (MRSR). Both protocols exploit the unique mobility characteristics of mobile robot networks to perform efficient routing. Our simulation study show that both MRDV and MRSR incur lower overhead while operating in mobile robot networks when compared to traditional mobile ad hoc network routing protocols such as DSR and AODV. We then propose and evaluate an efficient multicast protocol mobile robot mesh multicast (MRMM) for deployment in mobile robot networks. MRMM exploits the fact that mobile robots know what velocity they are instructed to move at and for what distance in building a long lifetime sparse mesh for group communication that is more efficient. Our results show that MRMM provides an efficient group communication mechanism that can potentially be used in many mobile robot application scenarios.

Measuring a Range of Information Dissemination in a Traffic Information System Based on a Vehicular ad hoc Network (Vehicular ad hoc network 기반 교통 정보 시스템에서 차량간 통신에 의한 정보 전달 범위 측정)

  • Kim, Hyoung-Soo;Shin, Min-Ho;Nam, Beom-Seok;Lovell, David J.
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.12-20
    • /
    • 2008
  • Recent wireless communication technologies are envisioned as an innovative alternative to solve transportation problems. On ad hoc networks, as a wireless communication technology, nodes can communicate data without any infrastructure. In particular, vehicular ad hoc networks (VANETs), a specific ad hoc network applied to vehicles, enable vehicles equipped with a communication device to form decentralized traffic information systems in which vehicles share traffic information they experienced. This study investigated traffic information dissemination in a VANET-based traffic information system. For this study, an integrated transportation and communications simulation framework was developed, and experiments were conducted with real highway networks and traffic demands. The results showed that it took 3 minutes in the low traffic density situations (10 vehicle/lane.km) and 43 seconds in the high traffic density condition (40 vehicle/lane.km) to deliver traffic information of 5km away with 10% market penetration rate. In uncongested traffic conditions, information seems to be disseminated via equipped vehicles in the opposite direction. In congested traffic conditions, the sufficient availability of equipped vehicles traveling in the same direction reduces the chance to use vehicles in the opposing direction even though it is still possible.

  • PDF

On Providing Anonymity in Ad Hoc Networks (Ad Hoc Network에서 익명성 제공에 관한 연구)

  • Kang, Seung-Seok
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.93-103
    • /
    • 2007
  • Networking environments are exposed to outside attacks and privacy threats. Due to broadcast nature of radio transmissions, wireless devices experience more vulnerable situations than those of wired network devices. This paper assumes that a wireless device has two network interfaces, one for accessing internet using 3G services, and the other for constructing an ad hoc network. To deal with privacy threats, this paper introduces an approach in which wireless devices form a special ad hoc network in order to exchange data using anonymous communications. One or more intermediate peers should be involved in the construction of an anonymous path. The proposed anonymous communication mechanism discourages traffic analysis and improves user privacy. According to simulation results, the anonymous connection in an ad hoc network prefers the intermediate peer(s) which is located near the source and/or the destination peer, rather than randomly-selected peers.

  • PDF

An Efficient Node Life-Time Management of Adaptive Time Interval Clustering Control in Ad-hoc Networks (애드혹 네트워크에서 적응적 시간관리 기법을 이용한 클러스터링 노드 에너지 수명의 효율적인 관리 방법)

  • Oh, Young-Jun;Lee, Knag-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.495-502
    • /
    • 2013
  • In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.