Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 31 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Clustering for coordinated zero-forcing beamforming in multiusers interference network | |||
HE Shengjie,CHUAI Gang | |||
Electrics, Communication and Autocontrol Technology 09 November 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Traditional Zero-Forcing algorithm can eliminate the network interference effectively in small scale interference network. However, with the increasing number of users in practical communication system, this algorithm is not applicable any more. Due to lack of enough antennas, the channel matrix fails to provide sufficient dimensions to isolate the interference. In this paper, we design a clustering strategy for coordinated Zero-Forcing Beamforming (CZF) in multiusers interference network to improve it. Efficient clustering algorithm is derived to put users in disjoint clusters where CZF is applied to users within each cluster and the intercluster interference can almost be negligible compared to the whole network interference. Simulation results show that the proposed scheme enhances the capacity of network by 300% and the convergence within three iterations respectively. | |||
TO cite this article:HE Shengjie,CHUAI Gang. Clustering for coordinated zero-forcing beamforming in multiusers interference network[OL].[ 9 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4660608 |
2. Algebraic Constructions of Quasi-Cyclic LDPC Codes Based on Finite Fields | |||
Rui Zhang | |||
Electrics, Communication and Autocontrol Technology 18 November 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper introduces two new algebraic constructions of quasi-cyclic LDPC codes based on finite fields. Constructions of regular or near-regular codes based on primitive elements and subgroups of a multiplicative group are introduced. The constructions are achieved by dispersing base matrices into arrays of CPMs. Masking can also be applied to all the two resultant parity check matrices for codes with various rates and degree distributions. The codes constructed based on the new approaches perform well with iterative decoding over AWGN channel. | |||
TO cite this article:Rui Zhang. Algebraic Constructions of Quasi-Cyclic LDPC Codes Based on Finite Fields[OL].[18 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4619205 |
3. Implementing Delay Tolerant Networks on Android Devices in Emergency Scenario | |||
WANG Yuchang,YU Chongxiu | |||
Electrics, Communication and Autocontrol Technology 12 March 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:?Mobile communication systems utilize fixed infrastructures to make sure an end-to-end connection. In some hostile environments, base-stations or access points may fail to work properly, the coverage range cannot reach seamless requirement either. Delay-Tolerant Network (DTN) is proposed to mitigate these problems. This paper analyses emergency scenario in order to make users interconnect without the infrastructures. By programming, it implements DTN on Android smartphones, where DTN nodes can be self-organized and transfer bundles in a single or multiple DTN regions. After investigating DTN architecture, routing strategies and DTN applications on multi platforms, it focuses on implementing voice communication function, neighbour discovery function and dynamic routing function, and enhances broadcast neighbour discovery process and list-exchanged epidemic routing algorithm. Testing is given to verify the above functions in two DTN regions. The results show a DTN node can transfer whatever it receives in one DTN region automatically to other DTN regions in a relatively long life time. By this way, DTN can accommodate the challenged environment and can be utilized in emergencies. | |||
TO cite this article:WANG Yuchang,YU Chongxiu. Implementing Delay Tolerant Networks on Android Devices in Emergency Scenario[OL].[12 March 2013] http://en.paper.edu.cn/en_releasepaper/content/4523736 |
4. Graphic Based Frequency Planning and Distributed Power Allocationfor Relay-Aided OFDMA Cellular Networks | |||
Dong Miaomiao ,Yang Qinghai | |||
Electrics, Communication and Autocontrol Technology 11 March 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, a novel inter-cell frequency planning scheme and distributed power allocation algorithm are conceived for relay-aided OFDMA cellular networks. The employed smart Relay Station (RS) is able to broadcast pilots to its connected Base Station (BS) and serving User Equipments (UEs) to evaluate the channel quality as well as to manage its accessed UEs. In order to reuse the subchannel among RSs in the RS-UE links, two different mechanisms are proposed to construct the global interference matrix, which interprets the reuse problem into a graphic based one. We further develop a Graphic Based Reuse Algorithm (GBRA) to solve the reuse problem. Furthermore, a distributed power allocation scheme is proposed for allocating the powers in the BS-RS and RS-UE links respectively aiming to maximize the system throughput under the UEs' rate constraints. Simulation results demonstrate that the proposed reuse scheme improves the system throughput significantly, through it results in a declined Signal Interference Noise Ratio (SINR). Meanwhile, the proposed power allocation algorithm further improves the system throughputs. | |||
TO cite this article:Dong Miaomiao ,Yang Qinghai . Graphic Based Frequency Planning and Distributed Power Allocationfor Relay-Aided OFDMA Cellular Networks[OL].[11 March 2013] http://en.paper.edu.cn/en_releasepaper/content/4526393 |
5. Light Weight Network Coding based Key Distribution Scheme for MANETs | |||
Liu Jianwei ,Abdur Rashid Sangi,Ruiying Du,Qianhong Wu | |||
Electrics, Communication and Autocontrol Technology 30 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Along with other advantages, throughput enrichment is considered a main advantage provided by network coding. It is a lightweight, efficient, easy to implement technique that can be used to resolve security related issues in resource constraint wireless ad hoc networks. To utilize the advantages of network coding, we present a lightweight key distribution scheme based on inherent security property of network coding. Our novel scheme is a combination of simple XOR network coding operations and message authentication codes (MACs) to achieve data confidentiality and guarantee the integrity of the distributed keys, respectively. A thorough security analysis is given to explain the effectiveness of our scheme against eavesdropping and impersonation attacks as well as with few reasonable assumptions, it could withstand more intelligent attacks i.e. node compromising and brute force attacks. this scheme requires adequate amount of memory and we have also discussed memory aspects of our scheme. Simulation analysis proved that while key exchange between two nodes in same cluster, this scheme achieved more than 95% key delivery ratio with an ignorable average delay of 2 m.s. 58% key delivery ratio was achieved while the key was exchanged between two nodes in different clusters and the average delay was around 10 m.s. | |||
TO cite this article:Liu Jianwei ,Abdur Rashid Sangi,Ruiying Du, et al. Light Weight Network Coding based Key Distribution Scheme for MANETs[OL].[30 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4505634 |
6. Modeling and Cost Analysis of an Improved Movement-Based Location Update Scheme in Wireless Communication Networks | |||
WANG Xian,JIANG Wei,YUAN Wei-Na | |||
Electrics, Communication and Autocontrol Technology 27 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:An improved movement-based location update (IMBLU) scheme was proposed in the literature to tackle the vulnerability of the original movement-based location update (OMBLU) scheme, which performs a location update (LU) when the number of cells crossed reaches a movement threshold, to the ping-pong effect, a synonym for the phenomenon that a user equipment (UE) moves back-and-forth between adjacent cells. In the IMBLU scheme the criterion for performing an LU is that the number of different cells visited reaches the movement threshold. Prior to implementing the IMBLU scheme in wireless communication networks, first we need to determine the optimal movement threshold that minimizes the signaling cost of the IMBLU scheme incurred by LUs and paging. Therefore, a comprehensive mathematical model is required. This paper devotes to this requirement by developing such a model to analyze the signaling cost of the IMBLU scheme. We characterize UE mobility by a one-dimensional random walk model and derive closed-form analytical formula for the signaling cost of the IMBLU scheme, based on which we carry out a numerical to investigate the influence of relevant parameters on the signaling cost. It is observed that the signaling cost is a downward convex function with respect to the movement threshold, that the superiority of the IMBLU scheme over the OMBLU scheme is proportional to the intensity of the ping-pong effect, as well as that the variance of cell residence time exerts noticeable influence on the signaling cost only in the scenario of low mobility. This paper can guide the implementation of the IMBLU scheme in wireless communication networks. | |||
TO cite this article:WANG Xian,JIANG Wei,YUAN Wei-Na. Modeling and Cost Analysis of an Improved Movement-Based Location Update Scheme in Wireless Communication Networks[OL].[27 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4508970 |
7. Energy- and Spectral-efficiency Tradeoff From Nash Bargaining Aspect | |||
ZHANG Ling,GAO Jinchun,XIE Gang | |||
Electrics, Communication and Autocontrol Technology 13 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Conventional design of wireless networks mainly focuses on system capacity and spectral efficiency(SE). As green radio (GR) becomes an inevitable trend, energy-efficient design is becoming more and more important. For SE oriented design, it can improve the system rate as much as possible, but energy efficiency (EE) may be not desirable. Similarly, for EE oriented design, it can save the energy mostly, but the system rate may be low. It can be proved that Pareto Optimality between SE and EE exists. In this paper, a new design about the tradeoff between SE and EE is addressed on the basis of Nash Bargaining to improve the system's comprehensive performance. With this design, we can not only improve the transmission rate but also save the energy. We first set up a general EE-SE tradeoff framework, then demonstrate the new objective function is strictly quasi-concave and get the unique and optimal Nash Bargaining Solutions (NBS). | |||
TO cite this article:ZHANG Ling,GAO Jinchun,XIE Gang. Energy- and Spectral-efficiency Tradeoff From Nash Bargaining Aspect[OL].[13 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4503773 |
8. Cross-Layer Resource Allocation of Two-Way Relaying for Statistical Delay-QoS Guarantees | |||
LIN Cen,LIU Yuan,TAO Meixia | |||
Electrics, Communication and Autocontrol Technology 02 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper considers the cross-layer design for delayquality-of-service (QoS) provisioning in two-way relay systems. Theaim is to find the optimal cross-layer resource allocation policy tomaximize the weighted sum-rate of the considered two-way relaysystem while guaranteeing the bounded delay-QoS constraints for bothusers. By applying the concept of effective capacity, the delayrequirements are characterized as the statistical QoS exponents,which are the only information exchanged between layers. Thecross-layer optimization problem then is equivalent to a weightedsum effective capacity maximization problem. The optimal joint powerand rate adaptation policy for the two-phase two-way relaying isderived. Numerical results show that the proposed policy canefficiently support diverse QoS requirements and significantlyimprove the performance compared with either the fixed power schemeor the conventional weight-based method. | |||
TO cite this article:LIN Cen,LIU Yuan,TAO Meixia. Cross-Layer Resource Allocation of Two-Way Relaying for Statistical Delay-QoS Guarantees[OL].[ 2 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4464801 |
9. A Simple Energy Efficient Transceiver based on Constant-Envelop for IEEE 802.15.4 | |||
Wang Chen ,Wenjie Wang,Qinye Yin | |||
Electrics, Communication and Autocontrol Technology 04 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Efficient transmission has always been a major issue for wireless sensor networks (WSN) due to the fact that the nodes are usually battery-powered. Wireless communication accounts for a strikingly large proportion of the total power consumption of a node. In this paper, we reduce the power consumption in the physical layer by designing a low-power transceiver. IEEE 802.15.4 is a popular communication protocol with many good features that can be used for power-saving. We design a simple energy efficient transceiver for IEEE 802.15.4. It utilizes the constant-envelope feature of the offset quadrature phase shift keying (O-QPSK) signal with half-sine shaping defined in the protocol to simplify the structure of the transceiver. Compared with conventional transceivers, the proposed transceiver uses a hard-limiter (inverter) to replace the digital-to-analog converter (DAC) and the analog-to-digital converter (ADC), which results in a much simpler structure and lower power consumption. Furthermore, the correlation operation could be efficiently implemented just by a reversible counter. The performance of the proposed transceiver is effectively demonstrated by both computer simulations and hardware tests. | |||
TO cite this article:Wang Chen ,Wenjie Wang,Qinye Yin. A Simple Energy Efficient Transceiver based on Constant-Envelop for IEEE 802.15.4[OL].[ 4 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4458831 |
10. Doppler Frequency Offsets Estimation for High-Mobility OFDM Systems | |||
Guo Wei,Yin Qin-ye,Mu Peng-cheng | |||
Electrics, Communication and Autocontrol Technology 01 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, the problem of multiple Doppler frequency offsets estimation for orthogonal frequency division multiplexing (OFDM) system over doubly-selective channels is investigated. The main application environment is for very high-mobility OFDM systems. The key point is to design a particular preamble structure. Then by remodeling the received blocks through downsampling, we compact parameter space and obtain a low complexity subspace-based estimator with the performance of high-resolution. The effectiveness of the proposed scheme is verified by simulations. | |||
TO cite this article:Guo Wei,Yin Qin-ye,Mu Peng-cheng. Doppler Frequency Offsets Estimation for High-Mobility OFDM Systems[OL].[ 1 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4459101 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated