• Title/Summary/Keyword: Information Centric

Search Result 723, Processing Time 0.032 seconds

Meta-Analysis of Information Privacy Using TSSEM (TSSEM을 이용한 정보 프라이버시 메타분석)

  • Kim, Jongki
    • Journal of Digital Convergence
    • /
    • v.17 no.11
    • /
    • pp.149-156
    • /
    • 2019
  • With widespread use of information technologies, information privacy issues have been gaining more attention by not only the public but also researchers. The number of studies on the issues has been increasing exponentially, which makes incomprehensible the whole picture of research outcome. Thus, it is necessary to conduct a systematic examination of past research. This study developed two competing models with four essential constructs in information privacy research and empirically tested the models with data obtained from previous studies. This study employed a quantitative meta-analysis method called TSSEM. It is one of MASEM methods in which structural equation modeling and meta-analysis are integrated. The analysis results indicated that risk-centric model exhibited much better model fits than those of concern-centric model. This study implies that traditional concern-centric model should be questioned it's explanatory power of the model and researchers may consider alternative risk-centric model to explain user's intention to provide privacy information.

A Study On User-centric Identity Information Management Model In Internet Environment (인터넷 환경에서의 사용자 중심 ID정보 관리 모델에 관한 연구)

  • Rhy, Hae-Gyu;Shin, Hyeon-Shik
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.3
    • /
    • pp.37-50
    • /
    • 2009
  • With the increase of number of internet services due to development of internet, it becomes a critical issue to appropriately manage the personal information about user's identity, that is ID information that service providers collect in terms of user's convenience improvement and privacy protection. But the existing ID information management models are service provider-centric or they insufficiently provide ID information management functions, so that they have not been satisfying user's requirement. In this paper, by establishing user-centric concept in we information management, we propose the new user-centric ID information management model in which user can make use of the internet service more conveniently and eventually enhance user's privacy.

A Proposal for Creating Task-Centric Application Profile: Utilization of Task Model for Suitable Selection and Combination of Metadata Schema Properties (메타데이터 스키마의 적절한 선택과 조합을 위해 태스크 모델을 활용한 업무중심의 어플리케이션 프로파일 모델 제안에 관한 연구)

  • Baek, Jae-Eun
    • Journal of Korean Library and Information Science Society
    • /
    • v.49 no.3
    • /
    • pp.407-428
    • /
    • 2018
  • Metadata standard is very important element to describe a digital resource in the records lifecycle. Metadata standard is influenced by the purpose and content of tasks that are performed to a resource. But it does not reflect a task-centric viewpoint to cover the whole records-lifecycle because metadata is defined and designed from a resource-centric viewpoint. In other words, to cover the whole records-lifecycle using metadata, it is necessary to properly select and combine metadata property from a task-centric viewpoint. Therefore, we proposed a task-centric metadata application profile that can combine and select appropriate metadata properties according to requirements and tasks performed on resource.

A Receiver-Centric Carrier Sense Technique for Wireless Ad Hoc Networks (무선 애드혹 네트워크에서 수신자 중심 캐리어 센싱 기법)

  • Yoo, Joon;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.307-311
    • /
    • 2010
  • Most wireless ad hoc networks use sender-centric carrier sensing where a data sender determines the transmission timing through channel assessment. However, sender-centric carrier sensing suffers from both exposed and hidden terminal problems even with physical and virtual carrier sensing. In this paper, we propose a new receiver-centric carrier sense (RCS) technique where a data receiver triggers packet transmission based on local channel assessment. Through both numerical analysis and simulation studies, we show that the proposed RCS achieves up to 20.9% higher throughput than previous receiver-centric approaches.

Cross-layer Video Streaming Mechanism over Cognitive Radio Ad hoc Information Centric Networks

  • Han, Longzhe;Nguyen, Dinh Han;Kang, Seung-Seok;In, Hoh Peter
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3775-3788
    • /
    • 2014
  • With the increasing number of the wireless and mobile networks, the way that people use the Internet has changed substantively. Wireless multimedia services, such as wireless video streaming, mobile video game, and mobile voice over IP, will become the main applications of the future wireless Internet. To accommodate the growing volume of wireless data traffic and multimedia services, cognitive radio (CR) and Information-Centric Network (ICN) have been proposed to maximize the utilization of wireless spectrum and improve the network performance. Although CR and ICN have high potential significance for the future wireless Internet, few studies have been conducted on collaborative operations of CR and ICN. Due to the lack of infrastructure support in multi-hop ad hoc CR networks, the problem is more challenging for video streaming services. In this paper, we propose a Cross-layer Video Streaming Mechanism (CLISM) for Cognitive Radio Ad Hoc Information Centric Networks (CRAH-ICNs). The CLISM included two distributed schemes which are designed for the forwarding nodes and receiving nodes in CRAH-ICNs. With the cross-layer approach, the CLISM is able to self-adapt the variation of the link conditions without the central network controller. Experimental results demonstrate that the proposed CLISM efficiently adjust video transmission policy under various network conditions.

Threshold based User-centric Clustering for Cell-free MIMO Network (셀프리 다중안테나 네트워크를 위한 임계값 기반 사용자 중심 클러스터링)

  • Ryu, Jong Yeol;Lee, Woongsup;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.1
    • /
    • pp.114-121
    • /
    • 2022
  • In this paper, we consider a user centric clustering in order to guarantee the performance of the users in cell free multiple-input multiple-output (MIMO) network. In the user centric clustering scheme, by using large scale fading coefficients of the connected access points (APs), each user decides own cluster with the APs having the higher the large scale fading coefficients than threshold value compared to the highest large scale fading coefficient. In the determined user centric clusters, the APs design the beamformers and power allocations in the distributed manner and the APs cooperatively transmit data to users by using beamformers and power allocations. In the simulation results, we verify the performance of user centric clustering in terms of the spectral efficiency and we also find the optimal threshold value in the given configuration.

Research on Efficiency of Interest-Data Handshaking in Wireless Content-Centric Networks (무선 Content-Centric Network에서의 Interest-Data Handshaking의 효율성에 대한 연구)

  • Lee, Seung-Jin;Park, Chan-Min;Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.81-86
    • /
    • 2014
  • Content Centric Network (CCN) is one of candidate technologies for the future Information Centric Networks. Recently, adopting CCN concept to wireless networks has extensively been studied. One of the well-known studies is Enhanced-Content-centric multiHop wireless NETwork (E-CHANET), which proposes efficient methods to deliver contents adopting CCN concept over wireless environment. In E-CHANET, in order for a provider to send a data packet, one interest packet from a consumer is required. In this paper, efficiency of data-interest handshaking in E-CHANET has been investigated. It is compared with a method using only one interest packet for all data packets through simulations. As results, while the handshaking provides transmission reliability, it increses content down load time too much.

Energy Efficient Data-centric based Sensor Network Routing Protocol (에너지 효율적인 데이타 기반 센서 네트워크 라우팅 프로토콜)

  • Park Noseong;Kim Daeyoung
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.261-277
    • /
    • 2005
  • We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

QuLa: Queue and Latency-Aware Service Selection and Routing in Service-Centric Networking

  • Smet, Piet;Simoens, Pieter;Dhoedt, Bart
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.306-320
    • /
    • 2015
  • Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

Content-Aware D2D Caching for Reducing Visiting Latency in Virtualized Cellular Networks

  • Sun, Guolin;Al-Ward, Hisham;Boateng, Gordon Owusu;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.514-535
    • /
    • 2019
  • Information-centric networks operate under the assumption that all network components have built-in caching capabilities. Integrating the caching strategies of information centric networking (ICN) with wireless virtualization improves the gain of virtual infrastructure content caching. In this paper, we propose a framework for software-defined information centric virtualized wireless device-to-device (D2D) networks. Enabling D2D communications in virtualized ICN increases the spectral efficiency due to reuse and proximity gains while the software-defined network (SDN) as a platform also simplifies the computational overhead. In this framework, we propose a joint virtual resource and cache allocation solution for latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we design low-complexity heuristic algorithms which are intuitive and efficient. In our proposed framework, different services can share a pool of infrastructure items. We evaluate our proposed framework and algorithm through extensive simulations. The results demonstrate significant improvements in terms of visiting latency, end user QoE, InP resource utilization and MVNO utility gain.