• Title/Summary/Keyword: Ad-hop

Search Result 347, Processing Time 0.027 seconds

Energy Efficient Relay Selection in a Multi-hop Ad-hoc Environment (다중홉 Ad-hoc 환경에서 에너지 효율적인 릴레이 선택 방안)

  • Jung, Hae-Beom;Kim, Song-Hee;Kim, Duk-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.327-337
    • /
    • 2012
  • There have been lots of researches on the optimal relay selection in relay-based systems. However, most researches have been focused on the maximization of transmission capacity with a constraint of sum power at both transmitter and relays. In Ad-hoc networks where relays have batteries of limited power, it is imperative to minimize the energy consumption while maintaining the required quality-of-service (QoS). In this paper, we propose an optimal relay selection strategy to minimize the relay power consumption while satisfying the required signal-to-noise ratio (SNR). Through intensive simulations, we show the proposed method is more effective in terms of energy consumption and guarantee lower transmission failure probability in multi-hop Ad-hoc environments.

Energy conserving routing algorithm based on the direction for Mobile Ad-hoc network (모바일 에드 혹 네트워크에서 노드의 방향성을 고려한 에너지 효율적 라우팅 알고리즘 연구)

  • Oh, Young-Jun;Lee, Kong-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2699-2707
    • /
    • 2013
  • We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.

The Design and Implementation of a Security Management Server for Pre-Distributed Key Exchange Method and Lightweight Key Distribution Protocol for Mobile Ad-hoc Node (이동 Ad-hoc 노드용 사전 키 분배 기법 및 경량 키 분배 프로토콜을 위한 보안관리 서버 시스템 설계 및 구현)

  • Yang, Jong-Won;Seo, Chang-Ho;Lee, Tae-Hoon
    • Journal of Internet Computing and Services
    • /
    • v.8 no.6
    • /
    • pp.1-8
    • /
    • 2007
  • The Mobile Ad-hoc network does environmental information which an individual collects in nodes which are many as the kernel of the USN technology based on the radio communication. And it is the latest network description delivering critical data to the destination location desiring through a multi-hop. Recently, the Ad-hoc network relative technique development and service are activated. But the security function implementation including an authentication and encoding about the transmitted packets, and etc, is wirelessly the insufficient situation on the Ad-hoc network. This paper provides the security service of key exchange, key management. entity authentication, data enciphering, and etc on the Mobile Ad-hoc network. It implements with the Ad-hoc network security management server system design which processes the security protocol specialized in the Ad-hoc network and which it manages.

  • PDF

Analysis of Power-Saving Protocols for Multi-hop Ad Hoc Networks (다중 홉 Ad Hoc 망에서 Power-Saving 프로토콜의 성능분석)

  • 김동현;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.203-207
    • /
    • 2003
  • Mobile Ad Hoc Network is a kind of network technology, that mobile hosts can compose networks freely and temporarily where the base networks don't exist and where its establishment is difficult or as occasion demands. Ubiquitous computer network is prograssing in the forms of miniaturization, lightweight or portability. So far, MANET was studied in the point how to route it efficiently, but its power saving problems are been issuing nowadays. We try to not only compare and analyze power saving protocols in multi-hop Ad Hoc network but also present their efficiencies in this thesis.

  • PDF

A Study of Relay scheme for shadow area in WiBro network (와이브로 네트워크에서 음영지역에 대한 중계방식에 관한 연구)

  • Son, Sung-Chan;Oh, Chung-Gyun
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.394-397
    • /
    • 2008
  • Recently WiBro network is installed for high speed wireless internet service by telecommunication service provider, however WiBro service is not provided in the region of mountain or difficult region to install network infra. Fixed repeater is used to resolve those shadow area problem in current WiBro network. This paper study introducing Ad-hoc based multi-hop relay instead of using fixed repeater in order to resolve those shadow area problem. Cost down of fixed repeater and active network expansion is possible to resolve shadow area problem by introducing multi-hop relay technology.

  • PDF

Fuzzy Based Multi-Hop Broadcasting in High-Mobility VANETs

  • Basha, S. Karimulla;Shankar, T.N.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.165-171
    • /
    • 2021
  • Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.

A Study on Delayed ACK Scheme for TCP Traffic in Ad-hoc Network (Ad-hoc 네트워크에서 지연 ACK를 이용한 TCP성능 향상에 관한 연구)

  • Park Kwang-Chae;Na Dong-Geon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1654-1662
    • /
    • 2006
  • An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

Optimal Routing Path Selection Algorithm in Ad-hoc Wireless Sensor Network (Ad-hoc 센서 네트워크를 위한 최적 라우팅 경로 설정 알고리즘)

  • Jang In-Hun;Sim Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.736-741
    • /
    • 2005
  • The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.

An Effective Cross Layer-based Multimedia Transmission Algorithm over Multi-hop Mobile Ad Hoc Network (다중 홉 이동 애드 혹 네트워크에서 크로스레이어 기반의 효과적인 멀티미디어 전송 알고리즘)

  • Lee, Gyeong-Cheol;Kim, Wan;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.474-481
    • /
    • 2010
  • In this paper, we present an effective cross layer-based video transmission algorithm over multi-hop mobile ad hoc networks. The proposed algorithm selects the most efficient PHY mode of wireless LAN multi-rate service at each node in a distributed way based on the available information at application, MAC, and physical layers in order to minimize end-to-end delay and maintain packet loss rate in tolerable range at the receiver. Finally, experimental results are provided to show superior performance of the proposed algorithm.

A Distance and Angle Based Routing Algorithm for Vehicular Ad hoc Networks

  • Wang, Jing;Rhee, Kyung-Hyune
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2012.05a
    • /
    • pp.190-192
    • /
    • 2012
  • Vehicular Ad hoc Networks (VANETs) is the new wireless networking concept of mobile ad hoc networks in research community. Routing in vehicular is a major challenge and research area. The majority of current routing algorithms for VANETs utilize indirect metrics to select the next hop and produce optimal node path. In this paper, we propose a distance and angle based routing algorithm for VANETs, which combines a distance approach with an angle based geographical strategy for selecting the next hop, with the purpose of using direct metrics to build a optimal node route. The proposed algorithm has better performance than the previous scheme.

  • PDF