Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty

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.

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.

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

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.

An ad hoc network, a self-organizing wireless network is made up of mobile nodes, each node act as relay for providing data communication. The topology of the ad hoc networks changes often and needs large and frequent exchange of data among the network nodes for efficient routing. Existing routing protocols are distance vector method and link state routing protocols. The location information of the adhoc network nodes are broadcasted within the transmission range. The enemy can receive the location information of the nodes. Current position aided routing protocols were not designed for use in high risk environment. We have proposed a method for secured routing in adhoc network. It is a hierarchical method to solve the above problem. This method need not maintain the route information explicitly. This reduces the number of query control messages and suits well in dynamic environment. This method is better adaptive to dynamic environment than the present proactive, reactive and zone routing protocol methods (ZRP) and improves the security, efficiency and performance in ad-hoc routing.

An ad-hoc wireless network is formed by a number of mobile nodes having limited communication range. The dynamic source routing (DSR) protocol is frequently used to extend the effective range of these nodes through mutual cooperation. The accurate execution of the DSR protocol demands sustained benevolent behaviour by all participating nodes. However, as ad-hoc networks are created in improvised environments, the realization of such altruistic behaviour is virtually impossible to achieve. In fixed networks, trust infrastructures like certification authorities and key distribution centres are generally used to provide default trust relationships. However, the creation of such an entity in an ad-hoc network is considered neither feasible nor pragmatic. In this paper, we propose a novel mechanism for establishing trust based routing in ad-hoc networks without necessitating a trust infrastructure. We accentuate, that the proposed mechanism is most suitable for ad-hoc networks that can be created on the fly without making any suppositions or imposing pre-configuration requirements.

Cognitive Radio Vehicular Ad Hoc Networks (CRVANETs) can resolve the conflicts between limited spectrum resource and vehicular communication service needs, and thus it receives much concern. Most existing routing solutions for Cognitive Radio Ad Hoc Networks (CRAHNs) or VANETs cannot be directly applied to CR-VANETs due to the high mobility of vehicles and varying availability of spectrums. To fill this gap, with the proliferation of delay tolerant applications, this paper presents a delay tolerant routing strategy for CR-VANETs with the object of maximizing the packet delivery ratio from the source to the destination. The proposed routing scheme is composed of two parts: the routing policy and the message replication policy. In the first policy, we select a concurrent forwarding set under the restriction of CR spectrum holes, and choose an optimized routing path for the next hop. In the second policy, we propose a hybrid and adaptable method relying on Drop-Oldest and Drop-Most strategies, to reduce the delivery cost. Through extensive simulations, we demonstrate that the proposed delay tolerant routing mechanism provides with better packet delivery ratio compared to state-of-the-art protocols.

Ad Hoc network is one of the popular wireless multi-hop networks. Nodes or Users in Ad Hoc network can move randomly and freely to maintain communication without the control of the fixed infrastructure. Due to the limited transmission power and wireless coverage of the terminal, if two terminals that are beyond their respective transmission radius need communicate, they must use other intermediate or relay nodes for packet forwarding, so that a wireless Ad Hoc network is formed among these nodes. In this paper, the current state-of-the-art multipath routing protocols for Ad Hoc networks are reviewed. Particularly, the pros and cons of them are analyzed. Finally, they are summarized and compared.

Ad Hoc network often termed as an infrastructure-less, self- organized or spontaneous network.The execution and survival of an ad-hoc network is solely dependent upon the cooperative and trusting nature of its nodes. However, this naive dependency on intermediate nodes makes the ad-hoc network vulnerable to passive and active attacks by malicious nodes and cause inflict severe damage. A number of protocols have been developed to secure ad-hoc networks using cryptographic schemes, but all rely on the presence of trust authority. Due to mobility of nodes and limitation of resources in wireless network one interesting research area in MANET is routing. This paper offers various trust models and trust based routing protocols to improve the trustworthiness of the neighborhood.Thus it helps in selecting the most secure and trustworthy route from the available ones for the data transfer.KeywordsAd Hoc networkTrustSecurityTrust models

The objective of the paper is to propose trust aware routing method for cooperative and resilient geographic routing in Wireless Ad-hoc and Sensor Networks (WASNs). The proposed method calculates the trust value on the basis of node behavior in routing the packets. The proposed method is designed to have the features such as self-adaptability, low overhead, and dependability which are missing in the existing trust models. With the trust values, the proposed method detects and isolates the malicious nodes dynamically during the routing process. The simulation results obtained using the network simulator ns-2 shows the efficiency of the proposed trust model.

The security of the messages travelling in ad hoc networks is one of the most critical issues of creating and maintaining practical networks over a period of time. Being a multi-hop network, the behaviour of the nodes forwarding the message becomes critical, and thus it is useful to have a certain level of trust on the forwarding nodes. The trust value, however, does not remain stable and must change with time, as a friendly node may turn malicious, and vice versa. Moreover, it is also desirable that the message contents are not easily revealed to the intermediate nodes and there is even some protection against message modification. However, the encryption and message integrity checking comes at a price of increased computation overheard at multiple nodes. This work introduces an approach that can be applied to calculate the trust in a dynamic way, and also protect the message against modification, without significantly increasing the overheads. The performance of the proposed approach has been established through simulations in terms of packet delivery ratio and the number of times the packet was broken into parts, and the results of the simulation were found to support the above claim.

Anonymity in ad hoc network routing came as a means to hide the identification information of nodes, traffic, paths and network topology, which is an effective counter-attack measure to a number of attacks such as traffic analysis, spoofing and denial of services. In this paper, we propose AMUR, an anonymous multicast routing protocol, for ad hoc networks. AMUR uses Bloom filters to encode source multicast tree in each multicast packet to provide anonymity of nodes, links, routing tables, and source routing trees for multicast purposes. We specify the AMUR protocols, and investigate its robustness against network mobility and various attacks.

In this paper, we propose a cooperative routing in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main features and contributions of the proposed cooperative routing are as follows. First, the construction of stable routing route by using entropy concepts in the view points of mobility of nodes. Second, the cooperative-aided transmission using the stable relay which can be selected by using entropy concepts. Third, we present a theoretical analysis model for the proposed cooperative routing with the outage probability of the end-to-end performance. Fourth, we consider a realistic approach based on mobile nodes as well as fixed nodes in the points of view of the mobile ad-hoc wireless sensor networks. The performance evaluation of our protocol is implemented via simulation and analysis.

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.