Energy-aware load-balaning fault-tolerant routing scheme for ad hoc sensor networks

Most routing protocols for sensor networks try to extend network lifetime by minimizing the energy consumption, but have not taken the network reliability into account. An energy-aware, load-balancing and fault-tolerant routing scheme, termed as ELFR was propsed to adapt to the harsh environment. First a network robustness model was presented. Based on this model, the route discovery phase was designed to make the sensors to construct into a hop-leveled network which is mesh structure. A cross-layer design was adopted to measure the transmission delay so as to detect the failed nodes. The routing scheme works with acknowledge （ACK） feedback mechanism to transfer control messages to avoid producing extra control overhead messages. When nodes fail, the new healthy paths will be selected locally without rerouting. Simulation results show that our scheme is much robust, and it achieves better energy efficiency, load balancing and maintains good end-to-end delay.     

城市轨道交通网络单程票卡调配模型

城市轨道交通单程票卡调配是票务组织中的重要组成部分.针对路网票务中心与线路票务中心间票卡调配问题,将其转化为载重能力约束条件下的车辆路径优化问题(Vehicle Routing Problem,VRP),构建以配送成本最小化为目标,以配送车辆路径为决策变量的优化模型,并采用遗传算法求解.以北京市轨道交通网络为对象进行实证分析,结果显示:所构建方法相比单次配送过程,成本平均降低约49.6%;相比既有装卸混合条件下的配送过程,成本降低约18.7%,验证了模型的准确性与有效性.所构建方法能够有效解决轨道交通路网层票卡调配问题,为票务组织提供理论和方法支持.     

Uplink Power Saving Potential of Cellular System with Fixed Relays

This paper presented a scheme of relayed cellular mobile telecommunication network, which only employs fixed digital relays and not more than two-hop relay routes. Power saving potential of the network is deeply studied under the assumption of not occupying additional frequency bands （i. e. relays share the same frequency bands as used by the base stations）. Theoretical analysis and simulation results have both shown that, with the same radio coverage requirement, the necessary effective transmission powers in such a relayed network have greatly decreased compared to conventional cellular network.     

基于交通流时间序列相似性的NCut城市路网分区算法

针对大规模城市道路交通路网分区的实际需求,基于可反映时间序列变化趋势的皮尔逊相关系数和度量空间关系的欧式距离,构建了一种衡量交通流时间序列相似性的综合指标; 结合交通流时间序列的时空相似性特点,引入子区内的空间连通约束,利用归一化割(NCut)算法设计了一种改进的路网静态分区算法; 为体现交通路网分区的时变特征,选取了合适的评价指标来确定每一时间段内合理的分区数量,提出了一种基于时间序列的NCut路网动态分区算法; 利用北京市东北二环区域内采集的路段交通流速度数据,应用所设计的算法对7.23 km2的路网进行分区,对比了晚高峰时期的分区效果。研究结果表明:所提出的分区算法能实现对路网内不同区域交通状况的有效识别,以30 min为间隔的动态分区算法能划分出数量和范围随时间变化的多个可变子区域; 与子区数固定为2、3、4、5的静态分区算法相比,动态分区算法的评价指标分别提升了63.77%、50.06%、6.43%和7.13%,提高了路网分区效果。可见,本文提出的动态分区算法在保证子区内部连通性的基础上可将异质路网划分成多个内部同质子区域,并充分体现交通流动态演化的时空特性,有利于制定动态的多区域边界控制方案。      

Network lifetime global optimization for multi-source and single-sink topology in wireless sensor networks

The multi-source and single-sink (MSSS) topology in wireless sensor networks (WSNs) is defined as a network topology, where all of nodes can gather, receive and transmit data to the sink. In energy-constrained WSNs with such a topology, the joint optimal design in the physical, medium access control (MAC) and network layers is considered for network lifetime maximization (NLM). The problem of integrating multi-layer information to compute NLM, which involves routing flow, link schedule and transmission power, is formulated as a non-linear optimization problem. Specially under time division multiple access (TDMA) scheme, this problem can be transformed into a convex optimization problem. To solve it analytically we make use of the property that local optimization is global optimization in convex problem. This allows us to exploit the Karush-Kuhn-Tucker (KKT) optimality conditions to solve it and obtain analytical solution expression, i.e., the globally optimal network lifetime (NL). NL is derived as a function of number of nodes, their initial energy and data rate arrived at them.Based on the analysis of analytical approach, it takes the influence of data rates, link access and routing method over NLM into account. Moreover, the globally optimal transmission schemes are achieved by solution set during analytical approach and applied to algorithms in TDMA-based WSNs aiming at NLM on OMNeT<++> to compare with other suboptimal schemes.     

输出端口编码的可扩展快速转发方法

提出了一种基于路由器端口编码的转发方法（OPCF），该方法通过在通信源和目的间预先建立起面向连接的端口编码路径，可直接根据端口编码对数据包进行路由，避免了路由表查询开销，实现了基于显式路由的灵活快速转发，有助于网络服务质量的提高和流量工程的实现．由于不需要路由器存储和管理除路由表外的额外信息，OPCF可获得良好的扩展性．由于可隐藏数据包的IP地址信息，OPCF能有效增强网络通信的安全性．原型系统上的实验结果表明，该方法能实现比MPLS更低的端到端延时并能有效提高网络的吞吐量．     

不确定信息下应急救援路径选择模型

迅速有效的震后交通疏散及道路管制措施对降低地震损失具有重要意义.通过定义路网疏散连通度和安全行驶路线,对不确定信息条件下救援疏散和路径选择问题进行描述.将避难点分配、路径规划、车辆容量,以及不确定通行能力作为该问题约束条件,确立了以公交疏散问题为基础的应急救援车辆路径选择模型.考虑到模型仿真的局限性,转化为相同发车间隔下的公交均衡调度问题进行求解.以唐山抽象路网和人口分布为基础进行仿真实验分析,结果表明:不确定信息条件下选择安全救援路径,当救援车辆途中遇阻时,只需调整交叉口转向策略即可顺利通行,保证了救援调度工作的稳定.     

考虑交叉口不同饱和度的路网动态分区方法

为了便于信号控制策略的实施,针对路网中不同状态的交叉口,考虑子区内交叉口的同质性和关联性,提出了基于不同拥挤程度的路网动态分区方法.首先考虑相邻交叉口的交通关联度和相似度,建立了路网动态分区模型;然后结合谱图理论设计了动态分区算法,根据特征向量元素,对路段、交叉口的拥堵程度进行划分;最后提出了动态子区划分评价准则.算例结果表明,本文提出的方法既能有效地保证相关性较强的交叉口划入同一子区,又使得各子区内部路段的拥堵程度比较均衡,有利于各种不同拥挤程度的子区信号控制方案的选择和实施,对于交通信号控制方案的设计有实际的指导意义.     

Full Duplex Communications for Next Generation Cellular Networks: The Capacity Gain

Full duplex communication highly improves spectrum efficiency of a wireless communication link. However, when it is applied to a cellular network, the capacity gain from this technology remains unknown. The reason is that full duplex communication changes the aggregate interference experienced by each communication link in cellular networks. In this paper, the capacity gain from full duplex communication is studied for cellular networks of 4G and beyond, where the same frequency channel is adopted in each cell. A two-layer Poisson point process (PPP) is adopted to model the network topology, and stochastic geometry is employed to derive the coverage probability and the average capacity of typical link in a cellular network. On the basis of these derived parameters, the capacity gain from full duplex communication is determined. Numerical results reveal that without mutual interference cancellation (MIC), the capacity gain is small under various power levels; with perfect MIC at base stations, the capacity gain can exceed 60%; with imperfect MIC at base stations, the capacity gain decreases quickly even with a slight drop of MIC performance.     

带时间窗的地铁配送网络路径优化问题

为应对人们日益增加的货物需求与货车进城难题,提出整合地铁网和道路交通网,形成以地铁列车和城市配送车辆为载体的地铁配送网络.考虑列车开行时间表、客户服务时间窗、城市配送车辆容量等限制条件,构建带时间窗的地铁配送网络路径优化模型,综合优化地铁列车班次的客户分配、出站点的客户分配及末端配送路径.设计随机变邻域的迭代搜索算法(ILS-RVND)进行求解,以成都市地铁3号线运输货物为例,验证了模型和算法的实用性和有效性.结果表明,地铁配送网络配送成本低,准时性高,配送车辆行驶距离短,能满足比货车单独配送更精准的服务需求.     

Dynamic Channel Allocation in Sectored Cellular Systems

It is known that dynamic channel assignment(DCA) strategy outperforms the fixed channel assignment(FCA) strategy in omni-directional antenna cellular systems. One of the most important methods used in DCA was channel borrowing. But with the emergence of cell sectorization and spatial division multiple access(SDMA) which are used to increase the capacity of cellular systems, the channel assignment faces a series of new problems. In this paper, a dynamic channel allocation scheme based on sectored cellular systems is proposed. By introducing intra-cell channel borrowing (borrowing channels from neighboring sectors) and inter-cell channel borrowing (borrowing channels from neighboring cells) methods, previous DCA strategies, including compact pattern based channel borrowing(CPCB) and greedy based dynamic channel assignment(GDCA) schemes proposed by the author, are improved significantly. The computer simulation shows that either intra-cell borrowing scheme or inter-cell borrowing scheme is efficient enough to uniform and non-uniform traffic service distributions.     

车载Ad Hoc网络中位置服务机制研究与设计

作为移动Ad Hoc网络具体应用之一的车载Ad Hoc网络具有许多自身特征,如车辆节点处于十字路口时存在许多等待绿灯的静止节点以及通行速度相对缓慢的通行节点。在考虑了上述特征之后,提出了一种适用于车载Ad Hoc网络的新的位置服务设计方案,该设计方案将位置服务与基于位置的路由协议如无状态路由协议GPSR进行融合。在城市场景下的仿真结果表明:通过与GLS和HLS相比,ILSV获得相当高的查询成功率并具有较优的可缩放性。     

考虑线路输送能力利用的城市轨道交通列车开行方案优化方法

考虑线路输送能力利用的空间不均衡性,建立以线路输送能力利用率最大化、上线车组数和乘客出行费用最小化为目标,以交路形式、发车频率、列车编组为决策变量的多交路列车开行方案优化模型.设计线性加权法与遗传算法相结合的求解算法.结合算例,对比单一交路、嵌套交路和衔接交路最优开行方案下的列车运行效果及在不同客流特征下的适用性.结果表明,以输送能力利用率最大化为目标能够有效提升线路输送能力利用率及其空间均衡性,符合乘客和企业的共同利益;对于单峰型客流集中线路,保持最大客流断面位置及取值不变,当单峰内客流需求比例超过30%时,适宜开行多交路列车.     

拉格朗日松弛启发式算法求解时空网络下的弧路径问题

为减少车辆调度成本,优化车辆运输路径,在时空网络中研究路段作业车辆的弧路径问题;考虑道路出行的时变性,利用车辆运行的时间、空间特征,构建时间-空间网络,建立弧路径问题的时空网络流模型;设计了拉格朗日松弛启发式算法,引入拉格朗日乘子松弛耦合约束,构建拉格朗日松弛问题;进一步通过拉格朗日分解,把松弛问题分解为单车最短路问题;用次梯度算法更新乘子,求解拉格朗日对偶问题,并更新原问题最优解的下界;使用启发式算法获得可行解,并更新原问题最优解的上界;用六结点运输网络和Sioux-Falls网络下的算例对算法进行实证分析。计算结果表明:六结点运输网络中6个算例的上下界间隙值等于0或接近0,Sioux-Falls网络中算例2的间隙值为0.02%,其余5个算例的间隙值等于0,均可以得到质量较高的近似最优解;在最复杂的算例(15辆车,70个任务)中,算法在可接受的时间内也得到了间隙值为0的解,找出了最优的车辆路径;随着迭代次数的增加,拉格朗日乘子会逐步收敛到固定值;当车辆容量从50增加到100时,最优解从52下降到42,说明在任务数和车辆数一定时,适当增加车容量可以降低运营成本。可见,与商业求解器相比,拉格朗日松弛启发式算法的间隙值更小,求解质量更高,可以更有效地求解弧路径问题。      

非均匀多业务分层网络的资源分配策略分析

研究一种支持多种业务(包括语音对话业务和数据流业务)的分层蜂窝网,在信道共享和信道分割 2 种资源分配策略下的网络性能.网络中的数据流业务根据当前的业务负载情况动态分配带宽,并通过双阈值带宽预留(DTBR)来保证不同业务的不同业务质量(QoS).实验数据显示了在不同业务量情况下2种资源分配方法的性能比较.     

基于定长帧的组播QoS路由技术

为高效利用网络资源且平衡负载,结合物理帧时槽交换技术,提出了基于定长帧的组播机制和QoS路由算法MRBP.该算法在满足带宽和时延要求的基础上,最小化时延和平衡节点负载,达到组播树总体时延较小并优化利用网络资源的目的.仿真结果表明,基于该算法建立的组播树具有较好的网络负载平衡性,并能够对服务质量提供较好的保证.     

考虑开行比例的大小交路列车开行方案优化

分析了城市轨道交通的大小交路列车开行比例关系，划分了2种典型的大小交路列车开行比例; 基于跨交路乘客对直达列车的选择偏好与换乘行为，提出了2种开行比例模式下乘客的广义出行费用计算方法; 考虑共线区段列车运行间隔的匹配关系，计算了运营车底数量; 以乘客出行费用和企业运营费用最小化为目标，构建了适用于多编组的大小交路列车开行方案优化模型，并针对开行方案编制流程和模型特点，设计了开行时段优化算法和遗传算法对模型进行求解; 以上海地铁8号线为例，研究了全日列车开行时段划分及其最优开行方案; 考虑固定编组和多编组与大小交路的组合运营模式，分析了单一交路运营与组合运营模式下的最优方案及其运营指标; 研究了乘客选择偏好和时间价值对开行方案和小交路折返站的影响。研究结果表明:与单一交路运营模式相比，大小交路运营模式下的乘客候车时间成本增幅超过11%;固定列车编组条件下，开行比例1:1模式下的小交路长度比开行比例2:1模式下的小交路长4个区间; 多编组运营的早高峰系统总成本降幅超过1.87%，比固定编组运营更具优势; 乘客对直达列车的选择偏好对多编组开行方案的影响较固定编组更大，当选择偏好概率大于0.3时，多编组开行方案的小交路折返站位置向外围延伸; 当时间价值增至原来的1.8倍及以上时，固定编组的运营模式由大小交路变为单一交路。      

Interference and Spectral Efficiency Analysis in Two-hop Cellular Network with Fixed Relays in FDD Mode

IntroductionRelaying is well known for its potential of ex-tending the high data rate coverage of a single basestation and reducing infrastructure deploymentcosts. Moreover, it is efficient in solving the cov-erage problem behind the obstacles and eliminatingblack spots, which even can not be solved by intro-ducing smart antenna technology[1,2]. Some dumbrelays (analog repeaters) have been adopted[1]in2 G and 3 G systems. But in such scenarios, thesignals received are forwarded without any si…     

北京市道路交通仿真平台建设及应用

为最大限度挖掘北京市城市道路供给能力,特别是交叉口及重点区域的道路通行能力,北京市交通管理部门设计并建设了北京市道路交通仿真平台。该平台采用Browser/Server模式,在VISSIM仿真软件基础上进行二次开发。平台支持北京市大范围的区域路网和重点交叉口的交通组织优化仿真,能对交叉口渠化、信号灯协调控制、出入口控制、大型活动车辆和人员疏散、交通勤务路线设计、道路施工影响评价等交通组织与管理方案进行仿真评价。通过对单个交叉口的交通组织方案进行设计与仿真,验证了平台的准确性和可靠性。结果表明:该平台能够对交通管理进行科学评估和优化,实现交通需求分析从定性到定量的转变,并能够提高交通决策的科学化和精细化水平。     

天水市公共交通线网规划研究

依据天水市总体规划和远景发展目标,结合天水市的地理状况和旅游特性,根据天水市道路网及公交线网的现状,提出公交线路布线原则与优化目标,评价现有公交线路的合理性,在城市道路网上预选公交线路,布设线网,应用最短路径法构建初步线网,引入多路径法分配公交客流量,逐步形成公交线网推荐方案.