Chen S.,Nanjing University of Posts and Telecommunications |
Wu M.,Nanjing University of Posts and Telecommunications |
Wu M.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Lu W.,Nanjing University of Posts and Telecommunications
International Journal of Communication Systems | Year: 2012
The error control of random network coding has recently received a lot of attention because its solution can increase robustness and reliability of data transmission. To achieve this, additional overhead is needed for error correction. In this paper, we design a compressed error and erasure correcting scheme to decrease the additional overhead of error correction. This scheme reduces the computation overhead dramatically by employing an efficient algorithm to detect and delete linearly dependent received packets in the destination node. It also simplifies the hardware operations when the scheme reduces the received matrix Y to form E k(Y) instead of E(Y) in the decoding process. If at most r original packets get combined in k packets of one batch, the payload of one packet can increase from M - k to M - O(rlog qk) for the application of compressed code, where M is the packet length. In particular, the decoding complexity of compressed code is O(rm) operations in an extension field Fqm, which does not enhance the overall decoding complexity of the system. Finally, we also compare our scheme's performance with existing works. The numerical results and analyses illustrate the security and performance of our scheme. Copyright © 2011 John Wiley & Sons, Ltd.
Lin M.,PLA University of Science and Technology |
Lin M.,Nanjing Southeast University |
Ouyang J.,Nanjing University of Posts and Telecommunications |
Ouyang J.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
And 2 more authors.
IEEE Journal on Selected Areas in Communications | Year: 2016
In this paper, we address the issue of joint beamforming (BF) and power control for a device-to-device (D2D) communication underlaying cellular network, where the wireless channels of the D2D link and the base station to user equipment link experience Rician and correlated Rayleigh fading, respectively. Based on the property of the integral network, we first formulate a constrained optimization problem to minimize the total transmit power of the devices in the network, while meeting the qualityof- service requirement of both the D2D and cellular users and suppressing the mutual interference to a certain level. Then, by adopting the available statistical channel state information and proposing an approximation method to relax the constraints, a support-vector-machine-based algorithm is presented to solve the optimization problem for the transmit powers and BF weight vectors of each user. Furthermore, we derive the analytical expressions for the cumulative density function and the generalized moments of the output signal-to-interference-plus-noise ratios, thereby developing some novel theoretical formulas for the ergodic capacity and the average symbol error rate of each user in the network. Finally, computer simulation results are provided to demonstrate the validity and efficiency of the proposed scheme and its performance analysis. © 2015 IEEE.
Bao J.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Pan L.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Xie Y.,Nanjing University of Posts and Telecommunications
Proceedings of 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2016 | Year: 2016
BDI (Dry Baltic Index) is a barometer of the shipping market, which is very important and difficult to predict precisely. The traditional forecasting method is not enough to predict precisely for it with higher complexity. The support vector machine has strong nonlinear function approximation and strong generalization ability. In this paper, a new BDI forecasting model based on support vector machine combined with CFS(Correlation-based Feature Selection) is presented and we first introduce the macroeconomic fundamental indicators of BDI. Firstly, we studied and researched the main macroeconomic fundamental indicators of BDI, investigate the inherent law and external influence of freight index fluctuation, and then put forward the BDI forecasting model based on support vector machine and demonstrate the construction principle of the forecasting model. Finally, in order to evaluate the predictive power of support vector machines, we compare their performance with the neural network model. The results show that the SVM model has a better performance in both the trend and the forecast precision, which can provide a powerful tool for the shipping market operators and investors to grasp the market trend and avoid the price risk. © 2016 IEEE.
Liu L.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Liu L.,Nanjing University of Posts and Telecommunications |
Liu Q.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Liu Q.,Nanjing University of Posts and Telecommunications |
And 2 more authors.
Journal of Computational Information Systems | Year: 2013
Since radio communication can not work well underwater, there are still many difficulties and challenges for localization technology of underwater wireless sensor networks (UWSN). In order to improve the localization accuracy, we propose an Autonomous Underwater Vehicle (AUV) aided localization scheme for UWSN. The first positioning for unknown nodes should be completed, simultaneously, the localization accuracy of every unknown node is estimated based on the number, the distribution and the distance of neighboring beacon nodes. Accordingly, some nodes with lower accuracy are filtered out, then AUVs will move to suitable place and give assistance to the secondary positioning of these nodes. Both theoretical analysis and simulation results suggest that this scheme can improve the positioning accuracy effectively by the assistance of AUVs. Moreover, the computation and complexity of this scheme are proven preferable as well. © 2013 Binary Information Press.
Wang Z.,Nanjing University of Posts and Telecommunications |
Wang Z.,HIGH-TECH |
Wang Z.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Chen W.,Nanjing University of Posts and Telecommunications |
And 2 more authors.
Personal and Ubiquitous Computing | Year: 2013
Online/offline signature schemes allow one to quickly compute a digital signature from a precomputed coupon. In this paper, we present an ID-based online/offline signature for wireless sensor networks (WSNs), which is based on Hohenberger' RSA signature (Crypto 09). We argue that due to significant reduction in costs of computation and storage, our scheme is particularly suitable for the WSNs environment with severely constrained resources. Our scheme can be proved secure under the factoring assumption without random oracles. © 2012 Springer-Verlag London Limited.
Cao K.,Nanjing University of Posts and Telecommunications |
Cao K.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Yang Z.,Nanjing University of Posts and Telecommunications |
Yang Z.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology
Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument | Year: 2011
In this paper, a novel cooperative spectrum sensing algorithm based on the smallest eigenvalue (SE) of the received signal covariance matrix is presented. The SE scheme makes use of the probability distribution function of the smallest eigenvalue, which is much more accurate than that of the maximum eigenvalue; therefore, the proposed algorithm theoretically has stronger rationality, lower decision threshold and higher sensitivity compared with MED and ED schemes. In addition, numerical simulations also show that SE not only has lower probability of missing detection and better sensing performance, but also obtains higher detection performance with a few secondary users and samples.
Wu D.,PLA University of Science and Technology |
Cai Y.,PLA University of Science and Technology |
Zhou L.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Rodrigues J.,University of Beira Interior
GLOBECOM - IEEE Global Telecommunications Conference | Year: 2012
In this work, with respect to the uncertainty about the individual information, we investigate the relay power allocation problem from the energy-efficient, Pareto optimal, and competitive fairness perspective. At first, we design an easy-implementation energy efficiency metric, which aims at striking a balance between the QoS provisioning and the energy consumption. Then, an auction mechanism is proposed for relay power allocation. By transferring the auction mechanism into a game, we prove the existence, uniqueness, and Pareto optimality of the Nash equilibrium (NE) for our auction game, and show that the allocation strategies from the NE can achieve the energy efficiency in terms of the proposed metric. Next, we develop a distributed relay power allocation algorithm based on our best-response functions to reach the Pareto optimal NE. Importantly, we not only certify the convergence of the proposed algorithm, but also provide quantitative analysis on it. Extensive simulations results are conducted to confirm the validity of the analytical results. © 2012 IEEE.
Zhou L.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Wang H.,TCL Research America |
Guizani M.,Qatar University
IEEE Transactions on Communications | Year: 2012
In this work, we investigate the impact of mobility on video streaming over multi-hop wireless networks by utilizing a class of scheduling schemes. We show that node spatial mobility has the ability to improve video quality and reduce the transmission delay without the help of advanced video coding techniques. To describe a practical mobile scenario, we consider a random walk mobility model in which each node can randomly and independently choose its mobility direction, and all the nodes can identically and uniformly visit the entire network. The contributions of this work are twofold: 1) It studies the optimal node velocity for the mobile video system. In this case, it is possible to achieve almost constant transmission delay and video quality as the number of nodes increases; 2) It derives an achievable quality-delay tradeoff range for different node velocities. Therefore, it is helpful to shed insights on network design and fundamental guidelines on establishing an efficient mobile video transmission system. © 1972-2012 IEEE.
Zhou W.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Chen J.-X.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Wang L.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology
Proceedings of 2015 IEEE International Conference on Computer and Communications, ICCC 2015 | Year: 2015
Face recognition research mainly focuses on traditional 2D color images, which is extremely susceptible to be affected by external factors such as various viewpoints and has limited recognition accuracy. In order to achieve improved recognition performance, as well as the 3D face holds more abundant information than 2D, we present a 3D human face recognition algorithm using the Microsoft's Kinect. The proposed approach integrates the depth data with the RGB data to generate 3D face raw data and then extracts feature points, identifies the target via a two-level cascade classifier. Also, we build a 3D-face database including 16 individuals captured exclusively using Kinect. The experimental results indicate that the introduced algorithm can not only achieve better recognition accuracy in comparison to existing 2D and 3D face recognition algorithms when the probe face is exactly in front of Kinect sensor, but also can increase 9.3% of recognition accuracy compared to the PCA-3D algorithm when it is not confronting the camera. © 2015 IEEE.
Wang K.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology |
Guo H.,Key Laboratory of Broadband Wireless Communication and Sensor Network Technology
Wireless Personal Communications | Year: 2014
The routing efficiency in delay tolerant networks is degraded due to intermittent connection and high latency. Additionally, socially selfish nodes in social networks refuse to provide message forwarding service since there are limited resources. To solve these problems, an improved routing algorithm based on the social link awareness is proposed. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and increases the successful delivery ratio, thereby improving the routing efficiency. © 2013 Springer Science+Business Media New York.