Improving Node Popularity Calculation Using Kalman Filter in Opportunistic Mobile Social Networks

Opportunistic mobile social networks (OMSNs) exploit human mobility to physically carry messages to the destinations. Routing algorithms in these networks typically favour the most popular individuals (nodes) as optimal carriers for message transfers to achieve high delivery performance. The state-of-the-art routing protocol BubbleRap uses a cumulative moving average technique (called C-Window) to identify a node's popularity level, measured in node degree, in a time window. However, our study found that node degree in real-life OMSNs varies quickly and significantly in time, and C-Window moreover slowly adapts to this node degree changes. To tackle this problem, we propose a new method of node degree computation based on the Kalman-filter theory. Using simulation, driven by real human contact traces, we showed that our approach can increase BubbleRap's performance, in terms of delivery ratio and traffic (load) distribution fairness.

[1]  Cecilia Mascolo,et al.  Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks , 2008, IEEE Journal on Selected Areas in Communications.

[2]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[3]  Thrasyvoulos Spyropoulos,et al.  A complex network analysis of human mobility , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[4]  Siem Jan Koopman,et al.  Time Series Analysis by State Space Methods , 2001 .

[5]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[6]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[7]  Richard A. Davis,et al.  Introduction to time series and forecasting , 1998 .

[8]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[9]  Pan Hui,et al.  Distinct types of hubs in human dynamic networks , 2008, SocialNets '08.

[10]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[11]  Pablo Rodriguez,et al.  Fair Routing in Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[12]  Bambang Soelistijanto.  Impact of social-aware forwarding on traffic distribution in social opportunistic networks , 2016, 2016 IEEE Region 10 Symposium (TENSYMP).

[13]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[14]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[15]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[16]  R. E. Kalman,et al.  A New Approach to Linear Filtering and Prediction Problems , 2002 .

[17]  Christophe Diot,et al.  Social Pocket Switched Networks , 2009, IEEE INFOCOM Workshops 2009.

[18]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[20]  D. Simon.  Kalman filtering with state constraints: a survey of linear and nonlinear algorithms , 2010 .

[21]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[22]  Khaled A. Harras,et al.  Opportunities in vehicular opportunistic networking , 2016, 2016 International Wireless Communications and Mobile Computing Conference (IWCMC).

[23]  Serge Fdida,et al.  SIMPS: Using Sociology for Personal Mobility , 2006, IEEE/ACM Transactions on Networking.