• 제목/요약/키워드: probability of Internet use

검색결과 102건 처리시간 0.022초

Efficient Channel Assignment Scheme Based on Finite Projective Plane Theory

  • Chen, Chi-Chung;Su, Ing-Jiunn;Liao, Chien-Hsing;Woo, Tai-Kuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.628-646
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.

A study on Classification of Insider threat using Markov Chain Model

  • Kim, Dong-Wook;Hong, Sung-Sam;Han, Myung-Mook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권4호
    • /
    • pp.1887-1898
    • /
    • 2018
  • In this paper, a method to classify insider threat activity is introduced. The internal threats help detecting anomalous activity in the procedure performed by the user in an organization. When an anomalous value deviating from the overall behavior is displayed, we consider it as an inside threat for classification as an inside intimidator. To solve the situation, Markov Chain Model is employed. The Markov Chain Model shows the next state value through an arbitrary variable affected by the previous event. Similarly, the current activity can also be predicted based on the previous activity for the insider threat activity. A method was studied where the change items for such state are defined by a transition probability, and classified as detection of anomaly of the inside threat through values for a probability variable. We use the properties of the Markov chains to list the behavior of the user over time and to classify which state they belong to. Sequential data sets were generated according to the influence of n occurrences of Markov attribute and classified by machine learning algorithm. In the experiment, only 15% of the Cert: insider threat dataset was applied, and the result was 97% accuracy except for NaiveBayes. As a result of our research, it was confirmed that the Markov Chain Model can classify insider threats and can be fully utilized for user behavior classification.

Road Aware Information Sharing in VANETs

  • Song, Wang-Cheol;Rehman, Shafqat Ur;Awan, Muhammad Bilal
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권9호
    • /
    • pp.3377-3395
    • /
    • 2015
  • Recently, several approaches to share road conditions and/or digital contents through VANETs have been proposed, and such approaches have generally considered the radial distance from the information source as well as the TTL to provision an ephemeral, geographically-limited information sharing service. However, they implement general MANETs and have not been tailored to the constrained movement of vehicles on roads that are mostly linear. In this paper, we propose a novel application-level mechanism that can be used to share road conditions, including accidents, detours and congestion, through a VANET. We assign probabilities to roads around each of the intersections in the neighborhood road network. We then use the graph representation of the road network to build a spanning tree of roads with the information source as the root node. Nodes below the root represent junctions, and the edges represent inter-connecting road segments. Messages propagate along the branches of the tree, and as the information propagates down the branches, the probability of replication decreases. The information is replicated until a threshold probability has been reached, and our method also ensures that messages are not delivered to irrelevant vehicles, independently of their proximity to the source. We evaluated the success rate and performance of this approach using NS-3 simulations, and we used IDM car following and MOBIL lane change models to provide realistic modeling of the vehicle mobility.

Consumer response analysis to use-by date labeling system: Focused on willingness to accept

  • Jong Mun Kim;You Been Jo;Seung Hyun Han;Uhn-Soon Gim
    • 농업과학연구
    • /
    • 제51권3호
    • /
    • pp.399-412
    • /
    • 2024
  • This study aimed to analyze consumers' behaviors and reactions to the use-by date labeling system and provide policy implications for its efficient implementation, by utilizing 213 consumers data conducted via an Internet survey using the Google online form. We refer "pure consumption date" as the period that have passed sell-by date yet have not passed use-by date. Consumers' willingness to accept (WTA) for pure consumption date food was surveyed, which means the discount ratio of pure consumption date food compared to the original price by sell-by date. Setting the expected effects of use-by date labeling system as five: food waste reduction (waste), food purchasing cost reduction (cost), and international standardization (standard), etc., Tobit regression result showed waste had the greatest (negative) impact on consumer's WTA, while cost and standard had positive impact on consumer's WTA. The logistic regression result revealed that consumers trying to reduce grocery costs have higher probability to purchase use-by date labeling food, and further expect higher WTA. Also consumers valuing the importance of environmental protection or food quality are more likely to purchase use-by date food. Conversely consumers valuing food safety importance tend to have negative impact on purchasing use-by date food, hence expect higher WTA. It is noteworthy that consumers valuing the importance of promoting the use-by date labeling system have significantly higher probability of purchasing use-by date food. Additionally, consumers' WTA averaged 54.3%, implying that consumers are willing to purchase use-by date food when it is discounted more than 54.3% from the original price, where women expect higher WTA, the aged over 60 expect higher WTA, furthermore single-parent households expect 21.3% higher than the average WTA. However, old-aged, unmarried women, higher educated and higher income groups were negative in purchasing use-by date food. These results suggest that customized sales policy and effective promotion strategies reflecting socio-demographic characteristics of consumers would be necessary to achieve effective implementation of the newly introduced system.

Secrecy Performances of Multicast Underlay Cognitive Protocols with Partial Relay Selection and without Eavesdropper's Information

  • Duy, Tran Trung;Son, Pham Ngoc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4623-4643
    • /
    • 2015
  • This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

Applying Theory of Planned Behavior to Examine Users' Intention to Adopt Broadband Internet in Lower-Middle Income Countries' Rural Areas: A Case of Tanzania

  • Sadiki Ramadhani Kalula;Mussa Ally Dida;Zaipuna Obeid Yonah
    • Journal of Information Science Theory and Practice
    • /
    • 제12권1호
    • /
    • pp.60-76
    • /
    • 2024
  • Broadband Internet has proven to be vital for economic growth in developed countries. Developing countries have implemented several initiatives to increase their broadband access. However, its full potential can only be realized through adoption and use. With lower-middle-income countries accounting for the majority of the world's unconnected population, this study employs the theory of planned behavior (TPB) to investigate users' intentions to adopt broadband. Rural Tanzania was chosen as a case study. A cross-sectional study was conducted over three weeks, using 155 people from seven villages with the lowest broadband adoption rates. Non-probability voluntary response sampling was used to recruit the participants. Using the TPB constructs: attitude toward behavior (ATB), subjective norms (SN), and perceived behavioral control (PBC), ordinal regression analysis was employed to predict intention. Descriptive statistical analysis yielded mean scores (standard deviation) as 3.59 (0.46) for ATB, 3.34 (0.40) for SN, 3.75 (0.29) for PBC, and 4.12 (0.66) for intention. The model adequately described the data based on a comparison of the model with predictors and the null model, which revealed a substantial improvement in fit (p<0.05). Moreover, the predictors accounted for 50.3% of the variation in the intention to use broadband Internet, demonstrating the predictive power of the TPB constructs. Furthermore, the TPB constructs were all significant positive predictors of intention: ATB (β=1.938, p<0.05), SN (β=2.144, p<0.05), and PBC (β=1.437, p=0.013). The findings of this study provide insight into how behavioral factors influence the likelihood of individuals adopting broadband Internet and could guide interventions through policies meant to promote broadband adoption.

Exact Outage Probability of Two-Way Decode-and-Forward NOMA Scheme with Opportunistic Relay Selection

  • Huynh, Tan-Phuoc;Son, Pham Ngoc;Voznak, Miroslav
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권12호
    • /
    • pp.5862-5887
    • /
    • 2019
  • In this paper, we propose a two-way relaying scheme using non-orthogonal multiple access (NOMA) technology. In this scheme, two sources transmit packets with each other under the assistance of the decode-and-forward (DF) relays, called as a TWDFNOMA protocol. The cooperative relays exploit successive interference cancellation (SIC) technique to decode sequentially the data packets from received summation signals, and then use the digital network coding (DNC) technique to encrypt received data from two sources. A max-min criterion of end-to-end signal-to-interference-plus-noise ratios (SINRs) is used to select a best relay in the proposed TWDFNOMA protocol. Outage probabilities are analyzed to achieve exact closed-form expressions and then, the system performance of the proposed TWDFNOMA protocol is evaluated by these probabilities. Simulation and analysis results discover that the system performance of the proposed TWDFNOMA protocol is improved when compared with a conventional three-timeslot two-way relaying scheme using DNC (denoted as a TWDNC protocol), a four-timeslot two-way relaying scheme without using DNC (denoted as a TWNDNC protocol) and a two-timeslot two-way relaying scheme with amplify-and-forward operations (denoted as a TWANC protocol). Particularly, the proposed TWDFNOMA protocol achieves best performances at two optimal locations of the best relay whereas the midpoint one is the optimal location of the TWDNC and TWNDNC protocols. Finally, the probability analyses are justified by executing Monte Carlo simulations.

무선 센서 네트워크에서 확률 기반의 클러스터링을 이용한 계층적 데이터 전송 프로토콜 (A Probability-based Clustering Protocol for Data Dissemination in Wireless Sensor Networks)

  • 김문성;조상훈;임형진;추현승
    • 인터넷정보학회논문지
    • /
    • 제10권2호
    • /
    • pp.153-160
    • /
    • 2009
  • 무선 센서 네트워크를 위한 데이터 전송의 설계 중에서 가장 중요한 이슈 중 하나는 에너지 효율적인 측면이다. 이를 위해 최근 여러 연구들이 진행되고 있으며 그중에서 가장 대표적인 프로토콜은 SPMS이다. SPMS의 주요 특징 중 하나는 에너지 소비를 줄이기 위한 수단으로 최단경로를 사용한다는 것이다. 그러나 반복적인 최단 경로의 사용으로 인하여 네트워크 라이프타임의 최대화는 불가능하다. 본 논문에서는 에너지 잔존량과 거리를 메트릭으로 사용하는 확률 함수 기반의 데이터 전송 프로토콜을 제안한다. 시뮬레이션 결과, 제안 프로토콜은 에너지 효율적인 데이터 전송을 하며 SPMS보다 네트워크 라이프타임이 약 78%증가하였다.

  • PDF

이산 확률 기법을 이용한 온톨로지 기반 교육 시스템 (Ontology based Educational Systems using Discrete Probability Techniques)

  • 이윤수
    • 한국컴퓨터정보학회논문지
    • /
    • 제12권1호
    • /
    • pp.17-24
    • /
    • 2007
  • 기존의 인터넷 시스템에서 사용자의 요구와 목적에 따른 프레젠테이션과 컨텐츠를 탐색하는 데 있어 풍부한 링크구조 등으로 인해 일부 심각한 유용성 문제를 발생시키고 있다. 최근 많은 시스템에서는 온톨로지 기술을 이용해서 동적 적응이 가능한 다양한 시스템들을 연구하고 있다. 이 연구에서는 이산 확률 분포 함수와 사용자 프로파일 기반의 동적 적응 모델을 적용한 온톨로지 기반 교육시스템을 설계하였다. 이 시스템은 온톨로지를 이용해서 교육 컨텐츠의 재사용성을 향상시켰고, 이산 확률 분포 함수와 동적 적응 모델을 이용해서 학습자에게 동적 컨텐츠를 제공할 수 있도록 하였다. 이 모델은 응용 영역을 동적 적응 객체의 가중치 방향성 그래프로 표현하며 사용자 행위를 이산 확률 함수를 동적으로 구축하는 접근 방식을 이용하여 모델링한다. 제안한 확률적 해석은 온톨로지 기반 환경에서 사용자의 탐색 행위를 추적하여 사용자 행위에 대한 잠재적 속성을 나타내는데 사용될 수 있다. 이러한 접근 방식은 사용자에게 가장 알맞은 프로파일을 동적으로 할당할 수 있다.

  • PDF

Optimizations of Multi-hop Cooperative Molecular Communication in Cylindrical Anomalous-Diffusive Channel

  • Xuancheng Jin;Zhen Cheng;Zhian Ye;Weihua Gong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권4호
    • /
    • pp.1075-1089
    • /
    • 2024
  • In this paper, the optimizations of multi-hop cooperative molecular communication (CMC) system in cylindrical anomalous-diffusive channel in three-dimensional enviroment are investigated. First, we derive the performance of bit error probability (BEP) of CMC system under decode-and-forward relay strategy. Then for achieving minimum average BEP, the optimization variables are detection thresholds at cooperative nodes and destination node, and the corresponding optimization problem is formulated. Furthermore, we use conjugate gradient (CG) algorithm to solve this optimization problem to search optimal detection thresholds. The numerical results show the optimal detection thresholds can be obtained by CG algorithm, which has good convergence behaviors with fewer iterations to achieve minimized average BEP compared with gradient decent algorithm and Bisection method which are used in molecular communication.