The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by a set of public benchmark problem...
Spectrum sensing is a fundamental problem in cognitive radio. As a result, it has been reborn as a very active research area in recent years despite its long history. Although various sensing methods have been proposed, their robustness at very low signal-to-noise ratio (SNR) and uncertain noise/interference environment is generally not satisfactory. In this paper, the concept of robust sensing is...
Spectrum sensing is a fundamental problem in cognitive radio. As a result, it has been reborn as a very active research area in recent years despite its long history. Although various sensing methods have been proposed, their reliability at very low signal-to-noise ratio (SNR) and noise/interference varying environment remains to be investigated. In this paper, the noise power and interference uncertainty...
We adopt the auction mechanisms into the dynamic channel allocation of cognitive radio networks. Under auction schemes, users bid the transmission time slots to gain access to the licensed channel. Their bids accumulate throughout the repeated bidding process over time, and they pay the "bill" at the end of the time frame in the form of out-band sensing. By doing so, we allocate the channel...
This paper describes 3-stage and 4-stage pipeline MD5 implementations on FPGA. This work removes the data dependency of a single step inside the main loop of the MD5 algorithm by data forwarding methodology, and breaks that single step computation into 3/4 pipeline stages. Three implementations on Xilinx Vertex-II are given with the throughput get to 1.04 Gbps, and occupy 1064 hardware slices. Thus,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.