链路可靠的无线传感器网络组播路由协议

在无线传感器网络实际应用中,组播正在发挥着越来越重要的作用.但由于能量等多方面的因素,使得为无线传感器网络设计一个有效的组播路由是非常困难的.针对无线传感器网络中节点的能量限制,通过寻求节点间最短路径,提出一种能量有效的链路可靠组播路由协议(RLMR).该协议充分考虑到网络中节点的能耗因素和两节点间的链路可靠性等,通过对这两个因素的综合考虑,让能量较多并且以发送节点更靠近的节点承担更多传输任务的方式,为数据流优化路由选择,均衡无线传感器网络节点的能量消耗,以延长网络的生存时间.仿真结果证明了RLMR的有效性和可靠性.     

Cross-Layer Design Based Optimized Link State Routing Protocol for Wireless Mesh Networks

A proactive routing protocol CL-OLSR (cross-layer based optimized link state routing) by using a brand-new routing metric CLM (cross-layer metric) is proposed. CL-OLSR takes into account four link quality impact factors in route calculation through the cross-layer operation mechanism: the node available bandwidth, the node load, the link delivery rate, and the link interference, and thus the effect of route selection is optimized greatly. The simulation results show that the proposed CL-OLSR protocol can not only improve the network throughput to a large extent, but also reduce the end-to-end delay, while achieving load balance route results.     

移动Ad hoc网络中基于链路稳定性预测的按需路由协议

移动Ad hoc网络拓扑的高度动态变化是造成传统按需路由协议的路由频繁通断的主要原因,因此在传统按需路由协议的基础上进行链路稳定性预测扩展,增强路由稳定性具有十分重要的意义。该文利用分组的接收功率把节点间的相对运动划分为靠近和远离两种类型,然后在不同相对运动类型下根据节点间距离得到了的链路平均维持时间。在路由过程中,中间节点利用得到的链路平均维持时间设置请求报文的转发延迟,通过一定转发规则选择稳定性较强的链路构成路径。仿真结果表明进行链路稳定性预测扩展后的按需路由协议能够有效增强路由的稳定性,并提高网络性能。     

Fuzzy Logic Based Reliable and Real-Time Routing Protocol for Mobile Ad hoc Networks

Wireless Personal Communications - MANET (mobile ad-hoc network) includes a set of wireless mobile nodes which communicate with one another without any central controls or infrastructures and they...     

Checkerboard-Like Routing Protocol for Ad Hoc Mobile Wireless Networks

The main purposes of this article are to relieve broadcast problem, to immunize to some prerequisites, and to reduce the number of transmitted control packets. Broadcasting control packets network-wide is the most direct and common method for finding the required destination node in ad hoc mobile wireless networks; however, this causes a lot of waste of wireless bandwidth. To remedy the problem, routing protocols demanding some prerequisites are proposed; nonetheless, hardly can they be used if these prerequisites are missed or become stale. To efficiently reduce the number of transmitted control packets, our routing protocol partitions the network into interlaced gray districts and white districts by the aid of GPS and inhibits an intermediate node residing in a white district from re-transmitting the received control packets. However, a mobile node residing in a gray district is responsible for re-transmitting them till they reach the destination node. Our routing protocol does not demand any prerequisite except the use of GPS. Each mobile node can always obtain its own location information; furthermore, the information may neither be missed nor become stale. Our routing protocol is easy to be implemented, saves precious wireless bandwidth, and reduces almost half a number of control packets as compared with pure flooding routing protocols.Ying-Kwei Ho received the B.S. degree and M.S. degree in applied mathematics and in electrical engineering from the Chung-Cheng Institute of Technology in 1987 and 1993 respectively and the Ph.D. degree in computer engineering and science from the Yuan-Ze University, Taiwan, R.O.C. He joined the Army of Taiwan, R.O.C. in 1987 and worked as a software engineer. From 1993 to 1997, he was an instructor in the War Game Center of Armed Forces University, Taiwan, R.O.C. He is currently an assistant professor of the Department of Computer Science at Chung-Cheng Institute of Technology. His research interests include mobile computing, wireless network performance simulation and evaluation, and modeling and simulation.Ru-Sheng Liu received the B.S. degree in electrical engineering from the National Cheng-Kung University, Taiwan, in 1972 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Dallas, Richardson, Texas, in 1981 and1985, respectively. He is currently an associate professor in the Department of Computer Engineering and Science at Yuan-Ze University, Chungli, Taiwan. His research interests are in the areas of mobile computing, internet technology, and computer algorithms.     

A Scalable and Reliable Multicast Routing Protocol for Ad-hoc Wireless Networks

Multicasting is an essential service for ad-hoc wireless networks. In a multicasting environment with multiple senders, receivers or meeting members, traditional multicast routing protocols must pay great overhead for multiple multicast sessions. This work presents a scalable and reliable multicasting protocol for ad-hoc wireless networks. A virtual backbone is used as a shared structure for multiple sessions. A clustering scheme is used to reduce the routing path length. A novel scheme is developed to effectively multicast packets using forwarding gates. Furthermore, a lost packet recovery scheme is developed for reliable packet transmission. This scheme can be used to improve the reliability of traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme and the results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio, packet delivery time, control overhead, multicast efficiency, and cost effect. Furthermore, our approach is stable for networks with high mobility and the lost packet recovery scheme is cost-effective. Chyi-Ren Dow was born in 1962. He received the B.S. and M.S. degrees in information engineering from National Chiao Tung University, Taiwan, in 1984 and 1988, respectively, and the M.S. and Ph.D. degrees in computer science from the University of Pittsburgh, USA, in 1992 and 1994, respectively. Currently, he is a Professor in the Department of Information Engineering, Feng Chia University, Taiwan. His research interests include mobile computing, ad-hoc wireless networks, agent techniques, fault tolerance, and learning technology. Jyh-Horng Lin was born in 1975. He received the B.S. and M.S. degrees in information engineering from Feng Chia University, Taiwan, in 1998 and 2000, respectively. He is currently a candidate for the Ph.D. degree in the Department of Information Engineering, Feng Chia University, Taichung, Taiwan. His research interests include mobile computing and ad-hoc wireless networks. Kun-Tai Chen was born in 1978. He received the B.S. and M.S. degrees in information engineering from Feng Chia University, Taiwan, in 2000 and 2002, respectively. He is currently an engineer in the VIA technologies, Inc. Hsinchu branch, Taiwan. His research interests include mobile computing, ad-hoc wireless networks and video decoding. Sheng-Chang Chen was born in 1979. He received his B.S. degree and M.S. degree in information engineering from Feng Chia University, Taiwan, in 2001 and 2002. He is currently a Ph.D. degree in information engineering from Feng Chia University, Taiwan. His research interests include mobile computing, ad-hoc wireless network and fault tolerance technique. Shiow-Fen Hwang was born in 1963. She received her B.S., M.S. and Ph.D. degrees in Applied Mathematics from National Chiao Tung University, Taiwan, in 1985, 1987 and 1991, respectively. Currently, she is an Associate Professor in the Department of Information Engineering, Feng Chia University, Taiwan. Her research interests include interconnection networks, mobile computing, and computer algorithms.     

移动无线传感网络簇头多跳路由协议

随着无线传感器网络在移动环境中广泛应用,移动环境下降低能耗成了传感网络研究的热点.通过研究移动环境下的各种路由协议,并结合LEACH协议自身存在的问题,提出了一种支持移动的簇头多跳的路由算法.该协议充分考虑了剩余能量、速度和距离,以及簇头选取和簇的构成方法,提出新的权值函数,从而有效地支持节点移动.仿真结果表明,该协议有效地均衡了节点能耗,提高了能量利用率,延长了网络寿命.     

End-to-End Link Reliable Energy Efficient Multipath Routing for Mobile Ad Hoc Networks

Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol.     

无线多跳混合路由视频传输

提出了一种同时利用机会路由和传统路由进行跨层优化的实时视频传输方法,通过将I帧和P帧分别利用不同路由进行传输,获得了比单独利用传统路由或机会路由更好的性能。     

移动自组网中联合优化设计的MAC/路由协议

文章针对节点数量多、密度大的一类移动自组网提出了一种跨层联合设计的MAC/路由协议.在MAC层上采用基于调度的信道分配算法以减少通信冲突,在网络层上结合使用表驱动路由和基于地理位置的路由来提高协议适应动态拓扑的能力,并设计了适合TDMA MAC协议的高效的消息交互机制.在OPNET仿真平台上与AODV/802.11和G...     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.     

基于拓扑优化和链路感知的无线体域网路由协议

为解决无线体域网(Wireless Body Area Networks,WBAN)在人体运动过程中网络拓扑结构频繁变化导致链路质量和WBAN性能下降等问题,首先根据人体结构对WBAN网络拓扑进行优化,通过添加中继节点建立WBAN主干网,提供节点和hub之间相对稳定的链接,然后提出了适用于WBAN拓扑优化后的路由策略(Routing Protocol Based on Topology Optimization and Link Awareness,R-TOLA)。R-TOLA综合了链路质量感知和代价函数,通过调整主干网中继和节点中继获得最优化路径。仿真实验表明,基于拓扑结构优化和链路感知的R-TOLA协议和其他路由协议相比,在人体拓扑网络结构频繁变化的环境下具有网络生存时间更长、吞吐量更大等优势。     

A Reliable Multicast Routing Protocol Based on Recovery Points and FEC in Mobile Ad-hoc Networks

Multicasting is an essential service for mobile ad-hoc networks. A major challenge for multicasting in mobile ad-hoc networks (MANETs) is the unstable forwarding path. This work presents a reliable multicasting protocol for mobile ad-hoc networks. A virtual backbone is used as a shared structure for multiple sessions. A lost packet recovery scheme is developed for reliable packet transmission, called the Recovery Point (RP) scheme. The RP scheme maintains the data packets received from the source for recovering lost packets for its downstream RPs. In addition, we combine the Forward Error Correction (FEC) technology with our RP scheme to enhance the reliability of our RP scheme. A mergence scheme for RP is also proposed to avoid excessive control overhead. Our RP and FEC based scheme can be used to improve the reliability and efficiency of the traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme. The results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio and multicast efficiency. Furthermore, the simulation results also demonstrate that our approach is stable in networks with high mobility.

基于可靠稳定性评价的MANET多路径路由优化算法

针对移动Ad hoc网络动态拓扑特性,该文提出一种以可靠路径稳定度估计为基础的多路径路由优化算法。该算法从路径剩余生存期统计特性出发,充分考虑相邻链路生存期相关性,从而消除已有算法在路径稳定度估计中存在的理论误差,并利用优化后的稳定度准则实现路由发现进程的多路径选取和基于备用路径支持的快速路由修复。仿真对比结果表明,该算法具有较快的收敛速度,能够有效提高网络吞吐量,缩短数据传输时延并降低路由开销,更好地保证较高节点移动度下的数据传输稳定性。     

A Novel Routing Protocol for Supporting QoS for Ad Hoc Mobile Wireless Networks

The main purposes of this article are to lessen the influence of the fastchanging network topology, rapidly varying bandwidth information, and the increasing size of routing tables onquality of service routing. Based on DSDV (Destination-Sequenced Distance-Vector) routing protocol formaintaining up-to-date routing information, the related research has to update routing tables when networktopology changes; moreover, the routing tables must be updated periodically even though the networktopology has not changed. To put emphasis on QoS routing, they also have to exchange routing tables by thetime of bandwidth information changes. Furthermore, the size of routing tables increases with the numberof mobile nodes; therefore, the precious wireless bandwidth is wasted on transmitting the large-scalerouting tables. In this article, we propose an on-demand-based QoS routing protocol to mitigate theseproblems and to achieve the QoS requirement. The goal of this article is to discover an optimal routewith minimum time delay for transmitting real-time data from a source node hop by hop to adestination node under some predefined constraints. Our contributions are as follows: our researchprovides a rigorous bandwidth definition and bandwidth application, a broad view of bandwidth calculationand reservation, minimizing the size of control packets and the number of control packet transmissions,and an efficient QoS routing protocol.     

基于路径稳定性的Ad Hoc网络按需路由算法设计

鉴于Ad Hoc网络的高移动性,选择一条稳定的路径进行通信尤为重要.文章借鉴AODV按需路由的思想,提出了基于路径稳定性的路由算法PSR(Path Stable based on-demand Routing),通过引入路径有效因子PEF(Path Efficieney Factor)来考虑可行路径的稳定性问题,增强了所选路径的稳定性,减少了由于节点运动引起的链路断裂次数.性能分析和仿真结果表明,与AODV相比,PSR减少了开销,提高了效率,使得算法的性能得到了提升.     

Routing Protocol Based on Tabu Search for Wireless Sensor Networks

This paper investigates the proposition of a new routing protocol for wireless sensor networks called TSRP (Tabu Search based Routing Protocol). In this protocol, we use the mechanism of the meta-heuristic Tabu search to route the data from the sensor (that has sense the events) to the sink. This mechanism is used to select the next sensor that will route the data based on a cost function (considering the energy and the visibility of this sensor compared to the sink). Simulation results, on a car parking application, show that TSRP prolongs the network lifetime than the existing protocols.