In traditional networks, routing table is essential for packet transmission due to the lack of the direction information about destination in the head of packet. However, it is feasible to make the address of device encode the routing information with the application of data technology. In this article, we propose new identities for networking routers -vectors, and a new routing principle based on these vectors is designed accordingly. These vectors encode the device distance information and serve as a pattern of the network topology. Then, routing decisions could be made by these vector calculations and only requirement of table query on the destination vector following the proposed routing principle. The proposed method is not limited in calculating the shortest path routing, but extend to solve the constrain routing problem. Besides, multi-paths routing is also available as long as multi-paths exist between the origin-destination pairs. The simulation results show that our proposed method works reliable and stable in routing tasks, and can achieve a remarkable performance when compared with the state-of-the-art work on the delay constrained least cost path (DCLC) problem.

A Learning-Based Approach to Intra-Domain QoS Routing

Reconfigurable conveyors are increasingly being adopted in multiple industrial sectors for their immense flexibility in adapting to new products and product lines. Before modifying the layout of the conveyor system for the new product line, however, engineers and layout planners must be able to answer many questions about the system, such as maximum sustainable rate of flow of goods, prioritization among goods, and tolerances of failures. Any analysis capability that provides answers to these questions must account for both the physical and cyber artifacts of the reconfigurable system all at once. Moreover, the same system should enable the stakeholders to seamlessly change the layouts and be able to analyze the pros and cons of the layouts. This paper addresses these challenges by presenting a model-driven analysis tool that provides three important capabilities. First, a domain-specific modeling language provides the stakeholders with intuitive artifacts to model conveyor layouts. Second, an analysis engine embedded within the model-driven tool provides an accurate simulation of the modeled conveyor system accounting for both the physical and cyber issues. Third, generative capabilities within the tool help to automate the analysis process. The merits of our model-driven analysis tool are evaluated in the context of an example conveyor topology.

/pdf/model-driven-performance-analysis-of-reconfigurable-conveyor-27995u5xq8.pdf

Model-Driven Performance Analysis of Reconfigurable Conveyor Systems Used in Material Handling Applications

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The quality of service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite the presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Multipath Dissemination in Regular Mesh Topologies

Upper bounds on the connection probability for 2-D meshes and tori

Wireless sensor network of regular topology is efficient in area covering and targets locating. However, communications with fixed channels lead to low spectrum efficiency and high probability of conflicts. This paper proposes economical timeslots-and-channels allocation methods for scheduling links in square, triangle, and hexagon lattice topologies. Based on these scheduling methods in square lattice, the authors explore routing methods for load balance and delay minimization, respectively, and compare their effects on transmission delay and energy consumption. The OMNet++-based simulation for square lattice verified the effectiveness of scheduling methods for improving network throughput and made performance comparison among different scheduling methods. It also proved that delay minimization-oriented routing helps to reduce the energy consumption for node standing by and load balance-oriented routing helps to reduce the energy consumption for packets transmission. However, there is trade-off between the reductions of the two types of energy consumptions. The authors further propose the idea of hybrid routing with the two aforementioned routing methods for reducing overall energy consumption and explore the challenges and countermeasures for hybrid routing optimization. Copyright © 2014 John Wiley & Sons, Ltd.

Scheduling and routing methods for cognitive radio sensor networks in regular topology

Networked Embedded Systems have come to occupy an important role in emerging applications. Nodes in such a system are interconnected by a mesh topology. Despite the availability of multiple shortest paths between pairs of nodes, simulation results revealed that these paths cannot be effectively exploited by spreading the messages over the paths in a uniform method. We define the union of all the shortest paths between a pair of nodes as a contour. We present results that characterize the structure of contours when each node communicates directly with eight immediate neighbors. Heuristic rules that effectively disseminate messages over the available paths are presented. Simulation results demonstrate that the new method for dissemination ensures that nodes in a contour, which are at the same distance from the source, handle roughly the same number of messages. In the future, such techniques can be extended to general topologies.

/pdf/contour-guided-dissemination-for-networked-embedded-systems-is8xvdhk8l.pdf

Contour Guided Dissemination for Networked Embedded Systems

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Minlan Duan

Author Tools

Chat about Author

Papers

Multipath Dissemination in Regular Mesh Topologies

Contour Guided Dissemination for Networked Embedded Systems