Journal on Communications

Data compression method for wireless sensor networks based on adaptive optimal zero suppression

Peng JIANG,Jian-feng WU,Bin WU,Lin-xi DONG,Da WANG

2013, 34(2): 1-7. doi:10.3969/j.issn.1000-436x.2013.02.001

Asbtract ( 184 )

HTML ( 0)

PDF (149KB) ( 508 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Considering the temporal and spatial redundancy in wireless sensor network(WSN), an adaptive optimal zero suppression data compression method (AOZS) was proposed.AOZS is a loss-less compression method, it aims to find an optimal digital factor to perform zero suppression and encode operation for a data sequence in ascending order, and therefore the final code length is the shortest based on this optimal gital factor.Simulation results show that AOZS can compress the data and decrease the energy consumption effectively, and reduce the network delay and prolong the life cycle of the network as a result.

Low complexity linear parallel detection algorithm for near ML detection of MIMO systems

Guo-sheng RUI,Hai-bo ZHANG,Yang ZHANG,Wen-biao TIAN,Song ZHANG,Ting-jun LI

2013, 34(2): 8-14. doi:10.3969/j.issn.1000-436x.2013.02.002

Asbtract ( 229 )

HTML ( 3)

PDF (186KB) ( 779 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

The existing parallel detection algorithms for MIMO systems have extremely high complexity under high order QAM and its complexity grows rapidly with the increase of the number of antenna.The non-parallel detection algorithms with low complexity have great SNR gap with optimal detection algorithm.A new parallel linear detection algorithm with low complexity was proposed.This algorithm exploited all symbols in QAM constellation as a reference to cancel the interference of the worst SNR sub-channel and detected the received signals of the rest with a new parallel linear detection algorithm based on lattice reduction.The simulation results show that the proposed detection algorithm is near the performance of the optimal detection algorithm and improves the diversity order with low complexity.Especially under the high order QAM, the complexity is decreased in evidence.

Cloud sourcing domain name resolving service model

Zhen QIN,Chun-jing XIAO,Le-min LI

2013, 34(2): 15-22. doi:10.3969/j.issn.1000-436x.2013.02.003

Asbtract ( 221 )

HTML ( 2)

PDF (143KB) ( 538 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

The current DNS had various performance and security problems, such as query delay, update latency, vulnerable to DoS attacks etc.Focuses on those problems, a novel, incremental deployable, compatible, and more effective domain name resolving service model was proposed.The service model was cloud sourcing, by using the cloud and its branch network worldwide to distribute DNS records, response DNS queries, and provide domain name resolved service.In this service model, the cloud edge servers function as local resolvers and authoritative nameservers, and authoritative DNS records were distributed to the edge servers, which directly responsed users’ DNS queries (if the quer not cached at local resolver, current DNS needed to access several nameservers in multi-level hierarchy).Compared with current domain name resolving services, the analysis and experiments prove that the service model show advantages in query latency, update latency, resiliency, and reliability etc.

Public-key encryption scheme based on R-LWE

Xiao-yuan YANG,Li-qiang WU,Min-qing ZHANG,Wei ZHANG

2013, 34(2): 23-30. doi:10.3969/j.issn.1000-436x.2013.02.004

Asbtract ( 361 )

HTML ( 23)

PDF (170KB) ( 1159 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

An improved method of generating trapdoor on ideal lattice was proposed by a stronger regularity bound theorem, then with R-LWE encryption algorithm and strongly unforgeable one-time signature tool from ideal lattice, an adaptive chosen-ciphertext attack (CCA) secure PKE scheme under the st rd model was designed.The new PKE scheme supported public ciphertext integrity verification, could achieve block encryption and had a high encryption/decryption speed and a low encryption blowup factor, whose security proved reduced to decisional R-LWE assumption tightly.The construction is the first CCA-secure PKE cryptosystem completely based on hard problems from ideal lattice.

Novel joint encoding/decoding algorithms of LT codes based on random permute egde-growth and stopping set

Jian JIAO,Zhi-hua YANG,Shu-shi GU,Jie ZHOU,Qin-yu ZHANG

2013, 34(2): 31-39. doi:10.3969/j.issn.1000-436x.2013.02.005

Asbtract ( 233 )

HTML ( 3)

PDF (321KB) ( 763 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Since LT codes adopt the random encoding method,high coding overheads were required for a stable recovery probability of information.a random permute edge-growth-based coding algorithm was proposed, which could enhance the decoding probability of LT code through restricting the random connections between random permutation edges in the Tanner graphs.With this proposed coding algorithm, a decoding algorithm based on stopping set Gaussian elimination was proposed, which efficiently used the redundancy information in the stopping set after the belief propagation decoding.As a result, this decoding scheme could approach the performance of maximum-likelihood decoding.The simulation results show that, the proposed joint design on coding/decoding schemes could obviously reduce the overheads of such short length LT codes as 10＜sup＞3＜/sup＞, while achieve the decoding failure rate of 10＜sup＞- 4＜/sup＞.

Hardware-task partitioning algorithm merged area estimation with multi-objective optimization

Nai-jin CHEN,Jian-hui JIANG

2013, 34(2): 40-55. doi:10.3969/j.issn.1000-436x.2013.02.006

Asbtract ( 233 )

HTML ( 1)

PDF (442KB) ( 490 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

In order to minimize the number of configuration (i.e.the number of partitioned modules) issue in reconfigurable computing systems, a hardware-task partitioning algorithm merged area estimation with multi-objective optimization was presented.It could estimate the area of hardware resource in each partitioning.Also, the detection function prior_assigned() was constructed with the guideline of making good use of reconfigurable resources,the execution delay sum of all partitioning modules of a data flow graph, number of edges between modules, etc.The detection function could calculate priority values of nodes.The proposed algorithm could adjust dynamically the schedu ing order of the ready list task-nodes by the priority values.Experimental results show that the proposed algorithm can get less modules than that of level-based partitioning, cluster based partitioning, enhanced static list, multi-objective temporal partitioning and level sensitive cluster based partitioning algorithms, and it can also obtain the least average execution delay with increase of the area of reconfigurable processing unit except level-based partitioning.

Trust based secure routing model for cognitive radio networks

Guang-hua ZHANG,Yu-qing ZHANG,Xue-feng LIU

2013, 34(2): 56-64. doi:10.3969/j.issn.1000-436x.2013.02.007

Asbtract ( 232 )

HTML ( 2)

PDF (206KB) ( 456 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

A trust-based secure routing model was put forward for defending against the selective forwarding attack on routing in cognitive radio networks.Based on monitoring results of nodes' forwarding behavior, trusts were built in order to identify malicious nodes.For the characteristic that routing selection must be closely collaborative with spectrum allocation, a route request piggybacking available spectrum opportunities was sent to non-malicious nodes during the routing discovery phase, and routing decisions were performed according to delays and available paths' trusts calculated from nodes' trusts during the routing selection phase.At t e time, different responses were made to service requests from nodes in different trust levels, and more severe penalties were taken for malicious behavior from non-trusted nodes, which can promote nodes’ cooperation in routing.Simul ion results and analysis show that under selective forwarding attack the proposed model has advantages in network throughput and end-to-end delay over the existing models.

Handover algorithm for WLAN/cellular networks with analytic hierarchy process

Jun LIU,Xiao-nan LI

2013, 34(2): 65-72. doi:10.3969/j.issn.1000-436x.2013.02.008

Asbtract ( 429 )

HTML ( 5)

PDF (169KB) ( 641 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

For WLAN/cellular network, a handoff decision algorithm was proposed based on analytic hierarchy process.Considering the network status and user’s traffic features, SAW and TOPSIS are simulated in the proposed algorithm.Compared with SAW,simulation results show that the analytic hierarchy ana is with TOPSIS is more suitable for network handoff decision of delay sensitive applications.

Research of incentive-aware data dissemination in selfish opportunistic networks

Guang-song ZHAO,Ming CHEN

2013, 34(2): 73-84. doi:10.3969/j.issn.1000-436x.2013.02.009

Asbtract ( 272 )

HTML ( 1)

PDF (291KB) ( 436 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

A reciprocal incentive scheme named RIS was proposed,which could create win-win situation for the internet service provider,A type nodes and B type nodes.When RIS was deployed in a selfish opportunistic network,how these selfish nodes select data objects for their limited buffer to maximize their revenue was analyzed.Furthermore,the effect of the scope of network information the nodes maintain on the selection of stored data objects for their buffer was revealed.Extensive trace-driven simulations using MIT trace were carried out to evaluate the data dissemination performance when all nodes were trying to maximize their revenue during the process of data dissemin ion.The results demonstrate that after deploying this incentive scheme,the average receiving rate of each channel rises by 18%,and the average receiving delay of each channel was reduced 4.83 days.Moreover,B type nodes only need to pay less for each subscribed data object.The simulation results also show that the larger scope of network information nodes maintain,the better performance RIS can achieve.

Optimizing path selection of mobile Sink nodes in mobility-assistant WSN

Xi-wei ZHANG,Lin SHEN,Yi-feng JIANG

2013, 34(2): 85-93. doi:10.3969/j.issn.1000-436x.2013.02.010

Asbtract ( 274 )

HTML ( 2)

PDF (235KB) ( 557 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

There inevitably exist some serious problems such as energy hole,overlapping and hot spots in static wireless sensor networks which are composed by all static sensors.The mobile Sink (MS) was used to reduce the energy consumption of static sensor nodes through a collection-based approach in which a subset of nodes served as the data collection points (CP) that buffer data originated from sensors and transferred these data to MS when it arrived.An optimization model named min-energy min-distance (MEMD) of MS’ moving path was introduced and proved this model was NP-hard.A heuristic algorithm was developed combining MS and CPs selection to enable a flexible trade-off between energy consumption and data delivery latency.Furthermore,a probabilistic path selection (PPS) algorithm to make the MS visit as much as possible sensors was proposed.The experimental and simulating results show monotonic decrease of data delivery latency for greater limits on the energy consumption and vice versa.

Strongly secure certificateless signature scheme without pairings

Ya-fei WANG,Rui-zhe ZHANG

2013, 34(2): 94-99. doi:10.3969/j.issn.1000-436x.2013.02.011

Asbtract ( 270 )

HTML ( 4)

PDF (106KB) ( 621 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Timer based algorithm for minimum connected dominating set construction

Yang YANG,Lan-lan RUI,Shao-yong GUO,Xue-song QIU,Feng QI

2013, 34(2): 100-108. doi:10.3969/j.issn.1000-436x.2013.02.012

Asbtract ( 232 )

HTML ( 1)

PDF (267KB) ( 595 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

In clustered MANET,a timer theory based MCDS algorithm was proposed to construct and reconstruct visual backbone quickly under dynamic topologies.The validity of this MCDS algorithm was established.The simulation results demonstrate that our algorithm produces a CDS of competitive size with low message overhead and adjusts the visual backbone fast to adapt to dynamic network topologies.

Multi-user bandwidth allocation method based on traffic cognition

Yao-dong ZHANG,Yue WANG,Jin-hai HUO,Jian YUAN

2013, 34(2): 109-116. doi:10.3969/j.issn.1000-436x.2013.02.013

Asbtract ( 233 )

HTML ( 0)

PDF (169KB) ( 527 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Wireless LAN MAC protocols can hardly make a balance between diverse traffic requirements of multi-users and network throughput efficiency.A bandwidth allocation model with super-frames and an optimization goal with a penalty function was established.After calculating the m nimum bandwidth satisfying a single user's QoS requirement,traffic cognition bandwidth allocation algorithm (TCBAA) for multi-users was proposed.Analysis and simulations experiment show that TCBAA can satisfy more users' QoS requirements under limited bandwidth resources,compared with fixed bandwidth allocation and maximum throughput allocation.

UC model of secure positioning protocols

Jun-wei ZHANG,Jian-feng MA,Chao YANG

2013, 34(2): 117-122. doi:10.3969/j.issn.1000-436x.2013.02.014

Asbtract ( 289 )

HTML ( 4)

PDF (88KB) ( 1062 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

The provable security of secure positioning in position-based cryptography was investigated,and the provable secure model of secure positioning was established in the universally composable framework.According to the security requirements of secure positioning,the ideal functionality of secure positioning firstly was proposed.Then,the ideal functionality of bounded retrieval model was designed one of the set-up assumptions in position-based cryptography.Lastly,the secure positioning protocol in 1-dimension space,as an example,could securely realize the functionality of secure positioning in the bounded retrieval model.

Forgery attacks on two identity based signature schemes

Liang CHEN,Yong-quan CUI,Miao-miao TIAN,Xiao-qing FU,Peng XU

2013, 34(2): 123-127. doi:10.3969/j.issn.1000-436x.2013.02.015

Asbtract ( 223 )

HTML ( 1)

PDF (79KB) ( 417 )

Knowledge map

References | Related Articles | Metrics

Li Ji-Guo et al.proposed an identity based signature scheme in the standard model in 2009,and a similar scheme was proposed by Gu Ke et al.in 2011.Three algorithms were constructed to attack these two schemes.In these attacks,attacker could forge a valid signature on any message on behalf of any user in polynomial time only by choosing random parameters without knowing the signing key of the user.The attacks showed that their signature schemes were insecure.The root causes of attacks were further analyzed and some possible improvements were given in the end.

Dynamic software watermarking algorithm based on memory operation

Jin-chao XU,Guo-sun ZENG

2013, 34(2): 128-137. doi:10.3969/j.issn.1000-436x.2013.02.016

Asbtract ( 209 )

HTML ( 1)

PDF (150KB) ( 373 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Memory operation based watermarking,a novel approach to software watermarking based on the dynamic memory behaviors of native code programs was introduced.The ition of dynamic cluster,memory relationship between clusters and matrix of memory relationship was given,and a detailed description of the software watermark embedding and extraction procedure was given.The platform independence,credibility,data rate and cost of the algorithm were analyzed,its stealthy and resistance were evaluated by experiments.

On the average diameter of directed loop networks

Ye-bin CHEN,Ying LI,Xiao ZHENG,Tao CHEN

2013, 34(2): 138-146. doi:10.3969/j.issn.1000-436x.2013.02.017

Asbtract ( 245 )

HTML ( 0)

PDF (187KB) ( 381 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

The formula of average diameter about directed double-loop networks was presented according to the relationship between average diameter and four geometric parameters (a,b,p and q) of its minimum distance diagram (L-shaped tile)，and a rapid algorithm to compute the average diameter was presented.A novel method to construct the minimum distance diagram (equivalent tree) of triple loop networks was presented,and the relationships between the layer of the equivalent tree and the shortest path of any two points in triple loop networks was studied,and a formula and a algorithm to compute its average diameter was provided.The experimental results show that average diameter approaches to a half of the diameter at the same network,in one infinite family,the diameter must obtain minimum value when average diameter obtains minimum value,but the inverse is not.Studies show that average diameter is the better parameter to measure transmission efficiency about loop networks instead of diameter,so average diameter should become one of important bases to design the optimal networks.

Review on learning mobile user preferences for mobile network services

Xiang-wu MENG,Yan-cui SHI,Li-cai WANG,Yu-jie ZHANG

2013, 34(2): 147-155. doi:10.3969/j.issn.1000-436x.2013.02.018

Asbtract ( 239 )

HTML ( 1)

PDF (105KB) ( 754 )

Knowledge map

References | Related Articles | Metrics

Recently,in order to alleviate the problem of “mobile information overload”,the learning of mobile user preferences has become a new hotspot of research in the personalized services.The research progress of learning mobile user preferences were summaried in recent years.The representation,acquisition method,adaptive learni evaluation about learning mobile user preferences were contrasted and analyzed.Finally,some future directions and development trends of learning mobile user preferences in the mobile network service were pointed out.

Development and prospect of research on femtocell in two-tier heterogeneous networks

Zhu XIAO,Ren-fa LI,Ke-chu YI,Jie ZHANG

2013, 34(2): 156-169. doi:10.3969/j.issn.1000-436x.2013.02.019

Asbtract ( 220 )

HTML ( 5)

PDF (200KB) ( 1123 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

An overview was given for femtocell in details on recent research progress.Three topics were mainly addressed in two-tier femtocell-macrocell wireless networks:spectrum allocation,interference management and access control.In addition,backhaul,user mobility,fairness and other related issues were studied as well.In the end,the prospects of femtocell application and future trends were concluded.

Power control algorithm for wireless sensor networks based on approximate Unit Delaunay triangulation

Peng-fei XU,Zhi-gang CHEN,Xiao-heng DENG

2013, 34(2): 170-176. doi:10.3969/j.issn.1000-436x.2013.02.020

Asbtract ( 218 )

HTML ( 1)

PDF (177KB) ( 343 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

A novel geometry structure named AUDT was presented to be as the underlying logical topology of wireless sensor networks,and the transmission range of each sensor was adjusted to the minimum according to its furthest logical neighbor.AUDT would have the desirable features of connectivity,planar,average degree-bounded and t-spanner.The simulation results show that the network delay of AUDT is very close to other similar algorithms,but AUDT performs better than them in terms of the transmission range and the radio interference.Furthermore,the communication cost of distributed constructing AUDT has reached the minimum.

Two-dimensional improved fractal model of the sea surface and sea spectrum evaluation

Yu CHEN,Yun-an HU,Tao LIN

2013, 34(2): 177-185. doi:10.3969/j.issn.1000-436x.2013.02.021

Asbtract ( 337 )

HTML ( 2)

PDF (313KB) ( 729 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the ominidirectional sea-wave spectrum of fractal sea-wave model could not satisfy the positive power law when spatial wave numbers was smaller than the fundamental wave number,2-D sea-wave model was proposed by combining statistical sea model and normalization band-limited Weierstrass-Mandelbrot (WM) fractal sea model.With the proposed method,the closed form expression of the directional sea-wave spectrum was calculated and the ominidirectional sea-wave spectrum and the angular distribution function derived，the comparison with the results in the literature was made,and influences of fractal dimension,frequency and amplitude factor,wind speed and wind direction on sea-surface were further analyzed.Simulation results show that omnidirectional sea-wave spectrum is in good agreement with the common spectrum of Pierson-Moskowitz (PM) and JONSWAP and Wen Sheng Chang and the real data of the South China Sea,angular distribution function is very similar to the Mitsuyasu’s distribution function,sea surface have both characters of large-scale turbulent waves and micro-scale capillary wave,statistical model and fractal model’s characters are still suitable for improved fractal model,and the correctness of the improved model was validated.

Joint estimation of time-variant characteristic parameters for distributed multi-antenna wireless channel

Jing ZHANG

2013, 34(2): 186-190. doi:10.3969/j.issn.1000-436x.2013.02.022

Asbtract ( 197 )

HTML ( 2)

PDF (192KB) ( 525 )

Knowledge map

Figures and Tables | References | Related Articles | Metrics

Current Issue