• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.1-8
• /
• 2011

In this paper, we propose an effective method for cooperative spectrum sensing in cognitive radios where cognitive user(CR) with the highest reliability sensing data is only selected and allowed to report its local decision to FC as only decision making node. The proposed scheme enables CR users to implicitly compare their sensing data reliabilities based on their likelihood ratio, without any collaboration among cognitive radio users. Due to the mechanism, the proposed cooperative scheme can achieves a high spectrum sensing performance while only requiring extremely low cooperation resources such as signaling overhead and cooperative time in comparison with other existing methods such as maximum ratio combination (MRC) based, equal gain combination (EGC) based and conventional hard combination based cooperative sensing methods.

• Journal of Satellite, Information and Communications
• /
• v.7 no.1
• /
• pp.7-12
• /
• 2012

In this paper, we proposed spectrum sensing using cooperative relay to solve problem of sensing performance degradation due to CPE (Customer-Primise equipments) which causes low SNR (signal-to-noise ratio) problem. In cooperative communication system, AF (amplify-and-forward) and DF (decoded-and-forward) is widely used for relay mechanism. Also, it is expected that cooperative relay scheme guarantees the high sensing performance by its diversity gain. Based on these backgrounds, in this paper, we apply to cooperative relay scheme to the CR (cognitive radio) system, and simulation results show comparison of the sensing performance between AF and DF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2067-2080
• /
• 2016

Cooperative spectrum sensing (CSS) for vacant licensed bands is one of the key techniques in cognitive radio networks. Currently, sequential probability ratio test scheme (SPRT) is considered as a powerful soft decision approach to improve the sensing result for CSS. However, SPRT assumes all secondary users (SU) are honest, and thus offering opportunities for malicious SUs to launch the spectrum sensing data falsification attack (SSDF attack). To combat such misbehaved behaviors, recent efforts have been made to trust mechanism. In this paper, we argue that powering SPRT with traditional trust mechanism is not enough. Dynamic SSDF attackers can maintain high trust in an alternant process of submitting honest or false sensing data, resulting in difficultly detecting them. Noting that the trust value of dymamic SSDF attackers behave highly volatile, a novel trusted SPRT scheme (VSPRT) based on volatility decay analysis is proposed in this paper to mitigate the harmful effect of dynamic SSDF attackers in the process of the soft-decision data fusion, and thus improving the accuracy of the final sensing result. Simulation results show that the VSPRT scheme outperforms the conventional SPRT schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4572-4586
• /
• 2019

Mobile Edge Computing (MEC) and Information-Centric Networking (ICN) are essential network architectures for the future Internet. The advantages of MEC and ICN such as computation and storage capabilities at the edge of the network, in-network caching and named-data communication paradigm can greatly improve the quality of video streaming applications. However, the packet loss in wireless network environments still affects the video streaming performance and the existing loss recovery approaches in ICN does not exploit the capabilities of MEC. This paper proposes a Deep Learning based Loss Recovery Mechanism (DL-LRM) for video streaming over MEC based ICN. Different with existing approaches, the Forward Error Correction (FEC) packets are generated at the edge of the network, which dramatically reduces the workload of core network and backhaul. By monitoring network states, our proposed DL-LRM controls the FEC request rate by deep reinforcement learning algorithm. Considering the characteristics of video streaming and MEC, in this paper we develop content caching detection and fast retransmission algorithm to effectively utilize resources of MEC. Experimental results demonstrate that the DL-LRM is able to adaptively adjust and control the FEC request rate and achieve better video quality than the existing approaches.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.114-121
• /
• 2010

In this paper, an auctioning strategy is proposed for cellular networks that ensures net energy savings. The pricing scheme, in conjunction with a two dimensional bid structure, incentivizes cooperation at the terminal nodes for better interference management at receivers and for cooperative relaying. It is shown that, for the proposed auctioning strategy, network operators are guaranteed revenue gains, mobile nodes' dominant strategy is to bid their true valuation of their energy resources, and overall effective energy gains occur under the assumption of a reserve price for bidding. Simulation results show that significant energy savings can be achieved by employing this auctioning mechanism for a 3G cellular set-up.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4483-4501
• /
• 2015

In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper. While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message. The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques. The benefit of the proposed scheme is showed in simulation results.

• Bulletin of the Korean Chemical Society
• /
• v.29 no.12
• /
• pp.2528-2530
• /
• 2008

• Bulletin of the Korean Chemical Society
• /
• v.21 no.12
• /
• pp.1217-1221
• /
• 2000

L-alanine dehydrogenase from Bacillus subtilis exhibits allosteric kinetic properties in the presence of $ZN^{2+}$. $ZN^{2+}$ induces the binding of substrate (L-alanine) to be cooperative at pH 8.0. The effect of pH variation between pH 7.0 and pH 10.0 on the inhibition by $ZN^{2+}$ correlates with the pH effect on the $K_m$ values for L-alanine within these pH range indicating that $ZN^{2+}$ and substrate compete for the same site. No such cooperativity is induced by $ZN^{2+}$ when the reaction is carried out at pH 10. At this higher pH, $ZN^{2+}$ binds with the enzyme with lower affinity and noncompetitive with respect to L-alanine. Inhibition of L-alanine dehydrogenase by $ZN^{2+}$ depends on the ionic strength. Increase in KCI concentration reduced the inhibition, but allosteric property in $ZN^{2+}$ binding is conserved. A model for the regulatory mechanism of L-alanine dehydrogenase as a noncooperative substrate-cooperative cofactor allosteric enzyme, which is compatible in both concerted and the sequential allosteric mechanism, is proposed.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.528-535
• /
• 2009

This paper proposes a mechanism to increase performance using cooperative communications in IEEE 802.11 environment. Existing algorithms use one relay between a source and a destination, which is a 2 hop relay. The proposed algorithm utilizes more than one relay to complement inefficiency of using one relay. In the proposed mechanism, an AP manages network information (rate), which is used to select relays of a source by the AP. The AP notifies the selected relays to the source and neighbor nodes, and the source transmits data to the relays for cooperative communications. Moreover, relays are given to have an opportunity to send its own data right after relaying the source's data. So relays are compensated for the power to send the source's data and overall throughput is improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2286-2309
• /
• 2016

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.