340 likes | 516 Views
IEEE CPSCom 2013. Social Community Partition-Aware Replica Allocation in Ad-hoc Social Networks (Ahmedin Mohammed Ahmed, Feng Xia, Nana Yaw Asabere, Hannan Bin Liaqat, Jie Li). Mobile and Social Computing Lab, School of Software, DUT. Ahmedin ahmedinmo@gmail.com 22 August 2013
E N D
IEEE CPSCom 2013 Social Community Partition-Aware Replica Allocation in Ad-hoc Social Networks(Ahmedin Mohammed Ahmed, Feng Xia, Nana Yaw Asabere, Hannan Bin Liaqat, Jie Li) Mobile and Social Computing Lab, School of Software, DUT Ahmedin ahmedinmo@gmail.com 22 August 2013 Beijing, China
Contents IEEE CPSCom 2013 • Introduction • System Model • ComPAS – Proposed Replication Scheme • Preliminary Results • Conclusion and Future Works ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Ad-hoc Social Networks (ASNET)? IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Introduction (Cont.) IEEE CPSCom 2013 • ASNET can be used in different applications, such as • Information Sharing in Conference/Workshop/Meeting • Home Networking • Communication between soldiers in a battlefield • Search and rescue operations • Law enforcement operations • Sensor networks • ……… ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Introduction (Cont.) IEEE CPSCom 2013 • Data mgmt in ASNETs is essential due to node characteristics such as mobile and resource constraints. • Cause the nodes to make social communities [1][2]. • Ensuring data availability at the point of partitioning is an important issue [3]. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Introduction (Cont.) IEEE CPSCom 2013 • Introduction of social behaviors to available MANETs solutions. • Social Graph – the most popular way to study the social r/ship among people & extract their social properties [4][5]. • Nodes communicate directly or use relay nodes. • The distance between the source and destination node determines the type of implementation. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Introduction (Cont.) IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Introduction (Cont.) IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Introduction (Cont.) IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
cont ... IEEE CPSCom 2013 • To deal with data management issues there are two mechanisms [to establish copies of data at d/t nodes]: Replication [6] and Caching [7] • Impossible to replicate all data items on every node because of the limited resources. • The question is??? • Where and How we should allocate the data replicas to gain high data accessibility and availability ? ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
cont ... IEEE CPSCom 2013 • ComPAS – an effective data replication method to improve data accessibility and enhance the efficiency of ASNETs. • Assumptions: • A user belongs only to one community. • Created social communities should be determined not only by common interests and contacts but also by mobility related context [8]. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
System Model IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
System Model (cont…) IEEE CPSCom 2013 Data replication is a technique of creating and managing duplicate versions of data items. Community is a structural sub-unit of social network with high density of internal links. Individuals have more social connections with others inside their own community than with individuals outside. Social connections can be family, friends, common location or common interest. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
System Model (cont…) IEEE CPSCom 2013 Physical Network – a set G of n nodes identified by {d0, d1, d2, …, dn-1, dn} Every node diεG has a unique address or identification & the same processor & energy capacity. Due to the node mobility and dynamic nature of ASNETs, nodes with similar moving behavior (same mobility group) create/form a community. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
System Model (cont…) IEEE CPSCom 2013 N user nodes with a set of G communities. Dic = 1 if and only if user i’s data is stored at one of the storage space at community c, and To find an efficient way to store X replicas for each user’s data on the storage space at G communities (X < G), and We choose the value of X depending on the replication budget of the system and its desired availability or accessibility. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
System Model (cont…) IEEE CPSCom 2013 two types of data queries (read and write) Cost of a Read Query for a User i: It represents the number of communities required to retrieve the data of user i and that of every neighbor of i. To retrieve user i’s data, the query is sent to its primary/own community, say in community c (i.e., Dic = 1), incurs a cost of 1. For each neighbor j (i.e., aij = 1), there are three cases. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
cont… IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
System Model (cont…) IEEE CPSCom 2013 Cost of a Write Query for a User i: It is always X+1. That means, X +1 communities need to update the data for i. Location Histogram [9] Load Balancing ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 ComPAS is based on a perception that if we need to place a replica copy for a user i somewhere, the most desirable location should be the primary storage place for most neighbors of i. most neighbors will benefit from this replica when they issue a read query. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
cont… IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 • Example • 14 nodes social graph • Random, Full and ComPAS • assume an existing distribution • of nodes across storage spaces • S1, S2, and S3 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 Full Replication Random Replication ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 Random Order of Visiting Nodes: 6,2,13,1,14,11,4,8,3,10,9,12,7,5 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
ComPAS IEEE CPSCom 2013 The cost to read the data for each of the 14 users shows a noticeable improvement of ComPAS over random replication methods, which is about 22.3% better. Another widely used approach is full replication. In this case, network read traffic falls to 0, but the storage requirements are high (14 units). Full replication also results in high write traffic to maintain consistency. Our proposed solution, ComPAS performs the best overall. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Preliminary Results IEEE CPSCom 2013 compared with the data lookup using an underlying ad-hoc replication protocol (no-replication), random replication scheme and the data replication approach W-DCG [10]. In our evaluation, the range for the number of storage spaces is G ε{4, 8, 12, 16}, and for the number of replicas, X ε {1, 3, 5, … ,G-1}. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Preliminary Results IEEE CPSCom 2013 Read Cost ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Preliminary Results IEEE CPSCom 2013 Accessibility And Traffic ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Conclusion • Extend the proposed method to work with different cases in social relationship of a community. • we aim to design a replication middleware with a performance driven load balancing and fairness mechanism. • We will also work on handling misbehaving nodes in the replica allocation operation. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
References • C. Zhang, Y. Song and Y. Fang, Modeling Secure Connectivity of Self organized Wireless Ad-hoc Networks, in Proceedings of IEEE INFOCOM, 2008. • T. Hara and S. K. Madria, Consistency Management Strategies for Data Replication in Mobile Ad-hoc Networks, IEEE Transactions on Mobile Computing, Vol. 8, No. 7, July 2009. • T. Hara, Effective Replica Allocation in Ad-hoc Networks for Improving Data Accessibility, in Proceedings of IEEE INFOCOM, pp. 1568-1576, 2001. • Y. Zhu, B. Xu, X. Shi and Y. Wang, A Survey of Social-based Routing in Delay Tolerant Networks: Positive and Negative Social Effects, IEEE Communications Surveys and Tutorials, Vol. pp, Issue. 99, pp. 1-15, 2012. • K. Wei, X. Liang and K. Xu, A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues, IEEE Communications Surveys and Tutorials, Vol. pp, Issue. 99, pp. 1-23, 2013. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
References • A. Derhab and N. Badache, Data Replication Protocols for Mobile Ad- Hoc Networks: A Survey and Taxonomy, IEEE Communications Surveys & Tutorials, pp. 33-51, 2009. • G. Xylomenos, X. Vasilakos, C. Tsilopoulos, V.A. Siris and G.C. Polyzos, Caching and Mobility Support in a Publish-Subscribe Internet Architecture, IEEE Communications Magazine, Vol. 50, Issue. 7, pp. 52-58, 2012 • P. Bellavista, R. Montanari and S. K. Das, Mobile Social Networking Middleware: A Survey, Pervasive and Mobile Computing, pp. 437-453, 2013. • D. Tran, K. Nguyen and C. Pham, S-Clone: Socially-aware Data Replication for Social Networks, Computer Networks, vol. 56, no. 7, pp. 2001-2013, 2012. • S. Jain, M. Chawla and N. Gupta, Weighted Dynamic Bi-connected Group based Replica Allocation method for Mobile Ad-hoc Networks, in Proceedings of International Conference on Advances in Communication and Control Systems (CAC2S), pp. 189-197, 2013. ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13
Thank You! ComPAS – ASNET Replication Model [by Ahmedin] @ IEEE CPSCom’13