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.
Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a large disparity between the computational power of attackers and legitimate clients: increasing the difficulty of puzzles might unnecessarily restrict legitimate clients too much, and lower difficulty puzzles cannot sufficiently block...
The coverage problem in sensor networks studies how to turn redundant sensors off while maintaining a required level of coverage. The existing algorithms and protocols are proven to be effective to conserve energy and prolong network lifetime, but only support a static level of sensing coverage. In contrast, many sensor network applications may require a dynamic level of coverage, which changes from...
The complexity of channel scheduling in Multi- Radio Multi-Channel (MR-MC) wireless networks is an open research topic. This problem asks for the set of edges that can support maximum amount of simultaneous traffic over orthogonal channels under a certain interference model. There exist two major interference models for channel scheduling, with one under the physical distance constraint, and one under...
This paper proposes a framework for congestion control, called binary marking congestion control (BMCC) for high bandwidth-delay product networks. The basic components of BMCC are i) a packet marking scheme for obtaining high resolution congestion estimates using the existing bits available in the IP header for explicit congestion notification (ECN) and ii) a set of load-dependent control laws that...
This paper describes methods for increasing the security of data being stored in a distributed hash table (DHT) which leverages the inherent properties of the DHT to provide a secure storage substrate. The methods presented are based upon a framework referred to as "scatter, conceal, and recover" (SCAR). The standard method of securing data in a DHT is to encrypt the data using symmetrical...
Summary form only given. Advances in networking and wireless technologies, coupled with integration of information networks and social applications, bring about unprecedented challenges, technical and non-technical, underscoring the need for insight into the capabilities of our complex distributed and networked systems. As critical as these physical and cyber infrastructures are to our lives and diverse...
Load factor based congestion control schemes have shown to enhance network performance, in terms of utilization, packet loss and delay. In these schemes, using more accurate representation of network load levels is likely to lead to a more efficient way of communicating congestion information to hosts. Increasing the amount of congestion information, however, may end up adversely affecting the performance...
The sparse network topology, coupled with the limited availability of reference nodes in Under Water Sensor Network (UWSN), significantly reduces the effectiveness of multi- lateration based schemes for location discovery. In this paper, we propose to explore Out-of-Range information to resolve location ambiguities of unknown nodes, which can not gain sufficient reference nodes information. The proposed...
We study link scheduling in networks with small router buffers, with the goal of minimizing the guaranteed packet loss rate bound for each ingress-egress traffic aggregate (connection). Given a link scheduling algorithm (a service discipline and a packet drop policy), the guaranteed loss rate for a connection is the loss rate under worst-case routing and bandwidth allocations for competing traffic...
Multicast communications are crucial to support collaborative information processing and dissemination in ad hoc sensor networks (ASNs). The unique characteristics, including the severe resource constraints of sensor nodes and the lack of infrastructure, make it highly challenging to secure the multicast communications in these networks. To this end, we propose a novel key pre-distribution based scheme,...
We consider the problem of packet scheduling in a network with small router buffers. The objective is to provide a statistical bound on the worst-case packet loss rate for a traffic aggregate (connection) routed along any network path, given maximum permissible link utilization (load). This problem is argued to be of interest in networks providing statistical loss-rate guarantees to ingress-egress...
The Denial-of-Service (DoS) attack remains a challenging problem in the current Internet. In a DoS defense mechanism, a honeypot acts as a decoy within a pool of servers, whereby any packet received by the honeypot is most likely an attack packet. We have previously proposed the roaming honeypots scheme to enhance this mechanism by camouflaging the honey-pots within the server pool, thereby making...
Ontologies are enabling the development of new object discovery and information retrieval on the Internet. We propose a user driven, ontology-based overlay architecture to enable communities of interest (Col) for structured resource access and knowledge sharing between users of similar interests. In this paper, we describe the overlay network architecture to support the basic functionalities of a...
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.