|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Summer 2010 Cluster Based Routing In Socially Selfish Delay Networks YANGYANG CAI 
ABSTRACT There are a number of scenarios where connectivity is intermittent, and a given destination may not be reachable at the moment a message is sent. Networks with these characteristics are known as Delay Tolerant Networks. Socially Selfish Networks(SSN) is a typical application scenario of DTN. In this paper,a routing algorithm is proposed for clustered socially selfish networks. It is proved by experiments that applying the cluster construct in SSN can reduce the redundant forwarding data and increase the security in routing procedure. |
||||||
|
