Guangshun Li

Learn More
The design of routing protocols for Underwater Acoustic Sensor Networks (UASNs) posesmany challenges due to long propagation, highmobility, limited bandwidth, multi-path and Doppler effect. Because of the void-hole caused by the uneven distribution of nodes and sparse deployment, the selection of next hop forwarding nodes only based on the state of current(More)
Discrete beeping is an extremely rigorous local broadcast model depending only on carrier sensing. It describes an anonymous broadcast network where the nodes do not need unique identifiers and have no knowledge about the topology and size of the network. Within such a model, time is divided into slots, and nodes can either beep or keep silent at each slot.(More)
Global broadcasting is a fundamental problem in wireless multi-hop networks. In this paper, we propose two distributed deterministic algorithms for global broadcasting based on the Signal-to-Interference-plus-Noise-Ratio (SINR) model. In both algorithms, an arbitrary node can become the source node, and the rest of the nodes are divided into different(More)
A new model K*TDG is proposed in this paper to solve the problem of complex data flow decomposing and exploring, where k indicates the compactness of the system parameters. In the following, the attributes of K*TDG and its primary operations are discussed, and a decomposing and exploring algorithm is proposed. In order to decrease the algorithm complexity,(More)
Correct verification is necessary at every design stage of a complex digital system. TED (Tayor Expansion Diagram) can be used not only to bit-level logical function but also to word-level arithmetic function. The method of equivalence checking based on TED is discussed in this paper, then a verifying algorithm for circuit including black box is proposed.(More)
The definition of term dependent graph (TDG) is expanded in this paper, and the connectivity of TDG is discussed. A complex data flow matching (CDFM) algorithm based on TDG is proposed. In order to decrease the algorithm complexity, a grouping strategy on the degree of the polynomial of complex components is proposed. The experiment results indicate that(More)
The theories about TED (Taylor expanded diagrams) are expanded and definitions of equivalent TED and utmost equivalent TED are depicted in this paper. Then hardware implement sharing methods of multi-objective functions based on TED are given. In the following equivalent TED decision (ETD) algorithm and utmost equivalent TED finding (UETF) algorithm are(More)
A new method that integrated high level synthesis and floorplan are proposed to reduce the total power dissipation. Function units are sorted into several clusters according to their working voltages. Floorplan are executed with the information of cluster gained from high level synthesis, and then the high level synthesis resolutions are adjusted(More)
Power analysis attacks have attracted significant attention within the cryptographic community. Power analysis attack methods for encryption circuits are being discussed. Unique masking method (UMM) are being discussed, point out it is vulnerable to higher-order differential power analysis. Propose a new method which uses dynamic current model logic (DCML)(More)
Taylor expansion diagram (TED) is a compact, canonical, world level graph-based representation, and it can effectively express multi-variate polynomial. In this paper, variable replacement algorithm and variable mergence algorithm for TED are presented. Based on variable replacement algorithm, variable ordering algorithm and variable merging algorithm, an(More)
  • 1