• Title/Summary/Keyword: Ad Hoc Wireless Network

Search Result 712, Processing Time 0.028 seconds

A Study on the Effective Routing Algorithm for Mobile Ad-hoc Wireless Program Developed Network (Ad-hoc 이동 통신망에서의 무료통신이 가능한 라우팅 알고리즘 프로그램 개발 연구)

  • Lee, Dong chul;Oh, Goo Young;You, Sung-Pil;Lee, Hye soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.601-603
    • /
    • 2013
  • The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

  • PDF

A Study on the Effective Routing Algorithm for Mobile Ad-hoc Wireless Program Develop Network (Ad-hoc 통신망에서 요구되는 라우팅 알고리즘 프로그램 개발연구)

  • Lee, Dong chul;Kim, Sung gwun;Cho, Se hyun;Lee, Hye soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.623-625
    • /
    • 2012
  • The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

  • PDF

Topic Similarity-based Event Routing Algorithm for Wireless Ad-Hoc Publish/Subscribe Systems (Ad-Hoc 무선 환경의 발행/구독 시스템을 위한 구독주제 유사도 기반의 이벤트 라우팅 알고리즘)

  • Nguyen, Hieu Trung;Oh, Sang-Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.11-22
    • /
    • 2009
  • For a wireless ad-hoc network, event routing algorithm of the publish/subscribe system is especially important for the performance of the system because of the dynamic characteristic and constraint network of its own. In this paper, we propose a new hybrid event routing algorithm. TopSim for efficient publish/subscribe system on the wireless ad-hoc network by extending the ShopParent algorithm by considering not only network overheads to choose a Parent of the publish/subscribe tree, but also topic similarity which is closeness of subscriptions. Our evaluation shows our proposed TopSim performs better for the case where a new joining node subscribed to the multiple topics and there is a node among Parent candidate nodes who subscribe to the ones in the list of multiple topics (related topics).

Ad-hoc Query Processing in a Wireless Sensor Network (무선 센서 네트워크에서 순간 질의 처리 방법)

  • Yun, Sang-Hun;Cho, Haeng-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11B
    • /
    • pp.685-692
    • /
    • 2007
  • Recent advances in wireless communications and electronics have enabled the development of low-cost, low-power, multi-functional sensors. A typical wireless sensor network (WSN) consists of a large number of sensor nodes that can measure and process data while communicating through wireless channels. In this paper, we propose a hybrid query processing (HQP) algorithm for user queries submitted to the WSN. Unlike previous algorithms that consider continuous queries only, HQP supports both continuous queries and ad-hoc queries. Specially. HQP tries to reduce energy consumption of ad-hoc queries by using query results cached at each sensor node which are created during the execution of the previous continuous query. HQP can also exploit a trade-off between energy consumption and data accuracy. We evaluate the performance of HQP under a variety of WSN configurations.

Implementation of Multimedia Services in a Mobile Ad-hoc Network (이동 Ad-hoc 네트워크에서의 멀티미디어 서비스 구현)

  • Ro Kwang-Hyun;Kwon Hye-Yeon;Shin Jae-Wook;Park Ae-Soon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.2
    • /
    • pp.45-52
    • /
    • 2006
  • Mobile Ad-hoc Network(MANET) could be applied to various applications by virtue of its characteristics such as self-organizing and infrastructure-free network. This paper proposes a multimedia application service model for MANET, called multi-hop Relay(mRelay) system. It supports a multi-hop communication-based multimedia service interworked with Internet by using an unmanned moving robot with wireless multimedia communication function as a mRelay terminal. The modified AODV routing protocol was applied to the terminal and it was verified that composition and maintenance of mobile Ad-hoc network in mRelay system under the various indoor scenarios were successful and stable multi-hop multimedia services were possible. The mRelay system can be applicable to various application services of mobile Ad-hoc networks.

  • PDF

An Efficient On-Demand Routing Approach with Directional Flooding for Wireless Mesh Networks

  • Kum, Dong-Won;Le, Anh-Ngoc;Cho, You-Ze;Toh, Chai Keong;Lee, In-Soo
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.67-73
    • /
    • 2010
  • Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

Performance analysis of ZRP supporting QoS for Mobile Ad hoc networks (MANET에 대해 QoS를 지원하는 ZRP의 성능연구)

  • Kwon, Oh-Seong;Jeong, Eui-Hyun;Kim, Jun-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.224-236
    • /
    • 2003
  • MANET(Mobile Ad hoc networks) is a mobile, multi-hop, and wireless network which is bandwidth constrained, energy constrained, resource constrained, autonomous, and self operating systems with dynamic topology. These constraints make the routing between communicating nodes in ad hoc networks difficult. In this paper we survey several routing protocol for mobile ad hoc networks. Especially, we focus on Zone Routing Protocol, hybrid routing framework suitable for a wide of mobile ad hoc networks and analyze performance of ZRP. In the case of ZRP protocol, it is essential that the use of optimal zone radius for efficient use. Otherwise it was proved through an simulation that performance of whole network is rapidly decrease with greatly increasing overhead of ZRP traffic that need for transmission of packet by IARP or IERP traffic. Also we suggest the process of finding QoS path that use in-band signal for QoS routing in ad hoc network. This method guarantees route that make real time multimedia service for QoS enabled path.

Throughput and Delay Analysis of a Network Coding-enabled Cooperative MAC Protocol for Ad Hoc Networks

  • Jang, Jae-Shin;Kim, Sang-Wu;Wie, Sung-Hong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1668-1688
    • /
    • 2012
  • Cooperative communications and network coding schemes have been proposed to increase system throughput for ad hoc networks. In this paper, we present throughput and delay analysis of the new network coding-enabled cooperative MAC protocol called NC-MAC, which has been proposed by us in order to significantly enhance system performance. This protocol introduces an approach that can accommodate both cooperative communication and network coding for wireless ad hoc networks by slightly increasing overhead and modifying standards. The protocol's performance is evaluated using mathematical analysis and computer simulation and two performance measures, system throughput and average channel access delay, are used for a performance comparison with previous schemes. It is assumed that all the frames exchanged over a wireless channel are susceptible to transmission errors, which is a new but more reasonable assumption differentiating this research from previous research. Numerical results show this protocol provides significantly enhanced system performance compared with conventional cooperative MAC protocols used in previous research. For instance, system performance is 47% higher using the NC-MAC protocol than when using the rDCF protocol.

The Performance Comparison of the Unicast Routing Protocol and the Broadcast Routing Protocol in the Small-sized Ad hoc Network (소규모 애드혹 네트워크에서의 유니캐스트와 브로드캐스트 라우팅 프로토콜의 성능비교)

  • Kim, Dong-Hee;Park, Jun-Hee;Moon, Kyeong-Deok;Lim, Kyung-Shik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.685-690
    • /
    • 2006
  • This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

Clustering Algorithm for a Traffic Control of Wireless Ad Hoc Networks multi-hop (무선 에드혹 망 다중홉 트래픽제어를 위한 Clustering 알고리즘에 관한 연구)

  • 이동철;김기문;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1161-1167
    • /
    • 2003
  • The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.