Ya-li WANG , Mei SONG , Yi-fei WEI , Ying-he WANG , Xiao-jun WANG
{"title":"Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks","authors":"Ya-li WANG , Mei SONG , Yi-fei WEI , Ying-he WANG , Xiao-jun WANG","doi":"10.1016/S1005-8885(14)60267-3","DOIUrl":"10.1016/S1005-8885(14)60267-3","url":null,"abstract":"<div><p>In order to establish a route supporting multi-constrained quality of service (QoS), increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm (IAMQER) is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 43-53, 59"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60267-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90141847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sensor data compression based on MapReduce","authors":"Yu YU, Zhong-wen GUO","doi":"10.1016/S1005-8885(14)60269-7","DOIUrl":"10.1016/S1005-8885(14)60269-7","url":null,"abstract":"<div><p>A compression algorithm is proposed in this paper for reducing the size of sensor data. By using a dictionary-based lossless compression algorithm, sensor data can be compressed efficiently and interpreted without decompressing. The correlation between redundancy of sensor data and compression ratio is explored. Further, a parallel compression algorithm based on MapReduce [1] is proposed. Meanwhile, data partitioner which plays an important role in performance of MapReduce application is discussed along with performance evaluation criteria proposed in this paper. Experiments demonstrate that random sampler is suitable for highly redundant sensor data and the proposed compression algorithms can compress those highly redundant sensor data efficiently.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 60-66"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60269-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75673182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jing LIU , Guo-sheng XU , Shi-hui ZHENG , Da XIAO , Li-ze GU
{"title":"Data streams classification with ensemble model based on decision-feedback","authors":"Jing LIU , Guo-sheng XU , Shi-hui ZHENG , Da XIAO , Li-ze GU","doi":"10.1016/S1005-8885(14)60272-7","DOIUrl":"10.1016/S1005-8885(14)60272-7","url":null,"abstract":"<div><p>The main challenges of data streams classification include infinite length, concept-drifting, arrival of novel classes and lack of labeled instances. Most existing techniques address only some of them and ignore others. So an ensemble classification model based on decision-feedback (ECM-BDF) is presented in this paper to address all these challenges. Firstly, a data stream is divided into sequential chunks and a classification model is trained from each labeled data chunk. To address the infinite length and concept-drifting problem, a fixed number of such models constitute an ensemble model <em>E</em> and subsequent labeled chunks are used to update <em>E</em>. To deal with the appearance of novel classes and limited labeled instances problem, the model incorporates a novel class detection mechanism to detect the arrival of a novel class without training <em>E</em> with labeled instances of that class. Meanwhile, unsupervised models are trained from unlabeled instances to provide useful constraints for <em>E</em>. An extended ensemble model <em>E<sub>x</sub></em> can be acquired with the constraints as feedback information, and then unlabeled instances can be classified more accurately by satisfying the maximum consensus of <em>E<sub>x</sub></em>. Experimental results demonstrate that the proposed ECM-BDF outperforms traditional techniques in classifying data streams with limited labeled data.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 79-85"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60272-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77226751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cong GUO, Zi-jian ZHANG, Lie-huang ZHU, Yu-an TAN, Zhen YANG
{"title":"A novel secure group RFID authentication protocol","authors":"Cong GUO, Zi-jian ZHANG, Lie-huang ZHU, Yu-an TAN, Zhen YANG","doi":"10.1016/S1005-8885(14)60274-0","DOIUrl":"10.1016/S1005-8885(14)60274-0","url":null,"abstract":"<div><p>The trend of researching group radio frequency identification devices (RFID) authentication protocol has become increasingly popular in recent years. One of the newest work in this area is from Batina and Lee, they presented a privacy-preserving multi-players grouping-proof protocol based on the elliptic curve cryptography (ECC), and claimed their protocol have the ability to resist five potential attacks, including compromised tag attack, man-in-the-middle attack, colluding tags attack, etc.</p><p>In this paper, we first take a counterexample to demonstrate their protocol is vulnerable to compromised tag attack. Then we propose a novel secure RFID authentication protocol, and analyze its security by merging formal analysis, provable security, and mathematical inductive method, so as to solve the weakness of Batina and Lee's work. Furthermore, compared with another two classic protocols (secure ownership transfer protocol (SOTP) and secure multiple group ownership transfer protocol (SMGOTP)), the performance analysis show that our protocol provides not only a lower tags' communication cost at about 50.0% and 14.3%, but also a lower reader's computation cost (approximate 14.5% and 55.1% respectively), when transferring a large number of tags.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 94-103"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60274-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81899965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved side information generation algorithm for Wyner-Ziv video coding","authors":"Deng-yin ZHANG , Yuan-yuan WU , Ming-xiang WAN","doi":"10.1016/S1005-8885(14)60276-4","DOIUrl":"10.1016/S1005-8885(14)60276-4","url":null,"abstract":"<div><p>Side information has a significant influence on the rate-distortion (RD) performance of distributed video coding (DVC). In the conventional motion compensated frame interpolation scheme, all blocks adopt the same side-information generation method regardless of the motion intensity inequality at different regions. In this paper, an improved method is proposed. The image blocks are classified into two modes, fast motion and slow motion, by simply computing the discrete cosine transformation (DCT) coefficients at the encoder. On the decoder, it chooses the direct interpolation and refined motion compensated interpolation correspondingly to generate side information. Experimental results show that the proposed method, without increasing the encoder complexity, can increase the average peak signal-to-noise ratio (PSNR) by up to 1∼ 2 dB compared with the existing algorithm. Meanwhile, the proposed algorithm significantly improves the subjective quality of the side information.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 109-115"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60276-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73178160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"3D-MIMO codebook aided multiple user pairing scheme in LTE-Advanced systems","authors":"Fei PENG, Ying WANG, Wei-dong ZHANG, Yuan YUAN","doi":"10.1016/S1005-8885(14)60261-2","DOIUrl":"10.1016/S1005-8885(14)60261-2","url":null,"abstract":"<div><p>Two-dimensional (2D) multiple-input multiple-output (MIMO) is currently concentrated on propagation in horizontal plane, but the impact of elevation angle is not considered. However, due to the three-dimensional (3D) character of the real MIMO channel, 2D MIMO cannot achieve the optimal system throughput. A multiple-user MIMO (MU-MIMO) user pairing scheme was proposed, in which the vertical dimension was taken into consideration. In the proposed scheme, a 3D codebook based on full dimension MIMO channel was designed; then two 3D MU-MIMO user's pairing schemes are proposed combining the proposed joint and separate 3D codebook. Simulation evaluates the proposed 3D codebook aided user pairing scheme and compares with the previous 2D MU-MIMO user pairing technology. Owing to the additional spatial degree of freedom in vertical dimension, the proposed 3D MU-MIMO user pairing schemes can effectively improve the overall system performance.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 1-9"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60261-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72500768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiu-juan DU , Ke-jun HUANG , Sheng-lin LAN , Zhen-xing FENG , Fan LIU
{"title":"LB-AGR: level-based adaptive geo-routing for underwater sensor network","authors":"Xiu-juan DU , Ke-jun HUANG , Sheng-lin LAN , Zhen-xing FENG , Fan LIU","doi":"10.1016/S1005-8885(14)60268-5","DOIUrl":"10.1016/S1005-8885(14)60268-5","url":null,"abstract":"<div><p>Underwater sensor network (UWSN) adopts acoustic communication with more energy-consumption and longer propagation-delay, which bring great challenges to protocol design. In this paper, we proposed level-based adaptive geo-routing (LB-AGR) protocol. LB-AGR divides traffics into four categories, and routes different types of traffic in accordance with different decisions. Packets upstream to the sink are forwarded unicast to the best next-hop instead of broadcasting to all neighbor nodes as in present UWSN routing protocols. LB-AGR defines an integrated forwarding factor for each candidate node based on available energy, density, location, and level-difference between neighbor nodes, which is used to determine the best next-hop among multiple qualified candidates. Through simulation experiments, we show the promising performance of LB-AGR.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 54-59"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60268-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83663025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wei-jie GUO , Liu-sheng HUANG , Quan SUN , Hong-li XU , Hao-ran ZHANG
{"title":"Delay-aware reliable broadcast scheme based on power control for VANETs","authors":"Wei-jie GUO , Liu-sheng HUANG , Quan SUN , Hong-li XU , Hao-ran ZHANG","doi":"10.1016/S1005-8885(14)60265-X","DOIUrl":"10.1016/S1005-8885(14)60265-X","url":null,"abstract":"<div><p>In vehicular Ad-hoc network (VANET), many multi-hop broadcast schemes are employed to widely propagate the warning messages among vehicles and the key is to dynamically determine the optimal relay vehicle for retransmission. In order to achieve reliable and fast delivery of warning messages, this paper proposes a delay-aware and reliable broadcast protocol (DR-BP) based on transmit power control technique. First, a comprehensive model is derived to evaluate the transmission in vehicle-to-vehicle communications. This model considers the wireless channel fading, transmission delay and retransmissions characters occurring in the physical layer/medium access control (PHY/MAC) layer. Then, a local optimal relay selection mechanism based on the above model is designed. In DR-BP scheme, only the vehicle selected as the optimal relays can forward warning messages and the transmit power is time-varying. Finally, extensive simulations verify the performance of DR-BP under different traffic scenarios. Simulation results show that DR-BP outperforms the traditional slotted 1-persistence (S1P) and flooding scheme in terms of packets delivery ratio and transmission delay.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 26-35"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60265-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76535447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qin-long HUANG , Jing-yi FU , Zhao-feng MA , Yi-xian YANG , Xin-xin NIU
{"title":"Encrypted data sharing with multi-owner based on digital rights management in online social networks","authors":"Qin-long HUANG , Jing-yi FU , Zhao-feng MA , Yi-xian YANG , Xin-xin NIU","doi":"10.1016/S1005-8885(14)60273-9","DOIUrl":"10.1016/S1005-8885(14)60273-9","url":null,"abstract":"<div><p>The online social networks (OSNs) offer attractive means for social interactions and data sharing, as well as raise a number of security and privacy issues. Although current solutions propose to encrypt data before sharing, the access control of encrypted data has become a challenging task. Moreover, multiple owners may enforce different access policy to the same data because of their different privacy concerns. A digital rights management (DRM) scheme is proposed for encrypted data in OSNs. In order to protect users' sensitive data, the scheme allows users outsource encrypted data to the OSNs service provider for sharing and customize the access policy of their data based on ciphertext-policy attribute-based encryption. Furthermore, the scheme presents a multiparty access control model based on identity-based broadcast encryption and ciphertext-policy attribute-based proxy re-encryption, which enables multiple owners, such as tagged users who appear in a single data, customize the access policy collaboratively, and also allows the disseminators update the access policy if their attributes satisfy the existing access policy. Security analysis and comparison indicate that the proposed scheme is secure and efficient.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 1","pages":"Pages 86-93"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60273-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74934131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A fuzzy reinforcement learning approach for cell outage compensation in radio access networks","authors":"Wen-cong QIN , Ying-lei TENG , Hong-cheng ZHUANG , Yu MIAO , Ying-hai ZHANG","doi":"10.1016/S1005-8885(13)60225-3","DOIUrl":"10.1016/S1005-8885(13)60225-3","url":null,"abstract":"<div><p>In order to reduce cost and improve service reliability, self-organizing networks (SON) features are being introduced gradually with the arrival of new 4G systems in radio access networks. Cell outage compensation (COC) is one of the most important tasks in the context of SON. This paper demonstrates a self-organized approach for COC, which based on fuzzy Q-learning and operates in a fully autonomous manner. To improve the effectiveness of the compensation algorithm and reduce the complexity, a method of selecting the compensation cells based on knowledge of cell load and radiated power level respectively is proposed. Then the joint downtilt and transmit power compensation is described as a multi-agent reinforcement learning problem and solved using fuzzy Q-Learning (FQL). The experiment results show that the network performance degradation is minimized when a cell is in outage through compensation. Moreover, the hybrid approach which adjusts downtilt and power simultaneously delivers higher performance than the strategies varied in antenna tilt or transmit power only.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"20 ","pages":"Pages 26-32"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(13)60225-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78027203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}