• Title/Summary/Keyword: Wireless Ad-hoc Networks

Search Result 610, Processing Time 0.023 seconds

Distributed Implementation of Delay Guaranteed Fair Queueing(DGFQ) in Multimedia Ad Hoc Wireless Networks (멀티미디어 Ad Hoc 무선망에서 지연시간 보장 공정큐잉(DGFQ)의 분산적 구현)

  • Yang Hyun-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.4
    • /
    • pp.245-253
    • /
    • 2005
  • The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we proposed distributed implementation of the delay guaranteed fair queueing (DGFQ) scheme in multimedia ad hoc wireless networks. Through the the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

  • PDF

Architectures and Connection Probabilities forWireless Ad Hoc and Hybrid Communication Networks

  • Chen, Jeng-Hong;Lindsey, William C.
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.161-169
    • /
    • 2002
  • Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

Dynamic Source Multi-path Routing Protocol for Wireless Ad-hoc Network Environments (무선 에드-혹 네트워크 환경을 위한 동적다중경로라우팅 프로토콜)

  • Kim, Moon-Jeong;Eom, Young-Ik
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.336-346
    • /
    • 2001
  • A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.

  • PDF

A Simple but Efficient Scheme for Reliable Connectivity and High Performance in Ad-hoc Wireless Networks

  • Tak, Sung-Woo
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.2
    • /
    • pp.141-148
    • /
    • 2012
  • This paper presents a simple but efficient scheme incorporating a reputation-based approach and a cross-layer approach, called the SIM scheme, for maintaining reliable connectivity and high performance in ad-hoc wireless networks. The SIM scheme incorporates the following two things: an ad-hoc routing scheme with a reputation-based approach exploiting the game theory concept based on an evolutionarily stable strategy, and a cross-layer approach between the network layer and the transport layer employing a reputation-based approach.

A Robust Route Maintenance Scheme Considering Node Mobility in Wireless Ad-hoc Networks (무선 Ad-hoc 네트워크에서 노드 이동성을 고려한 견고한 경로 관리 기법)

  • Kim, Kwan-Woong;Bae, Sung-Hwan;Kim, Dae-Ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4A
    • /
    • pp.309-315
    • /
    • 2009
  • Wireless Ad-hoc networks are dynamic networks that consist of mobile nodes. Nodes in Ad-hoc networks are usually laptops, PDAs or mobile phones. These devices feature Bluetooth and/or IEEE 802.11 (WiFi) network interfaces and communicate in a decentralized manner. Due to characteristics of Ad-hoc networks, Mobility is a key feature of routing protocol design. In this paper, we present an enhanced routing maintenance scheme that cope with topology changes pre-actively. The key feature of the proposed scheme is to switch next-hop node to alternative neighbor node before link breakage for preventing route failure. From extensive experiments by using NS2, the performance of the proposed scheme has been improved by comparison to AODV protocol.

Providing Guaranteed Delay in Multimedia Ad Hoc Wireless Networks (멀티미디어 Ad Hoc 무선망에서의 지연시간 보장방안)

  • Yang, Hyun-ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1177-1186
    • /
    • 2003
  • The multimedia ad hoc wireless network is quite an attractive issue since it offers a flexible solution to enable delivery of multimedia services to mobile end users without fixed backbone networks. However, with the unique design challenges of ad hoc wireless networks, it is a non-trivial issue to provide bounded delay guarantee, with fair share of resources. In this paper, we implemented the delay guaranteed fair queueing (DGFQ) scheme distributively. Through the results of performance evaluation, we can conclude that DGFQ also performs well to control bounded delay in multimedia ad hoc wireless networks.

Overlay Multicast in Wireless Ad Hoc Networks (무선 ad-hoc 망에서의 Overlay Multicast 지원 방안)

  • 김혜원
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.345-348
    • /
    • 2003
  • Overlay multicast is proposed as an alternative approach for providing muticast services. A logical infrastructure is built to form an overlay network on top of the physical layer. In this paper, we propose an efficient overlay multicast in wireless ad hoc networks. The overlay multicast tree adapts to the changes in underlying networks. The multicast tree adjusted according to the local member information.

  • PDF

Cluster-head Decision Method for Cognitive Radio Based on Wireless Ad-hoc Network (인지 무선 기반 애드 혹 네트워크에서의 클러스터 헤드 선정기법)

  • Lee, Kyung-Sun;Kim, Yoon-Hyun;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.91-96
    • /
    • 2012
  • Ad-hoc networks can be used various environment, which it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio (CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. In CR based wireless ad-hoc networks, cluster-head decides the existence of primary user using sensing information of primary user from each ad-hoc device. However, it is still defective research to decide cluster head among the a lot of ad-hoc devices. So, in this paper, we show the decision method of cluster head in CR based wireless and detection probabilities of primary user based on decision method of cluster head.

Mutual Authentication between the mobile node in Ad-hoc Network (Ad-hoc 망에서 이동 노드 간 상호 인증)

  • Choi, Woo-Jin;Seok, Gyeong-Hyu
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.10
    • /
    • pp.1087-1092
    • /
    • 2015
  • It was diversified demand for a wireless network to the rapid growth of the Internet, the time and space that are not in the new level of Internet technology, limits the Ad-hoc networks are needed. Ad-hoc networks do not communicate with the central station, each of the mobile nodes included in the network communicate with each other by the relay role. In recent years, the Ad-hoc wireless networks in a variety of routing protocols and network security, research is actively underway for the authentication method, but the security of wireless Internet and Ad-hoc networks, certification is incomplete situation. This paper considers the authentication and key agreement technique applicability of the USIM card using the DSR routing protocol of the Java Card and Ad-hoc networks, we propose a secure authentication mechanism between the mobile node.

Call Admission Control in Wireless Ad-hoc Networks with Multiple Channels and Radios

  • Ko, Sung-Won
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.4
    • /
    • pp.104-114
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol that works in wireless Ad-hoc communication networks with multiple radios and multiple channels and that controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, the MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which allows full duplex transmission between wireless Ad-hoc nodes, and reduces intra interference on the route. Also, a fixed channel only for reception at each node enables the estimation of the available bandwidth, which is used to control the call admission for QoS provision. The performance of the MCQosR was verified by simulation.