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.
Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding, and representable discrete polymatroids. We consider the vector linear solutions of networks over a field $\mathbb {F}_{q}$ , with possibly different message and edge vector dimensions, which are referred to as linear fractional solutions. It is...
Random s-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an undirected edge in between if and only if they have at least s common items. In particular, in a binomial random s-intersection graph, each item in some item pool is independently...
Random key graphs have received much interest and been used in diverse applications. A random key graph with n nodes is constructed as follows: each node selects a set of Kn different items uniformly at random from the same pool of Pn distinct items, and two nodes establish an undirected edge in between if and only if they share at least one item. For such graph denoted by G(n, Kn, Pn), we present...
In this modern era of technology wireless sensor networks have broad area of applications. Various applications of sensor network needs the communication to be authenticated and secured. Researchers have developed many schemes for intruder detection in WSNs, but those schemes are very complicated and require complex encryption and decryption process for intruder detection. In this paper we proposed...
Mobile Ad hoc networks are a class of dynamic networks without any centralized administration. A major problem in Mobile Ad hoc networks (MANETs) is the anonymity threat arises among the nodes usually when they mobile. Many researches are concentred on the part of avoiding anonymity threat in MANET with different approaches using simulators. This paper presents an implementation of (ATARPA) Anonymity...
Churn is one of the crucial problems which restrict the development and deployment of DHT networks. In terms of churn treatment, this paper studies the quick start-up bootstrapping mechanism for Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By modifying the way how to populate the routing tables, the heuristic algorithm decreases the messages sent...
In recent years, the potential range of applications for sensor networks is expanding. Their use has been considered for safety critical areas such as: hospitals or power plants. The security comes more to the fore. This paper presents SecSens, an architecture that provides basic security components for wireless sensor networks. Since robust and strong security features require powerful nodes, SecSens...
P2P networks facilitate people belonging to a community to share resources of interest. However, discovering resources in a large scale P2P network poses a number of challenges. Although distributed hash table (DHT) structured P2P networks have shown enhanced scalability in routing messages, they only support key based exact matches. This paper presents DIndex, a distributed indexing component that...
Inter domain service routing is an element in the success of Next Generation Network. Service requests, such as the INVITE request in Session Initiation Protocol [RFC3261] may need to be redirected. Service Path (SPath) can be used to hold the server paths and service information. The length of SPath increases as the number of hops in a redirection increases. The overhead for service routing which...
Kademlia-based DHT has been deployed in many P2P applications and it is reported that there are millions of simultaneous users in Kad network. For such a protocol that significantly involves so many peers, its robustness and security must be evaluated carefully. In this paper, we analyze the Kademlia protocol and identify several potential vulnerabilities. We classify potential attacks as three types:...
The lack of a trusted authority, responsible for peers' identity verification or for authentication purposes, makes actual P2P systems extremely vulnerable to a large spectrum of attacks. The main purpose of this paper is to present Likir (layered identity-based Kademlia-like infrastructure), a framework that includes an identity-based scheme and a secure communication protocol, built on top of Kademlia,...
Cryptographic devices are recently implemented with different countermeasures against side channel attacks and fault analysis. Moreover, some usual testing techniques, such as scan chains, are not allowed or restricted for security requirements. In this paper, we analyze the impact that error detecting schemes have on the testability of an implementation of the advanced encryption standard, in particular...
We establish new upper bounds on the complexity of several "rectangle" problems. Our results include, for instance, optimal algorithms for range counting and rectangle searching in two dimensions. These involve linear space implementations of range trees and segment trees. The algorithms we give are simple and practical; they can be dynamized and taken into higher dimensions. Also of interest...
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.