Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Computer-Network

There are 87 papers published in subject: > since this site started.

Results per page:

87 Total, 9 Pages | << First < Previous 4 5 6 7 8 9 Next > Last >>

Select Subject

All (8830)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Rank

Results per page:

87 Total, 9 Pages | << First < Previous 4 5 6 7 8 9 Next > Last >>

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Soft Threshold Based Cluster-head Selection Algorithm for Wireless Sensor Networks
	Rong Ding,Bing Yang
	Computer Science and Technology 25 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In recent years, many clustering algorithms have been proposed. Among them, LEACH is the most famous one. However, in LEACH, within each 1/p rounds, once a node has been selected as a cluster-head (CH), its threshold will be set to 0, and thus it will lose the chance to participate cluster-head selection, even if it still has enough energy. In this paper, we present a novel cluster-head selection algorithm. Instead of changing the threshold to 0 directly, the proposed algorithm adjusts the threshold of each node gradually according to the roles they have played in the last round, so more nodes could have the opportunity to be CHs. Simulation results show that the proposed algorithm outperforms LEACH in network lifetime by an average of 30% approximately.
	TO cite this article:Rong Ding,Bing Yang. Soft Threshold Based Cluster-head Selection Algorithm for Wireless Sensor Networks[OL].[25 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4409059


	2. A New Privacy Enhanced Temporary Social Network Service for Group Dating
	Lu Liu
	Computer Science and Technology 13 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Current group dating is low technology with a lot of embarrassment. In this paper we propose a new privacy enhanced temporary social network service Match for group dating, which helps to avoid embarrassment before face to face. The new service ensures users' privacy secret by applying public key encryption and proper access control based on temporary relationship; meanwhile the service won't accumulate users profile as current social network service does. As a result, the Match provide better user experience and privacy protection for group dating.
	TO cite this article:Lu Liu. A New Privacy Enhanced Temporary Social Network Service for Group Dating[OL].[13 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4406484

Saved Papers

Saved Papers


	3. Measuring Google CDN: locating data centers and evaluating delay performance
	Xu Dan
	Computer Science and Technology 10 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Content distribution network (CDN) is a system designed to reduce the bandwidth costs, increase global availability of content and improve end user performance. The famous internet search company Google has established his own CDN to transmit most of his traffic over the internet. In this paper we conduct extensive measurement of Google CDN. The purpose of our measurement is to locate Google data centers in the worldwide and further evaluate and analyze the delay performance of Google CDN. Based our measurement, we firstly try to find out all the content servers of Google CDN and present a novel approach to cluster these content servers into several data centers. Then we evaluate the delay performance from four different service type of Google CDN and give some observations of Google CDN's response strategy to the client's request.
	TO cite this article:Xu Dan. Measuring Google CDN: locating data centers and evaluating delay performance[OL].[10 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4405704


	4. Research on Algorithms about Conformance Test Sequences
	Hu Xiaoling,Gao Zhanchun
	Computer Science and Technology 04 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The key issue in protocol conformance test is generating test sequence. This paper proposes a completed heuristic algorithm that automatically generates test sequence using UIO and BUIO. Also a method adaptive to the previous algorithm is put forward to generate BUIO. By using partly equality relation between UIO and BUIO, algorithm of generating BUIO is simplified. Apply both the algorithm proposed and algorithm based on Rural Chinese Postman Algorithm and UIO sequences to Protocol ECMA-264 and compare the complexity of two test sequences.
	TO cite this article:Hu Xiaoling,Gao Zhanchun. Research on Algorithms about Conformance Test Sequences[OL].[ 4 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4401769


	5. Research of Secure Multicast based on Structural Method
	WANG Yan,ZHENG Junhui
	Computer Science and Technology 23 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Secure multicast based on structural method is investigated. In order to gain structural multicast safety, virtual circuits are established from multicast users to the Aggregation Router. This method could not only support Internet security technologies and mechanisms, but also has other characteristics due to using special network structure. During the process of transmitting multicast data, this method does not use IP addresses but use virtual circuit identifications instead, which makes it difficult for attackers to take attacks. In addition, the multicast membership has been verified and an attacker can not imitate a legitimate member of a multicast group, which further enhances the multicast security.
	TO cite this article:WANG Yan,ZHENG Junhui. Research of Secure Multicast based on Structural Method[OL].[23 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4400553


	6. Protocol Security Testing with SPIN and TTCN-3
	Zhou Li,Wang Zhiliang,Yin Xia
	Computer Science and Technology 14 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Protocol security testing is an important technique to ensure the security of communication protocols. However, methods considering both effective detection to specification vulnerabilities and efficient testing on protocol implementations are not well developed. In this paper, we present a general method for protocol security testing including protocol verification with SPIN model checker and protocol testing with formal testing language TTCN-3. We use threat model to model malicious entities and import the classification of information security to achieve a complete analysis of security requirements for protocol verification. We also develop a SPIN Trail to TTCN-3(st2ttcn) convention tool to generate testcases automatically from counter examples obtained from model checking. As a case study, we apply our approach to the security testing of Source Address Validation Improvements (SAVI) protocol. We test two versions of SAVI-DHCP protocol. The result indicates that our method is effective and efficient.
	TO cite this article:Zhou Li,Wang Zhiliang,Yin Xia. Protocol Security Testing with SPIN and TTCN-3[OL].[14 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4396471


	7. Research on Comparative Analysis of BPEL and XPDL
	Zhang Chaolin,Song Quanwang
	Computer Science and Technology 31 July 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:BPEL and XPDL are both XML-based process language. BPEL is committed to Web Services orchestration, and XPDL is committed to distributed workflow. Every company dedicates to the integration of the two functions. Therefore, this article made a comparative analysis for BPEL and XPDL in functions, structures, implementation details to provide the basis for their respective scope of use.
	TO cite this article:Zhang Chaolin,Song Quanwang. Research on Comparative Analysis of BPEL and XPDL[OL].[31 July 2010] http://en.paper.edu.cn/en_releasepaper/content/4380395


	8. Modeling Contacts and Mobility for Wireless Mobile Networks
	Tian Ye,Li Jiang
	Computer Science and Technology 18 July 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The inter-contact time between mobile human-carried devices is one of the key metrics in studying the mobility-assisted routing paradigms for wireless mobile networks. Recent studies on this topic are focused on the aggregated distribution integrating all the device pairs’ inter-contact times and there are limitations in their observations. In this work, we investigate the inter-contact time distribution using a number of real-world datasets, in particular, we divide the device pairs from the datasets in groups based on their contacting frequencies and investigate the group-wise inter-contact time distribution. We find that for the frequently contacting pairs, there are three segments on their distribution curve. We use superposition of three contact processes, which are caused by the devices‘ independent movements and intentions of the humans carrying the devices, to explain the three segments. Furthermore, a mobility model is presented. In our model, each node uses a priority queue to schedule its movement, and we theoretically prove that the priority queue results in a power-law inter-contact time and show that the model integrates the three contact processes. Finally, simulation study demonstrates that our mobility model could reproduce the contacts with their inter-contact times very similar to the empirical ones, therefore is accurate in characterizing the complexity of the device contacts in wireless mobile networks.
	TO cite this article:Tian Ye,Li Jiang. Modeling Contacts and Mobility for Wireless Mobile Networks[OL].[18 July 2010] http://en.paper.edu.cn/en_releasepaper/content/4379306


	9. Location-aware Routing for Pocket Switched Networks
	Ye Tian,Jiang Li
	Computer Science and Technology 26 January 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we seek to understand the reasons causing failures and delays of message delivery in Pocket Switched Networks (PSN), and to use this understanding for improving the network. By studying two real-world datasets, we find that node isolation is prevalent in PSN networks, which largely accounts for the inefficiencies in message delivery. In addition, by analyzing nodes’ contact-location relationship, we find that individual and system-wide key locations exist and their existence suggests potential improvements in message routing. Motivated by our observation, we design a location assisted routing scheme for PSN networks. With simulation-based experiments using real-world and synthetic contact traces, we compare the proposal with other representative routing schemes, and show that with the awareness of the location information, the proposed solution could deliver more messages within shorter delays, thus improves the network remarkably.
	TO cite this article:Ye Tian,Jiang Li. Location-aware Routing for Pocket Switched Networks[OL].[26 January 2010] http://en.paper.edu.cn/en_releasepaper/content/39480


	10. A Model of Communication between Private Cloud and External Clouds
	Liu Changyan
	Computer Science and Technology 21 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this article, a model of cloud computing is proposed. The model is about communication between private cloud and external clouds. It is consistent with OSA model for smooth communication between different clouds and convenient application deployment. The details of components are presented for functionality. Also the interactive mode of the model is described.
	TO cite this article:Liu Changyan . A Model of Communication between Private Cloud and External Clouds[OL].[21 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37822

	Check out RSS, or use RSS reader to subscribe this item