Search

The joint scheduling of multi energy micro energy network group can effectively absorb the residual heat of electricity in each sub micro network through the characteristics of energy substitutability and multi-agent interaction. However, the complex relationship of multi energy interaction brings difficulties to joint scheduling. In order to minimize the operating cost of the system, this paper establishes a day ahead optimal scheduling model of multi energy micro grid group of cooling, heating and power considering the consumption of clean energy. Through thejoint scheduling of micro grid group, it can promote the consumption of residual heat in the sub micro grid. Finally, in an example, by optimizing the operation of a multi-functional microgrid group, the mechanism of joint scheduling of multifunctional microgrid group is analyzed, and the effectiveness of the optimization operation model proposed in this paper is verified.

As China’s environment and climate problems become more and more serious, the integrated energy system is booming. However, the coupling between various systems is not strong, and it is urgent to increase the coupling between multiple systems. Taking the total cost of the integrated energy system as the objective function, the independent operation and coupling transformation of the power system, natural gas system and thermal system within the system are considered. In this paper, a system planning model is built to meet the three types of loads in the system: electric load, thermal load and gas load, so as to increase the coupling of the system, ensure the reliable operation of the integrated energy system and improve the energy utilization efficiency.

In this paper, we studied a hybrid wireless network including UWB devices and WiFi devices together and analyze the characteristics of selfish behavior and the methods how to expose it. In order to improve the self-giving cooperation between the nodes in hybrid wireless networks and increase the fairness index of the whole networks, a security mechanism was proposed in this paper. The punishment mechanism was used both in a common control channel and a data channel. The results of stimulations show that the proposed protocol improves the self-giving cooperation between nodes in the networks and make the interference of the network minimum. Index Terms - security protocol, UWB, WiFi, interference

A new method is presented for scale invariant target recognition under non-uniform illumination and noisy conditions. Both overlapping additive noise and nonoverlapping background noise are considered. The method includes two steps. First, the input scene is preprocessed with estimated illumination function. Then an optimum correlation filter is designed based on modified Wiener filter(WF) model, which the reference term of WF’s transfer function is synthesized using the mean of training images . Simulation results verify the effectiveness of the proposed idea in terms of tolerance to scale distortion in presence of non-uniform illumination and noise.

As one type of the attacks happening in MAC layer of distributed cognitive radio networks, a selfish behavior can degrade network performance significantly. In this paper, we analyze the characteristics of selfish behavior and the methods how to expose it. In order to improve the self-giving cooperation between the nodes in cognitive radio networks and increase the fairness index of the whole networks, a rigorous punishment mechanism based on a puzzle model was proposed in this paper. The punishment mechanism was used both in a common control channel and a data channel. The results of stimulations show that the proposed punishment mechanism increases the fairness index of the cognitive radio networks and improves the self-giving cooperation between nodes in the networks.

A novel algorithm is presented for detecting a target placed in background and degraded by non-uniform illumination and additive noise. The algorithm includes two steps. First, the input scene is preprocessed with estimated illumination function. Then the processed scene is correlated with a designed optimum filter based on Wiener filtering. Simulation results show effectiveness of the proposed method in terms of the robustness to non-uniform illumination and noisy conditions.

Selfish behavior is one type of the attacks happening in MAC layer of distributed cognitive radio networks. In this paper, we analyze the characteristics of selfish behavior and the methods to expose it. In order to improve the self-giving cooperation between the nodes in Cognitive Radio Networks (CRNs) and increase the fairness index of the whole networks, this paper proposed a rigorous punishment mechanism based on a puzzle model. The results of stimulations show that the proposed punishment mechanism increases the fairness index of the cognitive radio networks and improves the self-giving cooperation between nodes in CRNs.

This paper investigates the QoS routing in TDMA/CDMA ad hoc networks. Since the network topology may constantly change and the available bandwidth is very limited in ad hoc networks, it's quite often to see a call is blocked when a path with required bandwidth cannot be found in the system. Therefore, we try to find multiple paths whose aggregated bandwidth can meet the bandwidth requirement and whose delays are within the required delay bound and then use the multiple paths in parallel for the QoS transmission of the call. This QoS routing we proposed can significantly reduce the system blocking probability and thus make a better use of network resources. We discuss the process of searching multiple parallel paths and proposed three heuristics (according to three parameters: property of maximum bandwidth, property of shortest path, property of maximum ratio of bandwidth to hops) to choose a group of paths whose total bandwidth satisfies the requirement. Some simulations have been conducted and the simulation results have demonstrated the deference of blocking rates gained by using the proposed three heuristics and also shown the proposed algorithms out-perform one existent on-demand algorithm.

This paper proposes a QoS routing with delay constrained and bandwidth guaranteed in TDMA/CDMA ad hoc networks. Because the wireless bandwidth is shared among adjacent nodes and the network topology changes as the nodes move, quality of service is more difficult to guarantee in ad hoc networks than in most other type of networks. QoS routing requires finding not only a route from a source to a destination, but also a route that satisfies the end-to-end QoS requirement, often given in terms of bandwidth or delay. We improve a distributed algorithm to realize the control of delays and give the method to calculate the bandwidth of a path that can be used to judge whether the bandwidth of the path satisfies the requirement. In TDMA/CDMA ad hoc networks, this is a new scheme to satisfy not only delay constrained but also bandwidth guaranteed. Some simulations have been conducted and the simulation results have demonstrated the deference of call success rate between our algorithm and other existing global algorithm or other localized algorithms that only consider delay constrained or bandwidth guaranteed.