oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 6 )

2018 ( 178 )

2017 ( 166 )

2016 ( 159 )

Custom range...

Search Results: 1 - 10 of 8385 matches for " Deng Xiaoheng "
All listed articles are free for downloading (OA Articles)
Page 1 /8385
Display every page Item
Anomaly Detection Based on a Multi-class CUSUM Algorithm for WSN
Zhenghong Xiao,Zhigang Chen,Xiaoheng Deng
Journal of Computers , 2010, DOI: 10.4304/jcp.5.2.306-313
Abstract: Security is one of the most important research issues in wireless sensor networks (WSN) applications. Given that the single detection threshold of the cumulative sum (CUSUM) algorithm causes longer detection delays and a lower detection rate, a multi-class CUSUM algorithm is hereby proposed. Firstly a maximum and minimum thresholds, which sensor node
Modelling the guaranteed QoS for wireless sensor networks: a network calculus approach
Zhang Lianming,Yu Jianping,Deng Xiaoheng
EURASIP Journal on Wireless Communications and Networking , 2011,
Abstract: Wireless sensor networks (WSNs) became one of the high technology domains during the last 10 years. Real-time applications for them make it necessary to provide the guaranteed quality of service (QoS). The main contributions of this article are a system skeleton and a guaranteed QoS model that are suitable for the WSNs. To do it, we develop a sensor node model based on virtual buffer sharing and present a two-layer scheduling model using the network calculus. With the system skeleton, we develop a guaranteed QoS model, such as the upper bounds on buffer queue length/delay/effective bandwidth, and single-hop/multi-hops delay/jitter/effective bandwidth. Numerical results show the system skeleton and the guaranteed QoS model are scalable for different types of flows, including the self-similar traffic flows, and the parameters of flow regulators and service curves of sensor nodes affect them. Our proposal leads to buffer dimensioning, guaranteed QoS support and control in the WSNs.
Modelling on the Guaranteed QoS for Wireless Sensor Networks: A Network Calculus Approach
Lianming Zhang,Jianping Yu,Xiaoheng Deng
Computer Science , 2011, DOI: 10.1186/1687-1499-2011-82
Abstract: Wireless sensor networks (WSNs) became one of the high technology domains during the last ten years. Real-time applications for them make it necessary to provide the guaranteed Quality of Service (QoS). The main contributions of this paper are a system skeleton and a guaranteed QoS model that are suitable for the WSNs. To do it, we develop a sensor node model based on virtual buffer sharing and present a two-layer scheduling model using the network calculus. With the system skeleton, we develop a guaranteed QoS model, such as the upper bounds on buffer queue length/delay/effective bandwidth, and single-hop/ multi-hops delay/jitter/effective bandwidth. Numerical results show the system skeleton and the guaranteed QoS model are scalable for different types of flows, including the self-similar traffic flows, and the parameters of flow regulators and service curves of sensor nodes affect them. Our proposal leads to buffer dimensioning, guaranteed QoS support and control in the WSNs.
Distributed Routing and Spectrum Allocation Algorithm with Cooperation in Cognitive Wireless Mesh Networks
Zhigang Chen,Zhufang Kuang,Yiqing Yang,Xiaoheng Deng,Ming Zhao
International Journal of Distributed Sensor Networks , 2012, DOI: 10.1155/2012/781682
Abstract: Routing and spectrum allocation is an important challenge in cognitive wireless mesh networks. A distributed routing and spectrum allocation algorithm with cooperation (DRSAC-W) in cognitive wireless mesh networks is proposed in this paper. In order to show the decrease of the average end-to-end delay with cooperation in DRSAC-W, a distributed routing and spectrum allocation algorithm without cooperation (DRSAC-WO) is proposed in this paper. Minimizing the average end-to-end delay is the objective of DRSAC-W and DRSAC-WO. Simulation results show that the proposed algorithm DRSAC-W with cooperation can alleviate the high delay due to the heterogeneity of available channels of different nodes and achieve low average end-to-end delay.
An Enforceable Incentive Scheme in Wireless Multi-path Inter-session Network Coding Game
Zhuoqun Xia,Zhigang Chen,Xiaoheng Deng,Ming Zhao
Journal of Networks , 2012, DOI: 10.4304/jnw.7.2.351-356
Abstract: There are some selfish nodes in wireless mesh networks multi-path inter-session network coding; and all selfish nodes maximize their earnings through the game. In this paper, a stimulus scheme is proposed which is suit for selfish nodes game in a multi-path inter-session network coding game. In the multi-path transmission, we use the watch dog checks the existence of selfish nodes. After selfish nodes are detected, we modified the multi-path protocols. For multi-path selfish nodes, we adopt non-cooperation method to punish it; and that the priority forwarding is used to active cooperation nodes. It is proved that Nash equilibrium is acquired for all players to obey the incentive scheme honestly. Experiments verify the theoretical analysis.
Degree and connectivity of the Internet's scale-free topology
Lianming Zhang,Xiaoheng Deng,Jianping Yu,Xiangsheng Wu
Computer Science , 2011, DOI: 10.1088/1674-1056/20/4/048902
Abstract: In this paper we theoretically and empirically study the degree and connectivity of the Internet's scale-free topology at the autonomous system (AS) level. The basic features of the scale-free network have influence on the normalization constant of the degree distribution p(k). We develop a mathematics model of the Internet's scale-free topology. On this model we theoretically get the formulas of the average degree, the ratios of the kmin-degree (minimum degree) nodes and the kmax-degree (maximum degree) nodes, the fraction of the degrees (or links) in the hands of the richer (top best-connected) nodes. We find the average degree is larger for smaller power-law exponent {\lambda} and larger minimum or maximum degree. The ratio of the kmin-degree nodes is larger for larger {\lambda} and smaller kmin or kmax. The ratio of the kmax-degree ones is larger for smaller {\lambda} and kmax or larger kmin. The richer nodes hold most of the total degrees of the AS-level Internet topology. In addition, we reveal the ratio of the kmin-degree nodes or the rate of the increase of the average degree has power-law decay with the increase of the kmin. The ratio of the kmax-degree nodes has power-law decay with the increase of the kmax, and the fraction of the degrees in the hands of the richer 27% nodes is about 73% (the '73/27 rule'). At last, we empirically calculate, based on empirical data extracted from BGP, the average degree and the ratio and fraction using our method and other methods, and find that our method is rigorous and effective for the AS-level Internet topology.
STUDY ON MESORANGE ATMOSPHERIC DISPERSION BASED ON WIND DATA FROM A DENSER NETWORK
利用风场资料研究中距离大气扩散规律

Zhang Xifu,Zou Xiaoheng,Deng Yuzhen,
张锡福
,邹孝恒,邓玉珍

环境科学学报 , 1986,
Abstract: Based on surface and upper level wind data, the horizontal trajectories and the time series of longitudinal and lateral velocity fluctuations were calculated using an interpolation formula. The lateral atmospheric diffusion parameters, for various categories of stability were estimated. The comparison between the calculated results and field data collected by SF6 and balance balloon experiments showed no significant difference. The values obtained through SF6 experiment were larger that others due to the effect of the wind vertical shear.
MAEC : A Movement-Assisted Energy Conserving Method in Event Driven Wireless Sensor Networks
Ming Zhao,Zhigang Chen,Xiaoheng Deng,Lianming Zhang,Anfeng Liu,Guosheng Huang
Computer Science , 2005,
Abstract: Energy is one of the most important resources in wireless sensor networks. Recently, the mobility of base station has been exploited to preserve the energy. But in event driven networks, the mobility issue is quite different from the continuous monitoring one because only a small portion of sensor node has data to send at one time. The number of sensor node that forward traffic should be minimized to prolong the network lifetime. In this paper, we propose a movement-assisted energy conserving method which tries to reduce the amount of forwarding sensor node by directing the base station to move close to the hotspots. This method achieves good performance especially when applied to a network with a set of cooperative mobile base station. Extensive simulation has been done to verify the effectiveness of the propose schema.
Maximal linear spaces contained in the base loci of pencils of quadrics
Xiaoheng Wang
Mathematics , 2013,
Abstract: The geometry of the Fano scheme of maximal linear spaces contained in the base locus of a pencil of quadrics has been studied by algebraic geometers when the base field is algebraically closed. In this paper, we work over an arbitrary base field of characteristic not equal to 2 and show how these Fano schemes are related to the Jacobians of hyperelliptic curves. In particular, if $B$ is the base locus of a generic pencil of quadrics in $\bbp^{2n+1}$, and $F$ is the Fano variety of $n - 1$ planes contained in $B$, then $F$ is a component of a disconnected commutative algebraic group $G = \picz(C) \dcup F \dcup \pico(C) \dcup F'$, where $C$ is the hyperelliptic curve defined by the discriminant form of the pencil. In the second half of this paper, we study regular pencils of quadrics, where the hyperelliptic curve defined by the discriminant is singular.
Average size of the 2-Selmer group of Jacobians of monic even hyperelliptic curves
Arul Shankar,Xiaoheng Wang
Mathematics , 2013,
Abstract: In [5], Manjul Bhargava and Benedict Gross considered the family of hyperelliptic curves over $\Q$ having a fixed genus and a marked rational Weierstrass point. They showed that the average size of the 2-Selmer group of the Jacobians of these curves, when ordered by height, is 3. In this paper, we consider the family of hyperelliptic curves over $\Q$ having a fixed genus and a marked rational non-Weierstrass point. We show that when these curves are ordered by height, the average size of the 2-Selmer group of their Jacobians is 6. This yields an upper bound of 5/2 on the average rank of the Mordell-Weil group of the Jacobians of these hyperelliptic curves. Finally using an equidistribution result, we modify the techniques of [16] to conclude that as $g$ tends to infinity, a proportion tending to 1 of these monic even-degree hyperelliptic curves having genus $g$ have exactly two rational points - the marked point at infinity and its hyperelliptic conjugate.
Page 1 /8385
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.