• Title/Summary/Keyword: 애드 혹 무선 네트워크

Search Result 303, Processing Time 0.036 seconds

An Analysis on the Effect of Packet Dropping Attacks in Wireless Ad hoc Networks (애드 혹 네트워크상의 패킷 폐기 공격의 영향 분석)

  • Kim, Sang-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.61-63
    • /
    • 2005
  • 본 논문에서는 무선 애드 혹 네트워크상의 패킷 폐기 공격의 영향을 분석하고 시뮬레이션을 통해 그 효과를 측정하였다. 시뮬레이션 수행 결과 RREQ 패킷을 폐기한 경우에는 네트워크에 미치는 영향이 적은 반면, RREP 및 DATA 패킷을 폐기한 경우는 네트워크의 전송 효율이 떨어졌으며. 또한 패킷을 폐기하는 악성노드가 많을수록 데이터의 전달율이 감소하고 하나의 데이터를 전송 하는데 필요한 제어 패킷의 수가 늘어남을 알 수 있었다. 시뮬레이션을 통해 분석된 결과를 바탕으로 패킷 폐기 공격의 징후를 미리 검출하거나 공격 형태를 식별하는 기초 자료로 활용가능 할 것이다.

  • PDF

A Way to Evaluate Path Stability for Multipath Routing in Wireless Ad Hoc Networks (무선 애드혹 네트워크에서 다중경로 라우팅을 위한 경로 안정성 측정 방법)

  • Zhang, Fu-Quan;Park, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.4
    • /
    • pp.9-17
    • /
    • 2010
  • The mobility of nodes are different in wireless ad hoc networks. Routes have to be refreshed frequently due to the mobility of the nodes acting as routers. Path consists of a few highly mobile nodes should be avoided to forward packets, because even only one highly mobile node may result in the break of path. We develop a mobility aware method to evaluate path stability for multipath routing in wireless Ad Hoc networks. Specifically, we extend it to a well-studied multipath routing protocol known as ad hoc on-demand multipath distance vector (AOMDV). The resulting protocol is referred to as path stability evaluation (PSE). Performance comparison of AOMDV with PSE are studied through ns-2. Simulation shows that PSE has optimistic results in performance metrics such as packet delivery, end-to-end delay, routing overhead and throughput.

An Effective Resource Discovery in Mobile Ad-hoc Network for Ubiquitous Computing (유비쿼터스 컴퓨팅을 위한 이동 애드혹 네트워크의 효율적인 리소스 발견 기법)

  • Noh Dong-Geon;Shin Heon-Shik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.666-676
    • /
    • 2006
  • Rapid advances in ubiquitous computing and its pervasive influence over our society demand an efficient way to locate resources over the network. In mobile ad-hoc networks (MANETs) which is a special type of the sub-networks in ubiquitous environment, effective resource discovery is particularly important, due to their dynamics and the resource constraints on wireless nodes. In this paper, we propose an adaptive and efficient resource discovery strategy for MANETs. Our strategy also provides a solution to bridge different types of networks which coexist in ubiquitous environment.

Data Origin Authentication Scheme for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 데이터 송신 인증 기술)

  • Kang, Nam-Hi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.135-142
    • /
    • 2010
  • Wireless mesh network, which is an access network technology, adopts ubiquitous features of ad-hoc network that includes capabilities of self-configuration and self-management. This paper proposes a scheme which enables nodes along route in wireless mesh network to authenticate data and verify data integrity. The scheme distinguishes infra-node, which is a network device used to form mesh network, and user node in ad-hoc network, which operates functions as a sender, receiver or relayer, to deploy different authentication scheme. That is, hop-based authentication scheme along route forming wireless backbone differs from authentication scheme for user nodes in route over MANET. The proposed scheme is less complex than previously proposed schemes from the repects of security setup procedures and managements. In addition, the scheme is able to reduce transmission delay from a source to a destination owing to fast authentication over wireless backbone.

A Reliable Cluster based Dynamic Authentication Mechanism in MANET (이동 애드혹 네트워크에서 신뢰성 있는 클러스터 기반 동적 인증 기법)

  • Hwang, Yoon-Cheol;Kim, Jin-Il
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.661-672
    • /
    • 2008
  • Mobile Ad-hoc NETwork is a kind of self-controlled network composed only of mobile hosts. Since its range of use is gradually expanding into various sections applicable to practical lives, active researches are being conducted on it. However, as it depends on cooperation of nodes composing the entire network, due to weakness of wireless link and lack of its central infrastructure, so it is exposed to more serious risk than general network in security. Therefore, this paper proposes Cluster-Based Dynamic Authentication that enables only reliable nodes to participate in communication, by solving lack of centralized infrastructure, using hierarchical Mobile Ad hoc NETwork structure based on cluster, and by complementing security weakness through mutual authentication between hierarchical nodes. Simulation shows that the proposed scheme can complement security weakness of Mobile Ad hoc NETwork and that it is more adequate in reliability and expandability than the existing schemes.

  • PDF

A Scheme of IP address Auto-configuration for Mobile Ad-hoc NETwork (이동 애드혹 네트워크에서 자동주소 설정 기술)

  • Hwang, Jin-Ok;Youn, Joo-Sang;Park, So-Young;Min, Sung-Gi
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.489-491
    • /
    • 2009
  • Recently, a range of diverse networks are undergoing speedy evolution and inspiring variety applications. Among many networks, mobile Ad-Hoc networks (MANETs) are active working with a part of routing protocols. But, the majority of routing protocols have required a unique identifier, such as an IP address. At this while, IP address assignment scheme in MANET remains unsolved. When a centralized agent server is not exist, IP address is an critical issue such as a single MANET. This paper look over previous work about basic principles, also we suggest simple solution to overcome the power of two ($2^m$).

  • PDF

Weighted Voting Game and Stochastic Learning Based Certificate Revocation for the Mobile Ad-hoc Network (이동 애드 혹 네트워크 환경에서 가중투표게임과 확률러닝을 이용한 악의적인 노드의 인증서 폐지 기법)

  • Kim, Min Jung;Kim, Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.315-320
    • /
    • 2017
  • In this paper, I design a new scheme that is immune to malicious attack based on the weighted voting game. By using stochastic learning, the proposed scheme can revoke the certification of malicious node. Through the revocation process, the proposed scheme can effectively adapt the dynamic Mobile Ad hoc network situation. Simulation results clearly indicate that the developed scheme has better performance than other existing schemes under widely diverse network environments.

Adaptively Flexible Service Discovery and Advertisement for SSDP of UPnP in Wireless Ad-hoc Network (무선 애드 혹 환경에서의 UPnP의 SSDP 기능 향상을 위한 서비스 발견 및 광고 기법)

  • Jung, So-Ra;Youn, Hee-Yong
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.237-248
    • /
    • 2010
  • UPnP(Universal Plug and Play) is a middleware of DLNA (Digital Living Network Alliance) services a home network. UPnP supports the connections between each other devices in networks and also provides service discovery and advertisement with SSDP(Simple Service Discovery Protocol), which is generally designed for wired networks. SSDP operates on multicasting discovery request and advertisement and unicasting a reply in networks. It is a challenge issue for service discovery protocol such as SSDP to provide a stable and effective service in wireless ad-hoc networks. Wired based service discovery protocol does not consider the dynamics of wireless ad-hoc network. In that case, the nodes are freely in or out. Therefore, this paper proposes a flexible SSDP(fSSDP) which is a peer-to-peer(P2P) discovery protocol adopted for wireless ad-hoc Networks. It is implemented on the extension of SSDP. fSSDP supports a functionality that the broadcast area of service discovery dynamically changes with the periodically updated area of advertisement. It is good for reducing messaging overhead caused from the broadcast flooding of service discovery in wireless ad-hoc network.

Virtual Location Information based Routing Scheme in Wireless Ad-Hoc Networks (무선 애드 혹 네트워크에서 가상위치정보 기반 라우팅 기법)

  • Youn, JooSang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.77-85
    • /
    • 2013
  • Recently, location information based routing protocol has been studied to estimate end-to-end path in wireless ad-hoc network. This protocol assumes all nodes can get heir location information via GPS devices and floods only limited area with routing message through acquired location information. Therefore, this protocol has advantage that can reduce the number of routing message than the existing IP-based routing protocols. In addition, all nodes enabling this protocol must acquire their own location information to participate in the location-based routing. However, recent because of the miniaturization of sensor node, sensor node without GPS function has been launched. Therefore in case of the sensor node that does not know location information, it is impossible to participate in the ad hoc network configuration and location information based routing. In this paper, a virtual location information based routing scheme is proposed for wireless nodes without GPS function to be able to participate in location information based routing within ad hoc network environments consisting of wireless nodes with GPS function and wireless nodes without GPS function. Therefore, the proposed protocol has the advantage that a wireless node without a GPS function is able to participate in ad hoc network configuration and the location information based routing.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.