• Title/Summary/Keyword: Ad Hoc Networks

Search Result 1,360, Processing Time 0.033 seconds

A Study on Variable Geocasting in Ad-hoc Environment (Ad-hoc 환경에서의 가변 지오캐스팅에 관한 연구)

  • Lee Cheol-Seung;Kim Kuk-Se;Jung Sung-Ok;Lee Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.510-513
    • /
    • 2006
  • Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing we consider, in this paper, how to efficiently support applications such as variable Geocasting basd on Ad-hoc networks. The goal of a geocasting protocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance than previous research.

  • PDF

Distributed Coordination Protocol for Ad Hoc Cognitive Radio Networks

  • Kim, Mi-Ryeong;Yoo, Sang-Jo
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.51-62
    • /
    • 2012
  • The exponential growth in wireless services has resulted in an overly crowded spectrum. The current state of spectrum allocation indicates that most usable frequencies have already been occupied. This makes one pessimistic about the feasibility of integrating emerging wireless services such as large-scale sensor networks into the existing communication infrastructure. Cognitive radio is an emerging dynamic spectrum access technology that can be used for flexibly and efficiently achieving open spectrum sharing. Cognitive radio is an intelligent wireless communication system that is aware of its radio environment and that is capable of adapting its operation to statistical variations of the radio frequency. In ad hoc cognitive radio networks, a common control channel (CCC) is usually used for supporting transmission coordination and spectrum-related information exchange. Determining a CCC in distributed networks is a challenging research issue because the spectrum availability at each ad hoc node is quite different and dynamic due to the interference between and coexistence of primary users. In this paper, we propose a novel CCC selection protocol that is implemented in a distributed way according to the appearance patterns of primary systems and connectivity among nodes. The proposed protocol minimizes the possibility of CCC disruption by primary user activities and maximizes node connectivity when the control channel is set up. It also facilitates adaptive recovery of the control channel when the primary user is detected on that channel.

OFDMA-Based Reliable Multicast MAC Protocol for Wireless Ad-Hoc Networks

  • Kim, Sung-Won;Kim, Byung-Seo
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.83-85
    • /
    • 2009
  • Compared with unicast, multicast over wireless ad-hoc networks do not support reliability due to their inability to exchange request-to-send/clear-to-send (RTS/CTS) and ACK packets with multiple recipients. Although several media access control (MAC) layer protocols have been proposed to provide reliable multicast, these introduce additional overhead, which degrades system performance. A novel MAC protocol for reliable wireless multicast is proposed in this paper. By adapting orthogonal frequency division multiple access characteristics in CTS and ACK packets, the protocol achieves reliability over wireless multicast with minimized overhead.

  • PDF

Throughput Analysis of Power Management Scheme of IEEE 802.11 DCF in Wireless Ad Hoc Networks (무선 ad hoc 네트워크에서 IEEE 802.11의 power management scheme에 관한 성능 분석)

  • Lee, Kam-Rok;Kwon, Wook-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.61-62
    • /
    • 2006
  • In this paper, using Bianchi's model with channel idle probability we analyze performance of power management scheme of IEEE 802.11 DCF according to ATIM window size and number of nodes for wireless ad hoc networks. The analytical results show that, when the number of nodes is given, the selected ATIM window size limits the performance.

  • PDF

Transmission Capacity of Wireless Ad-Hoc Networks (무선 애드 혹 네트워크의 최대 전송 용량 분석)

  • Lee, Goo-Yeon;Lee, Yong
    • Journal of Industrial Technology
    • /
    • v.32 no.A
    • /
    • pp.9-13
    • /
    • 2012
  • In this paper, we investigate maximum transmission capacity of wireless ad-hoc networks. In the investigation, we consider a network topology with regularly located nodes. For the topology, we investigate the maximum transmission capacity with RTS/CTS medium access protocol, and next, we study the maximum transmission capacity without the protocol. We see that the results of our study overall follows the result of Gupta and Kumar's research.

  • PDF

An Adaptive Selection of Congestion Window for TCP over Ad-Hoc Networks

  • Song, Jung-Hoon;Lee, Sang-Don;Han, Ki-Jun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.541-543
    • /
    • 2004
  • TCP does not distinguish between congestion and packet losses due to route change and link failures, which are prevalent in mobile ad hoc networks. So, TCP does not show satisfactory performance in ad hoc networks since it assumes that all packet losses are due to network congestions. In particular, when a route is reestablished it needs to be adaptively determined CWND according to the new route features. In this paper, we proposed CWND adjustment scheme to improve the TCP performance overad hoc networks. TCP sender effectively adjusts CWND by monitoring the network situation using control packets. Simulation results using NS-2 show that the proposed scheme increases TCP throughput compared with those of general TCP.

  • PDF

Adaptive Partition-Based Address Allocation Protocol in Mobile Ad Hoc Networks

  • Kim, Ki-Il;Peng, Bai;Kim, Kyong-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.141-147
    • /
    • 2009
  • To initialize and maintain self-organizing networks such as mobile ad hoc networks, address allocation protocol is essentially required. However, centralized approaches that pervasively used in traditional networks are not recommended in this kind of networks since they cannot handle with mobility efficiently. In addition, previous distributed approaches suffer from inefficiency with control overhead caused by duplicated address detection and management of available address pool. In this paper, we propose a new dynamic address allocation scheme, which is based on adaptive partition. An available address is managed in distributed way by multiple agents and partitioned adaptively according to current network environments. Finally, simulation results reveal that a proposed scheme is superior to previous approach in term of address acquisition delay under diverse simulation scenarios.

A Tree-Based Approach for the Internet Connectivity of Mobile Ad Hoc Networks

  • Oh, Ro-An
    • Journal of Communications and Networks
    • /
    • v.11 no.3
    • /
    • pp.261-270
    • /
    • 2009
  • We propose a tree-based integration of infrastructure networks and MANETs (TUM) to efficiently extend the scope of mobile Internet protocol to mobile ad hoc networks and devise a tree-based routing protocol (TBRP) that is suitable for the TUM architecture. Infrastructure networks have a number of fixed Internet Gateways that connect two heterogeneous networks. Mobile nodes form a number of small trees named pMANETs, each of them growing from anchor node which can communicate directly with an Internet Gateway. A new node registers with foreign agent and home agent along the tree path without resorting to an inefficient flooding. Furthermore, the TBRP sets up a routing path efficiently by exploiting the tree information without relying on flooding. We show by resorting to simulation that our approach is competitive against the conventional AODV based approach.

FTCARP: A Fault-Tolerant Routing Protocol for Cognitive Radio Ad Hoc Networks

  • Che-aron, Zamree;Abdalla, Aisha Hassan;Abdullah, Khaizuran;Rahman, Md. Arafatur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.371-388
    • /
    • 2014
  • Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

EZR: Expansive Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 확장탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.32 no.8
    • /
    • pp.1269-1277
    • /
    • 2008
  • Ships at sea cannot exchange data among them easily so far. Basically voice-oriented communication systems are the main methods, some of them utilize the HF radio systems at lower bit rates, and for higher bit rates, the Inmarsat or VSAT are adopted. None of them are used widely because of lower qualities and higher costs. There exist many technical and economical limits to have the Internet service just like on land such as the WWW service. In order to achieve the improved transmission rates of the maritime communication networks at farther sea, MANET(Mobile Ad Hoc Network) is one of the most practical models. In this paper, a new routing protocol named EZR (Expansive Search Zone Routing Protocol) is proposed, which is based on SANET (Ship Ad Hoc Network) model that has some different features from MANET and VANET (Vehicular Ad Hoc Network). The search zone for the shortest path is firstly found by EZR. If no path is searched in the zone, the zone is expanded according to the rule of EZR. The zone-expanding and path-searching procedures are repeated until the path is found out. The performance of EZR is evaluated and compared with LAR protocol which is one of the most typical routing protocols based on geographical information. The simulated results show that EZR is much better than LAR at sea environments in terms of routing success rate, route optimality, and a single index of performance combined the previous two metrics.