As one of the most simple and effective single image dehazing methods, the dark channel prior(DCP) algorithm has been widely applied. However, the algorithm does not work for pixels similar to airlight(e.g., snowy gro...As one of the most simple and effective single image dehazing methods, the dark channel prior(DCP) algorithm has been widely applied. However, the algorithm does not work for pixels similar to airlight(e.g., snowy ground or a white wall), resulting in underestimation of the transmittance of some local scenes. To address that problem, we propose an image dehazing method by incorporating Markov random field(MRF) with the DCP. The DCP explicitly represents the input image observation in the MRF model obtained by the transmittance map. The key idea is that the sparsely distributed wrongly estimated transmittance can be corrected by properly characterizing the spatial dependencies between the neighboring pixels of the transmittances that are well estimated and those that are wrongly estimated. To that purpose, the energy function of the MRF model is designed. The estimation of the initial transmittance map is pixel-based using the DCP, and the segmentation on the transmittance map is employed to separate the foreground and background, thereby avoiding the block effect and artifacts at the depth discontinuity. Given the limited number of labels obtained by clustering, the smoothing term in the MRF model can properly smooth the transmittance map without an extra refinement filter. Experimental results obtained by using terrestrial and underwater images are given.展开更多
A random allocation scheme for SDMA systems is proposed with a goal of more efficient dynamic allocation. Based on theoretical analysis and derivation, the blocking probability of the proposed scheme is calculated and...A random allocation scheme for SDMA systems is proposed with a goal of more efficient dynamic allocation. Based on theoretical analysis and derivation, the blocking probability of the proposed scheme is calculated and compared with those of the ftrst duplicate （FD） and duplicate last （DL） schemes with different state-independent probabilities （p,） of acquring a dupicate channel suecessfully and 5 resources; moreover, a more realistic performance analysis of the random scheme is made with state-dependent ps in the SDMA/CDMA environment. The results show that the random scheme has a similar allocation pefformace to the FD and DL schemes, but is simpler than them in computation and scheduling.展开更多
The truncated binary exponential back-off algorithm is one of the most effective methods applied in collision resolution process of random multi-access channel.In this study,two new strategies are presented to improve...The truncated binary exponential back-off algorithm is one of the most effective methods applied in collision resolution process of random multi-access channel.In this study,two new strategies are presented to improve the capability of the truncated binary exponential back-off algorithm.In the new strategies,the sizes of the initial window size or the operating window sizes are adjusted dynamically,which always bring a significant improvement for the self-adaptability of the original algorithm.A series of experiments are simulated and the results verify that the new strategies can make the implementation more stable and effective than the original algorithm.展开更多
Demand assignment MAC protocols have been used widely in wireless networks. It can effectively utilize wireless bandwidth. Some strategies can he used by demand assignment MAC protocols to further improve their effici...Demand assignment MAC protocols have been used widely in wireless networks. It can effectively utilize wireless bandwidth. Some strategies can he used by demand assignment MAC protocols to further improve their efficiency. The concept of transmit probability is introduced. This concept allows a request slot to be assigned to many different traffic classes at the same time. Based on it, the dynamic random channel reservation （DRCR） protocol is proposed. The DRCR protocol operates dynamically by observing the traffic conditions. It uses information about the recent traffic conditions to assign transmit probability with which an mobile station can select request slots with lower traffic. The performance of DRCR is evaluated and compared with RSCA. The results show that DRCR is more stable than RSCA, it offers shorter delays of requests than RSCA and can relieve heavily stressed traffic classes faster than RSCA.展开更多
Random Access Channel (RACH) is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless communi...Random Access Channel (RACH) is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless communication system. In this paper, a dynamical RACH allocation scheme is proposed for Orthogonal Frequency-Division Multiple Access (OFDMA) systems. Based on the Pseudo-Bayesian algorithm, this mechanism predicts the number of RACHs for the next frame according to the current load. A new dynamic RACH assignment algorithm and an adaptive access probability method are adopted by the proposed scheme to improve the utilization ratio of RACH resources and increase the successful access rate. Numerical simulation shows that the proposed strategy achieves both improvement in the utilization ratio of RACHs and reduction in the access delay compared with other RACH allocation schemes.展开更多
Cloud computing involves remote server deployments with public net-work infrastructures that allow clients to access computational resources.Virtual Machines(VMs)are supplied on requests and launched without interacti...Cloud computing involves remote server deployments with public net-work infrastructures that allow clients to access computational resources.Virtual Machines(VMs)are supplied on requests and launched without interactions from service providers.Intruders can target these servers and establish malicious con-nections on VMs for carrying out attacks on other clustered VMs.The existing system has issues with execution time and false-positive rates.Hence,the overall system performance is degraded considerably.The proposed approach is designed to eliminate Cross-VM side attacks and VM escape and hide the server’s position so that the opponent cannot track the target server beyond a certain point.Every request is passed from source to destination via one broadcast domain to confuse the opponent and avoid them from tracking the server’s position.Allocation of SECURITY Resources accepts a safety game in a simple format as input andfinds the best coverage vector for the opponent using a Stackelberg Equilibrium(SSE)technique.A Mixed Integer Linear Programming(MILP)framework is used in the algorithm.The VM challenge is reduced by afirewall-based controlling mechanism combining behavior-based detection and signature-based virus detection.The pro-posed method is focused on detecting malware attacks effectively and providing better security for the VMs.Finally,the experimental results indicate that the pro-posed security method is efficient.It consumes minimum execution time,better false positive rate,accuracy,and memory usage than the conventional approach.展开更多
We present a coherent and systematic review of Random Access Algorithms for packet networks, as developed over three and a half decades. We consider the appropriate user models and we classify the algorithms according...We present a coherent and systematic review of Random Access Algorithms for packet networks, as developed over three and a half decades. We consider the appropriate user models and we classify the algorithms according to the channel sensing constraints imposed. We also present a review of the analytical methodologies required for the performance analysis of these algorithms.展开更多
Rate adaptation is an effective approach to achieve high spectrum efficiency under varying channel condition, especially for wireless communication. This paper proposes rate adaptation at receiver for wireless relay s...Rate adaptation is an effective approach to achieve high spectrum efficiency under varying channel condition, especially for wireless communication. This paper proposes rate adaptation at receiver for wireless relay system. In this scheme, source node uses a new modulation technology, called random projections code (RPC), to achieve rate adaptation. Both relay node and destination node decode the received RPC encoding signals. If destination does not decode RPC correctly, relay node will act compressing and forwarding role by performing LDPC syndrome encoding and sending syndrome coded information to destination node. We discuss how to jointly decode at destination node when it receives RPC coded information from source node and syndrome coded information from relay node. Finally, we evaluate the scheme by bit-error-rate (BER) and good put evaluation metrics. Simulation results show that the coding gain is about 4 dB, 3.1 dB, 2.2 dB and 1.6 dB for LDPC coding rate 0.8, 0.89, 0.94, 0.99 at BER 10-5 respectively. The throughput of the schemes is at least 0.3 bit/s/Hz higher than RPC at SNR ranging from 5 dB to 25 dB.展开更多
基金supported by the National Natural Science Foundation of China (No.61571407)。
文摘As one of the most simple and effective single image dehazing methods, the dark channel prior(DCP) algorithm has been widely applied. However, the algorithm does not work for pixels similar to airlight(e.g., snowy ground or a white wall), resulting in underestimation of the transmittance of some local scenes. To address that problem, we propose an image dehazing method by incorporating Markov random field(MRF) with the DCP. The DCP explicitly represents the input image observation in the MRF model obtained by the transmittance map. The key idea is that the sparsely distributed wrongly estimated transmittance can be corrected by properly characterizing the spatial dependencies between the neighboring pixels of the transmittances that are well estimated and those that are wrongly estimated. To that purpose, the energy function of the MRF model is designed. The estimation of the initial transmittance map is pixel-based using the DCP, and the segmentation on the transmittance map is employed to separate the foreground and background, thereby avoiding the block effect and artifacts at the depth discontinuity. Given the limited number of labels obtained by clustering, the smoothing term in the MRF model can properly smooth the transmittance map without an extra refinement filter. Experimental results obtained by using terrestrial and underwater images are given.
文摘A random allocation scheme for SDMA systems is proposed with a goal of more efficient dynamic allocation. Based on theoretical analysis and derivation, the blocking probability of the proposed scheme is calculated and compared with those of the ftrst duplicate （FD） and duplicate last （DL） schemes with different state-independent probabilities （p,） of acquring a dupicate channel suecessfully and 5 resources; moreover, a more realistic performance analysis of the random scheme is made with state-dependent ps in the SDMA/CDMA environment. The results show that the random scheme has a similar allocation pefformace to the FD and DL schemes, but is simpler than them in computation and scheduling.
基金This work was supported by the National Natural Science Foundation of China(No.10371097).
文摘The truncated binary exponential back-off algorithm is one of the most effective methods applied in collision resolution process of random multi-access channel.In this study,two new strategies are presented to improve the capability of the truncated binary exponential back-off algorithm.In the new strategies,the sizes of the initial window size or the operating window sizes are adjusted dynamically,which always bring a significant improvement for the self-adaptability of the original algorithm.A series of experiments are simulated and the results verify that the new strategies can make the implementation more stable and effective than the original algorithm.
文摘Demand assignment MAC protocols have been used widely in wireless networks. It can effectively utilize wireless bandwidth. Some strategies can he used by demand assignment MAC protocols to further improve their efficiency. The concept of transmit probability is introduced. This concept allows a request slot to be assigned to many different traffic classes at the same time. Based on it, the dynamic random channel reservation （DRCR） protocol is proposed. The DRCR protocol operates dynamically by observing the traffic conditions. It uses information about the recent traffic conditions to assign transmit probability with which an mobile station can select request slots with lower traffic. The performance of DRCR is evaluated and compared with RSCA. The results show that DRCR is more stable than RSCA, it offers shorter delays of requests than RSCA and can relieve heavily stressed traffic classes faster than RSCA.
基金Acknowledgements This paper was supported by the National Natural Science Foundation of China under Cants No.60971125, No.61121001 the National Key Project under Cant No. 2011ZX03005-005+2 种基金 the project under Cant No. 201105.
Acknowledgements This paper was supported by the National Natural Science Foundation of China under Crants No.60971125, No.61121001 the National Key Project under Cant No. 2011ZX03005-005 the project under Cant No. 201105.
文摘Random Access Channel (RACH) is an uplink contention-based transport channel usually used for initial channel access, bandwidth request, etc. How to use RACH resources effectively is very important in wireless communication system. In this paper, a dynamical RACH allocation scheme is proposed for Orthogonal Frequency-Division Multiple Access (OFDMA) systems. Based on the Pseudo-Bayesian algorithm, this mechanism predicts the number of RACHs for the next frame according to the current load. A new dynamic RACH assignment algorithm and an adaptive access probability method are adopted by the proposed scheme to improve the utilization ratio of RACH resources and increase the successful access rate. Numerical simulation shows that the proposed strategy achieves both improvement in the utilization ratio of RACHs and reduction in the access delay compared with other RACH allocation schemes.
文摘Cloud computing involves remote server deployments with public net-work infrastructures that allow clients to access computational resources.Virtual Machines(VMs)are supplied on requests and launched without interactions from service providers.Intruders can target these servers and establish malicious con-nections on VMs for carrying out attacks on other clustered VMs.The existing system has issues with execution time and false-positive rates.Hence,the overall system performance is degraded considerably.The proposed approach is designed to eliminate Cross-VM side attacks and VM escape and hide the server’s position so that the opponent cannot track the target server beyond a certain point.Every request is passed from source to destination via one broadcast domain to confuse the opponent and avoid them from tracking the server’s position.Allocation of SECURITY Resources accepts a safety game in a simple format as input andfinds the best coverage vector for the opponent using a Stackelberg Equilibrium(SSE)technique.A Mixed Integer Linear Programming(MILP)framework is used in the algorithm.The VM challenge is reduced by afirewall-based controlling mechanism combining behavior-based detection and signature-based virus detection.The pro-posed method is focused on detecting malware attacks effectively and providing better security for the VMs.Finally,the experimental results indicate that the pro-posed security method is efficient.It consumes minimum execution time,better false positive rate,accuracy,and memory usage than the conventional approach.
文摘We present a coherent and systematic review of Random Access Algorithms for packet networks, as developed over three and a half decades. We consider the appropriate user models and we classify the algorithms according to the channel sensing constraints imposed. We also present a review of the analytical methodologies required for the performance analysis of these algorithms.
文摘Rate adaptation is an effective approach to achieve high spectrum efficiency under varying channel condition, especially for wireless communication. This paper proposes rate adaptation at receiver for wireless relay system. In this scheme, source node uses a new modulation technology, called random projections code (RPC), to achieve rate adaptation. Both relay node and destination node decode the received RPC encoding signals. If destination does not decode RPC correctly, relay node will act compressing and forwarding role by performing LDPC syndrome encoding and sending syndrome coded information to destination node. We discuss how to jointly decode at destination node when it receives RPC coded information from source node and syndrome coded information from relay node. Finally, we evaluate the scheme by bit-error-rate (BER) and good put evaluation metrics. Simulation results show that the coding gain is about 4 dB, 3.1 dB, 2.2 dB and 1.6 dB for LDPC coding rate 0.8, 0.89, 0.94, 0.99 at BER 10-5 respectively. The throughput of the schemes is at least 0.3 bit/s/Hz higher than RPC at SNR ranging from 5 dB to 25 dB.
