Ad Hoc Network Routing Algorithm Based on Energy Balanced Connected Dominating Set

Power-aware routing has proven to be effective in maximizing the life time of ad-hoc networks. However, all the previous research focused on the power-aware routing algorithms in a cooperative network, where all the nodes honestly report battery usage. However, selfish nodes in ad-hoc networks have incentives to misreport lower residual energy to maximize their own usage. In this paper, we first show that it is a dominant strategy for a selfish node to report lower residual energy in a power-aware ad-hoc network, which diminishes the benefits of power-aware routing algorithms. We then propose a novel power-aware reputation system (PARS), to stimulate cooperation on power-aware routing in ad-hoc networks. Analysis and simulation results show that PARS is effective in supporting power-aware routing in selfish ad-hoc networks.

This article presents a hybrid genetic algorithm (GA) with two-optimization algorithm, to find a solution to the problem routing in Ad Hoc network big map, the objective is to find the shortest possible distance between a transmitter head (cluster, node, intermediate or advanced) and the base station. From studies and remarks, it has been proved that in the topologies of the large Ad Hoc network, the node responsible for transmitting to the base station sometimes used up its total energy and became inactive. So, there are many techniques to solve the problem routing in Ad Hoc networks, like GA (Genetic Algorithm), SA (Simulated Annealing), and BA (Bat Algorithm). In this article, we are focus on the (GA) that are present in the basic approaches of our work. We propose an analysis of these metaheuristics by identifying the fundamental ideas and propose ways to guide the choice of a metaheuristic in practice, particularly in Ad Hoc big map network, to find the best path between two nodes in communication. Thereafter, we try to more optimizer our algorithm by using a 2-optimizer algorithm, and we compare between two method GA and GA-2opt, the result show much better quality of our solution to adjust the problem of routing in big map Ad Hoc network.KeywordsArtificial intelligenceGenetic algorithmTwo-optimization algorithmAd Hoc network

Most conventional channel models are not capable of capturing the joint spatial correlation of shadowing processes between a large number of meshed radio channels in an ad-hoc wireless communications network. In this paper, we present a sum-of-sinusoids (SOS) based simulation model for the joint shadowing process in urban peer-to-peer radio channels. The performance of the proposed channel simulator is analyzed in terms of the autocorrelation and joint correlation function of the simulated shadowing process. Simulations illustrate that the proposed model is able to generate deterministic output shadowing values with a Normal distribution (in dB) and desired correlation properties. It is thus suitable for use in system level simulations, such as the evaluation of routing and radio resource management algorithms in ad-hoc networks.

Link state has been the dominating IGP routing technology in IP networks for more than a decade. With the advent of wireless ad-hoc networking, the need for light, efficient and robust routing makes it a good candidate to be also used in this constrained environment. One of the key issue in ad-hoc networking is the lack of bandwidth. Thus, in this paper we examine the overhead due to link state routing in an ad-hoc network. More precisely we study the classic link-state protocol OSPF and OLSR, a link state protocol that was developed specifically for ad-hoc networks. Further, we study how this overhead evolves when the node density increases. The last part of the paper presents directions towards extending OSPF for wireless and ad-hoc networks, which would make it a favorite to seamlessly unify wired and mobile IP networks.

In this paper, we analyze the advantages and disadvantages of the proactive QoS routing in ad-hoc networks. We discuss how to support bandwidth QoS routing in OLSR (Optimized Link State Protocol), a best-effort proactive MANET routing protocol. Using OPNET, we simulate the algorithm, exploring both traditional routing protocol performance metrics and QoS-specific metrics. Our analysis of the simulation results shows that the additional message overhead generated by the proactive QoS routing have a negative impact on the performance of the routing protocol. Given the negative results, we identified research areas that would be worthwhile investigating in order to obtain better performance results.KeywordsIdle TimePacket Delivery RatioOptimize Link State RoutGood BandwidthBandwidth ConditionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Single-attribute decision-making is often unable to achieve ideal results in Ad Hoc routing problems. Therefore, a multi-attributes decision-making routing algorithm for Ad Hoc network is proposed in order to achieve better optimization results. Compared with single-attribute decision-making, the main issue of multi-attributes decision-making is the Incommensurability between attributes and the contradiction produced by attributes. To deal with this problem, this paper proposes a reinforcement learning based multi-attributes decision-making routing algorithm for Ad Hoc network. We adopt option-critic framework based on hierarchical reinforcement learning to train agents and take into account the transmission bandwidth, packet loss rate, number of communication nodes, transmission delay. For each decision-making attribute, the combination weighting method is used to calculate the weight of each decision-making attribute, and a decision model based on multiple attributes is established. The mobile node selects the best next hop node to forward the data according to the multi-attributes decision model. The proposed algorithm evaluates various attributes and network conditions of mobile nodes comprehensively. Moreover, it can dynamically adjust the routing strategy in real time according to the load status of each node, and distribute the data in the network evenly. The simulation results show that compared with traditional multi-attribute routing algorithm, the algorithm not only has better convergence, but also finds a better path faster than the traditional multi-attribute algorithm when there is a preference for routing attributes. The proposed algorithm also has excellent performance in delivery ratio and cost, and improves the network performance.

Throughput scaling laws of an ad hoc network equipping directional antennas at each node are analyzed. More specifically, this paper considers a general framework in which the beam width of each node can scale at an arbitrary rate relative to the number of nodes. We introduce an elastic routing protocol, which enables to increase per-hop distance elastically according to the beam width, while maintaining an average signal-to-interference-and-noise ratio at each receiver as a constant. We then identify fundamental operating regimes characterized according to the beam width scaling and analyze throughput scaling laws for each of the regimes. The elastic routing is shown to achieve a much better throughput scaling law than that of the conventional nearest-neighbor multihop for all operating regimes. The gain comes from the fact that more source-destination pairs can be simultaneously activated as the beam width becomes narrower, which eventually leads to a linear throughput scaling law. In addition, our framework is applied to a hybrid network consisting of both wireless ad hoc nodes and infrastructure nodes. As a result, in the hybrid network, we analyze a further improved throughput scaling law and identify the operating regime where the use of directional antennas is beneficial. In addition, we perform numerical evaluation in both ad hoc and hybrid networks, which completely validates our analytical results.

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

Routing for ad-hoc wireless network is challenging, and there is no single routing strategy to deal with the complex and dynamic nature of the ad-hoc network. Given the availability of the low cost of location-aware devices, geographic forwarding and routing provided opportunity for improving existing ad-hoc routing strategies. In this paper, geographic forwarding strategies and geographic routing protocols are reviewed; challenges of implementing geographic routing in ad-hoc network are identified and discussed. More research effort is called for improving the basic forwarding strategy to increase the efficiency of the geographic routing protocol to provide a practical solution addressing the issues related to routing around local minima.

본 논문에서는 도심 교차로에서 경로 이탈 확률을 낮추어 줄 수 있는 차량 통신용 라우팅 알고리즘을 제안한다. 차량이 밀집된 도심의 교차로 지역에서는 차량들의 방향 전환으로 잦은 네트워크 단절과 패킷 전송지연 문제를 발생 시킬 수 있다. 본 논문에서는 이러한 문제점을 개선하기 위해 전송 노드 선정 과정에서 같은 진행방향의 노드를 이웃 노드로 선정하여 교차로에서 네트워크 단절의 비율을 낮출 수 있는 VANET (Vehicular Ad-hoc Network)용 라우팅 알고리즘을 제안한다. 시뮬레이션을 통한 성능분석 결과는 제안하는 알고리즘이 기존 라우팅 알고리즘에 비해 도심 교차로에서 경로 이탈 확률을 약 10% 감소시키며 네트워크 단절 비율을 5% 감소시킴을 보인다. This paper proposes a vehicle ad-hoc network (VANET) routing algorithm to reduce the probability of routing path discontinuity in urban intersections. In urban intersections, the vehicles may frequently change their moving directions. It can cause the disconnection of routing path and the increase of a packet transmission delay. In order to resolve this problem, the proposed routing algorithm exploits the information of moving directions in urban intersections. In this way, the proposed algorithm can reduce the probability of the local maximum which causes the increase of the number of routing hops and packet transmission delay. Simulation results show that the proposed algorithm can reduce the local maximum probability by 10% and increase the successful packet transmission ratio by 5% compared to the conventional VANET routing algorithms.

In this paper, we propose a new algorithm for wireless mobile and ad-hoc network, which establishes dynamic cluster of nodes. The proposed algorithm, namely, the Mobility Sensitive Routing Protocol (MSRP), consists of routing in cluster and routing between clusters. Ad-hoc network can utilize MSRP to reduce information exchange and communication bandwidth, to shorten route acquisition delay, and to accommodate more nodes.

This paper proposes a positioning routing algorithm for UWB ad hoc networks. The algorithm is deployed in two main scenarios: Multi-Coordinate System (MCS) and Unique Coordinate System (UCS). A Packet Forwarding Zone (PFZ) is proposed to investigate the performance where a limited forwarding region is used. New ideas have been included in the routing algorithm, such as the use of the Davidon-Fletcher-Powell (DFP) algorithm to estimate the position of the locally available beacon nodes, and the Reference Group (RG) concept as formed by suitable nodes with the Reference Group Master (RGM) chosen as elected by the nodes in the RG. The RG group characteristics particularly apply in the UCS case. In addition, the performance of Direct Method (DM) and DFP position estimation algorithms are also analyzed.

Ad-hoc 네트워크 환경에서의 많은 라우팅 알고리즘들은 소스 라우팅 기법을 기초로 설계되었으며 밀집된 ad-hoc 환경에서의 최단경로설정은 짧은 기간동안만 유지되는 제약사항이 존재한다 때문에 SSA와 ABR과 같은 라우팅 프로토콜은 링크 안정성을 고려하여 좀더 안정적인 경로를 탐색한다. 본 논문은 Ad-Hoc network 환경에 현실적으로 적합한 SSA 라우팅 알고리즘을 바탕으로 utilization 메트릭을 고려한 새로운 라우팅 기법에 대해 제안한다. 제안된 방식에서는 SSA의 특정 메트릭에 의한 병목현상을 해결하기 위해 연결을 위한 여러 경로들을 누적 utilization에 따라 분산시키도록 하여 네트워크상의 로드 밸런싱을 추구하였다. 성능 분석을 위해 기존의 라우팅 기법인 AODV와 SSA를 참고 비교 대상으로 하였다. ns-2 네트워크 시뮬레이션 결과 선택되어질 수 있는 안정적인 route가 많은 경우 전체 트래픽이 여러 경로들로 분산되어 경로 재설정(route reconstruction) 횟수를 현저히 줄이는 좋은 성능을 보였다 Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

Mobile Ad hoc Network is an emerging research area with practical applications. Due to its fundamental nature, however, a malicious attack may disrupt the route discovery process and significantly affect the Quality of Service delivered by the network In this paper, we introduce a new secure routing protocol, Secure On-demand Source Routing (SOSR), which follows a number of basic techniques of ad hoc on-demand routing protocols. Our protocol is based on promiscuous receive mode, successfully defeats different types of identified attacks and detects misbehaviors of abnormal nodes. The only requirement of the protocol is a shared key between the communication end nodes. In particular, the scheme offers low processing overhead for intermediate nodes of the network.

In this paper, first we introduce the basic principle of network coding and the present research situation. Then, in allusion to the limitation that traditional wireless Ad Hoc routing protocol can't support network coding well and that network coding system COPE passively waits for coding opportunity, an improved CA-DSR(Coding Aware-DSR) protocol is presented. This protocol considers the factors: utilizing the coding opportunity, finding the shortest path and neatly avoiding long route delay comprehensively as the route selection criteria. The simulation results on NS2 Simulation platform show that the improved routing protocol can discover the code opportunity and improve the network throughput effectively.