Skip to main content
Springer Nature Link
Log in

First-Priority Relation Graph-Based Malicious Users Detection in Mobile Social Networks

  • Conference paper
  • First Online:
Network and System Security (NSS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9408))

Included in the following conference series:

  • 1714 Accesses

Abstract

Mobile social networks (MSNs) consist of many mobile users (individuals) with social characteristics, that provide a variety of data delivery services involving the social relationship among mobile individuals. Because mobile users move around based on their common interests and contact with each other more frequently if they have more social features in common in MSNs. In this paper, we first propose the first-priority relation graph, say FPRG, of MSNs. However, some users in MSNs may be malicious. Malicious users can break the data delivery through terminating the data delivery or tampering with the data. Therefore, malicious users will be detected in the process of looking for the data delivery routing to obtain efficient and reliable data delivery routing along the first-priority relation graph. Secondly, we propose one hamiltonian cycle decomposition of FPRG-based adaptive detection algorithm based on in MSNs under the PMC detection model (the system-level detection model).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boldrini, C., Conti, M., Passarella, A.: Contentplace: social-aware data dissemination in opportunistic networks. In: Proc. ACM Int. Symp. Model. Anal. Simul. Wireless Mobile Syst., pp. 203–210 (2008)

    Google Scholar 

  2. Bulut, E., Szymanski, B.K.: Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks. IEEE Transactions on Parallel and Distributed Systems 23(12), 2254–2265 (2012)

    Article  Google Scholar 

  3. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proc. ACM SIGCOMM 2003 (2003)

    Google Scholar 

  4. Gao, L., Li, M., Bonti, A., Zhou, W., Yu, S.: Multidimensional Routing Protocol in Human-Associated Delay-Tolerant Networks. IEEE Transactions on Mobile Computing 12(11), 2132–2144 (2013)

    Article  Google Scholar 

  5. Kayastha, N., Niyato, D., Wang, P., Hossain, E.: Architectures, and Protocol Design Issues for Mobile Social Networks: a Survey. Journal: Proceedings of the IEEE-PIEEE 99(12), 2130–2158 (2011)

    Google Scholar 

  6. Kranakis, E., Pelc, A.: Better adaptive diagnosis of hypercubes. IEEE Transactions on Computers 49(10), 1013–1020 (2000)

    Article  MathSciNet  Google Scholar 

  7. Lin, L., Xu, L., Zhou, S.: Conditional Diagnosability of Shuffle-Cubes under the Comparison Model. International Journal of Computer Mathematics 92(2), 230–249 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lin, L., Xu, L., Zhou, S., Wu, W.: The social feature-based priority relation graph of mobile social networks. In: 2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), pp. 1921–1926. IEEE (2014)

    Google Scholar 

  9. Lin, L., Zhou, S., Xu, L., Wang, D.: Conditional Diagnosability of Arrangement Graphs under the PMC Model. Theoretical Computer Science 548, 79–97 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lin, L., Zhou, S., Xu, L., Wang, D.: The extra connectivity and conditional diagnosability of alternating group networks. IEEE Transactions on Parallel and Distributed Systems 26(8), 2352–2362 (2015)

    Article  Google Scholar 

  11. Musolesi, M., Mascolo, C.: CAR: Context-Aware Adaptive Routing for Delay-Rolerant Mobile Networks. IEEE Transactions on Mobile Computing 8(2), 246–260 (2009)

    Article  Google Scholar 

  12. Newman, M.E.J., Park, J.: Why Social Networks are Different from Other Types of Networks. PHYSICAL REVIEW E 68, 036122-1–036122-8 (2003)

    Google Scholar 

  13. Preparata, F.P., Metze, G., Chien, R.T.: On the Connection Assignment Problem of Diagnosable Systems. IEEE Transactions on Electronic Computers EC–16(6), 848–854 (1967)

    Article  Google Scholar 

  14. Saad, Y., Schultz, M.: Topological Properties of Hypercubes. IEEE Transactions on Computers 37(7), 867–872 (1988)

    Article  Google Scholar 

  15. Wang, Y., Yang, W.-S., Wu, J.: Analysis of a Hypercube-based Social Feature Multi-Path Routing in Delay Tolerant Networks. IEEE Transactions on Parallel and Distributed Systems 24(9), 1706–1716 (2013)

    Article  Google Scholar 

  16. Watts, D.J., Dodds, P.S., Newman, M.E.J.: Identity and Search in Social Networks. Science 296, 1302–1305 (2002)

    Article  Google Scholar 

  17. Wu, J., Wang, Y.: Social feature-based multi-path routing in delay tolerant networks, In: Proceedings IEEE INFOCOM 2012, pp. 1368–1376 (2012)

    Google Scholar 

  18. Wu, J., Wang, Y.: Hypercube-based Multi-path Social Feature Routing in Human Contact Networks. IEEE Transactions on Computers 63(2), 383–396 (2014)

    Article  Google Scholar 

  19. Xiao, M., Wu, J., Huang, L.: Community-Aware Opportunistic Routing in Mobile Social Networks. IEEE Transactions on Computers 63(7), 1682–1695 (2014)

    Article  MathSciNet  Google Scholar 

  20. Xu, J.-M.: Combinatorrial Theory in Networks. Science Press, Beijing (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, Fujian, China

    Li Xu & Limei Lin

  2. School of Information Technology, Deakin University, Melbourne, Australia

    Sheng Wen

Authors
  1. Li Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Limei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Li Xu or Limei Lin .

Editor information

Editors and Affiliations

  1. Apt. 2A, NEW YORK, New York, USA

    Meikang Qiu

  2. University of Texas, San Antonio, Texas, USA

    Shouhuai Xu

  3. Dept. of Computer Science, Columbia University, New York, New York, USA

    Moti Yung

  4. University of Otago, Dunedin, New Zealand

    Haibo Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Xu, L., Lin, L., Wen, S. (2015). First-Priority Relation Graph-Based Malicious Users Detection in Mobile Social Networks. In: Qiu, M., Xu, S., Yung, M., Zhang, H. (eds) Network and System Security. NSS 2015. Lecture Notes in Computer Science(), vol 9408. Springer, Cham. https://doi.org/10.1007/978-3-319-25645-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25645-0_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25644-3

  • Online ISBN: 978-3-319-25645-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics