• Title/Summary/Keyword: 이동 ad-hoc 망

Search Result 261, Processing Time 0.027 seconds

A Routing Protocol for Network Lifetime Extension in MANET (MANET에서 네트워크 수명 연장을 위한 라우팅 프로토콜)

  • Kim, Kyoung-Ja;Han, Sang-Hoon;Koo, Hyun-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.120-129
    • /
    • 2010
  • MANET(Mobile Ad Hoc NETwork) is a collection of mobile nodes that are free to move and organize themselves in an arbitrary manner without any fixed infrastructures. These mobile nodes are connected by wireless links and act as routers for all other nodes in the network. As a router each node in MANET consumes its batteries when forwarding a message, and the selection of the best path to minimize the total power needed to route packets is needed to maximize the lifetime of all nodes. In this paper, we propose a routing protocol considering the remaining battery capacity of nodes in the routing paths. The proposed scheme prevents the battery of each node from being overused and increases the lifetime of the network.

Design and Evaluation of ARDG Scheme for Mobility Management in Ad Hoc Networks (에드 혹 네트워크에서 이동성 관리를 위한 적응적 랜덤 데이터베이스 그룹 방안의 설계 및 평가)

  • Bae Ihn-Han;Ha Sook-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.917-922
    • /
    • 2004
  • Mobile ad hoc networks (MANETs) are networks of mobile nodes that have no fixed network infrastructure. Since the mobile node's location changes frequently, it is an attractive area to maintain the node's location efficiently. In this paper, we present an adaptive randomized database group (ARDG) scheme to manage the mobile nodes mobility in MHANETs. The proposed scheme stores the network nodes' location in location databases to manage the nodes' mobility. When a mobile node changes its location or needs a node's location, the node randomly select some databases to update or que교 the location information. The number of the selected databases is fixed in the case of querying while the number of the databases is determined according to the node's popularity in the case of updating. We evaluated the performance of the proposed scheme using an analytical model, and compared the performance with that of the conventional randomized database group (RDG) scheme.

An Efficient P2P System Using Cross-Layer Design for MANETs (MANET 에서의 Cross-Layer 디자인을 사용한 효율적인 P2P 시스템)

  • Park, Ho-Hyun;Choi, Hyun-Duk;Woo, Mi-Ae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.728-733
    • /
    • 2009
  • An ubiquitous environment has features like peer-to-peer and nomadic environments. Such features can be represented by peer-to-peer systems and mobile ad-hoc networks. P2P systems and MANETs share similar features, appealing for implementing P2P systems in MANET environment. However, if a P2P system designed for wired networks was applied to mobile ad-hoc environment, its performance was not good enough. Subsequently, this paper proposes a P2P system to improve performance using cross-layer design and the goodness of a node as a peer by using routing metric and P2P metric to choose favorable peers to connect. It also utilizes proactive approach for distributing peer information. The simulation results showed that the proposed system produced better performance in query success rate, query response time and energy consumption by reducing the routing path length.

An Efficient Group Key Distribution Mechanism for the Secure Multicast Communication in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 안전한 멀티캐스트 통신을 위한 효율적인 그룹 키 분배 방식)

  • Lim Yu-Jin;Ahn Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.339-344
    • /
    • 2006
  • Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

TCP Protocol Performance Evaluation of GMAHN (GMAHN 환경에서의 TCP 프로토콜 성능 분석)

  • Oh, Se-Duk;Kim, Jae-Ho;Bae, Jin-Seung;Jung, Chan-Hyuk;Lee, Chi-Moon;Ha, Jae-Seung;You, Choong-Yeul;Lee, Kwang-Bae;Kim, Hyun-Wook
    • Journal of IKEEE
    • /
    • v.12 no.1
    • /
    • pp.8-17
    • /
    • 2008
  • Recently, GMAHN that provides interface between MANET and Wired Network has been focused in mobile communication. It is necessary that the technology provide reliable data transmission technology between mobile node and wired network in MANET environment that is varied by the node movement. In this paper, using the TCP protocol(Tahoe, Reno, Vegas, SACK)that increases reliability between source and destination, we applied the TCP protocol mechanism to various environment, and proposed the most efficient TCP mechanism by comparing each mechanism.

  • PDF

Improvement of The AODV Routing Protocol for an Efficient Local Repair (효율적인 지역복구를 위한 AODV 라우팅 프로토콜의 개선)

  • 안수길;천수자;안상현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.487-489
    • /
    • 2003
  • 애드 혹 망은 유선 기반망 없이 무선 노드만으로 구성된 망을 말한다. 이러한 특징으로 인하여 빠른 망 구축을 가능하게 하지만, 망의 동적인 구조와 노드들의 이동성을 고려할 때 효율적인 데이터 전송을 위한 경로 유지는 중요한 문제로 대두된다. 본 논문에서는 애드 혹 라우팅 프로토콜 중의 하나인 AODV(Ad­hoc On­demand Distance Vector) 라우팅 프로토콜에서의 지역복구 (local repair) 시 경로설정 패킷의 플러딩 범위를 제한하는 범위 제한적(seeped) 플러딩을 이용한 효율적인 지역복구 기법을 제안한다. 이 방법의 경우 기존의 AODV 지역복구에 비해서 경로설정 오버헤드를 줄이고 데이터 전송률을 높일 수 있다.

  • PDF

P2P System for Ad-hoc Network Using On-Demand Routing Protocol (On-Demand 라우팅 프로토콜을 사용하는 에드혹 네트워크에 적합한 P2P 시스템)

  • 김영복;장주욱
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.688-690
    • /
    • 2004
  • 지금까지의 P2P 알고리즘들은 링크가 비교적 안정적이고 움직임이 적은 유선망을 기반으로 만들어졌다. 하지만 무선의 경우 우선 전파의 손실률이 높아 링크의 안정성이 떨어지고 노드들의 이동성 때문에 링크의 연결 관계가 수시로 변하게 된다. 이러한 이유로 기존의 P2P알고리즘들을 무선에 직접적용하기 힘들다. 따라서 본 논문에서는 기존의 P2P방식이 우선 에드혹 네트워크에서 나타낼 수 있는 문제점을 지적하고 이를 해결하기 위한 P2P방식을 제안하였고 실험을 통하여 검증하였다.

  • PDF

SLAOM: Scalable Location-Aware Overlay Multicast for Ad hoc Networks (애드 혹 망에서 확장성이 있는 이동 기반 오버레이 멀티캐스트)

  • Yu, Fu-Cai;Choi, Young-Hwan;Park, Soo-Chang;Lee, Eui-Sin;Tian, Ye;Park, Ho-Sung;Kim, Sang-Ha
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.235-239
    • /
    • 2007
  • 이동 애드 혹 망에서 노드들의 이동성은 멀티캐스트를 어렵게 한다. 많은 멀티캐스트 프로토콜에서 데이터 전달 구조 구성과 유지를 하기 위해 주기적인 플러딩이 널리 사용된다. 이런 주기적인 플러딩 메시지는 네트워크의 제어 비용을 심각하게 증가시키고, 에너지와 대역폭 자원을 낭비하게 한다. 데이터 전달구조 유지 부담을 줄이기 위해, 많은 비상태 멀티캐스트 프로토콜이 제안되었고 이 프로토콜들은 데이터패킷을 목적지로 보내기 위해 각각의 패킷 안에 목적지 주소 리스트를 적재한다. 그러나 데이터 패킷의 길이가 한정되어 있기 때문에, 목적지 주소 리스트 적재 정책은 프로토콜의 확장성을 제한한다. 이 논문에서는 이동 애드 혹 망을 위한 확장성이 있는 이동 기반 오버레이 멀티캐스트(SLAOM)라는 프로토콜을 제안한다. 이 프로토콜은 데이터 전달 구조 구성과 유지를 위한 주기적인 플러딩이 필요하지 않으며, 각각의 데이터 패킷에 목적지 주소 리스트를 적재할 필요도 없다. 시뮬레이션 결과는 우리의 프로토콜이 데이터 전송률과 제어 비용 면에서 다른 프로토콜들보다 뛰어남을 보여준다.

  • PDF

A Mobility Management Scheme Using GQS based on the Fuzzy-logic in Wireless Mobile Ad-Hoc Networks (에드-혹 망에서 퍼지로직 기반 GQS를 이용한 이동성 관리방법)

  • Yoon, Il;Oh, Sun-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.431-435
    • /
    • 2005
  • Mobile Ad-Hoc network is the network(MANET) of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move and communicate freely each other. Recently, many researches for mobility management of mobile nodes are actively carried out by using the location information of mobile nodes. The location management is an important issue in MANET because location information of mobile node is frequently changed in MANET. In this paper, an adaptive mobility management scheme using fuzzy-logic based GQS by considering the mobile locality is proposed in order to manage location information of mobile nodes in MANET efficiently. The proposed scheme selects mobility databases adaptively from GQS by considering the locality of mobile node. The performance of the mobility management scheme proposed in this paper is evaluated by an analytic model and compared with that of existing UQS based mobility management scheme.

  • PDF

Design and Evaluation of Fuzzy-Logic based Quorum System considering the Gravity of Locality of Mobile in MANETs (애드-혹 망에서 모바일의 지역 중요도를 고려한 퍼지로직 기반 쿼럼의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.9-14
    • /
    • 2008
  • Mobile Ad-Hoc network is the network of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move freely and communicate with each other. The location management is an important issue because location information of a mobile node is frequently changed in MANET. In this paper, we propose new quorum system applying the gravity of locality of mobile nodes adaptively by using the fuzzy-logic for the mobility of mobile nodes in order to manage location information of mobile nodes in MANET efficiently. The performance of the proposed scheme is evaluated by an analytical model and compared with those of existing UQS and DQS schemes.

  • PDF