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.
Computer Network has great effect on improving the efficiency of the communication system and application requirements in our life. In order to establish transmission path with movement characteristics and improve the efficiency of information transmission in Computer Network, the optimized clustering routing protocol based on node position using the minimum distance routing competition mechanism...
In this paper, we propose a comprehensive co-simulation platform for the clusters of microgrids. Our proposed real-time platform considers both physical and communication layers, which can be simulated via real-time digital power system simulator (RTDS) and OMNeT++. We also propose a novel oblivious power routing scheme to prevent congestion and minimize network loss. To this end, we firstly introduce...
In this paper, we consider a real-life heterogeneous fleet vehicle routing problem for retail construction material stores. A modified cluster first-route second algorithm is deployed to fit a real-life problem. In cluster first, the clusters of customers compatible with vehicle capacity are grouped together. In route second, the mathematical model is developed and solved by General Algebraic Modeling...
This paper proposes a federated SDN controller architecture for optical networks. Simulations show that adequate combination of clustering strategies with enriched hierarchical path computation offer a routing performance comparable to conventional centralized architectures.
BACR is a new hierarchical routing protocol based on LEACH designed for WSN. It introduced energy-involved voting and back-off announcement to control the number of cluster-heads to vary within a small range and evenly locate the cluster-heads thus to prolong the network lifetime. This work also employed the technology of cluster reappointment to minimize the energy consumed in cluster set-up phase...
The waste collection vehicle routing problems with time windows and intermediate facilities (WCVRPTW-IF) is actually belong to a well-known generalization of VRP, the Multi-Depot Vehicle Routing Problem with Inter-Depot Routes (MDVRPI), which is a combinatorial optimization problem and holds a central place in reverse logistics management. in order to improve the route compactness, which is very important...
In the age of cloud, Grid, P2P, and volunteer distributed computing, large-scale systems with tens of thousands of unreliable hosts are increasingly common. Invariably, these systems are composed of heterogeneous hosts whose individual availability often exhibit different statistical properties (for example stationary versus nonstationary behavior) and fit different models (for example exponential,...
In order to accomplish the self-management of the satellite integrated information network, policy is introduced into the network management and based on the characteristics of the nodes' high-dynamic and long transmission delay between the satellite and the ground station, this paper establishes a new policy-based hierarchical distributed architecture in which two new policy layers called domain...
An energy-efficient data gathering protocol called E2DGP that takes advantage of spatial and temporal correlation of sampling data for WSNs is proposed in this paper. E2DGP includes a clustering method of balancing energy consumption, a data prediction transmission strategy and an energy-aware multihop routing algorithm. In clustering process phase, the initial probability of node for cluster head...
For mobile ad-hoc wireless network, the route protocol is very important. This paper proposes a modified CBRP scheme based on the cloud model to improve the performance. And some experiments are conducted, the results show that the ad-hoc network will be lower average end-to-end delay and higher packet delivery ratio with the proposed scheme.
Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Among various issues, energy consumption is one of the most important criteria for routing protocol in wireless sensor networks (WSNs). This paper introduces an energy efficient clustering algorithm for mobile sensor network...
The observing of real world is the abstracting of nature in different levels of granularity. This paper applies quotient space granular method to the computer network routing, puts forwards a method using the granular computing method of quotient space to improve OSPF routing algorithm , describes the thought of granular layering and topological routing, defines the hierarchical dynamic routing (NCR)...
Applies real-world observation, abstract, solution in different levels of granularity to the computer network routing problem solving; and applies quotient space to agent, puts forwards the concept of quotient space. Then studies and researches the way of using quotient space granularity to improve the traditional method OSPF routing algorithm. By defining cluster, area and group granularity agent...
Sink mobility has become an increasingly important requirement of various sensor network applications. Handling such mobile sink conditions brings new challenges to large-scale sensor networking. This investigation proposed a hybrid-structure routing protocol (HSRP) that combines the benefits of grid-based and cluster-based structures. Grid-based structure is designed to solve the cluster head selection...
This paper develops a new distributed BFS algorithm for an asynchronous communication network. This paper presents two new BFS algorithms with improved communication complexity. The first algorithm has complexity O((E+V1.5)??logV) in communication and O(V1.5??logV) in time. The second algorithm uses the technique of the first recursively and achieves O(E??2 √logVloglogV) in communication and O(V??2√logVloglogV)...
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.