Strategy Study on Maximum Degree and Bisection Degree Synchronization Search in Scale-Free Networks

Xin Yi Chen; Jian Hua Xia

doi:10.4028/www.scientific.net/AMM.303-306.2157

Paper Titles

PcAVP - Adaptable Vertical Partitioning Algorithm Based on Privacy Constraint for Distributed Database System
p.2139

Principle, Framework and Application of Internet of Things
p.2144

Research and Application of Mass Storage System (MSS) in University Hybrid Libraries
p.2149

Research on Application of Internet of Things in Nursing Home
p.2153

Strategy Study on Maximum Degree and Bisection Degree Synchronization Search in Scale-Free Networks
p.2157

Study on Informatization Management of Personnel in Colleges
p.2161

A Parallel Programming Pattern Based on Directed Acyclic Graph
p.2165

The Research of Internet of Things in Military Logistic Management
p.2170

An Empirical Analysis of Developer Collaboration Network
p.2177

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 303-306Strategy Study on Maximum Degree and Bisection...

Strategy Study on Maximum Degree and Bisection Degree Synchronization Search in Scale-Free Networks

Abstract:

With the expansion of network and the increasing number of communities’ network, It’s a big problem for the search algorithm to enhance the search efficiency. The number of search steps and the amount of query information generated by maximum degree search strategy, which will grow exponentially, consequently, and lead to low the efficiency of search. Without considering the network congestion, breadth-first search strategy is undoubtedly the best search efficiency. From the point of the breadth-first search strategy, this paper designed and proposed the synchronous search strategy of Maximum degree and Bisection degree, and described the algorithm idea and algorithm design for MBDS. The simulation results showed that MBDS not only decreased the amount of query information, but also can efficiently decrease the search steps and improve the search speed.

You might also be interested in these eBooks

Sensors, Measurement and Intelligent Materials

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 303-306)

Pages:

2157-2160

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.303-306.2157

Citation:

Cite this paper

Online since:

February 2013

Authors:

Xin Yi Chen, Jian Hua Xia

Keywords:

Bisection Degree, Breadth-First Search, Maximum Degree, Synchronous Search

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] J. Kleinberg, Navigation in a small world. Nature, 406: 845. (2000).

Google Scholar

[2] J. Kleinberg, The small-world phenomenon: An algorithmic perspective. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, New York (2000).

DOI: 10.1145/335305.335325

Google Scholar

[3] D. J. Watts, P. S. Dodds, and M. E. J. Newman, Identity and search in social networks. Science, 296. (2002).

Google Scholar

[4] L. A. Adamic, R. M. Lukose, and B. A. Huberman, Local Search in power-law networks. Phys. Rev. E, 64: 046135. (2001).

Google Scholar

[5] L. A. Admic, How to search a social network. Social Network. (2005).

Google Scholar

[6] L. A. Adamic, R. M. Lukose, A.R. Puniyani, and B. A. Huberman, Search in Power-Law Networks. Phys. Rev. E, 64: 046135. (2001).

DOI: 10.1103/physreve.64.046135

Google Scholar

[7] A. L. Barabasi, Emergence of scaling in random networks. Science, 286(1999).

Google Scholar

[8] D. Gibson, J. Kleinberg, and P. Raghavan, Inferring Web communities from link topology, Proceedings of the 9th ACM Conference on Hypertext and Hypermedia. (1998).

DOI: 10.1145/276627.276652

Google Scholar