光无线混合宽带接入网的路由技术研究

文章研究了光无线混合宽带接入网(HOW BAN)后端无源光网络(PON)采用的多点控制协议以及前端无线网状网(WMN)中的各种路由机制,重点研究了几种适用于HOW BAN前端WMN的路由算法:最小跳路由算法、最短路径路由算法、风险和时延感知的路由算法、感知时延路由算法、预测吞吐量路由算法、容量和时延感知的路由算法、能量感知的路由算法、流量限制路由算法、时延区分路由算法。对HOW BAN中的传输协议,文章指出保持服务公平性、保证健壮性、提高服务质量(QoS)、节约能源、保障安全性、适应多频道网络等问题值得深入研究。     

混合光无线传感网络节能路由算法优化

为解决混合光无线传感网络节点因自身能量耗尽而过早消亡的问题.结合改进的蚁群算法,对一般混合光无线传感网络节能路由算法进行优化.首先给出节能路由算法的假定条件,设置算法具体应用场景,然后构建混合光无线传感器网络通信能耗模型,最后从引入路径度量,改进前向蚂蚁和返回蚂蚁的信息素更新规则着手,提高传统蚁群算法收敛速度,以减少能...     

光无线混合宽带接入网的现状和发展

简要介绍了光无线混合宽带接入网(HOWBAN)的网络结构和主要优点,综述了其网络部署、路由机制和生存性问题的研究进展,并指出该领域存在的问题和今后的发展趋势.     

无线传感器网络中基于线性网络 编码的节能路由算法

 该文基于网络编码思想,提出一种无需重传与确认的路由算法,这种算法以最小化单位比特有效数据的能耗为目标,给出最优化数学模型,并用遗传算法进行求解.所提出的免重传路由算法可以降低能耗,减轻节点之间的无线电干扰,节省了节点用于重传数据包所需配置的缓存.     

无线传感器网络中地理能量感知路由的改进

无线传感器网络的首要设计目标是能量的高效利用,所以设计其路由协议需要重点考虑能耗问题。针对WSN的GEAR路由协议,提出一种能耗上的改进方案并进行仿真,仿真结果显示,该方案能明显降低能耗。     

基于跨层网络编码感知的无线传感器网络节能路由算法研究

编码感知路由可以发现路由中的网络编码机会,减少数据传输次数,提高网络吞吐量,是近年来路由算法研究的一个热点.当前编码感知路由存在编码条件失效、未考虑节点能量的问题,不适合直接应用于无线传感器网络.本文提出基于跨层网络编码感知的无线传感器网络节能路由算法CAER (Cross layer coding Aware Energy efficient Routing).提出并证明了修正后的网络编码条件,以解决编码条件失效问题.基于跨层思想,将网络编码感知机制与拓扑控制、覆盖控制结合,挖掘潜在编码机会.提出综合考虑节点编码机会、节点能量的跨层综合路由度量CCRM (Cross layer Coding aware Routing Metric).仿真结果表明,相比现有编码感知路由,CAER能够提高网络编码感知准确性,增加网络编码机会数量5%~15%,延长网络生存时间8%~12%.     

基于博弈理论的无线传感器网络分布式节能路由算法

为了有效解决无线传感器网络路由节能问题,该文提出适合无线传感器网络的节能路由算法。在引入博弈理论概念建立网络模型的基础上,通过对于以往传感器网络簇首选择方法的研究,设计了一种基于博弈论的,兼顾节点剩余能量及簇首分布的节能路由DEER(DistributedEnergy-EconomicalRouting),大大节省了分布式决策网络协议的能量损耗。仿真证明了该方法在无线传感器网络中,能够有效地平衡网络负载,节省节点能量,延长网络寿命。     

光纤无线混合宽带接入网络节能关键技术研究

为减少光纤无线混合宽带接入网络(FiWi)中的能源消耗,在研究了FiWi网络中主要的接入技术及其网络架构的基础上,就FiWi节能技术所涉及的相关标准、MAC层休眠控制机制、网络层节能路由以及新型网络编码实现节能等关键技术进行了深入研究和展望。     

基于业务的光接入网路由选择算法

光接入网有着不同于光骨干网的特点和问题,不能直接套用光骨干网的路由选择算法。提出了一种基于业务的光接入网的路由选择算法。其思想是根据业务类型和重要性构建不同的带权图模型,每一种模型采用相应的子算法,使整体资源得到合理配置。实践证明,该算法能够改善网络的传输质量。     

无线传感器网络路由协议中休眠调度算法的研究

在分析无线传感器网络节能要求的基础上对无线传感器网络路由协议中使用的休眠调度算法进行了讨论,内容包括各种休眠调度算法的基本实现方法、考虑因素以及涉及到的关键技术.最后指明休眠调度对传感器网络节能的重要性.     

光无线混合宽带接入网QoS感知DBA算法

针对光无线混合宽带接入网的特点,提出一种考虑公平性的Qo S感知DBA算法(QDBA)。仿真结果表明:与已有算法相比,QDBA具有较高的吞吐量和较低的平均时延,同时具有更好的公平性和Qo S保障。     

一种基于能耗均衡的ZigBee网络高效混合路由算法

针对目前ZigBee网络混合路由算法寻找开销偏大、能耗不均的问题,提出一种高效混合路由算法( EHCA)。通过采用跨层泛听与优先使用深度大、剩余能量多的节点进行路由的方式,减少部分泛洪寻路分组的转发,均衡节点能耗。仿真结果表明,EHCA的节点能耗均衡、路由开销和网络寿命等性能均优于混合路由算法和树路由算法。     

Context‐aware hybrid satellite‐terrestrial broadband access

One of the key performance targets on the European Commission's Digital Agenda is to provide at least 30‐Mbit/s broadband coverage to all European households by 2020. The deployment of existing terrestrial technologies will not be able to satisfy the requirements in the most difficult‐to‐serve locations, either due to a lack of coverage in areas where the revenue potential for terrestrial service providers is too low or due to technological limitations that diminish the available throughput in rural environments. In this paper, we investigate a hybrid broadband system combining satellite and terrestrial access networks. The system design and the key building blocks of the intelligent routing entities (referred to as intelligent gateways) are presented. To justify the hybrid broadband system's performance subjectively, lab trials have been performed with an integrated multiple access network emulator and a variety of typical multimedia applications that have varying requirements. The results of the lab trials suggest that the quality of experience is consistently improved thanks to the utilisation of intelligent gateway devices, when compared with using a single access network at a time.     

Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply

Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance. Kai Zeng received his B.E. degree in Communication Engineering and M.E. degree in Communication and Information System both from Huazhong University of Science and Technology, China, in 2001 and 2004, respectively. He is currently a Ph.D. student in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. His research interests are in the areas of wireless ad hoc and sensor networks with emphases on energy-efficient protocol, cross-layer design, routing, and network security. Kui Ren received his B. Eng. and M. Eng. both from Zhejiang University, China, in 1998 and 2001, respectively. He worked as a research assistant at Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences from March 2001 to January 2003, at Institute for Infocomm Research, Singapore from January 2003 to August 2003, and at Information and Communications University, South Korea from September 2003 to June 2004. Currently he is a PhD candidate in the ECE department at Worcester Polytechnic Institute. His research interests include ad hoc/sensor network security, wireless mesh network security, Internet security, and security and privacy in ubiquitous computing environments. Wenjing Lou is an assistant professor in the Electrical and Computer Engineering department at Worcester Polytechnic Institute. She obtained her Ph.D. degree in Electrical and Computer Engineering from University of Florida in 2003. She received the M.A.Sc. degree from Nanyang Technological University, Singapore, in 1998, the M.E. degree and the B.E. degree in Computer Science and Engineering from Xi’an Jiaotong University, China, in 1996 and 1993 respectively. From December 1997 to July 1999, she worked as a Research Engineer in Network Technology Research Center, Nanyang Technological University. Her current research interests are in the areas of ad hoc and sensor networks, with emphases on network and system security and routing. Patrick J. Moran received his MSEE from Carnegie Mellon University, 1993. He is currently the CTO and Founder of AirSprite Technologies Inc, and is driving the company to utilize advanced networking protocols for low-power wireless network systems. His interests include architecture, protocols and high performance implementation of emerging communication technologies. Patrick has been involved in deployment of communication and signal processing technologies since graduating from the University of Minn. in 1986. He holds several patents and publications relating to storage, medical and data processing information systems. He is a member of the IEEE.     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

Localized power‐aware alternate routing for wireless ad hoc networks

In this paper, we design a localized power‐aware alternate routing (LPAR) protocol for dynamic wireless ad hoc networks. The design objective is to prolong the lifetime of wireless ad hoc networks wherein nodes can adaptively adjust their transmission power based on communication ranges. LPAR achieves this goal via two phases. In the first phase, energy draining balancing is achieved by identifying end‐to‐end paths with high residual energy. The second phase is designed to effectively reduce the power consumed for packet forwarding. This is achieved by iteratively performing adaptive localized power‐aware alternate rerouting to bypass each (potentially) high‐power link along the end‐to‐end path identified in the first phase. Further, the design of LPAR enables nodes to collect their neighborhood information ‘on‐demand’, which can effectively reduce the overhead for gathering such information. LPAR is suitable for both homogeneous and non‐homogeneous networks. Simulation results demonstrate that LPAR achieves improved performance in reducing protocol overhead and also in prolonging network lifetime as compared with existing work. Copyright © 2008 John Wiley & Sons, Ltd.     

A power controlled interference aware routing protocol for dense multi-hop wireless networks

A key issue impacting the performance of multi-hop wireless networks is the interference among neighboring nodes. In this paper, we propose a novel and practical interference aware metric, termed as Network Allocation Vector Count (NAVC), to estimate the effects of the interference on the average delay and the available bandwidth. This metric can be easily applied to routing protocols designed for 802.11 based multi-hop networks with no modification to the current 802.11 protocol. The design of NAVC as a metric for the AODV [32] routing protocol, as well as a metric for transmit power control, are described in detail. Our simulation results reveal that the NAVC-driven AODV can greatly improve its performance compared to those protocols based on hop-count. For scenarios of densely deployed nodes, the throughput improvement is often a factor near two, indicating that NAVC is more useful as networks grow denser. Moreover, the network lifetime can be notably prolonged when the NAVC is employed to conduct transmit power control. Our approach is essential for emerging applications such as wireless sensor networks where the interference is heavy and the energy is severely constrained.     

一种基于能量感知的弹性光网络RSA算法

弹性光网络具有高频谱效率和灵活性等优点,是光网络发展的主要方向。路由和频谱分配是弹性光网络的核心技术之一。文章提出了一种改进的基于能量感知的弹性光网络RSA(路由和频谱分配)算法,在进行选路和频谱分配时,同时考虑了网络中的能耗和可用频谱资源情况。理论分析和仿真结果表明,与传统RSA算法相比,改进算法可以提高能量效率,降低业务阻塞率。     

An efficient online‐battery aware geographic routing algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are being used in a wide variety of critical applications such as military and health‐care applications. Such networks, which are composed of sensor nodes with limited memory capacity, limited processing capabilities, and most importantly limited energy supply, require routing protocols that take into consideration these constraints. The aim of this paper is to provide an efficient power aware routing algorithm for WSNs that guarantees QOS and at the same time minimizes energy consumption by calculating the remaining battery capacity of nodes and taking advantage of the battery recovery process. We present an online‐battery aware geographic routing algorithm. To show the effectiveness of our approach, we simulated our algorithm in ns2 and compared it with greedy perimeter stateless routing for wireless networks and battery‐aware routing for streaming data transmissions in WSNs. Copyright © 2009 John Wiley & Sons, Ltd.