Search

Copyright of Journal of Data Acquisition & Processing / Shu Ju Cai Ji Yu Chu Li is the property of Editorial Department of Journal of Nanjing University of Aeronautics & Astronautics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Despite the surge in a vehicular ad-hoc network (VANET) and volunteer computing research, future high-end vehicles are expected to under-utilize the onboard computation, storage and communication resources. Therefore, this research envisions the next paradigm shift by merging VANET and volunteer computing, which we call VANET based volunteer computing (or VBVC). To date, the potential design system for VBVC has not been characterized. To fill up this gap, we first set forth the scientific classification of VBVC, which uses the automobiles alongside roadside units (RSU) to give computational administrations to different vehicles on the road. We propose a potential framework for different VBVC scenarios. Moreover, we provide an experimental evaluation of VBVC by comparing it with the traditional model in terms of job completion, latency, and throughput. The proposed VBVC performs better when compared with traditional approaches.

Many optimization techniques for networking protocols take advantage of topological information to improve performance. Often, the topological information at the core of these techniques is a centrality metric such as the Betweenness Centrality (BC) index. BC is, in fact, a centrality metric with many well-known successful applications documented in the literature, from resource allocation to routing. To compute BC, however, each node must run a centralized algorithm and needs to have the global topological knowledge; such requirements limit the feasibility of optimization procedures based on BC. To overcome restrictions of this kind, we present a novel distributed algorithm that requires only local information to compute an alternative similar metric, called Load Centrality (LC). We present the new algorithm together with a proof of its convergence and the analysis of its time complexity. The proposed algorithm is general enough to be integrated with any distance vector (DV) routing protocol. In support of this claim, we provide an implementation on top of Babel, a real-world DV protocol. We use this implementation in an emulation framework to show how LC can be exploited to reduce Babel's convergence time upon node failure, without increasing control overhead. As a key step towards the adoption of centrality-based optimization for routing, we study how the algorithm can be incrementally introduced in a network running a DV routing protocol. We show that even when only a small fraction of nodes participate in the protocol, the algorithm accurately ranks nodes according to their centrality. [ABSTRACT FROM AUTHOR]

A mobile ad hoc network (MANET) consists of mobile nodes communicating over wireless channels. Routing in MANETs is very challenging due to the random mobility of nodes and unreliability of wireless channels. Therefore most of the existing routing algorithms make only the best effort to find routes for communication but do not provide any performance guarantee. Because of the widespread use of MANETs in real-time applications, it becomes pertinent to provide deterministic network behavior. Quality of Service (QoS) aims to shape the network behavior and provide performance guarantees. In this work, a novel heuristic called Advanced-Optimised Link State Routing (A-OLSR) protocol is designed to provide QoS. It functions by enhancing the connectivity of nodes and establishing more stable routes as compared to standard best-effort Optimised Link State Routing (OLSR) protocol. The simulation results show that A-OLSR provides lower delay, reduces energy consumption and achieves higher throughput without introducing any additional routing overhead as compared to the standard OLSR and it's variants-A′-OLSR and A′′-OLSR. The results also show that A-OLSR provides scalability since it's performance remains consistent with the increasing size of network. [ABSTRACT FROM AUTHOR]

One of the key features of a routing protocol is its ability to recover from link or node failures, recomputing routes efficiently without creating temporary loops. Indeed, in real conditions, there is always a trade-off between the overhead due to the periodic generation of control messages and route convergence time. This paper formalizes the problem of the choice of timers for control message generation as an optimization problem that minimizes the route convergence time, constrained to a constant signaling overhead. The solution requires the knowledge of nodes’ centrality in the topology and can be obtained with a computational complexity low enough to allow on-line computation of the timers. Results on both synthetic and real topologies show a significant decrease of the transient duration with the consequent performance gain in terms of reduced number of unreachable destinations and routing loops. Our proposal is general and it can be applied to enhance any link-state routing protocol, albeit it is more suited for wireless networks. As a concrete example, we present the extension of OLSRv2 with our proposal, named Pop-Routing, and discuss its performance and the stability of centrality metrics in three large-scale real wireless mesh networks. This exhaustive analysis on traces of the topology evolution of real networks for one entire week shows that pop-routing outperforms the non-enhanced protocol in every situation, even when it runs with sub-optimal timers due to centrality computation on stale information. [ABSTRACT FROM AUTHOR]

Mobile Ad-hoc Networks (MANETs) are self-configuring and decentralized networks of wireless nodes (mobile), which communicate through radio waves. The core predicaments associated with MANETs encompass limited bandwidth availability, quick topology changes due to nodes' mobility within the network, network partitioning, linklayer contentions, dynamic wireless channel characteristics and inadequate energy resources. Consequently, traditional routing strategies of MANETs should consider the exceedingly random nature (e.g., dynamic network and node status changes) into the routing scheme design. However, in the past, several authors have expressed concern towards deprived forwarding schemes in MANETs, which contributes to the consumption of excess energy in network. Consequently, it causes high risk of network disconnections as well. Hence, considering higher energy consumption in MANETs as a problem, many researchers have presented numerous smart routing paradigms in past. Still, many of these suggested schemes drastically failed in achieving the desired quality of service (QoS) in network. Further, the pattern of interest shifts towards the cross-layer energy optimization schemes. These ideas did use of lower layers' special information explicitly in order to run the network efficiently. Furthermore, considering the sleep and idle energy consumption, the researchers have suggested many more solutions in the past. Nevertheless, these methods require complex synchronization and efficient coordination which is too inefficient for extremely variable networks (MANETs). To address these issues, we propose an efficient fuzzy based energy efficient load distribution scheme considering congestion as a major concern. This paper compares the performance of the proposed method, ELBRP and AODV via simulation. The simulation results show that the proposed method offers better Throughput performance, lesser Energy Consumption, lesser number of Dead nodes, elongate Network's Lifetime than other approaches. Additionally, the simulation results confirm that the proposed method suggests better Normalized Routing and Normalized MAC Load (Total Network Overhead) than other approaches as well. [ABSTRACT FROM AUTHOR]

Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

Vehicular communication networks are acquiring more and more commercial relevance because of recent advances in inter-vehicular communications via the DSRC/WAVE standard, which stimulates a brand new family of visionary services for vehicles, from road safety to entertainment and multimedia applications. After deep analysis of the literature it was decided to investigate evaluation of data transfer performance between moving sender and receiver in mobile communication network for heterogeneous service support. After careful analysis of the simulation tools the NCTUns 6.0 software package was chosen for planned investigations. The results illustrate that the longest communication can be maintained at the maximum number of vehicles participating on the network, but the quality of communication is inversely proportional to the number of vehicles. On this changing topology network when growing number of nodes (vehicles) increases flooding of network with the data packages and it determines many collisions. The number of rejected packages increases directly in proportion to the number of vehicles. When the number of nodes (vehicle) increases—it is increasing the number of the received same packages which are received from different nodes in the recipient node. On the sender node, the packages are rejected because the collisions occur due to improperly functioning access channel allocation mechanisms. It can be concluded that the routing protocols created for a normal MANET networks is useless in a fast-changing topology large-scale vehicle communication network. To provide heterogeneous services new routing protocols and channel access methods are needed, specifically for vehicle communication networks.

The rapidly developing ad-hoc network technology has a wide range of applications, such as vehicular ad-hoc networks (VANETs), wireless sensor networks (WSNs), and emergency and military communications. Due to the characteristics such as openness and dynamic topology, ad-hoc networks suffer from various attacks in the data plane. Even worse, some attacks can subvert or bypass the frequently used identity-based security mechanisms. To secure the data plane of ad-hoc networks, we propose a novel trust management system. In the system, fuzzy logic is employed to formulate imprecise empirical knowledge, which is used to evaluate the path trust value. Together with fuzzy logic, graph theory is adopted to build a novel trust model for calculating the node trust value. To defend against increasing attacks to trust management systems, such as slandering and harboring, we propose a filtering algorithm. An efficient trustworthiness decay method is also designed to resolve the conflict about the decaying historical trust value in a trust-based routing decision. Additionally, we present a feasible trust factor collection approach to assure that the trust management system is compatible with other security primitives, such as encryption and encapsulation. Finally, we implement the proposed trust management system by integrating it into the optimized link state routing (OLSR) protocol. Simulation results show that the proposed trust management system works well in detecting and resisting data-plane attacks. [ABSTRACT FROM PUBLISHER]

The increase in multimedia services has put energy saving on the top of current demands for mobile devices. Unfortunately, batteries’ lifetime has not been as extended as it would be desirable. For that reason, reducing energy consumption in every task performed by these devices is crucial. In this work, a novel opportunistic routing protocol, called JOKER, is introduced. This proposal presents novelties in both the candidate selection and coordination phases, which permit increasing the performance of the network supporting multimedia traffic as well as enhancing the nodes’ energy efficiency. JOKER is compared in different-nature test-benches with BATMAN routing protocol, showing its superiority in supporting a demanding service such as video-streaming in terms of QoE, while achieving a power draining reduction in routing tasks. [ABSTRACT FROM AUTHOR]

Vehicular communication networks are acquiring more and more commercial relevance because of recent advances in inter-vehicular communications via the DSRC/WAVE standard, which stimulates a brand new family of visionary services for vehicles, from road safety to entertainment and multimedia applications. After deep analysis of the literature it was decided to investigate evaluation of data transfer performance between moving sender and receiver in mobile communication network for heterogeneous service support. After careful analysis of the simulation tools the NCTUns 6.0 software package was chosen for planned investigations. The results illustrate that the longest communication can be maintained at the maximum number of vehicles participating on the network, but the quality of communication is inversely proportional to the number of vehicles. On this changing topology network when growing number of nodes (vehicles) increases flooding of network with the data packages and it determines many collisions. The number of rejected packages increases directly in proportion to the number of vehicles. When the number of nodes (vehicle) increases—it is increasing the number of the received same packages which are received from different nodes in the recipient node. On the sender node, the packages are rejected because the collisions occur due to improperly functioning access channel allocation mechanisms. It can be concluded that the routing protocols created for a normal MANET networks is useless in a fast-changing topology large-scale vehicle communication network. To provide heterogeneous services new routing protocols and channel access methods are needed, specifically for vehicle communication networks.

This paper analyzes the impact of error propagation on the achievable throughput and throughput-delay tradeoff in wireless networks. It addresses the particular class of multihop routing schemes for parallel unicast that achieve a throughput scaling of Θ(n^-\frac12) per node in a network of n nodes. It is shown that in the finite-block-length case, necessitated by finite decoding memory at the nodes, the guaranteed per-node throughput in the network cannot scale better than o(n^-r) per node for any r > 0. This bound on the guaranteed per-node throughput is tighter than the O(\frac1n) bound shown previously. Instead of focusing on the probability of error for each link, which is intractable, an approach of bounding mutual information is employed to show tight results on the achievable throughput and throughput-delay tradeoffs. It is shown that for multihop transmission protocols, error propagation leads to significant changes in the tradeoff between the throughput T(n) and the delay D(n), compared to previous results. The best known scaling behavior is only D(n) = Θ(n ( logn) T(n)) under maximum throughput scaling, where the block length required scales as Ω( logn). When decoding memory at nodes is constrained to be O(log log n), the achievable tradeoff worsens to D(n) = Θ(n (logn)^2 T(n)). [ABSTRACT FROM PUBLISHER]

Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area. [ABSTRACT FROM AUTHOR]

The joint routing and power allocation problem in a wireless full-duplex network with imperfect interference cancellation and a single source destination pair is solved. Our simplified interference model focuses on the effects of full-duplex by including residual self-interference and one hop interference while other interfering signals are assumed to be negligible. First, the optimal power allocation for a fixed route is identified. Then a modification of Dijkstra's algorithm is used to find the joint route and power allocation to maximize throughput. Due to interference, the algorithm proposed has a non decomposable objective function; however, it is efficiently solved for every candidate route. Our solution in a full interference model, that does not ignore any interference, is at most a constant bound away from the optimal solution in the full interference model. Through simulations we evaluate several scenarios and show the behavior of the solution in both interference models. [ABSTRACT FROM PUBLISHER]

We present a new approach to secure routing in mobile ad-hoc networks based solely on the relative transmission times of overhead packets. Unlike most previous works aimed at securing route computation, we eliminate a key vulnerability (explicitly stated routing metrics) altogether. We introduce the Secure Time-Ordered routing Protocol (STOP), which uses time-based orderings to ensure the establishment of multiple loop-free paths between a source and a destination. STOP is the first routing protocol to use performance-based path selection without source routing, path vectors, or complete topology information, making it far more efficient that similar approaches. We prove that adversaries cannot take any action to manipulate the time-based ordering so as to unfairly gain control of the forwarding topology and, by design, nodes which drop data packets will be avoided. Furthermore, at convergence, traffic load is evenly distributed over the well-performing paths, so adversaries cannot gain complete control over the data flow through temporary good behavior. Simulation results show that the countermeasures in STOP are effective against a variety of attacks from independent and colluding adversaries, and that this improved security does not come at the expense of routing performance. [ABSTRACT FROM AUTHOR]

Copyright of Social Technologies / Socialines Technologijos is the property of Mykolas Romeris University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We present the CROWN (Collaborative ROuting, scheduling and frequency assignment for Wireless ad hoc Networks) scheme. CROWN is a cross-layer optimization approach for spectrum-agile nodes to adjust their spectrum allocation and transmission scheduling according to the underlying traffic demands. Instead of choosing the optimal route based on predetermined transmission scheduling and frequency assignment results, CROWN incorporates the efficiency of the underlying frequency assignment and scheduling information into the routing metric calculation, so that the route with the maximal joint spatial and frequency reuse is selected. Simulation results show that CROWN efficiently exploits the frequency diversity and spatial reuse features of spectrum-agile radios. [ABSTRACT FROM AUTHOR]

We study the problem of communication reliability of wireless networks in a fading environment based on the outage probability formulation. The exact expression for the disconnect probability, the probability that a transmission by a node is not received correctly by any other node in the network, is obtained for one and two dimensional random networks. We obtain the end-to-end reliability of multi-hop transmission using the outage probability metric and develop algorithms for finding the most reliable route subject to power constraints as well as the minimum energy route subject to a reliability constraint. Finally, we study the tradeoff between outage probability and transmission power, with and without route diversity. [ABSTRACT FROM PUBLISHER]

Scalable source routing (SSR) is a self-organizing routing protocol which is especially suited for networks that do not have a well-crafted structure, e.g. ad hoc and mesh networks. SSR works on a flat identifier space. As a consequence, it can easily support host mobility without requiring any location directory or other centralized service. SSR is based on a virtual ring structure, which is used in a chord-like manner to obtain source routes to previously unknown destinations. It has been shown that SSR requires very little per node state and produces very little control messages. In particular, SSR has been found to outperform other ad hoc routing protocols such as ad hoc on-demand distance vector routing, optimized link-state routing, or beacon vector routing. In this paper we present Linyphi, an implementation of SSR for wireless access routers. Linyphi combines IPv6 and SSR so that unmodified IPv6 hosts have transparent connectivity to both the Linyphi mesh network and the IPv4/v6 Internet. We give a basic outline of the implementation and demonstrate its suitability in real-world mesh network scenarios. Furthermore, we illustrate the use of Linyphi for distributed applications such as the Linyphone peer-to-peer VoIP application. Copyright © 2008 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: Researchers have proposed routing metrics other than hop count, such as ETX (expected transmission count) and ETT (expected transmission time), to find routes with high throughput. These metrics are inherently suitable to be used in source routing protocols such as DSR, because link state information needs to be collected for the calculation of the shortest path. In this paper, we propose an efficient and generalized approach called accumulated path metric (APM) for supporting high-throughput metrics (HTMs) in on-demand routing protocols. One advantage of APM is that it is able to find the shortest path, in terms of a particular metric, without collecting topology information and without running a shortest-path algorithm. This will significantly simplify the existing design of supporting HTMs in DSR. We present a proof of the correctness of APM. Moreover, we address the problem of duplicate RREQ (route request) transmissions with existing HTM schemes and present a broadcast ordering (BO) technique to suppress unnecessary RREQ transmissions. We study the performance of APM and BO in both AODV and DSR, and the results verify the effectiveness of the proposed approaches. [Copyright &y& Elsevier]

Abstract: In position-based routing protocols, each node periodically transmits a short hello message (called beacon) to announce its presence and position. Receiving nodes list all known neighbor nodes with their position in the neighbor table and remove entries after they have failed to receive a beacon for a certain time from the corresponding node. In highly dynamic networks, the information stored in the neighbor table is often outdated and does no longer reflect the actual topology of the network causing retransmissions and rerouting that consume bandwidth and increase latency. An analysis on the possible impact of beacons due outdated and inaccurate neighbor tables is needed. We quantify by analytical and simulation means the possible performance loss and explore the limitations of position-based routing protocols which use beaconing. In highly mobile ad-hoc networks, the delay can increase by a factor of 20. The neighbor table inaccuracy is the main source of packet loss in uncongested networks. We propose and evaluate several concrete mechanisms to improve the accuracy of neighborhood information, e.g., by dynamic adaptation of the timer values when beacons are broadcasted, and show their effectiveness by extensive simulation. [Copyright &y& Elsevier]

Mobile robots need to be able to communicate among themselves, as well as with hosts participating in the task that they are all involved in. Wired networks are obviously not suitable for mobile robots. Current wireless networks based on a fixed infrastructure (GSM, WiFi, etc.) to route packets may not be suitable because this infrastructure does not cover every place and the requirements of its resources. The best choice for mobile robots are Ad-Hoc networks, which are wireless and do not need a fixed infrastructure. This article describes PERA, a complete communications library including link, net, and transport layers for mobile robots with reduced communications capacity. The network layer is based on a well-known ad-hoc routing protocol adapted to limited devices. This protocol has been implemented and tested on EyeBot mobile robots. Robots using PERA can send messages to other robots or hosts that are not directly reachable through their radio antenna range, by routing messages through intermediate mobile robots also running PERA. The design, implementation, testing and lessons learned in the development of PERA are presented in this article. [ABSTRACT FROM AUTHOR]

A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many routing schemes proposed in the literature try to minimize the energy consumed in routing or maximize the lifetime of the sensor network without taking into consideration limited capacities of nodes and wireless links. This can lead to congestion, increased delay, packet losses and ultimately to retransmission of packets, which will waste considerable amount of energy. This paper presents a Minimum-cost Capacity-constrained Routing (MCCR) protocol which minimize the total energy consumed in routing while guaranteeing that the total load on each sensor node and on each wireless link does not exceed its capacity. The protocol is derived from polynomial-time minimum-cost flow algorithms. Therefore protocol is simple and scalable. The paper improves the routing protocol in (1) to incorporate integrality, node capacity and link capacity constraints. This improved protocol is called Maximum Lifetime Capacity-constrained Routing (MLCR). The objective of MLCR protocol is to maximize the time until the first battery drains its energy subject to the node capacity and link capacity constraints. A strongly polynomial time algorithm is proposed for a special case of MLCR problem when the energy consumed in transmission by a sensor node is constant. Simulations are performed to analyzed the performance of the proposed protocols. [ABSTRACT FROM AUTHOR]

Abstract: Ad-hoc networks could bring many benefits over traditional, fixed networks. Unfortunately, they have many difficulties, including the selection of the optimal route, the availability of routes as mobile nodes move around the physical space, and problems related to the routing capabilities of mobile devices. This paper outlines an agent-based method which allows tests to be run on nodes within an ad-hoc network, which determines their fitness to route data. These tests are related to important routing parameters, such as data processing performance, memory buffering capabilities, system utilisation, network performance, and so on. A key element is the usage of the battery on mobile networks, and the performance of an ad-hoc network can be affected by mobile nodes leaving the network due to lack of battery power. The paper outlines the tests that could be used on devices, and presents results which can be used to assess the fitness of a device to route data through an ad-hoc network. The overall architecture uses a three-layered model where static agents gather the fitness information, which is then passed to domain agents, which are either static or mobile agents, who are then responsible for collecting the information for inter-domain routing agents, who are responsible for electing gateway agents. A key factor in the determination of routing metrics is the performance of the device, where a device could be used to route certain types of data, based on their routing performance. The results show practical results on how well a range of devices respond to important tests, such as memory buffering capabilities, network performance and battery usage. This is especially important when limited-power devices, such as PDAs, are used in the ad-hoc network. The results also show, clearly, how a typical iPAQ PDA copes with these tests, against high-powered PCs. An important result is in battery usage which shows that it varies with the type of processing and network activities that is being performed on the device. From these results reliable models could be built which predicts battery usage for differing types of activities, especially in routing data. [Copyright &y& Elsevier]

Abstract: In this paper, we propose GSR: a new routing and session management protocol for ad-hoc networks as an integral part of a service discovery infrastructure. Traditional approaches place routing at a layer below service discovery. While this distinction is appropriate for wired networked services, we argue that in ad-hoc networks this layering is not as meaningful and show that integrating routing with discovery infrastructure increases system efficiency. Central to our protocol is the idea of reusing the path created by the combination of a service discovery request and a service advertisement for data transmission. This precludes the need to use separate routing and discovery protocols. GSR also combines transport layer features and provides end-to-end session management that detects disconnections, link and node failures and enables service-centric session redirection to handle failures. This enables GSR to accommodate service-centric routing apart from the traditional node-centric routing. We compare GSR with AODV in terms of packet delivery ratio, response time and average number of hops traveled by service requests as well as data. GSR achieves better packet delivery ratio with a minor increase of the average packet delivery delay. [Copyright &y& Elsevier]

Wireless sensor and actor networks (WSANs) refer to a group of sensors and actors linked by wireless medium to perform distributed sensing and acting tasks. The realization of wireless sensor and actor networks (WSANs) needs to satisfy the requirements introduced by the coexistence of sensors and actors. In WSANs, sensors gather information about the physical world, while actors take decisions and then perform appropriate actions upon the environment, which allows a user to effectively sense and act from a distance. In order to provide effective sensing and acting, coordination mechanisms are required among sensors and actors. Moreover, to perform right and timely actions, sensor data must be valid at the time of acting. This paper explores sensor-actor and actor-actor coordination and describes research challenges for coordination and communication problems. [Copyright &y& Elsevier]

The Mobile Ad Hoc Networks (MANETs) are useful in many applications environments and do not need any infrastructure support. Much work has been done on routing in MANETs. However, the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention in the wireline network domain. However, these QoS routing algorithms can not be applied directly to MANETs, because of the bandwidth constraints and dynamic network topology of MANETs. Searching for the shortest path with minimal cost and finding delay constrained least-cost paths are NP-complete problems. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, to cope with changing of MANET topology, routing methods should be adaptive, flexible, and intelligent. In this paper, we propose a Genetic Algorithm (GA) based routing method for Mobile Ad-hoc Networks (GAMAN). Robustness rather than optimality is the primary concern of GAMAN. The GAMAN uses two QoS parameters for routing. The performance evaluation via simulations shows that GAMAN is a promising QoS routing algorithm for MANETs. [ABSTRACT FROM AUTHOR]