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.
A major concern for network intrusion detection systems is the ability of an intruder to evade the detection by routing through a chain of the intermediate hosts to attack a target machine and maintain the anonymity. Such an intermediate host is called a stepping-stone. The intruders have developed some evasion techniques such as injecting chaff packets. A number of algorithms have been proposed to...
In Peer-to-Peer (P2P) networks if adversaries such as Sybil attackers have got most identities in the network, they will control routing table or traffic. In this paper, we propose a framework based on two complementary techniques to defense malicious node after they transmit data to other malicious peers instead of honest peers. The first approach, based on behaviors of destination nodes, is used...
Wireless sensor networks (WSNs) consist of large number of sensor nodes with limited sensing, processing and communication capabilities that cooperatively fulfill environmental sensing and monitoring tasks. WSNs are meant to be deployed in large numbers in various environments, including remote and more importantly harsh environments ensuing potential hardware or software faults which consequently...
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k query as well as the relationship between the response time and the network lifetime. In this paper we address this issue explicitly by studying the top-k query problem in sensor networks with the response time constraint. We...
Recent work in building data-centric sensor networks treats a sensor network as a pool of information. Sensor nodes generate, store, and retrieve information as both data producers and consumers. The intensive demand of data exchange within the network leads previous approaches with sensor-to-sink transmission model inefficient. In-network data storage schemes, such as geographical hash table (GHT)...
Since mobility may cause radio links to break frequently, one pivotal issue for routing in mobile ad hoc networks is how to select a reliable path that can last longer. Several metrics have been proposed in previous literatures, including link persistence, link duration, link availability, link residual time, and their path equivalents. In this paper, we present a novel algorithm for predicting continuous...
Ubiquitous network connectivity is challenged in areas outside of the range of wireless base stations and cellular networks. In such networks the mobile nodes are disconnected for significantly long periods of time. In this paper, we propose an approach where mobile nodes deposit/retrieve messages to/from known point locations in the geographic region. Messages are delivered from a source by being...
SIP (Session Initiation Protocol) is a signaling protocol widely used in multimedia communication. Recently, P2PSIP (Peer-to-Peer SIP), which combines DHT (distributed hash table) and SIP, has been proposed to overcome the drawbacks of traditional CS SIP (client/server architecture SIP). However, the introduction of DHT increases the registration overhead and, session setup overhead/latency. These...
DHT networks offer a scalable structure for use in massively multi-user virtual environments (MMVEs). However, an issue with DHT structures is their use of uniform location-independent ID assignment. This conflicts with the locality-sensitive non-uniform ID assignment needed to achieve efficient latency-aware routing in MMVE applications. Our proposed solution is to use a modified version of the Hilbert...
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.