舒坚 陶娟 刘林岚 谌业滨 藏超
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60001-1
This paper proposes a chip correlation indicator (CCI)-based link quality estimation mechanism for wireless sensor networks under non-perceived packet loss. On the basis of analyzing all related factors, it can be concluded that signal-to-noise rate (SNR) is the main factor causing the non-perceived packet loss. In this paper, the relationship model between CCI and non-perceived packet loss rate (NPLR) is established from related models such as SNR versus packet success rate (PSR), CCI versus SNR and CCI-NPLR. Due to the large fluctuating range of the raw CCI, Kalman filter is introduced to do de-noising of the raw CCI. The cubic model and the least squares method are employed to fit the relationship between CCI and SNR. In the experiments, many groups of comparison have been conducted and the results show that the proposed mechanism can achieve more accurate measurement of the non-perceived packet loss than existing approaches. Moreover, it has the advantage of decreasing extra energy consumption caused by sending large number of probe packets.
杨卫东 李攀 刘燕 朱红松
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60002-3
This paper proposes a novel adaptive time division multiple access (TDMA) slot assignment protocol (ATSA) for vehicular ad-hoc networks. ATSA divides different sets of time slots according to vehicles moving in opposite directions. When a node accesses the networks, it choices a frame length and competes a slot based on its direction and location to communication with the other nodes. Based on the binary tree algorithm, the frame length is dynamically doubled or shortened, and the ratio of two slot sets is adjusted to decrease the probability of transmission collisions. The theoretical analysis proves ATSA protocol can reduce the time delay at least 20% than the media access control protocol for vehicular ad-hoc networks (VeMAC) and 30% than the ad-hoc. The simulation experiment shows that ATSA has a good scalability and the collisions would be reduced about 50% than VeMAC, channel utilization is significantly improved than several existing protocols.
黄丹 郑毅 陈常嘉
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60003-5
Characterizing the features of user churn is crucial to the sustainable development of peer-to-peer (P2P) systems where peers join and leave at any arbitrary time. This paper analyzes the user churn in a P2P downloading system named QQXuanfeng by using the fine-grained log analysis over 60 days. It shows that the online and offline duration is related to up (arrive) time and down (depart) time respectively. A continuous ON/OFF process, which exhibits the diurnal patterns of users, is simulated using the churn model. In particular, the dynamic departure rate is proposed to give insight into the distribution of online duration. Further more, considering the heterogeneity of users, we cluster users based on the similarity of redefined user availability. As an example of application of this model, a high availability overlay is constructed and evaluated based on the clustering.
张招亮 李栋 黄庭培 崔莉
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60004-7
Intruder detection and border surveillance are amongst the most promising applications of wireless sensor networks. Barrier coverage formulates these problems as constructing barriers in a long-thin region to detect intruders that cross the region. Existing studies on this topic are not only based on simplistic binary sensing model but also neglect the collaboration employed in many systems. In this paper, we propose a solution which exploits the collaboration of sensors to improve the performance of barrier coverage under probabilistic sensing model. First, the network width requirement, the sensor density and the number of barriers are derived under data fusion model when sensors are randomly distributed. Then, we present an efficient algorithm to construct barriers with a small number of sensors. The theoretical comparison shows that our solution can greatly improve barrier coverage via collaboration of sensors. We also conduct extensive simulations to demonstrate the effectiveness of our solution.
刘志新 代利利 马锴 关新平
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60005-9
In many wireless sensor network applications, it should be considered that how to trade off the inherent conflict between energy efficient communication and desired quality of service such as real-time and reliability of transportation. In this paper, a novel routing protocols named balance energy-efficient and real-time with reliable communication (BERR) for wireless sensor networks (WSNs) are proposed, which considers the joint performances of real-time, energy efficiency and reliability. In BERR, a node, which is preparing to transmit data packets to sink node, estimates the energy cost, hop count value to sink node and reliability using local information gained from neighbor nodes. BERR considers not only each sender’ energy level but also that of its neighbor nodes, so that the better energy conditions a node has, the more probability it will be to be chosen as the next relay node. To enhance real-time delivery, it will choose the node with smaller hop count value to sink node as the possible relay candidate. To improve reliability, it adopts retransmission mechanism. Simulation results show that BERR has better performances in term of energy consumption, network lifetime, reliability and small transmitting delay.
赵露 白光伟 沈航 唐振民
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60006-0
The IEEE 802.15.4 standard is widely used in wireless sensor networks (WSNs). In this paper, we propose a priority-based IEEE 802.15.4 carrier sense multiple access with collision avoidance (CSMA/CA) mechanism for WSNs. Considering traffic load and traffic type of sensor nodes, we classify sensor nodes into three types. In our mechanism, different contention parameters are set for nodes with different priority levels, in order that nodes with high priority achieve high probability to access the channel. By modeling the proposed mechanism using a Markov chain, we analyze and compute the successful transmission probability, throughput and energy consumption for nodes with different priority levels. Finally, our numerical results demonstrate that our mechanism performs well for WSNs.
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60007-2
To balancing energy consumption in wireless sensor networks, we proposed a fixed time interval node broadcasting scheme under variational acceleration straight-line movement model. Simulation results show that the approach proposed in this paper has a superior performance on energy consumption balance compared to uniform broadcasting methods.
张德栋 马兆丰 钮心忻 Peng Yong
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60008-4
In order to solve the contradictions between user privacy protection and identity authentication, an anonymous authentication scheme under mobile Internet is proposed, which is based on the direct anonymous attestation of trusted computing and uses the encrypting transfer and signature validation for its implementation. Aiming at two access mode of trusted mobile terminal under mobile Internet, self access and cross-domain access, the authentication process of each mode is described in details. The analysis shows that the scheme implements anonymous authentication on mobile Internet and is correct, controllable and unforgeable.
田鹏 田辉 高砾琦 张军 王萌
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60009-6
Heterogeneous networks are employed in the next generation communication systems to enhance the area spectral efficiency (ASE), where cell range extension (CRE) is a promising technique to improve the cell edge performance and utilize the low power node (LPN) resources more effectively. In this paper we propose a dynamic spectrum allocation scheme for Macro-Pico scenario to mitigate both the co-tier and cross-tier interferences. The available system spectrum is divided into different parts by four steps, i.e. user set partition, service request collection, cross-tier occupation and CRE occupation decision, while the service request of each user is taken into consideration. During the process implementation, the reference signal receiving power (RSRP) threshold is derived by mathematical means to judge cell edge macro users when a predefined ratio is given. Simulation results show that the proposed scheme reaches almost the same cell edge performance with the best existing option, meanwhile provides higher overall system throughput and better spectral efficiency. Therefore, much better balance is achieved.
吴迪, LING Yan1, ZHU Hong-Song, LIU Jiang-Chuan, TAN Guo-Zhen
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60010-2
In vehicle Ad-hoc netwok (VANET), traffic load is often unevenly distributed among access points (APs). Such load imbalance hampers the network from fully utilizing the network capacity. To alleviate such imbalance, the paper introduces a novel pricing game model. The research scene is at the intersection when the traffic light is green. As vehicles are highly mobile and the network typology changes dynamically, the paper divides the green light time into equal slots and calculates APs’ prices with the presented pricing game in each time slot. The whole process is a repeated game model. The final equilibrium solution set is APs’ pricing strategy, and the paper claim that this equilibrium solution set can affect vehicles’ selection and ensure APs’ load-balancing. Simulation results based on a realistic vehicular traffic model demonstrate the effectiveness of the game method.
赵志为 王永刚 卜佳俊
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60011-4
Code dissemination is an important building block of wireless reprogramming. We notice that current code dissemination protocols fails to consider page selection and energy balancing. In this paper, we present an integrated mutual selection based code dissemination protocol (MSD). The key idea of MSD is mutual selection comprising sender selection and page selection. By exploiting link quality information in mutual selection, MSD enhances the propagation. Further, MSD takes energy level information in the sender selection, thus avoiding low power nodes’ over-consumption. We simulate MSD by settings of Mica-Z motes. Simulation results show that MSD can reduce the completion time and average transmission, and help low power nodes avoid unnecessary transmission and energy consumption.
和洁 冯大政 Nicolas Younan H.Younan 马仑
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60012-6
A bi-capon beamforming (BCB) algorithm for multi-input multi-output (MIMO) radar is developed on the basis of correlation domain. By vectorizing the echo matrix and its transpose, the conventional capon cost function is transformed into bi-capon quadratic functions. By calculating two lower dimensional weight vectors with sub-matrices of the correlation matrix, BCB can significantly decrease the computational complexity and the requirement of training samples. In the presence of short data records, BCB can achieve better interference suppression performance than fully adaptive capon algorithm. Simulation results are presented to demonstrate the effectiveness of the proposed method.
王军选 ZHANG Yan-yan
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60013-8
The ‘polar coding’ proposed by Dr. Ar?kan can achieve the symmetric capacity of binary-input discrete memoryless channels (B-DMC). The generator matrix of polar codes is for N=2n, BN was a permutation matrix. In the article it was realized with an interleaver, so the matrix production of GN was avoided; then the generator matrix was just determined by the matrix which was constructed with three sub-matrixes of and one order zero matrix, it was deal with fast Hadamard transform (FHT) algorithm. The complexity of the new scheme was reduced sharply, and an iterative algorithm also can be used. The example showed that when N=8, complexity of the encoding scheme was just 16 which is obviously less than that of original encoding scheme 36.
姚玉坤 温亚迪 任智 刘智虎
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60014-X
To improve the performance of transmission by reducing the number of transmission and network overhead of wireless single-hop networks, this paper presents a high efficient multipacket decoding approach for network coding (EMDNC) in wireless networks according to the idea of encoding packets which cannot be decoded and are stored in buffer by receiving nodes, the lost packets can be recovered from these encoded packets. Compared with the network coding wireless broadcasting retransmission (NCWBR), EMDNC can improve the efficiency of decoding and reduce the number of retransmission and transmission delay. Simulation results reveal that EMDNC can effectively reduce the number of retransmission and network overhead.
魏垚 王文博 彭木根 闵仕君
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60015-1
Self-configuration of physical cell identity (PCI) is a key feature for the long term evolution advanced (LTE-A) network. The PCI is used to identify the different cells in the system, becoming an essential cell configuration parameter. Considering the uncoordinated deployments of the evolved Node B (eNodeB) and the limited number of PCI, the PCI assignment for cells would be quite complex. This paper presents and puts forward a graph theory based centralized PCI self-configuration scheme (GT-PCIS). The PCI self-configuration problem is mapped to the well-known minimum spanning tree (MST) problem in order to optimize the PCI reuse distance and decrease the multiplexing interference throughout the entire network. The proposal provides a greedy search to make the locally optimal selection of PCI at each stage, and to achieve a global optimum. To demonstrate the algorithm validity, performances of GT-PCIS and manual configuration are evaluated. Simulation results show that the proposed GT-PCIS outperforms other configuration algorithms even under the condition of severe PCI deficiency.
金学波 杜晶晶 鲍佳
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60016-3
A good model can extract useful information about the target’s state from observations effectively. There are many models used to tracking a, maneuvering target such as constant-velocity (CV) model, Singer acceleration model (zero-mean first-order Markov model) and current model (mean-adaptive acceleration model), etc. While due to the complexity of maneuvering target, to seek the target model which can get better performance is still a subject worthy of study. Based on statistics relation between the autocorrelation function and the covariance of Markov random processing, this paper develops a model which can adaptively adjust system parameters on line. Simulations show the good estimation performance get by the model developed here, and comparing CV, Singer and current models, the model can adaptively get the model parameter while tracking the trajectory and needn’t doing several tests to obtain a priori parameter.
肖锋 周亚建 周景贤 朱洪亮 钮心忻
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60017-5
As an important component of internet of things, electronic product code (EPC) system is widely used in many areas. However, the mass deployment of EPC system is frequently degraded by security and privacy problems. Therefore, the major researches focus on the design of a secure EPC system with high efficiency. This paper discusses the security requirements of EPC system and presents a universal composable (UC) model for EPC system, the ideal functionality of EPC system is also formally defined with the UC framework. Then a secure protocol for EPC system under UC framework is proposed and the analysis of security and performance of the proposed protocol is given, in comparison with other protocols, the results show that the proposed protocol is UC secure and can provide privacy protection, untraceability, authorized access, anonymity and concurrent security for EPC system. Furthermore, less computation and storage resource are required by the proposed protocol.
杨谈 崔毅东 金跃辉
中国邮电高校学报(英文版), 2013, 20 (1). doi： 10.1016/S1005-8885(13)60018-7
Social tagging is one of the most important characteristics of Web 2.0 services, and social tagging systems (STS) are becoming more and more popular for users to annotate, organize and share items on the Web. Moreover, online social network has been incorporated into social tagging systems. As more and more users tend to interact with real friends on the Web, personalized user recommendation service provided in social tagging systems is very appealing. In this paper, we propose a personalized user recommendation method, and our method handles not only the users’ interest networks, but also the social network information. We empirically show that our method outperforms a state-of-the-art method on real dataset from Last.fm dataset and Douban.