作者机构：
[Tan, Liansheng; Wu, Mou] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Wu, Mou] Hubei Univ Sci & Technol, Sch Comp Sci & Technol, Xianning 437100, Peoples R China.
通讯机构：
[Tan, Liansheng] C;[Wu, Mou] H;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;Hubei Univ Sci & Technol, Sch Comp Sci & Technol, Xianning 437100, Peoples R China.
关键词：
Data reduction;wireless sensor network;hierarchical least mean square (HLMS) algorithm;adaptive filtering;energy conservation
摘要：
In wireless sensor networks (WSNs), due to the restriction of scarce energy, it remains an open challenge how to schedule the data communications between the sensor nodes and the sink to reduce power usage with the aim of maximizing the network lifetime. To face this challenge, this paper proposes a workable data communication scheme utilizing the hierarchical Least-Mean-Square (HLMS) adaptive filter. The HLMS predicting techniques are explored that predict the measured values both at the source and at the sink, sensor nodes are subsequently required only to send those readings that deviate from the prediction by an error budget. Such data reduction strategy achieves significant power savings by reducing the amount of data sent by each node. We discuss the working mechanism of HLMS in the purpose of data reduction in WSNs, analyze the mean-squared error in the two level HLMS, and design the interactive HLMS prediction algorithm implemented at sink and sensor node and the transmission protocol between them. To elaborate on our theoretical proposal, the HLMS algorithms and protocols are then evaluated by simulation. Simulation results show that our proposed scheme achieves major improvement in convergence speed compared with previous approaches, and achieves up to 95% communication reduction for the temperature measurements acquired at Intel Berkeley lab while maintaining a minimal accuracy of 0.3 degrees C.
作者机构：
[Liansheng Tan] Department of Computer Science,Central China Normal University
会议名称：
2016 First IEEE International Conference on Computer Communication and the Internet
会议时间：
2016-10-13
会议地点：
中国湖北武汉
会议论文集名称：
Proceedings of 2016 First IEEE International Conference on Computer Communication and the Internet（ICCCI 2016）
摘要：
<正>It is my great honor to introduce you to the Proceedings of the First IEEE International Conference on Computer Communication and the Internet（ICCCI 2016）,during 13th Oct.and 15th Oct.2016,Ce
作者机构：
[Tan, Liansheng; Ge, Fei] Huazhong Normal Univ, Dept Comp Sci, 152 Luoyu Rd, Wuhan 430079, Hubei, Peoples R China.
通讯机构：
[Tan, Liansheng] H;Huazhong Normal Univ, Dept Comp Sci, 152 Luoyu Rd, Wuhan 430079, Hubei, Peoples R China.
关键词：
Dynamic path service;Blocking probability approximation;Flexi-grid networks
摘要：
The blocking probability to the path requests is an important issue in flexible bandwidth optical communications. In this paper, we propose a blocking probability approximation method of path requests in flexi-grid networks. It models the bundled neighboring carrier allocation with a group of birth-death processes and provides a theoretical analysis to the blocking probability under variable bandwidth traffic. The numerical results show the effect of traffic parameters to the blocking probability of path requests. We use the first fit algorithm in network nodes to allocate neighboring carriers to path requests in simulations, and verify approximation results. (C) 2016 Elsevier Inc. All rights reserved.
作者机构：
[Tan, Liansheng; Tang, Shengda] Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.;[Tang, Shengda] Guangxi Normal Univ, Sch Math & Stat, Guilin, Guangxi, Peoples R China.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan, Hubei, Peoples R China.
关键词：
Optical burst switching (OBS);Erlangian approximation;Multi-layer stochastic fluid model (MLSFM);Blocking time
摘要：
In an optical burst switching (OBS) network, the blocking time, representing the time interval during which the channel is occupied for a given class of incoming burst, is a key metric for performance evaluation and traffic shaping. In this paper, we study a horizon-based single-channel multi-class OBS node, for which the multiple traffic classes are differentiated using different offset time of each class. By assuming Poisson burst arrivals and phase-type distributed burst lengths and using the theory of Multi-layer stochastic fluid model, we obtain the Erlangian approximation for the finite time probability of the blocking time for a given class of burst in an OBS node. We further propose an explicit algorithm and procedure to calculate the Erlangian approximation. Numerical results are provided to illustrate the accuracy and the speed of convergence of the proposed method.
作者机构：
[Tan, Liansheng; Ge, Fei] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Zhu, Zhongxun] South Cent Univ Nationalities, Fac Math & Stat, Wuhan 430074, Peoples R China.;[Xiong, Naixue] Colorado Tech Univ, Sch Comp Sci, Colorado Springs, CO 80907 USA.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
Best effort traffic;hard quality of service (QoS) traffic;network utility maximization (NUM);QoS;resource allocation;soft QoS traffic;wireless network
作者机构：
[Tan, Liansheng; Zhang, Yongchang] Cent China Normal Univ, Dept Comp Sci, Wuhan 43007, Peoples R China.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 43007, Peoples R China.
关键词：
Network utility maximization (NUM);Resource allocation;Wireless network;Fairness index;Principle of equality and diminishing marginal utility (PEDMU)
摘要：
In this paper, we study the optimal resource allocation problem in a wireless network, where all types of traffic including best effort and quality of service (QoS; Soft QoS and Hard QoS) are described by a unified utility function. The attacked problem is casted into a network utility maximization (NUM) model. We formulate the fairness index in terms of users’ utility and traffic type parameters, and then study their relationships. Law of diminishing marginal utility is widely accepted in economics. In this paper, we establish the principle of equality and diminishing marginal utility that enables us to find the desired optimal solution to the NUM model by using this principle, correspondingly for the case where the total resource is sufficient and for the case where the total resource is insufficient. We propose some essential theorems and algorithms to find the optimal solution for the above two cases. The proposed algorithms are evaluated via simulation results. The theoretical analysis and simulation results not only validate the efficacy and efficiency of the proposed algorithms but also disclose the relation between the optimal resource allocation and the factors of traffic types, total available resource and user’s channel quality and the relation between fairness and total resource with respect to a certain allocation scheme.
摘要：
Inferring traffic matrix (TM) from link measurements and routing information has important applications including capacity planning, traffic engineering and network reliability analysis. The challenge comes from that there are more unknowns than data. To face this challenge, this paper describes the inference problem as an optimization problem, where the objective is to minimize the Mahalanobis distance between the solution and a certain prior distribution, subject to the routing and link measurement constraints. This optimization problem is then solved by the Moore-Penrose inverse of the routing matrix. To reduce the computing complexity, a principal component analysis (PCA) approach is further applied in solving the optimization problem. We obtain the explicit formulas by using the Moore-Penrose inverse and the PCA theory. On the basis of the generalized inverse of routing matrix and the PCA theory, we propose an interesting generalized Tomogravity approach, which is subsequently termed as PCAOM. We present the complete mathematical solution and the algorithm of the described TM estimation problem. By introducing a weight parameter, a generalized algorithm is presented, which can be applied flexibly by adjusting the importance of the prior according to the accuracy of the prior or even no prior is required when the prior is unavailable. Numerical results are provided to demonstrate the accuracy of our method with the dataset of Abilene network through the comparison with the famous Tomogravity method. Given that we have proposed two algorithms for the optimization problem of TM estimation, we also provide a guideline on how to choose the proper algorithm according to the availability of the prior information. (C) 2015 Elsevier Ltd. All rights reserved.
作者机构：
[Tan, Liansheng; Ge, Fei; Zhou, Haifeng] Cent China Normal Univ, Dept Comp Sci, Wuhan 43007, Peoples R China.;[Chan, Sammy] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 43007, Peoples R China.
关键词：
traffic matrix;traffic engineering;network capacity planning and management;network optimization;SNMP
关键词：
data collection;spatial correlation;wireless sensor network;structure fidelity
摘要：
One of the most widespread and important applications in wireless sensor networks (WSNs) is the continuous data collection, such as monitoring the variety of ambient temperature and humidity. Due to the sensor nodes with a limited energy supply, the reduction of energy consumed in the continuous observation of physical phenomenon plays a significant role in extending the lifetime of WSNs. However, the high redundancy of sensing data leads to great waste of energy as a result of over-deployed sensor nodes. In this paper, we develop a structure fidelity data collection (SFDC) framework leveraging the spatial correlations between nodes to reduce the number of the active sensor nodes while maintaining the low structural distortion of the collected data. A structural distortion based on the image quality assessment approach is used to perform the nodes work/sleep scheduling, such that the number of the working nodes is reduced while the remainder of nodes can be put into the low-power sleep mode during the sampling period. The main contribution of SFDC is to provide a unique perspective on how to maintain the data fidelity in term of structural similarity in the continuous sensing applications for WSNs. The simulation results based on synthetic and real world datasets verify the effectiveness of SFDC framework both on energy saving and data fidelity.
作者机构：
[Yu, Jing; Zhu, Zhongxun; Tao, Ting] South Cent Univ Nationalities, Coll Math & Stat, Wuhan 430074, Peoples R China.;[Tan, Liansheng] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Zhu, Zhongxun] S;South Cent Univ Nationalities, Coll Math & Stat, Wuhan 430074, Peoples R China.
关键词：
Cactus;Harary index;Perfect matching
摘要：
The Harary index is de ned as the sum of reciprocals of distances between all pairs of vertices of a connected graph. A connected graph G is a cactus if any two of its cycles have at most one common vertex. Let G (n; r) be the set of cacti of order n and with r cycles, ξ(2n; r) the set of cacti of order 2n with a perfect matching and r cycles. In this paper, we give the sharp upper bounds of the Harary index of cacti among G (n; r) and ξ (2n; r), respectively, and characterize the corresponding extremal cactus.
作者机构：
[Tan, Liansheng; Chen, Gong; Zhang, Wei] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[Zhu, Zhongxun] South Cent Univ Nationalities, Coll Math & Stat, Wuhan 430074, Peoples R China.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
关键词：
quality of service (QoS);soft QoS traffic;network utility maximization (NUM);utility-based allocation for soft QoS (USQ) algorithm;wireless network
摘要：
Optimization theory and nonlinear programming method have successfully been applied into wire-lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non-concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub-optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility-based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users' traffic characteristics, and the users' channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright (c) 2013 John Wiley & Sons, Ltd.
作者机构：
[Tan, Liansheng; Ge, Fei] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.
通讯机构：
[Tan, Liansheng] C;Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.
关键词：
Maximization;Network;Through- put Rates;Two-way Flows;Utility
摘要：
A communication network usually has data packets and ac- knowledge (ACK) packets being transmitted in opposite di- rections. ACK packet ows may affect the performance of data packet ows, which is unfortunately not considered in the usual network utility maximization (NUM) model. This paper presents a NUM model in networks with two-way ows (NUMtw) by adding a routing matrix to cover ACK packet ows. The source rates are obtained by solving the dual model and the relation to the routing matrix of ACK packet ows is disclosed. Furthermore, the source rates in networks with one-way ows by the usual NUM model are compared to those in networks with two-way ows by the NUMtw model.
作者机构：
[Feng, Sheng-Zhong; Meng, Jin-Tao; Yuan, Jian-Rui] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China.;[Meng, Jin-Tao] Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China.;[Meng, Jin-Tao] Chinese Acad Sci, Grad Univ, Beijing 100049, Peoples R China.;[Yuan, Jian-Rui] Cent S Univ, Changsha 410083, Peoples R China.;[Tan, Lian-Sheng] Cent China Normal Univ, Sch Informat Sci & Engn, Wuhan 430079, Peoples R China.
通讯机构：
[Tan, Lian-Sheng] C;Cent China Normal Univ, Sch Informat Sci & Engn, Wuhan 430079, Peoples R China.
关键词：
mobile ad-hoc networks;mobility control;power control;power efficiency
摘要：
Power saving is one of the key issues in Mobile Ad-Hoc Networks (MANETs). It can be realized in Medium Access Control (MAC) layer and network layer. However, previous attentions were mainly paid to MAC layer or network layer with the aim of improving the channel utilization by adopting variable-range transmission power control. In this paper we focus on the power saving in both MAC layer and network layer, and propose a Power Adjusting Algorithm (PAA). In the presence of host's mobility, PAA is designed to conserve energy by adjusting the transmission power to maintain the route's connectivity and restarting the route discovery periodically to find a new route with better energy efficiency dynamically. After analyzing the operations of PAA, we find that the length of route discovery restarting period is a critical argument which will affect power saving, and an energy consumption model is abstracted to find the optimal value of the restarting period by analyzing the energy consumption of this algorithm. PAA can handle the mobility of MANET by adjusting the transmission power and in the meantime save energy by restarting route discovery periodically to balance the energy consumption on route discovery and packet delivering. Simulation results show that, PAA saves nearly 40% energy compared with Dynamic Source Routing protocol when the maximum speed of mobile hosts is larger than 8 m/s.
