With the advancement in electronics technology, number of pins under the ball grid array (BGA) are increasing on reduced size components. In small size components, a challenging task is to solve the escape routing problem where BGA pins escape towards the component boundary. It is often desirable to perform ordered simultaneous escape routing (SER) to facilitate area routing and produce elegant...

A sensor network is one of the most adaptive research area that requires the optimization in term of energy effectiveness, load balancing etc. The sensor network is defined under the particular localization architecture and having the challenges in terms of load minimization, energy loss reduction, security etc. One of such common and most adaptive research problem is routing. In this paper, op...

Distributed Sensor Networks (DSN) consists of distributed nodes having the capability of sensing, computation and wireless communications. Routing, power management and data dissemination protocols have been specifically designed for DSN, where energy consumption is an essential design issues for routing. Maximizing the lifetime of the sensor nodes, it is preferable to distribute the energy dis...

Interference and collisions greatly limit the throughput of mesh networks that used contention-based MAC protocols such as 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute optimal schedules are computationally intractable (unless co-channel interference is neglected). This paper presents a tractable technique to comput...

Next generation fixed wireless networks are most likely organized in a mesh structure. The performance of these mesh networks is mainly influenced by the routing scheme and the channel assignment. In this paper, we focus on the routing and channel assignment in large-scale Wireless Mesh Networks to achieve a max-min fair throughput allocation. As most optimization approaches fail to optimize la...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

In this paper we present a specific routing algorithm for the Atmel 6002 FPGA circuit. We define a specific cost function and a specific way of handling the connectivity list, sorting it by two main criteria: the number of stored links and the competition's cost. We implemented a routing algorithm which simultaneously treats the global and local routing. One of the advantages of considering the...

The vehicle routing and facility location fields are well-developed areas in management science and operations research application. There is an increasing recognition that effective decision-making in these fields requires the adoption of optimization software that can be embedded into a decision support system. In this paper, we describe the implementation details of our software components f...

A wireless sensor network is a collection of nodes ordered into a co-operative network. The nodes communicate wirelessly and frequently self-organize after being arranged in an ad hoc manner. In progress proposals for routing in sensor networks were optimize for the limited capabilities of the nodes and the application precise nature of the networks. Existing routing algorithms are not resource...

Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms may fail to find a route from a source to a destination in some types of ad-hoc networks and if they find a route, it may be much longer than the shortest path. On the other hand, routing algorithms which are based o...