A mobile social network (MSN) is defined as a mobile network that uses social
relationships to allow its nodes to communicate. Many wireless networks including
ad hoc networks do not reflect a real world deployment because of routing implementation
difficulties. However, with the enormous use of social network sites (SNSs)
including Twitter and Facebook, MSNs are expected to make the implementation of
routing easier. Thus, some research activity has been devoted to routing protocols in
such networks. This task is very challenging, thus only a few MSN routing protocols
have been proposed in the literature. However, these protocols suffer from either a
low delivery ratio or high memory requirements. This thesis presents a new routing
protocol (Status) for MSNs which has excellent performance in terms of delivery ratio
and memory requirements. Status takes advantage of the online status of a node to
make forwarding decisions. Status has a low overhead ratio, low average delay and
low computational complexity at the node level. All of these features are examined
in this thesis.
Simulation results are presented which show that Status outperforms other routing
protocols such as Epidemic and PRoPHET with a realistic mobility model, namely,
the shortest path movement based model (SPMBM). Status does not have high memory
requirements since it does not store the online status of other nodes. Instead, an
instance check is done when two nodes meet. Since messages are forwarded without
probability calculations based on contact history, Status also has low computational
complexity. / Graduate
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/3624 |
| Date | 18 October 2011 |
| Creators | Altamimi, Ahmed B. |
| Contributors | Gulliver, T. Aaron |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.002 seconds