The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper investigates a specific NP-hard problem by comparing a depth-first search and a depth-first branch-and-bound algorithm as applied to network topology configuration in wireless ad hoc network planning. The vast amount of possible solutions in medium to large NP-hard problems makes algorithm methodology very important. State space algorithms are used to traverse through the solution space...
Mobile Ad Hoc Network consists of a large number of nodes. When we work with a large network with dense nodes, there are some nodes that have to bear the heavy traffic load, then over the time such nodes become weak and they start losing the packet. This packet loss is bearable up to some threshold value, but as the packet loss exceed this level, it disturb the whole network and now any kind of data...
This paper reviews Network-on-Chip architectures with prioritization of selected data streams targeting runtime reconfigurable manycore systems. The common idea of these architectures is to minimize the latency of selected packet transmissions by either bypassing or parallelizing processing stages in routers or by using dedicated links bypassing complete routers. Potential classes of selected data...
Network-on-Chip (NoC) has emerged as a solution for communication framework for high-performance nanoscale architecture. One important aspect, in addition to deadlock-free routing, is low power consumption. In view of varied communication requirements, application specific SoC design is increasingly important. Customized NoC architectures are more suitable for a particular application, and do not...
The heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal...
Manual order picking system can be regarded as a stochastic service system when we consider order arrival as system input and order picking as service. Enhancing its efficiency is very import for increasing client's satisfaction. Basing on the picking route stochastic model under sorted storage S-type picking condition, the stochastic service time distribution is deduced, and then corresponding efficiency...
Traditional algorithms of VRP often did not consider the loading rate of vehicle, which will partially effects the fuel consumption of the vehicle. So if considering the fuel consumption, there needs a new algorithm to find the optional route of VRP with lowest fuel consumption. Then the genetic algorithm of the model was designed and solved. The simulation result showed that the algorithm is a good...
Massive parallel computing performed on many-core Network-on-Chips (NoCs) is the future of the computing. One feasible approach to implement parallel computing is to deploy multiple applications on the NoC simultaneously. In this paper, we propose a multi-application mapping method starting with the application mapping which finds a region on the NoC for each application and then task mapping which...
This paper presents a simulation-based top-down systematic design procedure for flash ADCs. According to the developed design flow, an automated design tool is constructed for sizing flash ADCs in transistor level by consulting the circuit design experience. In addition to fulfill the user-defined specification, issues such as process variations and power consumption are also taken into consideration...
It aims at researching the manual order picking time of logistics distribution center, tour length hence. It builds picker route stochastic model under random-storage return-type picking conditions. It makes model approximation calculation with simulation result and conducts good results under permission errors. It provides basic foundation for building random distribution function of picking time...
Undesirable risk of hazardous materials transportation can be mitigated by a good routing. most scholars focus on the routing of hazardous materials transportation, but few papers concern with load-varied. The paper illustrates a routing model for the hazardous materials transportation under load-varied network. We use the Traditional Risk model for path risk assess, present a quadratic modeling methodology...
Routing delivery is one of the key techniques in mobile ad hoc network, which involves many aspects such as topology update, routing exchange and so on. In this paper, we firstly apply routing tree to describe the complete topology of ad hoc network, and then store the information of routing tree into every node's routing table. Sparse routing tree, as a pruned tree, is used to exchange topology information,...
According to the randomness and weak economy properties of the Emergency Rescue Routing Problem (ERRP), a chance-constrained programming model is constructed based on a stochastic road network. In this model, we consider there are multiple emergency rescue departments serving for a single emergency site, and the travel times between any two nodes are stochastic variables. As the stochastic ERRP is...
An integrated strategy coupling GIS with two-dimension hydrodynamic model is explored to simulate the flooding inundation in the upper reaches of Huangpu River. DEM data, hydraulic engineering map and other available geospatial data are used and aid to generate the computational grid, while, some treatments of interior and exterior boundary conditions, and calculations of variable resistance terms...
Probabilities of large dam break are usually small, but when abnormal factors such as earthquake or war may cause dam break, the dam-break flood in the lower reservoir and the downstream areas along the river will cause serious hazards. Through building mathematical model, generalizing four different operating conditions, calculating the process of dam-break flood routing and analyzing the dam-break...
Most EOL electronic products come from industrial by-products and consumer goods as solid waste. Recycling the EOL electronic products is a complex and long term process. This paper focuses on the location and routing problem of electronic products recycling center. Firstly this paper applies AHP method to select the locations of electronic products recycling centers, and sort various elements by...
Vehicle routing problem is an important combinatorial optimization problem. It has an important position in logistics optimization and supply chain management theory. Due to traffic flow, traffic incidents and other factors, the travel speed and travel time of road has large time-variability and randomness in real transport network. The study of vehicle routing problem in time-dependent network has...
This paper studied the edit distance measures used in part grouping of cellular layout design in details. An edit distance measure from the layout designer viewpoint is proposed. And a case study discusses the limitation of commonly used Levenshtein distance measure.
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established,...
In this paper we are proposing an efficient secure solution to the data centric routing protocol One Phase Pull diffusion which permit multi-hop routing of sensed data. SecOPP provides both Group and Pairwise key distribution with the possibility of rekeying as well as security services: integrity, authentication and confidentiality of exchanged messages. All these are obtained without using a key...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.