This paper proposes an advanced routing method in the purpose of increasing IoT routing device’s power-efficiency, which allows to centralize routing tables computing as well as to push loading, related to routing tables computation, towards the Cloud environment at all. We introduced a phased solution for the formulated task. Generally, next steps were performed: stated requirements for the system with Cloud routing, proposed possible solution, and developed the whole system’s structure. For a proper study of the efficiency, the experiment was conducted using the developed system’s prototype for real-life cases, each represents own cluster size (several topologies by each size), used sizes are: 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27 and 29. Expectable results for this research – decrease the time of cluster’s reaction on topology changes (delay, needed to renew routing tables), which improves system’s adaptivity.
In the calculations presented in the article, an artificial immune system (AIS) was used to plan the routes of the fleet of delivery vehicles supplying food products to customers waiting for the delivery within a specified, short time, in such a manner so as to avoid delays and minimize the number of delivery vehicles. This type of task is classified as an open vehicle routing problem with time windows (OVRPWT). It comes down to the task of a traveling salesman, which belongs to NP-hard problems. The use of the AIS to solve this problem proved effective. The paper compares the results of AIS with two other varieties of artificial intelligence: genetic algorithms (GA) and simulated annealing (SA). The presented methods are controlled by sets of parameters, which were adjusted using the Taguchi method. Finally, the results were compared, which allowed for the evaluation of all these methods. The results obtained using AIS proved to be the best.
The objective of the milk-run design problem considered in this paper is to minimize transportation
and inventory costs by manipulating fleet size and the capacity of vehicles and
storage areas. Just as in the case of an inventory routing problem, the goal is to find a periodic
distribution policy with a plan on whom to serve, and how much to deliver by what
fleet of tugger trains travelling regularly on which routes. This problem boils down to determining
the trade-off between fleet size and storage capacity, i.e. the size of replenishment
batches that can minimize fleet size and storage capacity. A solution obtained in the declarative
model of the milk-run system under discussion allows to determine the routes for each
tugger train and the associated delivery times. In this context, the main contribution of
the present study is the identification of the relationship between takt time and the size
of replenishment batches, which allows to determine the delivery time windows for milkrun
delivery and, ultimately, the positioning of trade-off points. The results show that this
relationship is non-linear.
Operational amplifies (op amps) are an integral part of many analog and mixed-signal systems. Op amps with vastly different levels of complexity are used to realize functions ranging from DC bias generation to high-speed amplification or filtering. The design of op amps continues to pose a challenge as the supply voltage and transistor channel lengths scale down with each generation of CMOS technologies. The thesis deals with the analysis, design and layout optimization of CMOS op amps in deep Submicron (DSM) from a study case. Finally, layout optimizations of op amps will be given, in which propose optimization techniques to mitigate these DSM effects in the place-and-route stage of VLSI physical design.
The public transport service is highly essential to meet the demand due to a rapidly growing population and mobility. Thus providing public service and improve its service becomes an urgent need in recent years. In Iraq, the Bus system represents the backbone in public transportation, which is based mainly on highway infrastructure. To meet the growing mobility needs, enhancing public service provided only by bus routes is essential. Measuring bus route performance represents one of the crucial transit research topics in the last recent years. The current study tries to investigate the urban public route's efficiency utilizing the "data envelopment analysis (DEA)" technique. To analyze route performance, DEA is using, and performance measures include route design, cost, service, operation, and comfort efficiency are selected and calculated for different routes. Efficiency and effectiveness are the output of this process. Bus company owners can also use the results of this study to improve their services, attract new customers, and better manage their resources.
There is a growing interest in new transportation routes that combine benefits of shorter distances, cost-effective transits and routes not troubled by maritime security concerns. The Northwest Passage offers a package of routes through the Canadian maritime zone; it is 9,000 km shorter than the Panama Canal route and 17,000 km shorter than the Cape Horn route. The Northern Sea Route shortens a Hamburg-Yokohama voyage by 4,800 miles, in comparison with the Suez Canal route. The transpolar route, if it materializes with an ice-free Central Arctic Ocean route, would shorten distances even further. Given the increase in regional and international navigation and shipping in the region, it is therefore not surprising that in recent years Arctic States and international bodies focused on the needs of enhanced safety and environmental standards for polar shipping. In addition to the dedicated domestic polar shipping regulation, primarily in Canada and the Russian Federation, the Arctic Council and International Maritime Organization (IMO) have launched important initiatives. The most important is establishing of international rules for ships operating in polar waters – The Polar Code.
Elastic optical networking is a potential candidate to support dynamic traffic with heterogeneous data rates and variable bandwidth requirements with the support of the optical orthogonal frequency division multiplexing technology (OOFDM). During the dynamic network operation, lightpath arrives and departs frequently and the network status updates accordingly. Fixed routing and alternate routing algorithms do not tune according to the current network status which are computed offline. Therefore, offline algorithms greedily use resources with an objective to compute shortest possible paths and results in high blocking probability during dynamic network operation. In this paper, adaptive routing algorithms are proposed for shortest path routing as well as alternate path routing which make routing decision based on the maximum idle frequency slots (FS) available on different paths. The proposed algorithms select an underutilized path between different choices with maximum idle FS and efficiently avoids utilizing a congested path. The proposed routing algorithms are compared with offline routing algorithms as well as an existing adaptive routing algorithm in different network scenarios. It has been shown that the proposed algorithms efficiently improve network performance in terms of FS utilization and blocking probability during dynamic network operation.
Energy and latency are the significant Quality of Service parameters of ad hoc networks. Lower latency and limited energy expenditure of nodes in the ad hoc network contributes to a prolonged lifetime of the network. Reactive protocols determine the route to the destination using a route discovery process which results in increased delay and increased energy expenditure. This paper proposes a new technique of route discovery, Dynamic Blocking Expanded Ring Search (DBERS) which minimizes time delay and energy required for route discovery process. DBERS reduces energy expenditure and time delay occurring in the existing route discovery techniques of reactive protocols. The performance of DBERS is simulated with various network topologies by considering a different number of hop lengths. The analytical results of DBERS are validated through conduction of extensive experiments by simulations that consider topologies with varying hop lengths. The analytical and simulated results of DBERS are evaluated and compared with widely used route discovery techniques such as BERS, BERS+. The comparison of results demonstrates that DBERS provides substantial improvement in time efficiency and also minimizes energy consumption.
en
pl
