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.
Recent rapid scale out of high performance computing systems has rapidly and continuously increased the scale and complexity of the interconnects. As a result, current static and over-provisioned interconnects are becoming cost-ineffective. Against this background, we have been working on the integration of network programmability into the interconnect control, based on the idea that dynamically controlling...
This work focuses on the changing demands which is contributed to dynamism and complexity of the routing problems. Most of vehicle routing problems (VRP) have been characterized by static and deterministic problem. To fill the gap, the present study aims at obtaining a set of routes that minimize the total expected routing risk in a dynamic vehicle routing problem (DVRP). Here, for clustering the...
This article explores the order batching problem (OBP), in warehouse of e-commerce companies. Based on the real E-commence warehouse case, we present a valid tabu search(TS) algorithm to determine how to group the orders in batches, with a greed-based seed heuristic method generating its initial solution. In tabu search, a modified combined picker routing algorithm for the multiple-cross-aisle picker...
To solve the overlap problem in node selection process in order to fill the existing routing algorithms deficiencies, This paper designs a traditional Gossiping routing algorithm based on SPSO. At the same time, the paper gives the content and design steps of this algorithm. The simulation results show that the algorithm can effectively solve the problem of node selection.
Wireless sensor network is a collection of distributed tiny sensor nodes, which sense the natural phenomenon and transmits the sensed information to the base station using multi-hop communication. Most of the existing systems use the routing techniques which consume lot of energy during data communication. Hence, the energy of sensor nodes depletes and results in decrease its lifetime. To overcome...
We investigate the latency and network lifetime-aware clustering problem for data collection in a WSN (Wireless Sensor Network) with one base station and propose a novel approach. Our approach consists of a polynomial-time heuristic for constructing clusters, a polynomial-time heuristic and an ILP (Integer Linear Programming) algorithm for constructing a routing tree for inter-cluster communication...
The introduction of wireless charging is a major breakthrough for Wireless Sensor Networks (WSNs) as it can solve the bottleneck of a limited network lifetime. Wireless charging is done via mobile chargers (MCs) that go to the nodes and recharge them using magnetic resonant coupling. Coordination among the MCs and adapting the routing with the heterogeneous charge depletion rate of the nodes is crucial...
Open vehicle routing problem (OVRP) is considered as a variant of vehicle routing problem (VRP), which has two hierarchical objectives, i.e., to minimize the number of routes, and to minimize the total cost measured by travel distances. Since the split delivery vehicle routing problem (SDVRP) has been studied extensively, and demonstrated that it can reduce the cost by at most 50% by allowing to split...
This paper presents a decision support for addressing urban waste collection services that are characterized by the presence of a garage from which all the vehicles start their routes, an intermediate facility where the vehicles unload the waste and a large number of pick up positions. Moreover, in a shift the vehicle can perform several routes subject to time and capacity constraints. Our aim is...
As the virtual backbone of the network, connected dominating set (CDS) plays an important role in supporting data communication, reducing the routing overhead, and enhancing the scalability of the network. Traditional CDS construction algorithms are usually applied to the networks with homogeneous nodes, e.g., a pure wireless sensor network. In the past few years, Wireless Sensor and Actor Networks...
Density of nodes deployed in WSNs is based on application requirements. The redundant data collection in dense network results in more energy consumption. The Data Routing In-Network Aggregation (DRINA) is one of the recent algorithm proposed to reduce energy consumption in dense network environment by minimizing the number of communications from source to sink. Here the Data transmission is carried...
Providing complete coverage of sensing field as long as possible and maintaining the connectivity between the nodes is the main motto of the Wireless Sensor networks. The proposed system is implemented to provide maximum connectivity and extension in network-lifetime along with providing secured data transmission which is required for many applications. Maximum connected load balance cover tree algorithm...
Vehicular Ad-hoc Network (VANETs) is a collection of intelligent vehicles aims to get control over transportation problems and reduce accidental ratio. Clustering refers to the classification of vehicles in groups in order to minimize the traffic overhead by selecting a responsible node called Cluster Head. In this paper, we introduce a new Triple cluster based routing protocol (TCRP) for cluster...
In this paper we modeled the distribution of a single type of products, which are distributed from two depots and use N-vehicles. This problem can be modeled using Capacitated Vehicle Routing Problems (CVRP), and the common algorithm to solve that model is Clarke and Wright Saving Algorithm (CWSA). The needed computational time for finding the nearly global optimum of CWSA grows exponentially with...
Sensor devices and the emergent networks that they enable are capable of transmitting information between data sources and a permanent data sink. Since these devices have low-power and intermittent connectivity, latency of delivery for certain classes of data may be tolerated in an effort to save energy. Several previously developed algorithms employ models which considers the popularity of individual...
Wireless sensors networks plays an important role for accurate monitoring for various applications such as military surveillance where exact monitoring is required. Critical issue with wireless sensor network is sensor node energy as energy utilization of sensor nodes increases the communication cost. This paper used effective N-DRINA routing algorithm which improves the data fusion and aggregation...
In many sensor network applications, messages are perciodically flooded through the network. Routing protocols also depend on such flooding for their functioning. Establishment of a connected dominating set (CDS) helps in reducing the cost of such operations. We propose a robust distributed algorithm for setting up a CDS and maintaining the CDS under a variety of node and link failures. We compare...
Cloud applications often rely on shared-nothing distributed databases that can sustain rapid growth in data volume. Distributed transactions (DTs) that involve data tuples from multiple geo-distributed servers can adversely impact the performance of such databases, especially when the transactions are short-lived in and require immediate response. The k-way min-cut graph clustering algorithm has been...
The objective of this study is to evaluate efficiency of routing protocols between Dijkistra's and Kruskal's algorithm. The application of routing protocols is presented. It is used to compute complicated routing paths and the efficiency of routing algorithms. Extensive simulations are being carried out with two different algorithms. The network loads in the performance plots are characterized by...
Typically, wireless sensor network (WSN) uses static sinks to gather sensor data. However, it brings not only excessive sink installation cost but also energy-hole problem. In this paper, we consider data acquisition with guaranteeing latency in WSN by multiple mobile sinks. In particular, we optimize the number of sinks as well as the itinerary of each sink for this problem such that the total cost,...
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.