Bu Zhiyong

A dynamic shortest path weighted routing mechanism for MANET based on complex network theory

In this paper, a dynamic shortest path weighted routing mechanism applying to mobile ad hoc networks is proposed based on the complex network theory. This weight routing mechanism uses node energy and link distance which are the two most important factors affecting the performance of mobile ad hoc networks to structure the weights of edges. The routing process presented by this paper uses a mixed mode based on local search and global information. The simulation results shows that the routing mechanism not only can select the more energy nodes to transmit data effectively, but also can balance the relationship between the length of the path and the transmission cost, disperse transmit load of nodes and lengthen the running time of network.

An adaptive massive access management for M2M communications in smart grid

Smart grid is an emerging technology which is designed to integrate advanced communication technologies into electrical power grids. In smart grid, automatic communications between machine devices is necessary. The number of Machine-Type Communication (MTC) devices will increase exponentially as smart grid technologies are further developed and deployed. It is a critical issue to deal with the massive accesses from an enormous number of MTC devices while guarantee the desired quality of service (QoS). In this paper, we formulate this problem as a queuing problem. Then we propose an adaptive massive access management by applying a probability estimation measurement, which is based on large deviation theory. The results demonstrate that our algorithm can adaptively adjust allocation rate and provide a better QoS. The results also show that our algorithm can improve the spectral efficiency.