Scaling Laws of Social-Broadcast Capacity for Mobile Ad Hoc Social Networks

Author(s):  
Yu Fang ◽  
Zijiao Zhang ◽  
Cheng Wang ◽  
Zhong Liy ◽  
Huiya Yanz ◽  
...  
IJARCCE ◽  
2017 ◽  
Vol 6 (3) ◽  
pp. 254-259
Author(s):  
Umesh Patil ◽  
Shital Damate ◽  
Ashwini Gurav ◽  
Ajit Patil

IEEE Network ◽  
2014 ◽  
Vol 28 (1) ◽  
pp. 4-9 ◽  
Author(s):  
Daqiang Zhang ◽  
Daqing Zhang ◽  
Haoyi Xiong ◽  
Ching-Hsien Hsu ◽  
Athanasios V. Vasilakos
Keyword(s):  
Ad Hoc ◽  

Author(s):  
Mohamed Amine Ferrag ◽  
Mehdi Nafa ◽  
Salim Ghanemi

In this chapter, first, the authors briefly introduce the two new systems “MASN-OLSR” (Mobile Ad Hoc Social Networks with OLSR) and “MASN-AODV” (Mobile Ad Hoc Social Networks with AODV). Then they choose wormhole and black hole attack methods, because they are not completely solved, especially in a setting where MASN is used as OLSR or AODV routing protocol. The authors give a definition of the wormhole and black hole attacks on an ad hoc network using OLSR or AODV as routing protocol and then examine the various existing proposals in the literature to overcome this attack. With an analysis of these methods, they then determine the advantages and disadvantages of each of these new systems.


2021 ◽  
Author(s):  
Hossein Rahnama

An emerging research area in pervasive computing is the inference of social context in order to facilitate and mediate communications among collocated people. Understanding users' needs through information reasoning and leveraging principles of social networks plays an important role in the emergence of innovative computer-mediated social networks. This thesis introduces a generic social networking framework for the design, analysis and visualization of opportunistic social networks. The proposed framework is capable of analyzing social similarities in order to provide decision support to users in the form of ego-centric social graphs. Using opportunistic data networks, a distributed inference model is introduced to provide multi-criteria attribute matching in an ad hoc computing environment. Enhancing communications protocols to deal with real-time analysis of dynamic data, generation of spontaneous semantics, and introducing efficient social visualization techniques are salient goals of this research. Efficient pattern matching algorithms in mobile ad hoc networks can have significant benefits in generating real-time context and eliminate the need for a centralized arbiter. In our research, we demonstrate a generic and customizable software architecture for achieving efficient pattern matching in mobile ad hoc networks. In this research we present a novel design for the development of a generic matching engine that is customizable to changing social scenarios. We show how customizable semantics can play an important role in decision-making, selection of a desired attribute, and notifying users with messages in a volatile mobile network.


2021 ◽  
Author(s):  
Hossein Rahnama

An emerging research area in pervasive computing is the inference of social context in order to facilitate and mediate communications among collocated people. Understanding users' needs through information reasoning and leveraging principles of social networks plays an important role in the emergence of innovative computer-mediated social networks. This thesis introduces a generic social networking framework for the design, analysis and visualization of opportunistic social networks. The proposed framework is capable of analyzing social similarities in order to provide decision support to users in the form of ego-centric social graphs. Using opportunistic data networks, a distributed inference model is introduced to provide multi-criteria attribute matching in an ad hoc computing environment. Enhancing communications protocols to deal with real-time analysis of dynamic data, generation of spontaneous semantics, and introducing efficient social visualization techniques are salient goals of this research. Efficient pattern matching algorithms in mobile ad hoc networks can have significant benefits in generating real-time context and eliminate the need for a centralized arbiter. In our research, we demonstrate a generic and customizable software architecture for achieving efficient pattern matching in mobile ad hoc networks. In this research we present a novel design for the development of a generic matching engine that is customizable to changing social scenarios. We show how customizable semantics can play an important role in decision-making, selection of a desired attribute, and notifying users with messages in a volatile mobile network.


Sign in / Sign up

Export Citation Format

Share Document