Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth, frequent topology changes caused by node mobility and power energy consumption. In order to efficiently transmit data to destinations, the applicable routing algorithms must be implemented in mobile ad-hoc networks. Thus we can increase the efficiency of the routing by satisfying the Quality of ...

Multi-constrained path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-constrained path optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an optimization metric, which makes path computation in ...

Under the sustained progress in VLSI technology, interconnect wires become increasingly important to system performance. This thesis presents research work on several aspects of VLSI interconnect performance optimization, namely, single-net performance driven routing, routing in the presence of buffer blockages and bays, performance driven multi-net global routing and interconnect planning. Sin...

Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this ...

In geographical ad hoc routing, each node has to be equipped with Global Positioning System (GPS). This requirement is quite realistic today as such devices are inexpensive and can provide reasonable precision. In this work, we are interested in the optimization of the geographical routing protocol, LAR (Location-Aided Routing) [1]. LAR is an on-demand routing protocol using geographical locati...

In recent years, mobile computing and wireless networks have witnessed a tremendous rise in popularity and technological advancement. The basic routing problem in MANET deals with methods to transport a packet across a network from source node to destination node. Due to the dynamic nature of MANET, it is difficult to design effective routing algorithms. In this paper, we introduce a novel meta...

This article puts forward the routing algorithm of wireless sensor network based on ant colony optimization. The algorithm uses the characteristics of ant colony algorithm that is easy to realize local work, integrates link quality into the pheromone formation and supports multiple routes. When choosing routing, the probability is calculated that the node is selected as the next hop according t...

− A mobile ad hoc network represents a state of system dynamics where the topology changes rapidly. This is further complicated with the necessity of real world mobility abstraction, represented by mobility models. The other major players in this system are wireless links, often supplemented by limitations in terms of bandwidth, link breakage, etc. With the above mentioned characteristics, it a...

In this article we present a survey of routing methods in Optical Burst Switching (OBS) networks. We begin with a description of routing approaches and follow the discussion with a detailed classification of routing algorithms in OBS. Afterwards, we discuss common OBS network loss models that are frequently used in routing optimization. As examples of such application, we present a linear and a...

In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization ρS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it lead...