• Title/Summary/Keyword: communication networks

Search Result 5,470, Processing Time 0.036 seconds

$M^2$ MAC: MAC protocol for Real Time Robot Control System based on Underwater Acoustic Communication ($M^2$ MAC(Message Merging): 수중음파통신 기반의 실시간 로봇 제어 시스템을 위한 MAC 프로토콜)

  • Kim, Yung-Pyo;Park, Soo-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.6
    • /
    • pp.88-96
    • /
    • 2011
  • Underwater acoustic communication is applicable in various areas, such as ocean data collection, undersea exploration and development, tactical surveillance, etc. Thus, robot control system construction used for underwater-robot like AUV or ROV is essential in these areas. In this paper, we propose the Message Merging MAC($M^2$-MAC) protocol, which is suitable for real time robot control system, considering energy efficiency in important parts of underwater acoustic sensor network constitution. In this proposed MAC protocol, gateway node receives the data from robot nodes according to the time slots that were allotted previously. And messages delivered from base-station are generated to one MAC frame by buffering process. Finally, generated MAC frames are broadcasted to all robot nodes in the cluster. Our suggested MAC protocol can also be hybrid MAC protocol, which is successful blend of contention based and contention-free based protocol through relevant procedure with Maintenance&Sleep (M&S) period, when new nodes join and leave as an orphan. We propose mathematical analysis model concerned about End-to-End delay and energy consumption, which is important factor in constructing real-time robot control system. We also verify the excellence of performance according to comparison of existing MAC protocols with our scheme.

Transform domain Wyner-Ziv video coding with successively improving side information based on decoding reliability (복호 신뢰도에 기반하여 점진적으로 보조정보를 향상시키는 변환영역 Wyner-Ziv 부호화 방법)

  • Ko, Bong-Hyuck;Shim, Hiuk-Jae;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.13 no.6
    • /
    • pp.892-904
    • /
    • 2008
  • As a video encoding in resource constrained environments such as sensor networks has become an important issue, DVC(Distributed Video Coding) has been intensively investigated as a solution for light weighted video encoding problem. Known as one of the representative schemes of DVC, the Wyner-Ziv coding generates side information of current frame only at decoder, using correlation among frames, and reconstructs video through noise elimination on the side information using channel code. Accordingly, the better quality of side information brings less channel noise, thus attains better coding performance of the Wyner-Ziv coder. However, since it is hard for decoder to generate an accurate side information without any information of original frame, a method to successively improve side information using successively decoded original frame, based on decoding reliability, was previously developed. However, to improve side information from decoding results, not only an error rate of the decoding result as a reliability, but also the amount of reliable information from the decoding result is important. Therefore, we propose TDWZ(Transform-domain Wyner-Ziv coding) with successively improving side information based on decoding reliability considering not only an error rate but also the amount of reliable information of the decoding results. Our experiment shows the proposed method gains average PSNR up to 1.7 dB over the previous TDWZ, that is without successive side information improvement.

Design of a Service Broker for Large Scale Connections to Support Pubsub QoS between TOS and Mobile Devices (TOS와 Mobile device 간의 펍섭 QoS를 지원하는 대량 커넥션 서비스 브로커 설계)

  • Jeon, Young-Jun;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.137-142
    • /
    • 2016
  • A two-step open system(TOS) was proposed to relay between a healing platform and a repository of personal health documents. TOS was designed by taking into consideration the pubsub service based on large scale connections to monitor a provider's access/request process for health documents in real time. TOS, however, uses WebSocket as a communication protocol in case of pubsub. Given the operational environment of low quality wireless networks for mobile devices that are user terminals in a healing platform, there is a need to add a messaging protocol to support QoS as well as a transmission protocol. As a light messaging protocol optimized for mobile devices, MQTT defines reliable messaging QoS to consider a wireless network situation of low speed/low quality. This study designed an MQTT protocol-based message broker to support QoS in case of large scale connections and pubsub by taking into consideration mobile devices that are user terminals in a healing platform. After designing a model between TOS and MQTT message broker, the study implemented a prototype based on the proposed design and compared it with its counterparts from previous studies based on the performance indicators in a load-test with the MQTT client tool.

A Performance Enhancement Scheme of Hierarchical Mobility Management in IPv6 Networks (IPv6 네트워크에서 계층적 이동성 관리의 성능향상 방안)

  • Seo, Jae-Kwon;Lee, Kyug-Geun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.119-126
    • /
    • 2007
  • Recently, the mobility of users and mobile communication technologies have developed rapidly. The users in this state also want to connect their devices and to receive services anywhere, anytime. Hierarchical Mobile IPv6 (HMIPv6) has been proposed by the Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead when employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely Mobility Anchor Point (MAP) as a local home agent. However, HMIPv6 has been found to cause longer handover latency when the inter-domain handover occurs. This is because a Mobile Node (MN) has to generate two addresses and register them to Home Agent (HA) a MAP, respectively. In order to solve such problems, we propose a scheme that an MN generates one address and registers it to HA for supporting fast handover during the inter-domain handover process. In the proposed scheme, the load of MAP and MAP domain is reduced because the number of MNs which are managed by MAP is decreased and the MAP does not perform proxy Neighbor Discovery Protocol (NDP) to intercept packets destined to MNs. We evaluate the performance of proposed scheme in comparison to HMIPv6 through the simulation and numerical analysis.

Cross-layer Design of Routing and Link Capacity Extension for QoS in Communication Networks (통신망 QoS를 위한 라우팅과 용량 증설의 계층간 최적화 기법)

  • Shin, Bong-Suk;Lee, Hyun-Kwan;Park, Jung-Min;Kim, Dong-Min;Kim, Seong-Lyun;Lee, Sang-Il;Ahn, Myung-Kil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1749-1757
    • /
    • 2010
  • This paper considers the cost minimization problem to satisfy QoS (Quality of Service) requirements for a given network, in particular when communication resources to each link can be additionally assigned. For the purpose of quantifying QoS requirements such as data transfer delay and packet loss, we introduce the cost function considering both the link utilization factor and the additionally assigned resource. To minimize this cost function, we firstly formulate a Basic Capacity Planning (BCP) problem, a special case of Network Utility Maximization (NUM). We show that the solution of this BCP problem cannot be optimal via a counter example. In this paper, we suggest the cross-layer design of both additionally assigned resource and routing path, whose initial values are set to the result of BCP problem. This cross-layer design is based on a heuristic approach which presents an effective way to plan how much communication resources should be added to support the QoS requirements in future. By simulation study, we investigate the convergence of the cost function in a more general network topology as well as in a given simple topology.

Performance Analysis of Fast Handover Scheme Based on Secure Smart Mobility in PMIPv6 Networks (프록시 모바일 IPv6 네트워크에서 안전한 스마트 이동성에 기반한 빠른 핸드오버 기법의 성능분석)

  • Yoon, KyoungWon;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.121-133
    • /
    • 2013
  • Defect-free transfer service on the Next-generation wireless network extensive roaming mobile node (MN) to provide efficient mobility management has become very important. MIPv6(Mobility IPv6) is one of mobility management scheme proposed by IETF(Internet Engineering Task Force), and IPv6-based mobility management techniques have been developed in various forms. One of each management techniques, IPv6-based mobility management techniques for PMIPv6 (MIPv6) system to improve the performance of a variety of F-PMIPv6 (Fast Handover for Proxy MIPv6) is proposed. However, the F-PMIPv6 is cannot be excellent than PMIPv6 in all scenarios. Therefor, to select a proper mobility management scheme between PMIPv6 and F-PMIPv6 becomes an interesting issue, for its potenrials in enhancing the capacity and scalability of the system. In this paper, we develop an analytical model to analyze the applicability of PMIPv6 and F-PMIPv6. Based on this model, we design an Secure Smart Mobility Support(SSM) scheme that selects the better alternative between PMIPv6 and F-PMIPv6 for a user according to its changing mobility and service characteristics. When F-PMIPv6 is adopted, SSM chooses the best mobility anchor point and regional size to optimize the system performance. Numerical results illustrate the impact of some key parameters on the applicability of PMIPv6 and F-PMIPv6. Finally, SSM has proven even better result than PMIPv6 and F-PMIPv6.

Beacon Node Based Localization Algorithm Using Received Signal Strength(RSS) and Path Loss Calibration for Wireless Sensor Networks (무선 센서 네트워크에서 수신신호세기와 전력손실지수 추정을 활용하는 비콘 노드 기반의 위치 추정 기법)

  • Kang, Hyung-Seo;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.15-21
    • /
    • 2011
  • In the range-based localization, the localization accuracy will be high dependent on the accuracy of distance measurement between two nodes. The received signal strength(RSS) is one of the simplest methods of distance measurement, and can be easily implemented in a ranging-based method. However, a RSS-based localization scheme has few problems. One problem is that the signal in the communication channel is affected by many factors such as fading, shadowing, obstacle, and etc, which makes the error of distance measurement occur and the localization accuracy of sensor node be low. The other problem is that the sensor node estimates its location for itself in most cases of the RSS-based localization schemes, which makes the sensor network life time be reduced due to the battery limit of sensor nodes. Since beacon nodes usually have more resources than sensor nodes in terms of computation ability and battery, the beacon node based localization scheme can expand the life time of the sensor network. In this paper, therefore we propose a beacon node based localization algorithm using received signal strength(RSS) and path loss calibration in order to overcome the aforementioned problems. Through simulations, we prove the efficiency of the proposed scheme.

Batching delivery for VCR-like functions in video-on-demand service system (주문형 비디오 서비스 시스템에서 VCR 기능을 위한 Batching 전송)

  • 박호균;유황빈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2852-2859
    • /
    • 1997
  • Video-On-Demand system provides electronic video rental services from remote video servers on a broadband communication networks. Most of proposed VOD systems are typically designed for one-to-one conncetion between a user and video server. Therefore, video server stream services to customers individually by allocating a dedicated transmission channel and a set of video server resources for each customer. However, it is inefficiency and wxpensive way when server support multiple users who access the same video stream with a dedicated video channel. Therefore, to achieve cost-effectiveness, batching have studied method that uses multicast communication to simultaneously service all users requesting the same video with a single video with a single video stream. However, the application of the multicast communication by batching detract from the VCR-like function and on-demand nature of the system. In this paepr, we propose a scheme that can support an interactive VCR for all user requesting the same video stream with batching. To reduce a server I/O and network bandwidth requirement, dynamic buffer is allocated to access node which has variable playout poit. Consequently, it makes possible interactive VCR operation as if customer uses true VOD system. Also, this scheme can just deliver a multicast stream without delay after an initial request or VCR action occurred. The policy can guarantee acceptable services to number of users at minimum cost.

  • PDF

An Analysis of Association for Essential Proteins in Protein-Protein Interaction Network (단백질 상호작용 네트워크에서 구조적 특징과 필수 단백질의 연관성 분석)

  • Kang, tae-ho;Ryu, jae-woon;Lee, yoon-kyoung;Yeo, myung-ho;Jung, young-su;Kwon, mi-hyeong;Yoo, jae-soo;Kim, hak-yong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.842-845
    • /
    • 2008
  • The protein interaction network contains a small number of highly connected protein, denoted hub and many destitutely connected proteins. Recently, several studies described that a hub protein is more likely to be essential than a non-hub protein. This phenomenon called as the centrality-lethality rule. This rule is widely credited to exhibit the importance of hub proteins in the complex network and the significance of network architecture as well. To confirm whether the rule is accurate, we investigated all protein interaction DBs of yeast in the public sites such as Uetz, Ito, MIPS, DIP, SGD, and BioGRID. Interestingly, the protein network shows that the rule is correct in lower scale DBs (e.g., Uetz, Ito, and DIP) but is not correct in higher scale DBs (e.g., SGD and BioGRID). We are now analyzing the features of networks obtained from the SGD and BioGRD and comparing those of network from the DIP.

  • PDF

Secure and Efficient Protocol for Vehicular Communication with Privacy Preservation (프라이버시를 보호하며 안전하고 효율적인 차량간 통신 프로토콜)

  • Kim, In-Hwan;Choi, Hyoung-Kee;Kim, Jung-Yoon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.6
    • /
    • pp.420-430
    • /
    • 2010
  • Due to increasing demand for improving road safety and optimizing road traffic, Vehicular Ad-Hoc Networks (VANET) have been subject to extensive attentions from all aspects of commercial industry and academic community. Security and user privacy are fundamental issues for all possible promising applications in VANET. Most of the existing security proposals for secure VANET concentrate authentication with privacy preservation in vehicle-to-vehicle (V2V) and vehicle-to-roadside infrastructure (V2I) communications and require huge storage and network capacity for management of revocation list. Motivated by the fact, we propose a new scheme with security and privacy preservation which combines V2V and V2I communication. With our proposed scheme, the communication and computational delay for authentication and overhead for management of revocation list can be significantly reduced due to mutual authentication between a vehicle and a Roadside Unit (RSU) requires only two messages, and the RSU issues the anonymous certificate for the vehicle on behalf of the Trust Authority (TA). We demonstrate that the proposed protocol cannot only guarantee the requirements of security and privacy but can also provide efficiency of authentication and management of revocation list.