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 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 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. The Implementation and Analysis of the Translation from Subtree Filtering to XPath
	Yonghao Shen,Bin Zhang,Guohui Li,Jun Guo
	Computer Science and Technology 04 December 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:NETCONF is a new protocol for network management provided by the IETF NETCONF working group, which uses an Extensible Markup Language (XML) based data encoding for the configuration data and the protocol messages. The subtree filtering is a filtering mechanism recommended by NETCONF. This paper presents a translation method to convert subtree filtering to XML Path (XPath). With this method, we realize the authorization for subtree filter using XPath based access control mechanism.
	TO cite this article:Yonghao Shen,Bin Zhang,Guohui Li, et al. The Implementation and Analysis of the Translation from Subtree Filtering to XPath[OL].[ 4 December 2009] http://en.paper.edu.cn/en_releasepaper/content/37254


	2. An Improvement of the Route Discovery Process in AODV for Ad Hoc Network
	Yongjun Hu,Junliang Shen
	Computer Science and Technology 03 November 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Ad hoc networks are composed of a set of mobile and wireless nodes. They have several characteristics such as being self-organized, dynamically changing topology and multi-hop connectivity. Ad-Hoc On-Demand Distance Vector Routing (AODV) is one of the most widely researched on-demand ad hoc routing protocols. An improvement of the route discovery process in AODV (IMAODV) is proposed to decrease the delay and the routing overload in this paper. The performance of IMAODV is compared with AODV in terms of routing load and average end-to-end delay. The simulation results show that IMAODV has less the average end-to-end delay and the routing load than AODV in the network.
	TO cite this article:Yongjun Hu,Junliang Shen. An Improvement of the Route Discovery Process in AODV for Ad Hoc Network[OL].[ 3 November 2009] http://en.paper.edu.cn/en_releasepaper/content/36374

Saved Papers

Saved Papers


	3. Secure multi-party computations of geometric intersections
	Cui Hui
	Computer Science and Technology 18 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Secure multi-party computation is a research focusing in international crypto graphic community. This paper focuses on geometric intersection problems. We use Cantor Encoding method to solve the secure multi-party computation geometry, and propose a new scheme to solve geometry intersection problem. In order to keep secret, we make use of convertible encryption algorithm. This paper gives the solutions to the segment intersection problem and polygon intersection problem, and then demonstrate their security through simulation example. Compared to mostly existing schemes, this scheme can solve any polygon intersection problem, and sometimes its complexity of computation maybe smaller, especially when dealing with the polygon having more vertexes and smaller area. Although it will generate some errors, but this will not affect its application.
	TO cite this article:Cui Hui. Secure multi-party computations of geometric intersections[OL].[18 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35310


	4. Security Issues and Practical Extensions of Kademlia Protocol
	Zhang Hao,Yuan Tian
	Computer Science and Technology 14 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Kademlia is the most popular deployed structured peer-to-peer protocol, which has a number of desirable advantages that other previous protocols do not offer. However, Kademlia is also vulnerable to the common attacks on the peer-to-peer overlay, although it has some subtle properties that can mitigate the harmfulness of certain attacks. In this paper, we discuss security issues of Kademlia and present some practical extensions of the protocol: a verifiable way of generating node IDs, verifiable routing table updating, and secure message forwarding.
	TO cite this article:Zhang Hao,Yuan Tian. Security Issues and Practical Extensions of Kademlia Protocol[OL].[14 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35154


	5. Energy-Efficient Time Synchronization Algorithm for Wireless Sensor Networks
	Wu Wanrong ,Wang Qianping ,Wang Wei ,Su Yu-e ,Hao Li
	Computer Science and Technology 11 September 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In wireless sensor networks, energy efficiency is an important standard for evaluating the effectiveness of the time synchronization protocols. Hence, energy should be conserved as much as possible provided that algorithm can achieve a certain accuracy. In this paper, we propose an energy efficient time synchronization algorithm in which each layer of the network can be synchronized merely by receiving broadcast messages rather than relying on two-way message exchange. Simulation result shows that our improved strategy reduced the energy consumption and prolonged the lifetime of network compared with TPSN
	TO cite this article:Wu Wanrong ,Wang Qianping ,Wang Wei , et al. Energy-Efficient Time Synchronization Algorithm for Wireless Sensor Networks[OL].[11 September 2009] http://en.paper.edu.cn/en_releasepaper/content/35128


	6. Messenger Nodes Based Routing Protocol for Sparse MANET and Performance Analysis
	Yibo Zhu,Xiaojun Wu,Sheng Yuan,Ming Zeng
	Computer Science and Technology 20 March 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recently, the routing issue in sparse Mobile Ad hoc NETwork (MANET) has drawn many researchers’ attention. However, almost all routing protocols resort to either Global Position System (GPS) or trajectory-control, which increase the cost of entire network. In this paper, the Messenger nodes based Routing (MR) protocol, a novel opportunistic routing protocol, is proposed to serve sparse MANET without either GPS or trajectory-control. With the assistance of the MR protocol, sparse MANET can accordingly be deployed much more conveniently. The simulation results in this paper demonstrate that the MR protocol is able to provide a high rate of packets reception. Moreover, the theoretical models for both the average delivery delay and the average number of hops of the MR protocol are constructed in this paper. Finally, the comparison between simulation and theoretical analysis indicates the coincidence of the analytical models with the simulation results.
	TO cite this article:Yibo Zhu,Xiaojun Wu,Sheng Yuan, et al. Messenger Nodes Based Routing Protocol for Sparse MANET and Performance Analysis[OL].[20 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30549


	7. A novel energy-efficient clustering protocol for WSN
	Li Zhuangzhi ,Xie Ruijun ,Li Tengjie
	Computer Science and Technology 16 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Wireless sensor networks have become more and more popular due to their good application in automotive safety, medical monitoring and so on. However, sensor nodes have some limitations such as low computing capabilities, low battery life and low transmission power, among which, energy efficiency is usually considered as the most crucial problem. Many cluster-based protocols have been proposed to solve this problem, LEACH is a famous one which contributes to evening the energy used in every sensor node so as to prolong the life of the entire network, but LEACH chooses the cluster heads randomly and the number of nodes each cluster head manages is arbitrary. In this paper, we propose a novel energy-efficient clustering protocol which a modified version of LEACH, here, we choose the cluster heads according to the worth of each node and specify the number of member nodes that each cluster head should manage so as to properly use the energy of every cluster head.
	TO cite this article:Li Zhuangzhi ,Xie Ruijun ,Li Tengjie . A novel energy-efficient clustering protocol for WSN[OL].[16 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29047


	8. DHT based context information disseminating method in autonomic network
	WangHao
	Computer Science and Technology 11 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In autonomic network, context information given by monitor is the main foundation of decision. In order to make good use of network context information, the dissemination sub-system is needed to be scalable (support large scale of autonomic network) and distributed(deal with issue of single point of failure). In response to these demands, we propose a method to construct a context information dissemination model based on DHT. In our targeted application, an overlay network is built upon the lower network consist of autonomic nodes. The context information can be published and located using DHT lookup mechanism in the structured distributed network environment. To deal with the mismatch between the overlay-level network and physical network, we present a self-adjust scheme to reduce the lookup routing latency during the process agents apply for the context information. In the strategy, we aim to make node themselves adjust node identifiers in a geographically manner. This self-adjust operation only takes place when the autonomic node access to DHT overlay network.
	TO cite this article:WangHao. DHT based context information disseminating method in autonomic network[OL].[11 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28818


	9. Flow Label Negotiation Mechanism in Heterogeneous Networks based on SIP
	GAO Cheng,Huang Xiaohong,Sun Qiong,Ma Yan
	Computer Science and Technology 05 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Flow Label is a 20-bit field in IPv6’s Base Header. This field is especially designed to solve the QoS problem in next generation network. However, the related research work is still far from enough to make it practical. In this paper, a framework to guarantee the QoS across multiple domains using Flow Label is discussed. Based on this framework, we enhance the SDP message and Precondition, a Flow Label negotiation mechanism using SIP is proposed.
	TO cite this article:GAO Cheng,Huang Xiaohong,Sun Qiong, et al. Flow Label Negotiation Mechanism in Heterogeneous Networks based on SIP[OL].[ 5 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28474


	10. The UPnP-based Algorithm of Resource Scheduling in Pervasive Computing Environment
	Tian Tian,Jian Kuang,JiaLi Bian
	Computer Science and Technology 04 March 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, an algorithm of resource schedule based on UPnP is proposed for pervasive computing. A user could access any resource he or she wants in anywhere at anytime without thinking about more. And the system can schedule the resources exiting in the network by this algorithm. The resource mentioned above can also be understood for service that users may need. A strategy is also presented in this algorithm, which is optimization method of choosing the best one from the devices that provide the services or resources. This research for RS algorithm is supported by Microsoft Research Asia, and by the Embedded Systems and Network Communications Laboratory at Beijing University of Posts and Telecommunications.
	TO cite this article:Tian Tian,Jian Kuang,JiaLi Bian. The UPnP-based Algorithm of Resource Scheduling in Pervasive Computing Environment[OL].[ 4 March 2008] http://en.paper.edu.cn/en_releasepaper/content/19008

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