• Title/Summary/Keyword: heterogeneous information network

Search Result 757, Processing Time 0.029 seconds

CDASA-CSMA/CA: Contention Differentiated Adaptive Slot Allocation CSMA-CA for Heterogeneous Data in Wireless Body Area Networks

  • Ullah, Fasee;Abdullah, Abdul Hanan;Abdul-Salaam, Gaddafi;Arshad, Marina Md;Masud, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5835-5854
    • /
    • 2017
  • The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

An Architecture of UPnP Bridge for Non-lP Devices with Heterogeneous Interfaces (다양한 Non-lP 장치를 위한 UPnP 브리지 구조)

  • Kang, Jeong-Seok;Choi, Yong-Soon;Park, Hong-Seong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.779-789
    • /
    • 2007
  • This paper presents an architecture of UPnP Bridge for interconnecting Non-lP devices with heterogeneous network interfaces to UPnP devices on UPnP networks. The proposed UPnP Bridge provides a Virtual UPnP device that performs generic UPnP Device's functionalities on behalf of Non-lP device. This paper defines 3 types of descriptions, Device Description, Message Field Description, and Extended UPnP Service Description in order to reduce the amount of effort required to connect a non-lP device with a new interface or message format to UPnP network. By these three types of descriptions and Message conversion module, developers for Non-lP devices can easily connect the devices to UPnP network without additional programming. So UPnP control point controls Non-lP devices as generic UPnP device. Some experiments validate the proposed architecture, which are performed on a test bed consisting of UPnP network the proposed bridge, and non-lP devices with CAN and RS232 interfaces.

A Study on Dynamic Provisioning Mechanism for QoS guarantee in DiffServ Networks (DiffServ 망에서 QoS 보장을 위한 동적 프로비저닝 메카니즘 연구)

  • Rhee, Woo-Seop;Lee, Jun-Hwa;Yang, Mi-Jeong;Lee, Il-Woo;Yu, Jae-Hoon;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2B
    • /
    • pp.105-116
    • /
    • 2003
  • The differentiated service architecture is based on a simple model by applying a per-class service in the core node of the network. However, due to the simplified network behavior, the network structure and provisioning were more complicated. If a service provider wants the dynamic provisioning or better bandwidth guarantee, signaling protocol with QoS parameters or admission control method should be deployed in DiffServ network. However, these methods increase the complexity. Therefore, we proposed DPM2 mechanism for admission control in the DiffServ network. In this paper, we describe and survey the admission control methods that are applicable to IP networks and propose also the dynamic provisioning mechanism based on the bandwidth broker and distributed measurement based admission control and movable boundary bandwidth management to support heterogeneous QoS services in differentiated service networks. For the performance evaluation for proposed mechanism, we used ns-2 simulator.

A Study on Security System of 4G Network System (4세대 네트워크 시스템의 보안시스템에 관한 연구)

  • Kim, Hee-Sook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.6
    • /
    • pp.15-23
    • /
    • 2016
  • In this paper we presented 4G security models in an open environment. 4G networks have still more security holes and open issues for expert to notice. In here. we show that a number of new security threats to cause unexpected service interruption and disclosure of information will be possible in 4G due mainly to the fact that 4G is an IP-based, heterogeneous network. it tells about the security issues and vulnerabilities present in the above 4G standards.. we try to present several architectures behind 4G infrastructure for example WiMAX and 3GPP LTE architecture. Finally, we point to potential areas for future vulnerabilities and evaluate areas in 4G security which warrant attention. When you make a big dada program, If you use this network architecture then you can improve your learning speed.

Mobile Agent Based Discovery Mechanism for Pure P2P Environments (순수 P2P 환경을 위한 이동 에이전트 기반 자원 검색 기법)

  • Kim, In-Suk;Kim, Moon-Jeong;Kim, Moon-Hyun;Kim, Ung-Mo;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.327-336
    • /
    • 2003
  • Recently the rapid growth of Internet and the construction of high speed networks make many kinds of multimedia services possible. But most of current multimedia services are designed being by client/server model, which incurs high load of central server. In order to solve this problem, we propose a peer-to-peer network-based discovery mechanism for multimedia services. In the proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Use of mobile agents can solve the loss problem of the search result that occurs when the network is unsettled in pure peer-to-peer network. It also supports interoperability in heterogeneous system environments. In the proposed scheme, each host maintains the location information of resources which are locally requested or recently requested by other hosts. So, the proposed scheme has faster response time than the pre-existing mechanisms in pure peer-to-peer network environments.

Efficient Deep Neural Network Architecture based on Semantic Segmentation for Paved Road Detection (효율적인 비정형 도로영역 인식을 위한 Semantic segmentation 기반 심층 신경망 구조)

  • Park, Sejin;Han, Jeong Hoon;Moon, Young Shik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1437-1444
    • /
    • 2020
  • With the development of computer vision systems, many advances have been made in the fields of surveillance, biometrics, medical imaging, and autonomous driving. In the field of autonomous driving, in particular, the object detection technique using deep learning are widely used, and the paved road detection is a particularly crucial problem. Unlike the ROI detection algorithm used in general object detection, the structure of paved road in the image is heterogeneous, so the ROI-based object recognition architecture is not available. In this paper, we propose a deep neural network architecture for atypical paved road detection using Semantic segmentation network. In addition, we introduce the multi-scale semantic segmentation network, which is a network architecture specialized to the paved road detection. We demonstrate that the performance is significantly improved by the proposed method.

Small-cell based Cooperative Multi-Point Communications to Increase Macro-cell User Performance in Ultra-Dense Heterogeneous Networks (고밀도 이기종 네트워크에서 매크로셀 사용자 성능 향샹을 위한 스몰셀 기반 다중점 협력통신)

  • Ban, Ilhak;Kim, Se-Jin
    • Journal of Internet Computing and Services
    • /
    • v.22 no.6
    • /
    • pp.9-15
    • /
    • 2021
  • In ultra-dense heterogeneous networks, the amount of interference from small-cell base stations(SBS) to macro-cell user equipments (MUEs) increases significantly as the number of SBSs increases and it causes the MUEs to decrease the signal-to-interference and noise ratio(SINR) and system capacity. In this paper, we propose a small-cell based cooperative multi-point(CoMP) communication scheme that can guarantee the performance of MUEs even when the number of SBSs increases. In the proposed scheme, MUEs first find SBSs that give signal strength equal to or greater than a given SINR threshold and then they are served by different numbers of the selected SBSs using CoMP to improve the performance of MUEs. Simulation results show that the proposed small-cell based CoMP scheme outperforms other interference management or CoMP schemes in terms of the SINR and system capacity of MUEs.

A Mobile P2P Message Platform Enabling the Energy-Efficient Handover between Heterogeneous Networks (이종 네트워크 간 에너지 효율적인 핸드오버를 지원하는 모바일 P2P 메시지 플랫폼)

  • Kim, Tae-Yong;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.10
    • /
    • pp.724-739
    • /
    • 2009
  • This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.

Dynamic Load Balancing Algorithm using Execution Time Prediction on Cluster Systems

  • Yoon, Wan-Oh;Jung, Jin-Ha;Park, Sang-Bang
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.176-179
    • /
    • 2002
  • In recent years, an increasing amount of computer network research has focused on the problem of cluster system in order to achieve higher performance and lower cost. The load unbalance is the major defect that reduces performance of a cluster system that uses parallel program in a form of SPMD (Single Program Multiple Data). Also, the load unbalance is a problem of MPP (Massive Parallel Processors), and distributed system. The cluster system is a loosely-coupled distributed system, therefore, it has higher communication overhead than MPP. Dynamic load balancing can solve the load unbalance problem of cluster system and reduce its communication cost. The cluster systems considered in this paper consist of P heterogeneous nodes connected by a switch-based network. The master node can predict the average execution time of tasks for each slave node based on the information from the corresponding slave node. Then, the master node redistributes remaining tasks to each node considering the predicted execution time and the communication overhead for task migration. The proposed dynamic load balancing uses execution time prediction to optimize the task redistribution. The various performance factors such as node number, task number, and communication cost are considered to improve the performance of cluster system. From the simulation results, we verified the effectiveness of the proposed dynamic load balancing algorithm.

  • PDF

RDP: A storage-tier-aware Robust Data Placement strategy for Hadoop in a Cloud-based Heterogeneous Environment

  • Muhammad Faseeh Qureshi, Nawab;Shin, Dong Ryeol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4063-4086
    • /
    • 2016
  • Cloud computing is a robust technology, which facilitate to resolve many parallel distributed computing issues in the modern Big Data environment. Hadoop is an ecosystem, which process large data-sets in distributed computing environment. The HDFS is a filesystem of Hadoop, which process data blocks to the cluster nodes. The data block placement has become a bottleneck to overall performance in a Hadoop cluster. The current placement policy assumes that, all Datanodes have equal computing capacity to process data blocks. This computing capacity includes availability of same storage media and same processing performances of a node. As a result, Hadoop cluster performance gets effected with unbalanced workloads, inefficient storage-tier, network traffic congestion and HDFS integrity issues. This paper proposes a storage-tier-aware Robust Data Placement (RDP) scheme, which systematically resolves unbalanced workloads, reduces network congestion to an optimal state, utilizes storage-tier in a useful manner and minimizes the HDFS integrity issues. The experimental results show that the proposed approach reduced unbalanced workload issue to 72%. Moreover, the presented approach resolve storage-tier compatibility problem to 81% by predicting storage for block jobs and improved overall data block placement by 78% through pre-calculated computing capacity allocations and execution of map files over respective Namenode and Datanodes.