17,049 research outputs found
QoS routing in ad-hoc networks using GA and multi-objective optimization
Much work has been done on routing in Ad-hoc networks, but 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, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version
Mobile object location discovery in unpredictable environments
Emerging mobile and ubiquitous computing environments present hard challenges to software engineering. The use of mobile code has been suggested as a natural fit for simplifing software development for these environments. However, the task of discovering mobile code location becomes a problem in unpredictable environments when using existing strategies, designed with fixed and relatively stable networks in mind. This paper introduces AMOS, a mobile code platform augmented with a structured overlay network. We demonstrate how the location discovery strategy of AMOS has better reliability and scalability properties than existing approaches, with minimal communication overhead. Finally, we demonstrate how AMOS can provide autonomous distribution of effort fairly throughout a network using probabilistic methods that requires no global knowledge of host capabilities
Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a special structure of fractal-like network, which consists
of a self-similar tiling of equilateral triangles. As a collective adaptive
mechanism, the routing is realized by a relay of cyclic message-ferries
corresponded to a concatenation of the triangle cycles and using some good
properties of the network structure. It is recoverable for local accidents in
the hierarchical network structure. Moreover, the design principle is
theoretically supported with a calculation method for the optimal service rates
of message-ferries derived from a tandem queue model for stochastic processes
on a chain of edges in the network. These results obtained from a combination
of complex network science and computer science will be useful for developing a
resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201
- …