Entity

Time filter

Source Type


Wu X.,Zhejiang University of Technology | Meng L.,Zhejiang Provincial Optical Communication Key Laboratory | Hua J.,Zhejiang Provincial Optical Communication Key Laboratory | Zhou M.,Zhejiang University of Technology | Zhou K.,Zhejiang University of Technology
Chinese Journal of Sensors and Actuators | Year: 2011

Wireless Sensor Networks(WSN)is a hot spot of the research of wireless networks currently, the key of achieving efficient transmission business is to control node energy and improve the network lifetime in wireless sensor networks. The paper first uses Boolean sensing model based on Poisson point process to identify the function of the rate of coverage and the node density in unit area, and then calculates the total number of nodes in the region, next uses the greedy strategy of the Prim algorithm to find a spanning tree with the maximum weight, and constructs an approximate solution for the minimum connected dominating set. In order to control the commotions of the nodes,make the nodes in spanning tree to work,and other nodes are in sleep state. At last, we analyse the relationship between the number of nodes in connected dominating and the coverage radius. Source


Meng L.-M.,Zhejiang University of Technology | Meng L.-M.,Zhejiang Provincial Optical Communication Key Laboratory | Shen X.-Y.,Zhejiang University of Technology | Shen X.-Y.,Zhejiang Provincial Optical Communication Key Laboratory | And 2 more authors.
2010 IEEE International Conference on Wireless Information Technology and Systems, ICWITS 2010 | Year: 2010

This paper puts forward a routing algorithm based on Grover searching theory for MANET. It first gives the Grover searching theory and the construction way of probability branch matrix and solution path matrix which are suitable for MANET. And then, on this basis, define probability computation equation to compute each node's probability. Select nodes with high probability to transmit datagram to reduce computation quantity in networks and make the routing converge quickly. © 2010 IEEE. Source


Wu X.,Zhejiang University of Technology | Zhou M.,Zhejiang University of Technology | Zhou K.,Zhejiang University of Technology | Zhou K.,Zhejiang Provincial Optical Communication Key Laboratory | And 2 more authors.
Chinese Journal of Sensors and Actuators | Year: 2010

Mobile Ad hoc network is currently a hotspot in the international wireless network researching domain. The study of routing model is always an important component in the research of Ad Hoc network. Stability and lifetime are two key elements to judge the quality of a routing protocol. Combining with the idea of minimum cost maximum flow in the network, a routing optimization model base on the link stable model is put forward. First, a network routing model is set up based on lifetime through prediction of mode movement. Then, the maximum lifetime for minimum hop model is set up with regarding hops between nodes as network cost and lifetime as network flow. Finally network stability is defined as an evaluating indicator to do network simulations. Results of simulations show that this model can increase network stability. Source


Meng L.,Zhejiang University of Technology | Meng L.,Zhejiang Provincial Optical Communication Key Laboratory | Zhou K.,Zhejiang University of Technology | Zhou K.,Zhejiang Provincial Optical Communication Key Laboratory | And 4 more authors.
Chinese Journal of Sensors and Actuators | Year: 2010

Ad Hoc networks is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. After analyzing the drawbacks of the existing algorithms, this paper puts forward a routing algorithm based on the idea of quantum Grover algorithm. First, this paper explains the principle of Grover algorithm, and gives the way to construct probability branch matrix and solution-path matrix which are fit for Ad Hoc networks. On that basis, it defines probability computational formula to compute the probability of each node. In the process of routing searching, we select nodes with high probability to forward data packets. Results of simulation show that comparing with DSR, performance of routing hops simulated with this algorithm is close to the minimum number of hops, while, number of relay nodes is reduced significantly in the process of routing setup. Source


Meng L.-M.,Zhejiang University of Technology | Meng L.-M.,Zhejiang Provincial Optical Communication Key Laboratory | Wu Y.-F.,Zhejiang University of Technology | Wu Y.-F.,Zhejiang Provincial Optical Communication Key Laboratory | And 4 more authors.
2010 International Conference on Wireless Communications and Signal Processing, WCSP 2010 | Year: 2010

Ad Hoc networks is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. In response to the drawbacks of traditional routing protocols such as bad convergence and providing no QoS guarantee, this paper gives the way to construct node vector function to represent QoS indices in networks. And then combining the idea of Grover quantum searching and DSR protocol, it puts forward a MANET routing model based on Quantum search algorithm. In the process of routing, this algorithm gets node probability vector by Grover computation on node vector function in networks. Results of simulation show that comparing with DSR protocol, routing algorithm based on Quantum search algorithm can converge quickly and provide QoS guarantee, which fills up the deficiency of the exiting algorithm. ©2010 IEEE. Source

Discover hidden collaborations