• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.034 seconds

15×15 Kernel Block Adaptive Median Filter based on LED Illumination Detection Algorithm for Low Rate CamCom (15×15 Kernel Block Adaptive Median Filter를 적용한 저속 카메라 통신용 LED 조명 검출 알고리즘 연구)

  • Han, Jungdo;Lee, Minwoo;Cha, Jae Sang
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.5
    • /
    • pp.143-150
    • /
    • 2018
  • With the rapid development of RF based high speed wireless communication technology, devices that can be applied to IoT networks based on RF bandwidth are rapidly spreading, nevertheless, the development speed of the RF communication is not possible to keep up with the spread of the RF band for wireless communication. In this situation, OWC technology that uses visible light source as a transmitter is attracting attention as a technology that can overcome the band exhaustion problem of RF based wireless communication technology. Although, due to the distortion of the LED illumination shape by camera exposure time and LED blinking period, the LED illumination detection rate is degraded and the RoI setting is inaccurate. In this paper, we propose an adaptive median filter applied LED illumination detection algorithm for low rate CamCom, it is possible to detect a clear RoI and LED illumination. This research will be able to play a role as a complementary material of RF based wireless communication technology efficiently.

Redesign and Performance Analysis of RTP(Real-time Transport Protocol) for Encryption of VoIP Media Information between Different Communication Networks (이종의 통신망 간에 VoIP 미디어 암호화를 위한 RTP(Real-time Transport Protocol)의 재설계 및 성능 분석)

  • Oh, Hyung-Jun;Park, Jae-Kyoung;Won, Yoo-Hun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.4
    • /
    • pp.87-96
    • /
    • 2013
  • In this paper, we suggest redesigned RTP protocol that is able to perform encryption of VoIP media information for single private network and between the different private networks. And we conduct a test for performance analysis. Such as SRTP or ZRTP methods have been used for VoIP media encryption. But, the existing encryption techniques have problem that can not perform end-to-end encryption between different private networks. In order to solve this problem, in this paper, we redesign RTP protocol. Redesigned RTP includes all information for encryption of VoIP media. Therefore the encryption is not affected by modification of SIP and SDP information that occurred in gateway. Also, redesigned RTP includes code for whether or not to apply encryption. By using the code, modification of RTP header from gateway prevents. As a result, redesigned RTP maintain the integrity and the RTP is able to perform encryption between the different private networks. Also, we conduct a test for performance analysis of SRTP, ZRTP and redesigned RTP.

Flexible Disjoint Multipath Routing Protocol Using Local Decision in Wireless Sensor Networks (무선 센서 네트워크에서 지역 결정을 통한 유연한 분리형 다중경로 라우팅 프로토콜)

  • Jung, Kwansoo;Yeom, Heegyun;Park, Hosung;Lee, Jeongcheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.911-923
    • /
    • 2013
  • Multipath routing is one of challenging issues for improving the reliability of end-to-end data delivery in wireless sensor networks. Recently, a disjointedness and management of path have been studying to enhance the robustness and efficiency of the multipath routing. However, previous multipath routing protocols exploit the disjointed multipath construction method that is not to consider the wireless communication environment. In addition, if a path failures is occurred due to the node or link failures in the irregular network environment, they maintain the multipath through the simple method that to construct a new extra path. Even some of them have no a method. In order to cope with the insufficiency of path management, a hole detouring scheme, to bypass the failures area and construct the new paths, was proposed. However, it also has the problem that requires a heavy cost and a delivery suspension to the some or all paths in the hole detouring process due to the centralized and inflexible path management. Due to these limitations and problems, the previous protocols may lead to the degradation of data delivery reliability and the long delay of emergency data delivery. Thus, we propose a flexible disjoint multipath routing protocol which constructs the radio disjoint multipath by considering irregular and constrained wireless sensor networks. It also exploits a localized management based on the path priority in order to efficiently maintain the flexible disjoint multipath. We perform the simulation to evaluate the performance of the proposed method.

Multi-query Indexing Technique for Efficient Query Processing on Stream Data in Sensor Networks (센서 네트워크에서 스트림 데이터 질의의 효율적인 처리를 위한 다중 질의 색인 기법)

  • Lee, Min-Soo;Kim, Yearn-Jeong;Yoon, Hye-Jung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1367-1383
    • /
    • 2007
  • A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

  • PDF

QoS Routing Protocol Based on Virtual Grids and MultiPaths for Mobile Sinks in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 위한 가상 그리드와 다중 경로 기반의 QoS 라우팅 프로토콜)

  • Yim, Jinhyuk;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.11
    • /
    • pp.385-392
    • /
    • 2016
  • Recently, Expectation Area-based Real-time Routing (EAR2) protocol has been proposed to support real-time routing in wireless sensor networks. EAR2 considers the expectation area of a mobile sink and uses flooding within the expectation area. However, flooding leads to excessive energy consumption and causes long delay against real-time routing. Moreover, since EAR2 uses single path to the expectation area, it is difficult to support reliable routing in sensor networks with high link failures. Thus, to overcome these limitation of EAR2, this paper proposes a reliable and real-time routing protocol based on virtual grids and multipath for mobile sinks. To support real-time routing, the proposed protocol considers expectation grids belonged to the expectation area. Instead of flooding within the expectation area, the proposed protocol uses multicasting to the expectation grids and single hop forwarding in an expectation grid because the multicasting can save much energy and the single hop forwarding can provide short delay. Also, the proposed protocol uses multipath to the expectation grids to deal with link failures for supporting reliable routing. Simulation results show that the proposed protocol is superior to the existing protocols.

Implementation of the mobility for Location Searching in Broadband Intelligence Wireless ATM Networks (광대역 지능 무선 ATM 망에서 위치 탐색을 위한 이동성 구현)

  • 정운석;박광채
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.461-467
    • /
    • 2003
  • This paper proposes the method of mobility implementation for location searching in the intelligence wireless ATM networks that expand and apply standard broadband signaling capabilities, and analyze the performance based on the numerical algorithm. The existing B-ISDN UNI protocol stack demands the location search mechanism to determine the location of mobile terminal in the wireless ATM networks because it use single protocol through the fixed PTP interface or PTM interface that don't support terminal mobility. The proposed method make possible the dynamic mobility at a part of wireless access by minimizing the signaling load without a falling-off in system performance by using the intelligence network technology according to the expansion of ATM and B-ISDN signaling integration based on the fixed networks. We implemented the performance analysis by MFC modeling based on numerical algorithm, and realized the efficiency of expenses by carrying out the comparative signaling performance evaluation to measure the relative gains of location search service in the intelligence wireless ATM system. The obtained results have the flexibility to operate in the public B-ISDN network environment without a change of existing B-ISDN/ATM NNI signaling reference to support the wireless ATM access system, and can easily expand to correspond to terminal mobility and various multimedia services in the next broadband PCS.

A Cluster-Based Channel Assignment Algorithm for IEEE 802.11b/g Wireless Mesh Networks (IEEE 802.11b/g 무선 메쉬 네트워크를 위한 클러스터 기반 채널 할당 알고리즘)

  • Cha, Si-Ho;Ryu, Min-Woo;Cho, Kuk-Hyun;Jo, Min-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.87-93
    • /
    • 2009
  • Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

mSFP: Multicasting-based Inter-Domain Mobility Management Scheme in Sensor-based Fast Proxy Mobile IPv6 Networks (센서기반 FPMIPv6 네트워크에서 멀티캐스팅 기반의 도메인간 이동성관리 기법)

  • Jang, Hana;Jeong, Jongpil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.1
    • /
    • pp.15-26
    • /
    • 2013
  • IP-based Wireless Sensor Networks (IP-WSNs) are gaining importance for their broad range of applications in health-care, home automation, environmental monitoring, industrial control, vehicle telematics and agricultural monitoring. In all these applications, mobility in the sensor network with special attention to energy efficiency is a major issue to be addressed. Because of the energy inefficiency of networks-based mobility management protocols can be supported in IP-WSN. In this paper we propose a network based mobility supported IP-WSN protocol called Multicasting-based inter-Domain Mobility Management Scheme in Sensor-based Fast Proxy Mobile IPv6 Networks (mSFP). Based on [8,20], We present its network architecture and evaluate its performance by considering the signaling and mobility cost. Our analysis shows that the proposed scheme reduces the signaling cost, total cost, and mobility cost. With respect to the number of IP-WSN nodes, the proposed scheme reduces the signaling cost by 7% and the total cost by 3%. With respect to the number of hops, the proposed scheme reduces the signaling cost by 6.9%, the total cost by 2.5%, and the mobility cost by 1.5%. With respect to the number of IP-WSN nodes, the proposed scheme reduces the mobility cost by 1.6%.

QoS Routing Protocol using multi path in Unidirectional Mobile Ad Hoc Networks (단방향 이동 Ad Hoc 망에서의 다중경로를 이용한 QoS 라우팅 프로토콜)

  • Kang, Kyeong-In;Park, Kyong-Bae;Yoo, Choong-Yul;Jung, Chan-Hyeok;Lee, Kwang-Bae;Kim, Hyun-Ug
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.935-944
    • /
    • 2002
  • It is the Mobile Ad Hoc Networks that constituted with serveral mobile node that can communicate with other mobile nodes. Until now, there were no routing protocols considering such as Multimediadata, VOD (Video On Demand), which is required of lots of bandwidth in Mobile Ad Hoc Network, io we are in the need of QoS (Quality of Service)routing protocol to transmit the data packets faster and more accurate. Also, there are an unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. In this paper, we propose the Advanced Routing routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links and to support QoS service. For the performance evaluation, we use NS-2 simulator of U.C. Berkeley. We could get not only increased received data rate and decreased average route discovery time, but also network load decreases with compared Best effort service.

Design and Performance Analysis of EU Directory Service (ENUM 디렉터리 서비스 설계 및 성능 평가)

  • 이혜원;윤미연;신용태;신성우;송관우
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.559-571
    • /
    • 2003
  • ENUM(tElephon NUmbering Mapping) is protocol that brings convergence between PSTN Networks and IP Networks using a unique worldwide E.164 telephone number as an identifier between different communication infrastructure. The mechanism provides a bridge between two completely different environments with E.164 number; IP based application services used in PSTN networks, and PSTN based application services used in IP networks. We propose a new way to organize and handle ENUM Tier 2 name servers to improve performance at the name resolution process in ENUM based application service. We build an ENUM based network model when NAPTR(Naming Authority PoinTeR) resource record is registered and managed by area code at the initial registration step. ENUM promises convenience and flexibility to both PSTN and IP users, yet there is no evidence how much patience is required when users decide to use ENUM instead of non-ENUM based applications. We have estimated ENUM response time, and proved how to improve performance up to 3 times when resources are managed by the proposed mechanism. The proposition of this thesis favorably influences users and helps to establish the policy for Tier 2 name server management.