Cao Trong Hieu

A Connection Entropy-based Multi-Rate Routing Protocol for Mobile Ad Hoc Networks

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node’s mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

A new routing protocol with high throughput route metric for Multi-Rate Mobile Ad-hoc Networks

In this paper, we propose a new routing protocol to support the selection of stable and high speed route in Multi-Rate Mobile Ad-hoc Networks (MANET). We introduce another approach for modeling the mobility aspect under the relation with the variation of communication rate. Maximize the proposed “Route Selection Indicator” (RSI) ensures that the the selected route is the most stable, has highest speed among route candidates. The correctness of proposal is proved and the simulation results show that our proposed approach provides an accurate and efficient method for evaluating and selecting the best route in mobile environments.

RAI: A high throughput routing protocol for multi-hop Multi-Rate Ad hoc Networks

In this paper, a high throughput routing protocol for Multi-Rate Ad-hoc Networks using lower layer information is proposed. Maximize the proposed “Route Assessment Index” metric ensures that the selected route has high throughput and reliable links. Also, the chosen route could avoid link bottleneck, hence, reducing the packet drop rate. The correctness of the proposal is proved and the simulation results show that our new metric provides an accurate and efficient method for evaluating and selecting the best route in Multi-Rate Ad-hoc Networks.

A reliable and high throughput Multi-Rate Ad Hoc routing protocol: Cross layer approach

In this paper, a high throughput routing protocol, using the MAC layer information, for Multi-Rate Ad-hoc Networks is proposed. By choosing the route with the minimum value of the proposed “Route Assessment Index”, the selected route is ensured to have high throughput with links reliability. Also, link bottleneck could be avoided in the chosen route. Hence, the packet drop rate is also decreased. The correctness of the proposal is proven and the simulation results show that our new metric provides an accurate and efficient method for evaluating and selecting the high throughput route in Multi-Rate Ad-hoc Networks.

Securely Deliver Data by Multi-path Routing Scheme in Wireless Mesh Networks

Wireless Mesh Networks with static Transit Access Points (TAPs) have many advantages to connect different kinds of networks. While Mobile Ad hoc Networks still have many challenges to improve because of dynamic topology and security vulnerabilities, WMNs are the best solution for wireless communication recently. To utilize the characteristics of WMNs topology, in this paper, we propose an algorithm to preserve privacy for routing. This idea comes from the fact that if we can separate data traffic into more than one path, the probability to capture all traffic from intermediate node is very small. It means it is very difficult to launch traffic analysis attacks because of traffic confidentiality. In addition, to hide securely the real source and destination addresses a new technique is proposed along with an Adaptive Key Agreement Scheme. We apply Information Entropy to model our routing traffic and highlight the robustness of the algorithm. We also present a detail traffic evaluation observed from neighboring nodes to show the availability of our proposal in term of robustness, loop free and computational overhead.

Adaptive algorithms to enhance routing and security for wireless PAN mesh networks

Wireless PAN Mesh Network (WMN) is currently going to be standardized and enhanced to take full advantages of the flexible and heterogeneous networks Although the standard (802.15.5) is under-construction, WMNs are expected to become popular as they have the ability to connect all kinds of current networks So far, there is no applied architecture which is efficient enough to completely solve routing and security problems in WMN To assist IEEE P805.15 in routing and security aspects, in this paper, we propose an adaptive algorithm for detecting bogus nodes when they attempt to intrude into the network by attacking routing protocol In addition, a procedure to find the most optimal path between two nodes is presented along with adaptive pre-conditions for WMNs We also show that our algorithm is robust according to the mobility of the nodes and it is easy to implement in currently proposed architectures It can work with many kinds of wireless networks as well as can reduce computational costs.

A multi-rate routing protocol with connection entropy for mobile ad hoc networks

In Mobile Ad hoc Networks (MANETs), when mobile nodes move to another location, the relative distance of communicating nodes will directly affects the data rate of transmission. The further distance between two communicating nodes is, the lower rate that they can use for transferring data. The connection certainty of a link also changes because a node may move closer or far away out of communication range of other nodes. Taking into account those issues, this paper proposes a new routing metric for MANETs. The new metric consider both link weight and route stability that be defined in relation with connection entropy. The problem of determining the best route is subsequently formulated as the constrained minimization of an object function formed as a linear combination of the link weight and and the uncertainty of connection of that link. The simulation results show that proposed routing metric improves end to end throughput and reduces the percentage of link breakage and route reparation.