conditional shortest path routing in delay tolerant networks power point presentation (ppt) ....etc

[:=Read Full Message Here=:]

abstract:
Attacks against Wireless Sensor Networks (WSNs) are becoming more and more frequent. Due to the sensitive nature of these networks, appropriate security mechanisms should therefore be developed. This seminar introduces a fault-tolerant approach for WSNs. The basic idea to detect malicious nodes is to proceed to intermediate verification of the signed messages within the communication paths. A tolerance state is defined in which a set of tests are performed on the malicious node in order to definitely reject it or rehabilitate it. ....etc

[:=Read Full Message Here=:]

In optical WDM networks, since each lightpath can carry a huge mount of traffic, failures may seriously damage the end-user applications.As a result, fault-tolerance is an important issue in these networks. The primary path is the light path which carries traffic during normal operation. in case of a failure, the traffic is rerouted on a backup path. a reliable and fault-tolerant routing algorithm is discussed in this paper for establishing primary and backup path. load balancing is used to establish the primary path. In this method, the pa ....etc

[:=Read Full Message Here=:]

sss
the design of a generic intrusion-tolerant architecture for web servers ....etc

[:=Read Full Message Here=:]

Abstract—In this paper, we present a framework for analyzing routing performance in delay tolerant networks (DTNs). Differently from previous work, our framework is aimed at characterizing the exact distribution of relevant performance metrics, which is a substantial improvement over existing studies characterizing either the expected value of the metric, or an asymptotic approximation of the actual distribution. In particular, the considered performance metrics are packet delivery delay, and communication cost, expressed as number of copies ....etc

[:=Read Full Message Here=:]

Abstract
Delay tolerant networks are characterized by thesporadic connectivity between their nodes and therefore the lackof stable end-to-end paths from source to destination. Since thefuture node connections are mostly unknown in these networks,opportunistic forwarding is used to deliver messages. However,making effective forwarding decisions using only the networkcharacteristics (i.e. average intermeeting time between nodes)extracted from contact history is a challenging problem. Basedon the observations about human mobility traces a ....etc

[:=Read Full Message Here=:]

Presented By:
Jing Deng, , Richard Han and Shivakant Mishra
Abstract
This paper describes an INtrusion-tolerant routing protocol for wireless SEnsor NetworkS (INSENS). INSENS securely and efficiently constructs tree-structured routing for wireless sensor networks (WSNs). The key objective of an INSENS network is to tolerate damage caused by an intruder who has compromised deployed sensor nodes and is intent on injecting, modifying, or blocking packets. To limit or localize the damage caused by such an intruder, INSENS incorpo ....etc

[:=Read Full Message Here=:]

i can't download the file,plz give me the download link ....etc

[:=Read Full Message Here=:]

CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks
Musolesi, M. Mascolo, C. Dept. of Comput. Sci., Dartmouth Coll., Hanover, NH;
This paper appears in: Mobile Computing, IEEE Transactions on Publication

Abstract

Most of the existing research work in mobile ad hoc networking is based on the assumption that a path exists between the sender and the receiver. On the other hand, applications of decentralised mobile systems are often characterised by network partitions. As a consequence delay tolerant networking ....etc

[:=Read Full Message Here=:]

Abstract—Routing is one of the most challenging, open problems in disruption-tolerant networks (DTNs) because of the short-lived wireless connectivity environment. To deal with this issue, researchers have investigated routing based on the prediction of future contacts, taking advantage of nodes' mobility history. However, most of the previous work focused on the prediction of whether two nodes would have a contact, without considering the time of the contact. This paper proposes predict and relay (PER), an efficient routing algorithm for DTN ....etc

[:=Read Full Message Here=:]