The research of cooperative routing algorithm in mobile Ad hoc networks

1 Introduction Ad hoc [1, 2] network is a dynamic-topological mobile self-organized network without any centralized access point. In such a network, each node acts as both host and router simultaneously, entering and departing from the network freely. How…     

Load-balanced broadcast routing in wireless Ad-hoc networks

In wireless Ad-hoc networks, where mobile hosts are powered by batteries, the entire network may be partitioned because of the drainage of a small set of batteries.Therefore, the crucial issue is to improve the energy efficiency, with an objective of balancing energy consumption.A greedy algorithm called weighted minimum spanning tree (WMST) has been proposed, in which time complexity is O(n2).This algorithm takes into account the initial energy of each node and energy consumption of each communication.Simulation has demonstrated that the performance of the proposed algorithm improves the load balance and prolongs the lifetime.     

Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing

On-demand routing protocols are widely used in mobile Ad-hoc network (MANET). Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem (BSP). A location-aided probabilistic broadcast (LAPB) algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay (DD) in the routing discovery phase.     

Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network

Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths.However,under some circumstances if multiple paths cannot be established based on the current network topology,the traditional multi-path routing mechanism will degenerate into single path routing mechanism,thus the advantages of multi-path routing cannot be exhibited.To enhance the end-to-end path reliability,an adaptive multi-path routing mechanism with path segment is proposed,in which multi-path can be establ...     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

Graph partitioning algorithm for opportunistic routing in large-scale wireless network

.     

一个基于层次结构的Ad hoc网络移动模式

采用连通图中极小支配集概念对平面分布的Ad hoc网络进行层次划分；提出移动节点之间的相关度概念，利用GM-BFS算法来实现Ad hoc网络的簇结构生成。结果显示提出的分簇模式能较好地适应网络的扩展、簇生成算法具有收敛快的特征。     

A fuzzy logic cooperative MAC for MANET

In both wireless local area networks（WLAN） and mobile ad hoc networks（MANET）, the 1EEE 802.11e medium access control （MAC） protocol is proposed for an effective quality of service （QoS） solution. A number of studies have been done to enhance the performance of 802.11e in MANET by independently adjusting contention window （CW） size of each access category （AC） in every node. However, without the cooperation between the high priority flows and lower priority flows, the QoS goal of high priority flows cannot achieve effectively. In this article, a fuzzy logic based cooperative MAC protocol （FLCMAC） is proposed to cooperate amongst network flows and dynamically adjust access probability of each low priority flow affecting the high priority flows to satisfy their QoS requirement. The simulation results indicate that compared to the enhanced distributed channel access （EDCA） scheme of 802.11e, the FLCMAC consistently excels, in terms of throughput and delay under moderate and heavy background traffic both in single-hop and multi-hop scenarios.     

a high-throughput path metric for multi-hop wireless routing

This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput.This paper describes the design and implementation of ETX as a metric for the DSDV and DSR routing protocols, as well as modifications to DSDV and DSR which allow them to use ETX. Measurements taken from a 29-node 802.11b test-bed demonstrate the poor performance of minimum hop-count, illustrate the causes of that poor performance, and confirm that ETX improves performance. For long paths the throughput improvement is often a factor of two or more, suggesting that ETX will become more useful as networks grow larger and paths become longer.This research was supported by grants from NTT Corporation under the NTT-MIT collaboration, and by MIT’s Project Oxygen.Douglas De Couto received his Ph.D. in Computer Science from MIT in June 2004 for work in multi-hop wireless routing. He was a member of MIT’s Computer Science and Artificial Laboratory. He also received his S.B. and M.Eng. degrees in Computer Science and Electrical Engineering from MIT, in 1998. His research interests include multi-hop wireless networks, sensor and embedded networks, and applications of GPS. E-mail: decouto@csail.mit.eduDaniel Aguayo is a graduate student in MIT’s EECS department and a member of MIT’s Computer Science and Artificial Intelligence Laboratory. He received an S.B. in Computer Science and Electrical Engineering from MIT in 2001, and an M.Eng. in 2002. His research interests are focused on multi-hop wireless networks. E-mail: aguayo@csail.mit.eduJohn Bicket is a graduate student in MIT’s EECS department and a member of MIT’s Computer Science and Artificial Intelligence Laboratory. He received a B.S. from Cornell University. His research interests include multi-hop rooftop 802.11 networks and device drivers. E-mail: jbicket@csail.mit.eduRobert Morris is an associate professor in MIT’s EECS department and a member of MIT’s Computer Science and Artificial Intelligence Laboratory. He received a Ph.D. from Harvard University for work on modeling and controlling data networks with large numbers of competing connections. He co-founded Viaweb, an e-commerce hosting service. His current interests include routing in multi-hop rooftop 802.11 networks, modular software-based routers, distributed hash tables, and peer-to-peer file storage. He has received a Sloan Fellowship, an NSF Career award, and the ITT Career Development Chair at MIT. E-mail: rtm@csail.mit.edu     

无线传感器网络路由协议性能研究

无线传感器网络是目前网络研究的热点,其路由协议的设计是最具挑战性的问题之一,对目前典型的无线传感器网络的路由协议进行分类研究和性能分析,设计并实现了在NS2环境下典型协议的仿真场景和性能分析比较。对无线传感器网络路由协议的研究和组网具有参考指导意义。     

On-demand coding-aware routing in wireless Mesh networks

Network coding,which exploits the broadcast nature of wireless medium,is an effective way to improve network performance in wireless multi-hop networks,but the first practical wireless network coding system COPE cannot actively detect a route with more coding opportunities and limit the coding structure within two-hop regions.An on-demand coding-aware routing scheme(OCAR)for wireless Mesh networks is proposed to overcome the limitations specified above by actively detecting a route with more coding opportunities along the entire route rather than within two-hop regions.Utilizing more coding opportunities tends to route multiple flows 'close to each other' while avoiding interference requires routing multiple flows 'away from each other'.OCAR achieves a tradeoff by adopting RCAIA as routing metric in route discovery,which is not only coding-aware but also considers both inter and intra flow interference.Simulation results show that,compared with Ad-hoc on-demand distance vecfor routing(AODV)and AODV+COPE,OCAR can find more coding opportunities,thus effectively increase network throughput,reduce end to end delay and alleviate network congestion.     

Reliable routing mechanism based on neighbor stability for MANET

One critical issue for routing in mobile Ad-hoc networks (MANETs) is how to select a reliable path that can last longer because mobility may cause frequent breakdown in radio links. A novel routing mechanism based on link lifetime estimation is proposed in this article. In this mechanism, the node's received signal strength is obtained continuously by using Newton interpolation polynomial, and by method of middle value and interception, the reference points are selected to estimate the link lifetime. With the constraint of link lifetime and hop counts, the source nodes set up the route hop by hop. The simulations show that link lifetime can be predicted regardless of mobility pattern. Moreover, the route discovery times and packet drop ratio can be reduced by the proposed mechanism, and thus improving the performance of MANETs.     

无线Ad-hoc网络及其关键技术

本在介绍了无线Ad-hoc网络发展情况的基础上，分析了其面临的挑战及相应的关键技术，并对蜂窝网与Ad-hoc网络的结合及无线Ad-hoc网络中无线资源管理进行探讨。     

一种基于自组网络的无线抄表系统研制

研制一种符合国家无委会民用计量频段的基于射频发射自组无线网络的无线抄表系统,采用CFDA微蜂窝式固定无线数据接入平台实现网络的自组织功能;采用最新的MCU＋RF一体化集成方案的超低功耗芯片Si1010设计集中器和采集器;软件编程实现按需DSR路由协议;集中器通过GPRS与控制中心通信,接入Web平台,实现快速自动抄表,系统构建简单方便,性价比高,更加利于实现智能小区无线抄表。     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks

We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology information obtained during the location request phase to establish geographic paths to their respective destinations. Geographic paths decouple node ID’s from the paths and are immune to changes in the network topology. Further, they help nodes avoid dead-ends due to greedy forwarding. To utilize geographic paths even in sparser networks, OGPR uses a path-healing mechanism that helps geographic paths adapt according to the network topology. We present extensions to OGPR protocol to cope with networks containing unidirectional links. Further, we present results from an extensive simulation study using GloMoSim. Simulation results show that OGPR achieves higher percentage packet delivery and lower control overhead, compared to a combination of GPSR+GLS protocols, AODV, and DSR under a wide range of network scenarios.     

移动自组网典型路由协议的性能分析与比较

分析了移动自组网的先应式路由协议DSDV和按需路由协议AODV与DSR,并通过网络仿真软件ns2进行了仿真实验,对其分组投递率,端到端平均时延、吞吐量、路由开销等方面的性能进行了分析和比较.实验结果表明,按需路由协议具有更好的性能.     

High throughput route selection in multi-rate wireless mesh networks

Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity （WiFi） mesh networks. It uses the medium access control （MAC） transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector （AODV） routing can be improved as high throughput AODV （HT-AODV）. Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.     

Rate allocation strategies for energy-efficient multipath routing in Ad-hoc networks towards B3G

Wireless mobile Ad-hoc network is a special network that all nodes can self-organize and work together. It is flexible to form a network and extend the coverage area dynamically without infrastructure, so Ad-hoc network is envisioned as cornerstones of future generation networking technologies (B3G or 4G). However, the dynamic network topology makes the communication cost not only the energy of source/destination nodes, but also the relay nodes. Another problem of the Ad-hoc network is it is hard to provide a stable and persistent quality of service (QoS), which is strongly required by the beyond 3rd generation (B3G) system. In this article, the authors establish a scenario that contains B3G cellular base station and Ad-hoc mobile nodes, and propose two algorithms minimum incremental rate algorithm and power feed-back rate allocation algorithm in multipath routing. The algorithms can maintain a constant total transmission rate and bit error ratio (BER) to provide the QoS guarantee and reach the minimum power consumption of the relay nodes by adjusting the rate of each path in the multipath routing.     

Secure routing in mobile wireless ad hoc networks

We discuss several well known contemporary protocols aimed at securing routing in mobile wireless ad hoc networks. We analyze each of these protocols against requirements of ad hoc routing and in some cases identify fallibilities and make recommendations to overcome these problems so as to improve the overall efficacy of these protocols in securing ad hoc routing, without adding any significant computational or communication overhead.