• Title/Summary/Keyword: Wireless Ad hoc Network

Search Result 713, Processing Time 0.027 seconds

Throughput and Delay of Single-Hop and Two-Hop Aeronautical Communication Networks

  • Wang, Yufeng;Erturk, Mustafa Cenk;Liu, Jinxing;Ra, In-ho;Sankar, Ravi;Morgera, Salvatore
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.58-66
    • /
    • 2015
  • Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

A Multi-Agent Scheme Considering User's Mobility RFID based on Knowledge Management System (사용자의 이동성을 고려한 멀티 에이전트 방식의 RFID 기반 지식 관리 시스템)

  • Seo, Dae-Hee;Baek, Jang-Mi;Cho, Dong-Sub
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.99-108
    • /
    • 2010
  • The Wireless Ad Hoc network is discussed as a core technology for ubiquitous computing, and the smart tag technology is currently being actively discussed as a part of the sensor network. Thus, considering its security may advance the realization of ubiquitous computing. RFID (Radio Frequency Identification) technology using the smart tag technology as a part of the sensor network is currently in the limelight. In particular, when RFID is applied to a knowledge management system managing various data, data mobility and management convenience are ensured and automated knowledge service can be provided to users. Accordingly, this paper to proposed a secure scheme for mobility knowledge management systems using multi-agents differentiated from the existing knowledge management systems. Specifically, the proposed scheme designates user's authentication and privilege information in multi-agents and provides effective knowledge service through grouping based on user information. Moreover, even user's movement, the proposed scheme ensures service availability and provides continuous information through communication with multi-agent systems.

Self Organization of Sensor Networks for Energy-Efficient Border Coverage

  • Watfa, Mohamed K.;Commuri, Sesh
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.57-71
    • /
    • 2009
  • Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

Intrusion Detection System based on Cluster (클러스터를 기반으로 한 침입탐지시스템)

  • Yang, Hwan-Seok
    • Journal of Digital Contents Society
    • /
    • v.10 no.3
    • /
    • pp.479-484
    • /
    • 2009
  • Security system of wireless network take on importance as use of wireless network increases. Detection and opposition about that is difficult even if attack happens because MANET is composed of only moving node. And it is difficult that existing security system is applied as it is because of migratory nodes. Therefore, system is protected from malicious attack of intruder in this environment and it has to correspond to attack immediately. In this paper, we propose intrusion detection system using cluster head in order to detect malicious attack and use resources efficiently. we used method that gathering of rules is defined and it judges whether it corresponds or not to detect intrusion more exactly. In order to evaluate performance of proposed method, we used blackhole, message negligence, jamming attack.

  • PDF

A Routing Algorithm with Small Routing Traffic (작은 라우팅 구성 트래픽을 가지는 라우팅 알고리즘)

  • Choi, Ick-Sung;Kwark, Gwang-Hoon;Kim, Geun-Hyung
    • The KIPS Transactions:PartC
    • /
    • v.18C no.4
    • /
    • pp.279-286
    • /
    • 2011
  • This paper proposes techniques for wireless sensor network routing algorithm with small routing traffics. It reduces routing traffic by gathering routing messages for fixed duration of time and the routing message for the configuration result is sent once. The routing traffic gathering technique has disadvantage of longer network configuration time. To overcome this, first one or first few routing messages are delivered immediately and later routing messages are gathered for fixed duration of time. The proposed scheme was modelled and implemented in Qualnet simulator using C language. Experimental results show that the proposed techniques are effective for reducing routing traffics.

Efficient and Secure Routing Protocol forWireless Sensor Networks through SNR Based Dynamic Clustering Mechanisms

  • Ganesh, Subramanian;Amutha, Ramachandran
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.422-429
    • /
    • 2013
  • Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

A Design of Sensor Web service Framework for Wireless Sensor Networks Environment (무선 센서 네트워크 환경에 대한 센서 웹 서비스 프레임워크의 설계)

  • Kim, Yong-Tae;Jeong, Yoon-Su;Park, Byung-Joo;Park, Gil-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.123-131
    • /
    • 2009
  • In this paper, we design ZigBee RF based framework for mobile web service on collected data by sensor node and transmitting data to data base by sensor network and remote sensing server through wireless connection. The proposed system is an integrated platform of sensor network for the sensor management and providing SOA based sensor web access. This paper combines SOA technology with sensor network. composes sensor node as web view, and provides high capability. extensiveness, reliability, and usability to the user who accesses to sensor web. The mobile message conversion module, SOAP message processing module. WSDL message generator, and mobile web service module is embodied for improving the capacity of the framework. The capacity evaluation of local wireless communication system which is proposed in this paper is analyzed through NS-2 simulation.

Mobility Management Scheme for the Wireless Mesh Network using Mobility Anchor Point (MAP를 적용한 무선 매쉬 네트워크에서의 이동성 관리방법)

  • Jang, Sung-Hwan;Cho, Kyu-Seob
    • Journal of Internet Computing and Services
    • /
    • v.12 no.3
    • /
    • pp.101-110
    • /
    • 2011
  • WMN is highlighted as a next generation network technology due to relatively reasonable cost to be built, compared with the pre-existing wireless network. It also enables same kind of network or even other kind of network to be integrated. Some WMN researches support mobility using router protocol such as AODV and DSR because WMN has the similar features with Ad-hoc network in terms of operation. However, WMN has got different operations with additional functions of multi-interface and internet connect, it can't be a good method to manage efficient mobility any more. This study suggests method to apply MAP function of HMIPv6 to WMN as a way to manage WMN mobility. Through simulation, operation was verified and function was appreciated. Through the results of evaluation, the suggest mobility management had shorter handover delay and packet loss reduced, which improved whole network throughput rate, compared with mobility management using AODV.

Dynamic Channel-Time Assignments based on the link status in IEEE 802.15.3 High-rate WPAN (IEEE 802.15.3 고속 무선 PAN(Personal Area Network)에서 링크상태에 따른 동적 채널할당)

  • 곽동원;이승형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.844-851
    • /
    • 2004
  • Various types of error are caused due to many factors of various environment in air interface channel of wireless communications. In this case, the reliability of the channel is much lower than that of wired case. IEEE 802.15.3 high-rate WPAN, which operates in an ad hoc networking environment, is more susceptible to such errors. The problem has been investigated for wireless LANs, for example, as follows. If the queue size of a certain node is longer than that of other nodes, the node estimates that its channel state is bad and the resource of the node is decreased. However this method has a disadvantage that a central controller must always monitor the status. To avoid this disadvantage, in this paper, a new MAC protocol that the throughput of overall piconet is increased by LDS (Link-status Dependent Scheduling) is proposed.

Density-Based Opportunistic Broadcasting Protocol for Emergency Situations in V2X Networks

  • Park, Hyunhee;Singh, Kamal Deep;Piamrat, Kandaraj
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.1
    • /
    • pp.26-32
    • /
    • 2014
  • Vehicular-to-anything (V2X) technology is attractive for wireless vehicular ad-hoc networks (VANETs) because it allows for opportunistic choice of a vehicular protocol between vehicular-to-vehicular (V2V) and vehicular-to-infrastructure (V2I) communications. In particular, achieving seamless connectivity in a VANET with nearby network infrastructure is challenging. In this paper, we propose a density-based opportunistic broadcasting (DOB) protocol, in which opportunistic connectivity is carried out by using the nearby infrastructure and opposite vehicles for solving the problems of disconnection and long end-to-end delay times. The performance evaluation results indicate that the proposed DOB protocol outperforms the considered comparative conventional schemes, i.e., the shortest path protocol and standard mobile WiMAX, in terms of the average end-to-end delay, packet delivery ratio, handover latency, and number of lost packets.