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.
Node clone attack, that is, the attempt by an adversary to add one or more nodes to the network by cloning captured nodes, imposes a severe threat to wireless sensor networks. Several distributed detection protocols have been proposed against this attack. However, all of them rely on too strong assumptions and cannot be efficiently applied to most of sensor networks. In this paper, we propose an innovative...
A wireless ad hoc network (WANET) is a collection of wireless terminals that communicate with each other without predetermined topology. Since WANET devices are power-limited, network protocols should be designed to prolong the battery lifetime of these devices. In this paper, we propose a cross-layer integration approach for power efficient routing protocol. The proposed cross-layer integration between...
In delay tolerant networks (DTNs) with frequent network partitioning, routing packets is a challenge, because the successful establishment of an end-to-end path between source and destination nodes is not guaranteed. Typical routing protocols for DTNs depend on data replications over multiple paths for reliable data delivery. Since they invoke a lot of replicated packets, our previous work introduced...
It is generally recognized that the current routing scheme of Internet suffers from serious scalability problems. In this paper, we work with the abstract but 'Internet-like' network model consisting of an infinite-variance power-law random graph (IVPLRG) and adopt the idea of a routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits very naturally to the spontaneously emerging...
Low latency data delivery is an important requirement for achieving effective monitoring through wireless sensor networks. When sensor nodes employ duty cycling, sending a message along the shortest path, however, does not necessarily result in minimum delay. In this paper we firstly study the lowest latency path problem, i.e., the characteristics of path with mini delay that connect a source node...
Modern high-performance computing applications use large scale simulations to facilitate scientific discovery, such as studying the impact of sub-atomic interactions or searching for a cure for diseases. These applications increasingly use data that is growing exponentially in size. Thus, management of data at high performance computing (HPC) centers is a critical problem, and addressing data-related...
A conditionally Poissonian power-law random graph with infinite degree variance is considered as a random network model. A method for elegant analytical computation of accurate approximations for various network characteristics is introduced, based on slight redefinition of the model in terms of non-homogeneous Poisson point processes and on the replacement of certain random variables by their expectations...
Optimality principle based sink tree methodology for adaptive static routing using multiple route configuration scheme is an innovative strategy for integrating dynamic routing protocol attributes seamlessly into static routing. In context of incapability to dynamically adapt to network topology failures and high management overhead, static routing still offers robustness to routing convergence failure,...
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.