Nan Wang's research while affiliated with Northeastern University (Shenyang, China) and other places

Publications (4)

Article
Full-text available
Coded caching is a promising method for solving caching problems in content-centric wireless networks. To enhance the security of coded caching for practical purposes, this paper investigates a secure coded caching scheme for defending against an eavesdropper who may possess prior knowledge before eavesdropping on content delivery. A novel key-base...
Article
Full-text available
Dynamic resource control and routing are important for realising the intelligent control of data transmission in wireless multi‐hop networks. It is well known that back‐pressure routing based on a max‐weight policy maximises network throughput and optimises resource allocation in multi‐hop wireless networks with time‐varying channels. Due to the sl...
Article
Full-text available
Owing to the limited network resources in ad hoc networks, improving network throughput is the key to solve network congestion and increase network transmission efficiency. Back‐pressure routeing, as an optimal routeing strategy for throughput, has recently received substantial attention for joint routeing and scheduling over multi‐hop wireless net...
Article
Full-text available
Mobile ad hoc networks (MANETs) are attractive for many applications because of their easy‐to‐use and self‐organising nature. However, the routing overhead problem has always been a bottleneck restricting the development of MANETs technology. The reason behind is the traditional blind flooding methods and frequent route initiations caused by node m...

Citations

... The w c (x, y) (t) denotes the Backpressure weight on the link (x, y), which is the maximum weight assigned to the link (x, y) at the time slot t, i.e., W (x, y) (t) = max c∈N w c (x, y) (t). The packets are scheduled for flow c only when the device c attains the maximum weight on the activated link [49]. In this way, the maximum weight on the link (x, y) can be defined as below: ...
... A distributed dynamic routing algorithm was designed in [16] to create an efficient routing mechanism based on mobility of nodes. However, the designed routing algorithm has some defects in terms of delay and packet loss rate. ...