A Content-based Network Coding to Match Social Interest Similarities in Delay Tolerant Networks

• Main Authors: Karbaschi, Golnaz, Carneiro Viana, Aline
• Other Authors: As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Université de Rennes (UR)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2009
• Subjects: Network coding; fairness; delay tolerant networks; [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]; Laponia
• Online Access: https://hal.inria.fr/inria-00429439

International audience Considering users' social characteristics leads to better exploitation of network coding in delay tolerant networks. We present a content-based network coding that aims to match the social interests similarities (i.e., same profession, hobbies, interests, etc.) of people in a community. We aim to provide a more adaptive-to-social-network coding and lower decoding delay for the users that are interested in different contents. This approach has the potential to open interesting research horizons.