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.
Named Data Networking is a new data centric kind of communication network. This paper shows the study about NDN network and applies this architecture over Vehicular ad-hoc networks so that performance of network improves and communication becomes faster. At the end of simulation results are discussed in the form of packet delivery ratio, throughput, good put, routing overhead and various network parameters...
The built-in caching capability of future Named Data Networking (NDN) promises to enable effective content distribution at a global scale without requiring special infrastructure. The aim of this work is to design efficient caching schemes in NDN to achieve better performance at both the network layer and application layer. With the specific objective of minimizing the inter-ISP (Internet Service...
This paper proposes multigoal implementations of the Dijkstra's shortest path algorithm and the boundary iterative-deepening depth-first search (BIDDFS). The algorithms were modified to allow for the search of more than one goal in a single expansion pass. The aim of this is to reduce the operational redundancy and hence the time taken for calculating multiple start-goal node pairs. Simulations using...
Taking into account inter-task dependency in reconfigurable computing systems, a step closer to reality, can interfere with placement algorithm and it highly affects on hardware resource utilization. In this paper a tree based placement algorithm is proposed that its specifications are efficiency and low execution time. The main feature of this placement algorithm is that it is easy and simple to...
This paper proposed an algorithm of radius restrained distributed breadth first search flooding for call routing in multimedia communication. By knowing the information of neighbor nodes in finite scope, this algorithm does breadth first search and selects the least number of next forwarding neighbor nodes to reduce redundant information in broadcasting routing information. Simulation results demonstrate...
Multi-path routing scheme can guarantee the probability of successful packet delivery in mobile ad hoc networks (MANET), network reliability can also be enhanced. A novel adaptive multi-path routing protocol with the maximum path lifetime is proposed. By calculating the lifetime of links without the aid of positioning equipments and extra control messages, the partial-disjoint multi-path can be established...
Some ad hoc network scenarios are characterized by frequent partitions and intermittent connectivity. Hence, existing adhoc routing schemes which assume the existence of end-to-end paths do not work in such challenging networks. Disruption tolerant networking (DTN) technology has been designed for such challenging network environments. Several unicast and multicast routing schemes have been designed...
With the deployment of sensor network applications there is lot of breakthrough in digital or smart sensor designs. These smart sensors have a dedicated processor which allows interfacing to many sensors which measure ambient readings of temperature, pressure and humidity of the environment. These sensors once calibrated they function independently running using a self-powered battery which operates...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
Networks on chips (NoCs) provide a mechanism for handling complex communications in the next generation of integrated circuits. At the same time, lower yield in nano-technology, makes self repair communication channels a necessity in design of digital systems. This paper proposes a reliable NoC architecture based on specific application mapped onto an NoC. This architecture is capable of recovering...
In this paper we propose a set of different configurations of failure recovery schemes, developed for network-on-chip (NoC) based systems. These configurations exploit the fact that communication in NoCs tends to be partitioned and eventually localized. The failure recovery approach is based on checkpoint and rollback and is aimed towards fast recovery from system or application level failures. The...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
This paper presents a distributed fermat-point range estimation strategy, which is important in the moving sensor localization applications. The fermat-point is defined as a point which minimizes the sum of distances from three sensors inside a triangle. This point is indeed at the trianglepsilas center of gravity. We solve the problems of large errors and poor performance in the bounding box algorithm...
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.