Extra back-off flow control in multi-hop wireless networks

CSMA is the predominant distributed access protocol for wireless mesh networks. Originally designed for single-hop settings, CSMA can exhibit severe performance problems in multi-hop networks in terms of stability and end-to-end throughput. To ensure a smoother flow of packets, we examine an enhancement referred to as Extra Back-off (EB) flow control. In this enhanced scheme a node remains silent for a certain extra back-off time (imposed on top of the usual back-off time that is part of CSMA) after it has transmitted a packet, to give both the downstream and upstream neighbors the opportunity to transmit. EB flow control entails only a small modification to CSMA, preserving its distributed character. In order to examine the performance of EB flow control, we analyze a novel class of Markov models at the interface between classical tandem queues and interacting particle systems. The results demonstrate that EB flow control provides an effective mechanism for improving the end-to-end throughput performance.     

Utility-optimal random access control in wireless multi-hop networks with queuing constraints

In this paper, a model of network utility maximization （NUM） is presented for random access control in multi-hop wireless networks. Different from the classical NUM framework, our model considers the queueing stability. We propose a distributed iterative prices and link probabilities adaption algorithm by using dual decomposition techniques, which only requires limited message passing, but converges to the global optimum of the total network utility. Numerical results and simulation comparison validate our conclusion.     

End-to-end delay estimation for multi-hop wireless networks with random access policy

End-to-end delay analysis is an important element of network performance analysis in multi-hop wireless networks.In this paper,we propose an analytical model for estimating the end-to-end delay performance of wireless networks employing a random access policy for managing node’transmissions on shared channels with time-varying capacity.To obtain the closed form expression,a new concept of residual effective capacity is presented using the definitions of effective bandwidth theory and effective capacity theory.This allows us to calculate the cumulative distribution function of the queuing delay.Based on this concept,we derive a formula to calculate the average end-to-end delay for multi-hop wireless networks,with the result including the effect of a random access protocol,which has not previously been considered.Finally,we validate our analysis through simulations and provide an example application for our results.     

Maximum lifetime rate control and random access in multi-hop wireless networks

Network lifetime and transmission quality are of paramount importance for rate control in an energy constrained multi-hop wireless network. It is known that they depend on mechanisms that span several protocol layers due to the existing interference across collision links and the energy constrained nature of wireless nodes. Although separate consideration of these issues simplifies the system design, it is often insufficient for wireless networks when the overall system performance is required. In this paper, we present a framework for cross-layer rate control towards maximum network lifetime and collision avoidance. The main contributions of this paper are twofold. First, although the link attainable rate is typically a non-convex and non-separable function of persistent probabilities, we prove the convergence of this cross-layer algorithm to the global optimum of joint congestion control and random access algorithm under the framework of nonlinear programming. Second, by adjusting a parameter in the objective function, we achieve the tradeoff between transmission quality and network lifetime. Simulations illustrate the desirable properties of the proposed algorithm, including convergence to the global optimum, better performance than the layered scheme, desirable tradeoff between transmission quality and network lifetime.     

Infinitesimal and finite perturbation analysis for queueing networks

The sample-path perturbation analysis technique is extended to include finite (and possibly large) perturbations typically introduced by changes in queue sizes or other parameters. It is shown that there is a natural hierarchy of perturbation analysis which takes care of increasingly large perturbations. Experiments with zero (infinitesimal) and first order (finite) perturbation analysis show that significant accuracy improvement can be obtained with small increase in computational effort.     

无线多跳网络的延迟性能分析

多跳无线网络技术具有广阔的应用前景。研究如何精确地分析、预知和保证多跳无线通信路线的端到端延迟性能非常重要。通过引入一个延迟违约概率的下限,扩展链路层等效带宽模型,并在不同的信道服务速率和无线信道条件下进行模拟。分析和仿真发现,与信道服务速率相比,最大多普勒频移对多跳延迟性能的影响更大。     

Full-state perturbation analysis of discrete event dynamic systems

Discrete event dynamic systems are studied within the framework of perturbation analysis in this paper. Perturbation is extended from the event times only to both event times and queue lengths. An approximate technique, full-state perturbation analysis (PA), is developed as an extension of the PA approach. Full-state PA is able to deal with problems involving queue length perturbations which often defy existing PA methods, while it still retains all the advantages of existing PA. Full-state PA is used to calculate the throughput sensitivity to the number of customers in closed queueing networks and the throughput sensitivity to routing change. Numerical examples are given. Experimental results verify the validity and accuracy.This work is supported in part by the National High Technology Project and by Southeast University Research Funds for Young Teachers.     

可修排队系统GI/G(M/G)/1的可靠性分析

利用更新过程理论和向量马氏过程方法全面考察了可修排队系统GI/G(M/G)/1的结构,得到了所有感兴趣的指标,并证明了服务台的可靠性指标只与系统的忙期、闲期和忙期循环时间有关.     

无线Ad Hoc网络中的功率控制问题

分析了Adhoe网络中节点的能量消费模式,详细论述了几种MAC层的功率控制技术和网络层具有能量意识的路由的主要度量准则,并提出了一些有前景的研究方法。     

Reliability and Feedback of Multiple Hop Wireless Networks

This paper analyzes fault-tolerance over the entire design life of a class of multiple-hop wireless networks, where cooperative transmission schemes are used. The networks are subject to both node failure and random channel fading. A node lifetime distribution is modeled with an increasing failure rate, where the node power consumption level enters the parameters of the distribution. A method for assessing both link and network reliabilities projected at the network's design life is developed. Link reliability is enhanced through use of redundant nodes. The number of redundant nodes is restricted by the cooperative transmission scheme used. The link reliability is then used to establish a re-transmission control policy that minimizes an expected cost involving power, bandwidth expenditures, and packet loss. The benefit and cost of feedback in network operations are examined. The results of a simulation study under specific node processing times are presented. The study quantifies the effect of loop closure frequency, acknowledgment deadline, and nodes' storage capacity on the performance of the network in terms of network lifetime, packet loss rate, and false alarm rate. The study concludes that in a network where energy is severely constrained, feedback must be applied judiciously.     

一种基于IEEE 802.11e的多跳无线网络拥塞控制协议

多跳无线网络中网络拥塞的出现将严重降低网络的性能。基于802.11e提供的区分业务类型的信道接入优先级机制,提出了一种对尽力而为(best-effort)类型业务动态调整其优先级进行网络拥塞控制的协议。该算法的主要思想是对发生网络拥塞的节点提升其业务流传输的优先级使其获得更多的传输机会以缓解拥塞状况,并对严重的网络拥塞状况采取反向施压的策略降低上游节点业务流的转发速率。仿真结果表明,该算法有效地提高了网络重负载情况下的吞吐量。     

无线传感器网络中平均时延约束的自适应休眠机制

针对流量动态变化的无线传感器网络,提出了具有平均时延约束的自适应休眠机制.在休眠阶段,节点采取自适应地周期性休眠和苏醒来节省能量且保证平均传输延迟.在苏醒周期的节点没有数据发送或者收到目的地址为其他节点的RTS/CTS帧后进入休眠周期.通过建立马尔科夫链模型分析可得到该机制中平均时延约束下休眠周期的优化值.     

离散事件动态系统的分析和优化：排队网络模型方法（下）

5近似分析法前面我们介绍了排队网络的三种分析方法,它们都可以求出准确解。这当然是最理想结果,遗憾的是这些方法并不适用于所有的排队网络模型。因此在这一节里我们接着介绍排队网络模型的近似分析。事实上上节已经介绍了一种近似方法:平均值近似分析法。之所以提出近似分析是因为一方面有许多排队网络用现在的理论还无法求出其准确解,因此不得不借助于近似分析;另     

Policy Gradient Approach of Event‐Based Optimization and Its Online Implementation

In the theory of event‐based optimization (EBO), the decision making is triggered by events, which is different from the traditional state‐based control in Markov decision processes (MDP). In this paper, we propose a policy gradient approach of EBO. First, an equation of performance gradient in the event‐based policy space is derived based on a fundamental quantity called Q‐factors of EBO. With the performance gradient, we can find the local optimum of EBO using the gradient‐based algorithm. Compared to the policy iteration approach in EBO, this policy gradient approach does not require restrictive conditions and it has a wider application scenario. The policy gradient approach is further implemented based on the online estimation of Q‐factors. This approach does not require the prior information about the system parameters, such as the transition probability. Finally, we use an EBO model to formulate the admission control problem and demonstrate the main idea of this paper. Such online algorithm provides an effective implementation of the EBO theory in practice.     

Dynamics of Transmission Provision in a Competitive Power Industry

The main objective of this paper is to revisit the operations and planning of an electric power system, and, more specifically, of its transmission system. The intent is to formulate the underlying problems as decision-making problems with specific performance objectives. Once this is done, it becomes possible to identify open research questions on this subject, including their dependence on the overall industry structure.     

Optimization of a PH/PH/1/N Queue with Controllable Service Time and Partial Information

We study a queueing system where both inter-arrival and service times are distributed according to phase-type distributions. This system is modeled as a Markov decision process with full and partial information. The objective is to minimize the long-run average cost of the system. Numerical results are presented.     

无线传感器网络中多跳时间同步算法的研究

提出了一种基于簇型的多跳时间同步算法——CBTS。利用Leach算法将网络划分成不同的簇,在此基础上把节点间的时间同步分为水平同步和垂直同步两个阶段来完成。在水平同步阶段,通过构建基站与簇头节点的层次拓扑结构,采用双向消息交换同步机制来完成簇头节点与基站的时间同步。在垂直同步阶段,采用双向消息交换和参考广播相结合的同步机制,来完成簇头节点和簇成员之间的时间同步,并利用最小方差线性拟合的方法估计了节点的时钟偏差,提高了时钟同步的精度,最终实现了整个网络节点的时间同步。经过仿真测试,证明该算法具有较低的消息交换开销和不错的同步精度。     

Model-based approach for available bandwidth prediction in multi-hop wireless networks

We present a complete and practical analytical model for the IEEE 802.11-based multi-hop wireless networks.The features of our model are that it first takes into account the realistic problems both from the physical and MAC (Media Access Control) layers in multi-hop wireless networks,including packet collisions,neighboring interference,hidden node problems,capture effects,non-ideal channels,non-saturated situations and multi-rate sending scenarios,which makes the analytical results more accurate.Second,it r...     

多跳无线网络中基于模型的可用带宽预测

文中首先针对基于IEEE802.11协议的多跳无线网络,建立了一个更完整、实用的分析模型.相对于以往的工作,该模型具有3个突出特点:(i)它从物理层和MAC层上考虑了多跳无线网络中更真实的情况,包括节点周围的干扰、隐藏节点问题、捕获效应、真实的信道环境、非饱和节点以及多速率发送等,从而使得基于该模型的分析结果更准确;(ii)它将网络中业务的带宽需求映射到了模型的参数中,从而可以方便地对带宽敏感业务进行建模分析;(iii)它可以预测性地分析当某一特定带宽的业务进入网络后网络性能的表现.然后,基于该模型提出和验证了端到端可用带宽预测的迭代算法.该算法可以预测新业务进入网络后,一些对可用带宽估计起关键作用的网络参数的变化,因而可以获得更准确的可用带宽信息.该迭代算法收敛速度快且易于实现,具有很好的应用前景.