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.
In this paper, we first propose a static analysis approach to estimate the maximum value of the worst-case latency of all possible communications in a Chip Multi-Processor (CMP) with a 2D-Mesh Network-on-Chip (NoC), which is called the Worst-case Inter-core Communication Latency (WICL). Then the Hop-based Priority scheduling approach is proposed for a 2D-Mesh NoC to improve its WICL. Our experimental...
Vehicular Ad hoc Networks (VANETs) have gained considerable attention in recent years because of the extensive applications. However, VANETs are confronted with numerous difficulties and challenges, which lead to communication performance degradation and even data delivery failure. In this paper, we propose a new routing protocol called Intersection-based Delay sensitive Routing using Ant colony optimization...
Backpressure Routing is a cross-layer control algorithm that makes decisions on routing and resource allocation in mobile ad hoc networks using network state information like queue backlog values and current available channel rates. While it is desirable because of its provable performance guarantees, including providing optimal throughput, the real world problem of implementing backpressure routing...
This paper proposes and subsequently delineates quantification of network security metrics using software defined networking approach in real time using a progressive testbed. This comprehensive testbed implements computation of trust values which lend sentient decision making qualities to the participant nodes in a network and fortify it against threats like blackhole and flooding attacks. AODV and...
With the rapid increase in the number of processor cores on a chip, packet-switching networks on chip (NoCs) have emerged as a promising paradigm for designing scalable communication infrastructures for future multi-core processors. The quest for high-performance networks, however, has led to very area-consuming and complex routers with marginal return in performance. On the other hand, studies show...
This paper explores the impact ground delay can have on designing and executing rendezvous operations such as formation flight. For a given formation pairing the route is fixed, speed policies are then generated to compensate for uncertainty in take-off times. Value Iteration is used to solve both the deterministic and stochastic Dynamic Programming problem for an entire state-space. The final optimal...
Since the energy constraint is a fundamental issue for wireless sensor networks (WSNs), the expectation of network lifetime has become a critical performance index. In actual applications, due to the data traffics may fluctuate randomly, there is a compelling need for a routing strategy that is robust to the variation amplitude of time varied data traffics. In this paper, we jointly consider the lifetime...
This paper deals with dynamic Multi-Vehicle Routing Problem in both deterministic and stochastic scenarios; the objective is to find the best paths for a fleet of vehicles, with the aim of visiting a set of targets. Based on the Cooperative Receding Horizon approach proposed in [4] for the Euclidean case, this paper i) develop a routing algorithm for graph-represented mission spaces, ii) presents...
Due to intermittent connectivity and uncertain node mobility, opportunistic message forwarding algorithms have been widely adopted in delay tolerant networks (DTNs). While existing work proposes practical forwarding algorithms in terms of increasing the delivery rate and decreasing data overhead, little attention has been drawn to the control overhead induced by the algorithms. The control overhead...
The Delay/Disruption Tolerant Network (DTN) is characterized with long delay, high bit-error rate, intermittent connectivity and frequent partitions. Due to this, network coding is introduced to improve its transmission performance significantly. Numerous DTN routing algorithms based on network coding have been developed. However, they are susceptible to various malicious attacks. In this paper, we...
Electric vehicles are slowly gaining popularity as a viable substitute for fossil fuel powered automobiles. Environmental concerns, energy dependency, and volatile fuel prices have triggered governments and private entities to search for an alternative strategy for the current combustion engine vehicle design. These strategies have led to a marginal market share increase of electric vehicles. Currently...
We consider the problem of routing multiple robots to service spatially distributed requests at specified time instants, where each robot, as well as each request, is associated with one or more skills. A request can be serviced by a robot as long as the robot has at least one skill in common with the skill set of that request. We characterize the feasibility aspects of such a heterogeneous routing...
Locating individual congested links in large scale networks is an important but difficult problem, because of the hardness to directly measure the massive links. Current advantages of network tomography propose to infer the link congestion states by end-to-end measurements via solving a set of linear equations in Boolean algebra. But one challenging problem in such approaches is the requirement to...
Wireless Body Area sensor Networks (WBANs) enable innovative health care monitoring. Limited energy source of a sensor node limits WBANs for long time monitoring of health care. Efficient energy utilization is therefore one of the research challenges inWBANs. In this research work we analysed energy utilization of popular routing techniques. We formulate a mathematical framework to identify energy...
We address the problem of inferring the network link loss rates using end-to-end measurements, which can also be formulated as network tomography. As we have known that most tomography problems are rank-deficit. One kind of method uses multiple probe measurements to acquire more information about the system that may generate much additional overhead; the other method imposes unrealistic assumption...
A novel GPS denied routing problem for UAVs is described, where two UAVs cooperatively navigate through an array of non-communicating Unattended Ground Sensors (UGS). Contact with UGS is strictly maintained, which allows the UGS act as beacons for relative navigation eliminating the need for dead reckoning. This problem is referred to as the Communication Constrained UAV Routing Problem (CCURP). To...
With the fast development of Internet, the size of routing table in the backbone router continues to grow rapidly. Forwarding Information Base (FIB), which is derived from routing table, is stored in line-card to conduct routing lookup. Since the line-card's memory is limited, it would be worthwhile to compress the FIB for consuming less storage. Therefore, various FIB compression algorithms are proposed...
In this paper, we discuss an ILP-based method for simultaneous optimal technology mapping, placement and routing for programmable logic devices, such as FPGAs, as a fundamental research for architecture and algorithm evaluation. In general, heuristic methods are used for technology mapping, placement and routing, and many such methods have been developed. Although they are used to obtain high quality...
Wireless Sensor Networks (WSNs) provide a cost efficient solution for data gathering in future smart environments like smart grids and Advanced Metering Infrastructure (AMI). Using the traditional minimum cost routing, leads to congestions along shortest paths and decreases the network lifetime. Multipath routing and load balancing is a logical way to extend the network lifetime. In this paper we...
The current works on the data centers have revealed that most of the network resources are underutilized when adding the resources to the data centers. This under utilization results in congestion while routing the data across the data centers. This can be improved by the load balancing over the bottlenecked links. The traditional method handles the load balancing by implementing the protocols at...
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.