Computer Science
Started in January,1974（Monthly）
Supervised and Sponsored by Chongqing Southwest Information Co., Ltd.
ISSN 1002-137X
CN 50-1075/TP
CODEN JKIEBK
Authors
Reviewers
Editors
Current Issue
Volume 38 Issue Z10, 16 November 2018
  
Service-oriented Middleware Model for Internet of Things
TAN Yun-song,HAN Jian-jun
Computer Science. 2011, 38 (Z10): 1-3. 
Abstract PDF(252KB) ( 599 )   
RelatedCitation | Metrics
We introduced a servic}oriented middleware model for the development of Internet of Things systems, which focus on embedded devices and security. We described the set of abstract primitives supported by the model that tries to case the development of applications hiding platforms details and other aspects such as scalability, adaptability and inter-operability which are mandatory features in Internet of Things.
Internet of Things:Differential Features and Descriptive Model
HUANG Ying-hui,LI Guang-yu
Computer Science. 2011, 38 (Z10): 4-6. 
Abstract PDF(361KB) ( 493 )   
RelatedCitation | Metrics
The differential features can support Internet of Things existing as a new kind of development, and the theory model can indicate that Internet of Things has been understood deeply. A semantic analysis pointed out that the thing in word Internet of things indicates actually the thing's information, and the Internet is actually the Internet application.Internet of Things is a new type of Internet application which makes the thing's information be shared on a global scale. Internet of Things has four differential features; only for thing's information, coded by UID or EPC, stored in RFID electronic tag, uploaded by non-contact reading with RFID reader. The graphical model of Internet of Things shows that the main tasks of constructing Internet of things are the preprocessing of thing's information before uploaded into Internet and the building of an RFID system. The set expression model of Internet of Things stresses the common character of Internet applications namely an Internet application is essentially a set of information, so the development processes and the technical methods of other Internet applications can be referenced and reused.
Security Analysis and Strategy for M2M of IOT
CHAO Shi-wei,YANG Yuan,LI Jing-yi
Computer Science. 2011, 38 (Z10): 7-9. 
Abstract PDF(263KB) ( 421 )   
RelatedCitation | Metrics
The advanced idea of M2M technology attracts one new round of "wireless revolutions" , and also exposes the potential security hazard of Internet of Things. So, in this case, M2M's structure, consists of front-end sensors and cquipment,networks,back-end IT systems,will become a starting point to analyze the possible potential security threats,those arc Internet of hhings faced, from thirteen parts which is to proposed in this paper, aggressively proposed their corresponding solutions and strategics.
Non-contact Health Monitoring System Based on the Internet of Things and Expression Recognition
YANG Ning,ZHANG Hong
Computer Science. 2011, 38 (Z10): 10-11. 
Abstract PDF(249KB) ( 472 )   
RelatedCitation | Metrics
The Internet of things uses in various fields,which is of great convenience to people's lives. Health monitoring can provide users with convenient and reliable health services, which are of low cost The current health monitoring systems depend on the instruments. Based on the Internet of things and expression recognition, a system called NCHMS was proposed, which monitors the health status with no contact. This article elaborated on the structures and functions of NCHMS system, improved the expression classification space for health monitoring, and gave a detailed expression recognition algorithm. The experimental data from the simulated experiments can tell that the system has considerable feasibility and practicality. Internet of things, Expression recognition, Health monitoring, Non-contact
Machine Manufacturing Rapid Inquiry System's Primary Design and Implementation
HUANG Peng
Computer Science. 2011, 38 (Z10): 12-13. 
Abstract PDF(159KB) ( 609 )   
RelatedCitation | Metrics
The Internet of I}hings is regarded as the computer, the Internet and mobile communication network of information industry after the third time, because of its vast wave of industrial application prospects under governments' attendon. The structure system of the Internet of Things and the key technology play a decisive networked application effect. Content networking applications, can change the traditional industry management mode, let management become more intelligent,more efficient.
Study of Autonomous Method of IoT Component
HE Shuang,ZHOU Yan-hui
Computer Science. 2011, 38 (Z10): 14-17. 
Abstract PDF(313KB) ( 460 )   
RelatedCitation | Metrics
With the development of the Internet of Things(IoT)，how to "intclligentize" the sentient objects with the self-adaption abilities to change their own autonomously against the environment is a real challenge in the IoT researches. Based on the components theory, this paper brought up the FEI3DA(fcature environment belief desire action)structure and its definition of self-adaptive from the three-tier architecture of IoT, and established corresponding algorithm to describe it, at last demonstrated the self-adaption mechanism of these components with instance.
Constructing Smart Campus Based on the Cloud Computing and the Internet of Things
LU Qian
Computer Science. 2011, 38 (Z10): 18-21. 
Abstract PDF(475KB) ( 915 )   
RelatedCitation | Metrics
Based on the wisdom of cloud computing and physical build the campus network, the use of cloud computing,virtualization, SOA cloud build the smart campus, combined with the Internet of things, RFID smart campus building.Most universities already have the hardware to achieve wisdom campus conditions, but the software side, their own way,sharing of resources,poor application of a single campus. Using virtualization technology to integrate the formation of university resources to pool hardware resources, to achieve dynamic resource allocation, dynamic load balancing, improve resource utilization. Meanwhile, using resources monitoring, load management, redundant backup, dynamic dcployment, rapid deployment, resource scheduling, multi-tenant technology, massive data processing, large-scale distributed storage, data management technology to build the campus structure cloud. Conjugating network technology, physical infrastructure and IT infrastructure in general Internet, real-time monitoring, large amounts of data will be handled by the campus goes,the real wisdom on campus,for Colleges leaps and bounds.
RFID Uncertain Data Cleaning Strategy under Shunting Mechanism
XIA Xiu-feng,XUAN Li-juan,LI Xiao-ming
Computer Science. 2011, 38 (Z10): 22-25. 
Abstract PDF(331KB) ( 439 )   
RelatedCitation | Metrics
Radio frequency identification(RFID) is one of the key technologies in Internet of Things. The uncertainty and mass of RFID original data limit the development of technology seriously. 13y analyzing the uncertain data characteristics,an RFID data cleaning strategy under shunting mechanism was established. The strategy introduces the cleaning queue concept, and according to the cleaning nodes' judgment conditions it can choose the optimal cleaning line. Since it needn't to travel all the cleaning nodes in cleaning system, it saves much time of data transmission and waiting. The experimental results show that the strategy can ease the pressure of data transmission, and improve the efficiency of data cleaning greatly.
Research and Application of Low-cost Food Tracking Based on the Internet of Things
DENG Fang-yuan,JING Xiao-ping
Computer Science. 2011, 38 (Z10): 26-29. 
Abstract PDF(329KB) ( 409 )   
RelatedCitation | Metrics
Duc to high cost of the current RFID technology application in the food tracking, it can't be used in low-cost industry. We proposed a Internet based low-cost solution for food tracking analysis using the two-dimensional code on the basis of Internet of things. By analyzing the two-dimensional code, middleware, mobile phones, computer terminals and other component parts in the Internet of things,we indicated the feasibility of the solution,of which the identificalion of two-dimensional code using the phone provides a great convenience. The final result is that the solution for traeking the food industry is currently a large number of applications.
Real Time Situational Awareness Model for Large-scale Networks
ZHENG Li-ming,ZOU Peng,ZHANG Jian-feng,JIA Yan,HAN Wei-hong
Computer Science. 2011, 38 (Z10): 30-35. 
Abstract PDF(557KB) ( 971 )   
RelatedCitation | Metrics
NSAS (Network Situation Awareness System) can identify and predict potential attacks. It plays an important role in improving the emergency response capacity and proactive defense capability of the networks. Existing NSASs have many faults, such as lacking for multi source information, higher computational complexity, which arc difficult to be applied to larg}scale networks and real-time situational awareness. This paper introduced an NSAS for largescale network. The situational awareness model was proposed first, and then the details of key technologies, including data fusion, correlation analysis, index quantification and event predication,were given. I}he experimental results demonstrate the effectiveness and reasonability of the proposed model.
Honeyfarm-based Network Worm Detection Technique in Three-tied Intranet
CHEN Zhi-jie,XIAN Ming
Computer Science. 2011, 38 (Z10): 36-40. 
Abstract PDF(436KB) ( 602 )   
RelatedCitation | Metrics
There arc many intrusion activities on the intranet in which network worms cause the greatest harm. Traditional network security means have many deficiencies, as a means of monitoring and information gathering, honey field technology is essentially different with traditional network security measures. A network worm detection method based on honcyfarm of threctied intranet was proposed. With the ability of improving the speed of worm detection, enhancing the security of internal network, it has important practical significance.
Web Browser Vulnerability Exploitation Attack Test Technology Based on Code Overriding
MENG Chen
Computer Science. 2011, 38 (Z10): 41-43. 
Abstract PDF(302KB) ( 483 )   
RelatedCitation | Metrics
Based on the proofs of concept for vulnerability exploitation attack, we can find the characteristic of the attack through reverse engineering using WinDbg and write test code according to the characteristic. We then encapsulate the test code into a DLL and inject the DLL into Web browser through remote thread. The injected DLL will hook browser's API by means of code overriding, so that the browser will jump to the test code. I3y visiting a website and acknowledging the return value of the injected code to judge whether the webpage contains trojan horse using the vulnerability. I3y deploying this technology into numerous virtual machines, we can analyze webpages in bulk, and then provide high-quality webpages blacklist to antivirus software companies and search engines.
Construction Method of Rootkit Based on JOP
LI Zheng-yu,MAO Bing,XIE Li
Computer Science. 2011, 38 (Z10): 44-49. 
Abstract PDF(515KB) ( 472 )   
RelatedCitation | Metrics
ROP is a new programming method, this method can leverage existing code of system to construct malicious code, rootkit constructed by ROP can evade the detection of most kernel integrity protection mechanisms present. Because the instruction gadgets ending by jmp have a certain regularity, so, present there are many protection methods that can detect it. Compared with ROP, the construction method of rootkit based on JOP has no certain regularity, so, the methods of ROP detection present can't detect it. Moreover, compared with ROP, this new method will not be restricted by size of kernel stack and the memory layout of data will be more flexible in the process of construction.
Secure and Reliable Centralized Multicast Key Management Scheme
DENG Shu-hua,ZHAO Ze-mao
Computer Science. 2011, 38 (Z10): 50-52. 
Abstract PDF(328KB) ( 566 )   
RelatedCitation | Metrics
By constructing two special polynomials,a new multicast key management (MKM) scheme-Hash Function-based Multicast Kcy Management (HFMKM) scheme was proposed,which was based on hash function and two-variable one-way function. The properties of both centralized and distributed were combined in this scheme, so it overcame the defect of conventional centralized flat schemes, whose security totally depended on the Group Controller CGC). With Comparing and analyzing it with GKMP scheme, the results showed that the HFMKM scheme obviously improved the security and the overall performance. It is a new security MKM scheme.
Research on the Defense in Depth System of Air Defense Information Network
HUANG Ren-quan,LI Wei-min,ZHANG Rong-jiang,HE Ze-wei
Computer Science. 2011, 38 (Z10): 53-55. 
Abstract PDF(422KB) ( 1082 )   
RelatedCitation | Metrics
In the information age, the security of air defense information network is a new challenging problem to the air defense system. According to the frangibility of the hardware, operation system and the network protocol, there was a great danger hidden in the air defense information network, and both of the outside and inside threats were studied. For keeping the security of the air defense information network, the defense in depth strategy was proposed, and then the defense models were constructed both in length and depth. At last, the technology framework was analyzed, and the key technology was studied.
Key Management Scheme for WSN Based on Convertible Ternary Polynomial
FANG Zhao-lin,XIE Hong-jun
Computer Science. 2011, 38 (Z10): 56-58. 
Abstract PDF(249KB) ( 391 )   
RelatedCitation | Metrics
Because all nodes having the same polynomial use the same shared session keys, schemes designed for wireless sensor networks based on the ternary polynomial are vulnerable to the node capture attacks. They are lack of performance scalability in terms of communication overhand. To address these limitations, a new dynamic key management proposal was designed for wireless sensor networks based on the convertible ternary polynomial, which can guarantee that all nodes having the same polynomial can get the same administration keys and two nodes having the same polynomial can get shared session keys. Compared with the schemes based on the ternary polynomial, the proposed scheme can greatly defend against the node capture attacks overall and reduce communication overhand.
Groups of Immune-softman Intrusion Detection Model Based on Trust Correlation
ZHOU Fang,ZHENG Xue-feng,YU Zhen
Computer Science. 2011, 38 (Z10): 59-61. 
Abstract PDF(253KB) ( 390 )   
RelatedCitation | Metrics
The immuncsoftman is provided with adaptability, intelligence and collaboration, so it is used to monitor distributed dynamic network environment in real time. Most of Distributed Intrusion Detection System will produce large amounts of alarm information and the false-alarm rate is also high, which affects the effectiveness of intrusion detection.To address this issue, groups of immuncsoftman intrusion detection model based on trust correlation was proposed.Through the trust correlation algorithms the credibility of the Immune-softman producing alarm can be measured. Simulations show that the groups of immuncsoftman intrusion detection model based on trust correlation can improve the accuracy of intrusion detection alerts.
Analysis of Problem in SVD Domain Watermarking and Improved Algorithm
JIANG Tian-fa,XIONG Xiang-guang,JIANG Wei
Computer Science. 2011, 38 (Z10): 62-65. 
Abstract PDF(389KB) ( 704 )   
RelatedCitation | Metrics
The reasons of high falscpositive detection rate problem for a class of singular value decomposition(SVD)based image watermarking algorithms were analyzed and the corresponding results were given. On this basis, a novel watermarking algorithm based on discrete wavelet transform(DWT) and SVDwas proposed. First the host image is divided into non-overlap blocks and each block is applied 1-level DW T, and then SVD on the low-frequency sub-bandis made. The watermarking is preprocessed by Arnold transform and then is embedded into the singular values of the low-frequency sub-band based on quantization method. Experiments show that the proposed algorithm can overcome the high falscpositive detection rate problem which exists in the traditional watermarking algorithm based on SVD and robust against common signal processing such as JPEG compression, filtering, and the adding of noise.
Research and Development of Peer-to-Peer Botnets
DU Qin,LU Guang-li,SU Zhong,LIN Fan,ZHANG Shao-hua
Computer Science. 2011, 38 (Z10): 66-71. 
Abstract PDF(563KB) ( 1303 )   
RelatedCitation | Metrics
Because of IRGbased botnets' central point of failure, more and more botnets turn to decentralized Command & Control Channel. Peer-to-Peer protocol based botnet(P2P botnet) is the most important one. After more than 10 years' development, the technology of P2P botnets has been fully mature. They are more resilient and robust, and more difficult to be eliminated. They are considered to be the new generation of botnets. In this paper,the P2P botnet's evolution process was introduced, the functional structure, taxonomy and execution process of P2P botnet were discussed in detail, the propagation model and research development on technology of tracking, detecting and defending methods were proposed.
New Botnet Propagation Model with Inununity
HUANG Biao,TAN Liang
Computer Science. 2011, 38 (Z10): 72-75. 
Abstract PDF(360KB) ( 411 )   
RelatedCitation | Metrics
Botnet is a novel attack mode evolved from the traditional malicious softwares, currently it has become a major threat to Internet. The propagation model of botnet is the most common method to study the spreading features of bots, but current botnets' propagation models don't consider characteristics of some hosts' immunity, so these propagation models can not exactly describe how the bots spread on the Internet. In this paper, a new botnet propagation model with the immunity was proposed. This model carefully considerates about the real situation of the Internet, espedally immunity of the host which removed from the susceptible network in advance. Simulation result shows that the botnet propagation model with immunity more exactly satisfies the practical propagation laws and infection characteristics of bot on Internet.
Framework Detecting in Parallel DSP Network Based on Wormhole Algorithm
ZOU Xiu-guo
Computer Science. 2011, 38 (Z10): 76-77. 
Abstract PDF(249KB) ( 318 )   
RelatedCitation | Metrics
There are many ways that compose parallel DSP network. Two methods connecting DSP are EMIF and McBSP, combining the advantages of both approaches. Its structure can use wormhole algorithm. Depth-first traversal algorithm is a good wormhole algorithm. Elaborating on the concrete realization of the wormhole algorithm, and geting the framework with this algorithm in the detecting. If using the same DSP chip, the parallel DSP algorithm has more applicability in parallel DSP system.
Research on Software Vulnerability Mining Technique Based on File-format
CHEN Tao,SUN Le-chang,PAN Zu-lie,LIU Jing-ju
Computer Science. 2011, 38 (Z10): 78-82. 
Abstract PDF(481KB) ( 941 )   
RelatedCitation | Metrics
Software vulnerability mining technique based on FilcFormat becomes more important in information security filed for the filcformat vulnerability's serious damage and complexity discovery. Summarized the development of this technique,and mainly analyzed three disadvantages when applied to a special filcformat At last, proposed the further improvement directions.
New Trust Metric Based on Fuzzy Adjustment for Services Computing Environment
SHENG Yong,DU Xiao-jing,JIANG Li-ming,XU Jian
Computer Science. 2011, 38 (Z10): 83-86. 
Abstract PDF(331KB) ( 793 )   
RelatedCitation | Metrics
In order to deal with the problem of the decline of accuracy of trust metric, which is met due to the ignorance of the difference of rating scale, we presented a new trust metric based on fuzzy adjustment, Firstly, we described the semantic of trust rating and rating scale based on fuzzy member functions. On this basis,we proposed a trust rating adjust method. Lastly, we applied the weigh calculated from similarity matrix to trust aggregation. Analysis and experiment show that compared with Pagerank algorithm and TidalTrust algorithm, the method proposed in this paper has more remarkable enhancements in the accuracy of trust metric and is effective to reduce the false positive and negative in trust decision.
A Kind of Network Security Protocols and Verification
LI Xiao-yan,MIAO Chang-yun
Computer Science. 2011, 38 (Z10): 87-88. 
Abstract PDF(169KB) ( 332 )   
RelatedCitation | Metrics
Considering some problems of secure communications between the various modules in distributed intrusion detection system, a kind of network security protocols of applicable to distributed intrusion detection system were poposed. The protocols are proved to be safe in theory and to be a reliable in product testing.
Research and Design of Network Access Control Software Based on a Special Network
LOU Heng-yue,DOU Yue-jiao
Computer Science. 2011, 38 (Z10): 89-91. 
Abstract PDF(356KB) ( 397 )   
RelatedCitation | Metrics
Based on analysis of security and confidentiality in a private network and the demand for network access control,a network access control software was designed and realized. Focused on the request of management and limitation for on-line client computers which used chipset/wireless network card in a private network, this software realized its functions by detecting the change of client IP address or other messages, triggering network control events for network monitoring and management.
Reliability Prediction Model for Web Services Based on Control-structure
XIE Chun-li,WANG Xi-feng
Computer Science. 2011, 38 (Z10): 92-95. 
Abstract PDF(298KB) ( 344 )   
RelatedCitation | Metrics
In the development phase of Web services, the services located in different locations and provided by different organizations must be composed together in order to satisfy specific business requirements. The reliability must be ensured for composite services first. The reliability of composite services is the most important QoS(Quality of Service)which can determine the popularity of the services. The reliability of composite services is affected by the structure of services and by the composite conditions. So, the traditional models to predict the reliability are inapplicable to Web services. In this paper, to improve the accuracy of reliability prediction, a reliability prediction model for composite service was presented based on control-structure. Lastly, a case study was designed to support our reliability model. The experimental results show that our model can obtain better reliability prediction accuracy.
Study on Military Networks Defense In-depth Model Based on Closed-loop Control
LIU Sheng-jian
Computer Science. 2011, 38 (Z10): 96-98. 
Abstract PDF(279KB) ( 913 )   
RelatedCitation | Metrics
According to the specific construction demand of military networks defense system, this paper proposed a new military network defense in-depth model of APR-WPDRRC based on closed-loop control mechanism. Since the model adopts technique policy of multilayer defense in-depth and integrate layer-class frame of defense in-depth technique method, it can achieve cooperation linkage and closed-loop control of fast warning, initiative protection, real-time detection, urgent response, dynamic restore and precision counterattack. hhe model has a good networks defense agility of adaptability, intrusion tolerance attack and strong survivability when it is confronted with large-scale, distributed, instantancous changing network attacks.
Vague-keyword Search under Encrypted Environment in Cloud Computing
LIANG Yu,LU Jin,LIU Li-xi,ZHANG Chi
Computer Science. 2011, 38 (Z10): 99-100. 
Abstract PDF(262KB) ( 438 )   
RelatedCitation | Metrics
As there is a significant development in potable devices market recently, cloud computing is more commonly implemented. Confidential Batas arc accumulated and stored in cloud servers. To ensure the Batas arc secured, they should be encrypted when being uploaded, which makes efficient searching among them a much complicated task. Traditional searching programmes in encrypted environments are able to find the data only if the keyword is exactly correct,but will fail if spelling errors or format errors occur.These programmes arc hence not suitable for cloud computing. We introduced a high efficiency programme which can deal with even vague keyword searching in the encrypted environment.
Secure ID-based Verifiably Encrypted Signature without Random Oracles
WANG Tian-qin,SU Li-wen
Computer Science. 2011, 38 (Z10): 101-105. 
Abstract PDF(357KB) ( 428 )   
RelatedCitation | Metrics
Verifiably encrypted signature can be used in secure electronic transactions. We presented the first efficient identity-based verifiably encrypted signature scheme which has the properties of verifiability and recoverability. We gave a security model with precise definitions and showed that the scheme is secure under the computational Bilinear Diffie-Hellman assumption without random oracles.
Application of FAT in Information Security Risk Assessment
ZHENG Lei-lei,SONG Li-hua,GUO Rui,ZHANG Jian-cheng
Computer Science. 2011, 38 (Z10): 106-108. 
Abstract PDF(357KB) ( 642 )   
RelatedCitation | Metrics
Information Security (IS) becomes the focus question that people pay attention to, how to build a qualitative model of Information Security Risk Assessment (ISRA) and how to quantitatively analyze the key parts in a number of risk factors are the primary questions that we concerned. We built the ISRA model using Fault Tree Analysis (FAT)，and then by qualitative and quantitative analysis, we analyzed the relationship between risk factors and IS, finding out the main factors that result in Information Security Risk exposure. The result shows the practicability and expandability of this assessment model.
Research on Hierarchical Trusted Platform Based on Trusted Terminal
JIA Jia,ZHOU Yi,DONG Hui,ZHENG Cheng-yan
Computer Science. 2011, 38 (Z10): 109-113. 
Abstract PDF(463KB) ( 395 )   
RelatedCitation | Metrics
This paper presented the research on hierarchical trusted platform based on trusted terminal, which is a new direction. The platform system is a combination of hardware, secure operating system and application system. This paper,through building a complete trusted chain from the start stage of the client terminal, undertaking the security of trusted computing platform which could make the trust transfer from user to user, realized the real trusted computing experience for users.
Network Model Based on Local World
WANG Xue-guang
Computer Science. 2011, 38 (Z10): 114-118. 
Abstract PDF(409KB) ( 490 )   
RelatedCitation | Metrics
Self-organized mechanism is one of many reasons which can explain system building. For simulating the network formation in the real world, this paper proposed a network evolution model based on local world and self-organized mechanism. It discussed the model's topological properties, including clustering coefficient, betweenness centrality, efficiency,reachability,biggest cluster size and cluster diameter. The results show that the model can tolerate random failures and intentional attacks very well.
Applications of A-EKE Protocol with ElGamal Signature Scheme Based on the Conic Curve over Zn
HAO Si-jia,FANG Ying-jue,WANG Biao,WU Jing-yang
Computer Science. 2011, 38 (Z10): 119-123. 
Abstract PDF(384KB) ( 396 )   
RelatedCitation | Metrics
This paper proposed a scheme in which A-EKE is formed on the basis of conic curve over residue class ring Zn，using ElGamal signature algorithm, and presented the numerical simulation of the scheme. This scheme has combining advantages; A-EKE Protocol using a combination of asymmetric(publi-key) and symmetric(secret-key) cryptography provides security and identification for communication on computer network. A-EKE allows hosts not to store cleartext passwords, and thus can prevent the attacker from mimicking the user to the host. Implementing the scheme using ElGamal signature algorithm also strengthens the scheme. The scheme can secure against active attack, overlay attack,rnan-irrth}rniddle attack,off-Line dictionary attack and password profile cor工iprornise. Cox工iprehensively usin9 the difficulties in factorizing large integer and computing discrete logarithm with Conic Curve over ，the security of this scheme is increased. For the facility of plaintext embedding and the computing of rank and point on conic Cn(a, b)，the scheme has the advantages of speedy operation and easy realization, especially by using the NAF. These advantageous properties of the schemes have pragmatic significance for the design and realization of secure and efficient identity authentication and key negotiation system.
Survey of Data Consistency Insurance Technologies for Continuous Data Protection
LIU Lin,XIONG Qi,WU Shi-zhong
Computer Science. 2011, 38 (Z10): 124-127. 
Abstract PDF(464KB) ( 850 )   
RelatedCitation | Metrics
As a new branch of disaster tolerance, Continuous Data Protection(CDP) overcomes the weakness of traditional data backup and snapshot technology, protecting critical data with novel method. The working flow of Continuous Data Protection was first introduced, then problems leading to data inconsistency in CDP were analyzed, and some technologies employed for data consistency protecting were summarized and analyzed. The future research direction in CDP data consistency protection was pointed out.
Information Filtering Mechanism Based on User Network Architecture for Mobile Internet
WANG Jing-xin,YUAN Jian,GENG Jun-wei,FENG Zhen-ming
Computer Science. 2011, 38 (Z10): 128-132. 
Abstract PDF(433KB) ( 356 )   
RelatedCitation | Metrics
To improve the accuracy of information filtering mechanism and resolve the cold start problem, an information filtering mechanism based on user network architecture was proposed. Here, the social network is treated as a part of the information sharing and dissemination system, like information processing nodes, to help us recognize mobile users' needs and identify more interesting services. The user interest network structure is used to improve the collaborafive filtering. The social network is used to limit the transmission of information. The fingerprints are used to solve the cold start problem. Data analysis shows that this mechanism has better performance.
Design and Implementation of Field Data Collection and Transmission System for e-Science Applications
QIN Gang,WANG Jin-yi,YANG Zhi-chao,DAI Liang-feng,FAN Dao-yi,YAN Bao-ping
Computer Science. 2011, 38 (Z10): 133-135. 
Abstract PDF(367KB) ( 598 )   
RelatedCitation | Metrics
e-Science is one of the research hotspots in recent years, which focuses on how to apply IT on other disciplines. How to collect and transmit field data is an immediate problem to be solved in e-Science for those disciplines involving field observation. This paper brought out a system for field data collection and transmission in an automatic and high efficient way combined with several kinds of communication methods. A demonstration system was developed in JAVA language to implement this system and was verified to be good efficient in test.
Use of LDA Model in Topic Tracking
ZHANG Xiao-yan,WANG Ting,LIANG Xiao-bo
Computer Science. 2011, 38 (Z10): 136-139. 
Abstract PDF(418KB) ( 703 )   
RelatedCitation | Metrics
As more and more researches are made for the LDA model, its ability of representing and mining has been increased a lot. " Topic" is an important concept in the I_DA model, which is represented as a polynomial distribution of the feature set. Topic tracking is monitoring a stream of news stories to find additional stories on a topic identified by several samples. There are two reasons for using the LDA model in topic tracking; one is to show how the performance of the tracking system using the I_DA model is; the other is trying to find whether there is some relation between the LDA topic and the tracked topic. The experimental results indicate that the LDA model is better than the vector space model，the unigram language model and the special event model in a topic tracking system However, since the granulari- tics of two kinds of topics arc different, the relation between the LDA topic and the tracked topic is not about bijection.An adjustable LDA model is needed in our future work.
Techniques for Thread Assessment Based on Rough Set Theory and Plan Recognition
WANG Xiao-fan,WANG Bao-shu,LUO Lei
Computer Science. 2011, 38 (Z10): 140-142. 
Abstract PDF(227KB) ( 415 )   
RelatedCitation | Metrics
Although there is a mass of uncertain information in process of thread assessment, plan recognition quick is very important. A new method for plan recognition based on rough set was put forward. First the model for plan recognition based multi-attribute of rough set was build and calculating methods were given, then concrete examples were demonstrated to test the validity and correctness of the models. The results of the experiment show that the model can promote the efficiency of thread assessment, and give a new technique of pattern matching quick.
Research on Density Clustering Algorithm with a Multiple Constraints
JIANG Min,PI De-chang,SUN Lan
Computer Science. 2011, 38 (Z10): 143-145. 
Abstract PDF(336KB) ( 631 )   
RelatedCitation | Metrics
Traditional clustering algorithms based on density can not overcome the shortage with a variety of constraints in the existing clustering algorithm based on the density proposed. This paper proposed a clustering algorithm based on density with a variety of constraints. The algorithm introduces a variety of constraints into clustering algorithm to analyze the clustering results affected by a variety of constraints. Experimental results show that the algorithm in a multi constrained condition can complete a cluster analysis of the data points,and can obtain a better clustering results,provides a good theoretical support for really dealing with multiple constraints clustering.
Web Data Mining Based on Cloud-computing
CHENG Miao
Computer Science. 2011, 38 (Z10): 146-149. 
Abstract PDF(361KB) ( 521 )   
RelatedCitation | Metrics
Internet is a huge and widely distributed information service center, the vast amounts of data generated on the Internet arc usually geographically distributed, heterogeneous, dynamic and become more complex, it can not meet the requirements if we use the existing centralized data mining methods. To solve these problems,proposed a cloud computing-based Web data mining method, the massive data and mining tasks will be decomposed on multiple computers parallely processed. We use open platform-Hadoop to establish a parallel association rules mining algorithm based on Apriori, and it tests and veriftes the efficiency of system. This paper proposed a design thinking that "migrate the calculation to the store"，the calculation will be implemented on the local storage nodes, thus it can avoid the large amount of data transmission on the network, and will not take a lot of bandwidth.
Non-extensive Entropy:A New Metric of Internet Topology
ZHANG Yi-fang,QIAN Ya-guan,WANG Bin,LU Bing-bing
Computer Science. 2011, 38 (Z10): 150-152. 
Abstract PDF(238KB) ( 557 )   
RelatedCitation | Metrics
With the size of Internet growing fast, the topology model of Internet is becoming an appealing point in research community. People make try to put deep insight into the nature of Internet topology, by constructing more models from initial Waxman random model to I3A，GLP, and PFP. A number of topology metrics were proposed, including node degree, cluster, and betweeness, to describe the topology characters. Non-extensive entropy, which is employed extensively in statistical physics,was introduced for a new Internet topology metric in this paper. It is used to depict the purity of node degree distribution. In order to evaluate the non-extensive entropy as topology metric, we analycd the consistency of BA, Waxman and real topology generated from CAIDA，by their non-extensive entropies. Finally, we argued that I3A is more in accordance with real Internet topology by comparing their non-extensive entropy, which confirms that non-extensive is fit for topology metric.
Research on Article Edit Characteristic in Wikipedia
ZHAO Dong-jie,HAO Li,LI De-yi,WANG Hua,HE Yu
Computer Science. 2011, 38 (Z10): 153-156. 
Abstract PDF(357KB) ( 906 )   
RelatedCitation | Metrics
Aiming at the problems of article edit characteristic in wikipedia, under the direction of the idea of networked data mining,featured articles in wikipedia were analysed by text processing to hind the difference of sentence between adjacent versions, the article edit interaction networks were constructed, where the node is editor and the link is the edit interaction connection between editors, then the article edit characteristics in wikipedia were analysed by the empirical analysis of the nine networks. Results show that all networks have small-world properties, strong positive degree strength correlation and negative degre}clustering coefficient distribution, their degree distributions are similar to strength distributions, their cumulate distributions and link weight distribution arc power-law distribution, shortest path length distributions are similar to gauss distribution, all networks have degree and strength disassortativity and weak reciprocity, furthermore the edit collective have strong heterogeneity and community structure, which deepens the knowledge of the process of article edit interaction and collective intelligence.
Fuzzy Clustering Partition Model for Computer Cluster in Cloud Computing
LIU Bo-cheng,CHEN Qing-kui
Computer Science. 2011, 38 (Z10): 157-160. 
Abstract PDF(397KB) ( 441 )   
RelatedCitation | Metrics
With the development of cloud computing applications, the computer cluster becomes more and more important, but the computer performance in cluster is so different. Even though they can connect and can share their resources each other, but when the computer performance is not balance and the cluster performance is not to match with the parallcl tasks, it can cause the low efficiency for parallel task. So, it is an important problem how to partition and management computer cluster. The paper gave a way to solve it. Using the fuzzy clustering method according to the computer resources in computer cluster and through the vector of resource demand and the vector of lowest inaccuracy tolerance,we can divide the computer cluster into several classes(logical computer cluster) and make the every computer performance in one class to be more similar. It makes the computer cluster management to become easier. We partition the computers in lab into network gateway cluster, data base cluster, and service cluster for the Internet of thing cloud using this model.This model is fit for the cloud computing applications.
Lineage Tracing Model for Iceberg Queries Over RFID Data Stream
LIU Yao-zong,ZHANG Hong,MENG Jin,WANG Yong-li
Computer Science. 2011, 38 (Z10): 161-164. 
Abstract PDF(371KB) ( 398 )   
RelatedCitation | Metrics
In order to get popular elements and the origin of the data in RFID data streams, iceberg queries of RFID data streams with data information on the origin of glaciers query must be made. RFID data lineage to track the application flow needs to know the origin of the data. This paper introduced the data streams lineage tracing techniques, combined with the method of the query RFID data stream, a lineage tracing model for iceberg queries over RFID Data Stream was proposed in this paper.
Model of Identifying the Influentials in Blog Community
LU Lu,DING Cai-chang
Computer Science. 2011, 38 (Z10): 165-168. 
Abstract PDF(351KB) ( 504 )   
RelatedCitation | Metrics
Some bloggers in the virtual community could impact other partners' opinion and guide the actions of other members by publishing high-quality blog post, which is considered to have high influence. We regarded them as important informative resources. Detecting the influential' s activities gives assistance to external world' s decision. We proposed some measurements of influence by taking advantage of the blog's unique form,and ctuantify influence with resped to topics. I}he experiment shows that model can overcome shortcomings of only using the simple statistical characteristics to identify important blogger,which is an effective method.
Application Research on Artificial Immune Network Combined with RBF
YAN Xue-ming,YANG Ling-xiao,GE Hong
Computer Science. 2011, 38 (Z10): 169-171. 
Abstract PDF(338KB) ( 502 )   
RelatedCitation | Metrics
Artificial immune network, an intelligent information processing model inspired by biological immune system,has been widely studied and applied. In this paper, a modified artificial immune algorithm combined with traditional RBF was used in problem solving. The experimental results show that the modified artificial immune network algorithm can present the functions of reducing data redundancy, smoothing noise and extracting feature data to improve data quality.In the application of combining with RBF network, the speed and functionality of problem solving arc raised effectively.
Performance Research of Storage Area Network under the Online Transaction Processing
GOU Yan,LI Hua
Computer Science. 2011, 38 (Z10): 172-174. 
Abstract PDF(281KB) ( 419 )   
RelatedCitation | Metrics
Storage area network is a storage solution based on "block" data access, it is popular in recent years and used in many areas. Online transaction processing is popular business. Online transaction processing business is running in a storage area network, to improve the quality of business. How to ensure the business can run fast and stable, or how to resolve problems in the shortest time is something that we are concerned about. This requires us to research their performance and optimize it,in order to support system running with a high quality.
Personalize Context and Item Class Based Resource Recommendation
YANG Chang,LI Hua
Computer Science. 2011, 38 (Z10): 175-177. 
Abstract PDF(317KB) ( 386 )   
RelatedCitation | Metrics
The conditional collaborative filtering technology does not consider the user's context information which affect user's rating. 13ut recent research show that user's personalized context directly affect rating, so the result of recommendation can be improved if personalize context is incorporated into conditional collaborative filtering technology.Besides, the personalized context and item class are can be combined, Firstly classifying the items, and then making sure user's personalize context under every item class. When predicting the rating of target item,Firstly make sure which item class the target item is belong to, and then identify the user's personalized context used to compute the rating of the target item. hhe experimental results show that the recommendation accuracy of proposed approach is better than Slope One.
Hybrid Particle Swarm Algorithm of Solving Nonlinear Constraint Optimization Problems
ZHANG Li-feng,HU Xiao-bing
Computer Science. 2011, 38 (Z10): 178-180. 
Abstract PDF(281KB) ( 1141 )   
RelatedCitation | Metrics
Combining a multiplier method which deals with constraint problems with improved particle swarm optimization algorithm, a new hybrid particle swarm optimization algorithm was proposed for solving non-linear constraint problems. The new algorithm takes advantage of the particle swarm optimization algorithm and the multiplier method, for the non-available particle appearing in the iterative process, using the multiplier method to produce feasible particle, and then search its optimal value by improved particle swarm optimization. Thus it can not only reduce the probability of falling into local minimum, but also can improve the search accuracy. And the numerical tests show that the proposed new algorithm has the characteristics of validity and searching for more precise particle and better robustness.
Negative Selection Algorithm Based on Niche Strategy
YANG Ning ,WANG Qian
Computer Science. 2011, 38 (Z10): 181-184. 
Abstract PDF(330KB) ( 419 )   
RelatedCitation | Metrics
Negative selection algorithm is one of the traditional core algorithms of the artificial immune system, many improved algorithms are based on it, However, there are many problems about these algorithm such as the long-time computing and the excessive consumption of space resources. In order to reduce the complexity of the algorithm and the generation time of the detector, we presented a algorithm which was based on the niche strategy, it improve the efficiency of the generation of negative selection algorithm.
Research on PageRank Algorithm
LI Zhi-ying,YANG Wu,XIE Zhi-jun
Computer Science. 2011, 38 (Z10): 185-188. 
Abstract PDF(344KB) ( 1575 )   
RelatedCitation | Metrics
Pages ranking is one of the key technologies used in the design of a search engine. I}his paper described the famous PageRank algorithm. For the problems such as topic drift and emphasis on the old page, the approaches and features of a variety of improved algorithms were analysed in detail, hoping that can provide the basic support to the research in the future.
Study on Word Meaning Comprehension Based on Formal Concept Analysis
YANG Fan, ZHAI Yan-hui,QU Kai-she, LI De-yu
Computer Science. 2011, 38 (Z10): 189-191. 
Abstract PDF(338KB) ( 574 )   
RelatedCitation | Metrics
We discussed polysemy analysis and semantic analysis based on formal concept analysis. On polysemy analysis, we generated a decision context based on relations between word meanings and the corresponding parts of speech.And then we extracted the decision rules from the context and gave them explanations. On semantic analysis,we formed a formal context based on relations between linguistic objects and their semantic features, and analyzed them according to formal concept analysis. Experiments show that we can not only classify the linguistic objects easily, but view reladons between different word classifications intuitively, and that formal concept analysis is an efficient tool for semantic analysis.
Improved Slope One Algorithm for Collaborative Filtering
WANG Yi， LOU Heng-yue
Computer Science. 2011, 38 (Z10): 192-194. 
Abstract PDF(249KB) ( 577 )   
RelatedCitation | Metrics
Compared to traditional rating-based collaborative filtering algorithm, the Slope One algorithm is simple and efficient. However, the Slope One algorithm relies on a large number of users' ratings to the item which should be predieted. The rating prediction is affected when users' ratings are not enough and it does not consider the users' habits.For the reason, the semantic similarity of the keywords to describe the items was introduced, which measures the degree of similarity between item-pairs, then a combination of items' semantic similarity and the Slope One algorithm was proposed. Finally,by the standard data set MovieLens, the data of the experiment's result show that the improved algorithm improvers the accuracy of the original algorithm.
Research on Cloud Economic Resource Management Model with QoS Constrains
QIAN Qiong-fen,LI Chun-lin, ZHANG Xiao-qing
Computer Science. 2011, 38 (Z10): 195-197. 
Abstract PDF(374KB) ( 385 )   
RelatedCitation | Metrics
It is a major challenge for the cloud computing system to provide satisfied cloud application with QoS constraints. We proposed a cloud computing economic management model based on commodity market prototype, which implements the mapping from application service layer QoS to resource device layer QoS over the SLA negotiations between the users and providers in cloud computing market Finally, the utility function as management strategy was used to optimize resource scheduling.
Survey on Product Review Spam Detection
SUN Sheng-yun ，TIAN Xuan
Computer Science. 2011, 38 (Z10): 198-201. 
Abstract PDF(349KB) ( 736 )   
RelatedCitation | Metrics
It is common for ccommerce Web sites to enable their customers to write reviews of products that they have purchased. Unfortunately, reviewers may write some untruthful opinions in order to promote or damage specific products' reputation which called review spam. Product review spam detection makes an attempt to find untruthful opinions and remove them to restore the truthful for readers. The difference between product review spam and other spams was analyzed firstly. The related work of review spam detection was presented including review helpfulness and review sentiment analysis later; and then the data set and methods to detect spam were introduced and summarized. The trend of product review spam detection was concluded finally.
Research and Comparison of Virtual Storage Technology
FU Yun-sheng ,WANG Kai-yun
Computer Science. 2011, 38 (Z10): 202-203. 
Abstract PDF(266KB) ( 889 )   
RelatedCitation | Metrics
We introduced the conception and advantages of virtual storage technology, three implementation approaches of virtual storage were detailed which is called host based, storage device-based and network-based. According to the comparison and analysis of virtual storage described above, we gave the conclusion that users with different demands should choose the appropriate approach of virtual storage depending on the application scenario.
Handwritten Numeral Recognition Based on the Improved BP Neural Network
HE Song, QI Jian-yu
Computer Science. 2011, 38 (Z10): 204-205. 
Abstract PDF(246KB) ( 654 )   
RelatedCitation | Metrics
The digital recognitions have extensive application in a lot of important fields. The artificial network was studied in the paper. The figure specimens were filtered through the process of unconstrained handwritten numeral, that it was recognized by the improved BP neural network. The result of experiment demonstrates that the method has very high noise immunity capacity and overcomes the limitation of traditional BP algorithm. The recognition rate and precision rate are greatly improved at the same time.
Towards Improving Process Mining Results Based on Invisible Tasks
XUE Gang，LIU Fang-yu， ZHOU Yi xuan， YE Xiao-hu
Computer Science. 2011, 38 (Z10): 206-208. 
Abstract PDF(225KB) ( 452 )   
RelatedCitation | Metrics
Process mining is helpful for deploying new business processes as well as auditing, analyzing and improving the already enacted ones. I}he following text will solve the problem in dealing with invisible tasks,such tasks that exist in a process model but not in its event log. This is a problem since invisible tasks are mainly used for routing purpose but must not be ignored. Analyzed the features of strong-loop,weak-loop,jump and invisible tasks,on the basis of which a new algorithm was proposed. This algorithm can improve the efficiency of the mining of invisible tasks.
Mining Complex Structure Based on the Repetitive Task
YE Xiao-hu,LIU Fang-yu, XUE Gang
Computer Science. 2011, 38 (Z10): 209-211. 
Abstract PDF(310KB) ( 348 )   
RelatedCitation | Metrics
Process mining is helpful for deploying new business processes as well as auditing, analyzing and improving the already enacted ones. I}he namesake task and a repetitive task exist in the business process of system log of a large number. The existing alpha algorithm of the mining algorithm can distinguish them very well. It leads to the results of the process mining will often produce inaccurate flow model. In order to improve the accuracy of the process mining,it put forward an improved method. The new method not only can dig the complex structure,such as circulation structure,free choice structure and so on, but also can dig the eponymous task and repeat task in the log.
Point-to-Point Wireless Data Acquisition Based on CC1100
WANG Jun-he,GAO Fei,WU Jie-lin
Computer Science. 2011, 38 (Z10): 212-214. 
Abstract PDF(243KB) ( 489 )   
RelatedCitation | Metrics
Wireless sensor network(WSN) feature is convenient distributing and fast networking. I}his paper gave a wireless data acquisition system in the simple hardware own-design that obeys wireless sensor network Zigbec protocol.And data transferring from sender node to receiver node was realized. Last the receiver node sended the results reading from the wireless channel to personal computer.
Comparison and Analysis of Modeling Language DSC and BPMN
ZHOU Yi-xuan, ZHU Bin-yu, LI Song,XIA Shou-min
Computer Science. 2011, 38 (Z10): 215-218. 
Abstract PDF(331KB) ( 768 )   
RelatedCitation | Metrics
Business process modeling is the most important part of Business Process Management, a good modeling language plays a crucial role in business process modeling and development Different characteristics of business process modeling languages are emerging, the research, analysis and comparison of modeling language become an important issue between process design and process realization. This paper introduced a new business process modeling language, DSC(Dynamic System Chart) , and conducted a comparison with BPMN which is the currently popular modeling language.
Research of Semantic Retrieval Model Based on Idiom Literary Quotation Ontology
YANG Xuesong , RAN Jie
Computer Science. 2011, 38 (Z10): 219-221. 
Abstract PDF(266KB) ( 365 )   
RelatedCitation | Metrics
Abstract Aiming at the prohlem that the users often can not retrieve useful information or retrieve information is inaccurate, this paper presented an information retrieval model based on Idiom Literary quotation Ontology, and the model and its charactcristics were analyzed in detail. Through a systematic in-depth analysis of the users' questions, the qucstions mode and answers mode were proposed, it can improve the efficiency of semantic retrieval, improve the precision rate and recall rate to a certain extent.
Development and Application Research of Network File Management System Based on ASP. NET
YANG Yang , JIA Jun-jun ,LI Wei-wei
Computer Science. 2011, 38 (Z10): 222-224. 
Abstract PDF(278KB) ( 350 )   
RelatedCitation | Metrics
The continuous developing of information technology leads to data and information content increasing rapid1y. How to manage enterprise and individual data, to protect the data assets safety and dependable, and how to transfer,save and get the data conveniently and quickly, these arc the real problems need to be dissolved in the current stage.Network storage technology has come to the stage of widespread application. Combining with the Fourth version of ASP. NET technology, the network file management system was developed and deployed successfully. After practical application, it shows that the system satisfies the requirement of data storage for enterprise and individual, and it gives a new kind of experience for data storage.
Overview of Cloud Services Delivery Networks
SHI Pei-chang,WANG Huai-min ,SHI Dian xi ,YIN Gang, DING Bo ,WANG Tian-zuo
Computer Science. 2011, 38 (Z10): 225-229. 
Abstract PDF(585KB) ( 558 )   
RelatedCitation | Metrics
Cloud Services Delivery Networks(CSDN) build a layer distributed server network on top of Internet and provide users with cloud delivery services using the way to the nearest and on-demand. With no-liner and rapid growth of Internet traffic and three characteristics referring to the Internet traffic including a large scale video traffic, mobile traffic and interactive traffic presented by itself, in order to provide efficient and reliable cloud delivery services,CSDN faces many new challenges. hhis paper first described and analyzed the background and new challenges of CSDN, on the basis presented a classification model of the existing technologies from three dimensions infrastructure layer, platform layer and service layer et al. And then a comprehensive overview of the latest technologies of CSDN research was given,including networking inside CSDN nodes, server placement, content naming, content management, request parsing and system management. Finally, future research trend of CSDN was pointed out, that is the new technology issues what CSDN much-needed breakthrough, including cooperation, mobility management and interactive support al et.
Model for Flexible Evolution of Composite Services Based on Conditional Pi Calculus
LIU Tao ,ZENG Guo-sun
Computer Science. 2011, 38 (Z10): 230-238. 
Abstract PDF(676KB) ( 367 )   
RelatedCitation | Metrics
Composite services ought to be adaptable to changing environments and business rules. Existing service composition languages and execution engines lack variability and adaptability needed to cater for dynamic changes. In spite of many extensions,how to ensure the correctness for the dynamic adaptation of composite services remains a challenge.We proposed a mechanism for flexible evolution of composite services based on conditional Pi calculus. We extended classical Pi calculus through introducing the conditional control operator and the belonging operator, which suits the Event Condition-Action(ECA) pattern better. A method to describe composite service processes was proposed based on conditional Pi calculus and ECA. I}hrough scenario analysis of various composite service changes, eleven basic dynamic scenarios and corresponding flexible evolution patterns were proposed. Each pattern was formalized and analyzed to ensure the variability and adaptation correctness of composite services.
Consistency Model of Distributed Collaborative Learning Based Knowledge Point
WANG Xiao-hua, LI Tian-ze
Computer Science. 2011, 38 (Z10): 239-241. 
Abstract PDF(359KB) ( 408 )   
RelatedCitation | Metrics
Modern distance education is based on the Internet and terminals with teaching activities, collaborative learning is an important way to improve the efficacy of distance learning, it is required that in-depth research of consistency maintenance, collaborative awareness and other key technologies based on collaborative learning semantic, so high effident, natural interaction and customized learning will be achieved. This paper analysised model and algorithm of collaborative learning consistency about the distance education. By this model, a specific algorithms based on knowledge point structure would be Build to maintain the consistency.
Analysis on Dynamic Behavior for Open-source Software Execution Network
ZHANG Xi-zhe, LUO Shi ,YIN Ying, ZHANG Bin
Computer Science. 2011, 38 (Z10): 242-248. 
Abstract PDF(621KB) ( 474 )   
RelatedCitation | Metrics
With the development and increasingly mature of Internet and software technology, software system is facing with the characteristic of uncertain using pattern and complex dynamic interaction behavior. This paper analysised the topological measure characteristics in software execution network based on the complex network. Take three typical open-source software running in Linux as an example, first the software execution log and according to the calls relationship of methods the execution network were established, and then typical topological metrics like connectivity, network diameter and density, average path length, degree distributions, degree correlations, clustering coefficient, between- ness centrality and closeness were analyzed in the software execution network, also make comparison with software structural network based on static code association. The results show that execution behavior have dynamic changes and restructuring phenomenon in the software execution process, compared with the structural network the topological characteristics in the execution network have many difference, the average path length becomes smaller in the perform network,the small-world character tends to disappear. Explore software execution behavior rules has important guiding significance for the software maintenance management and quality assurance.
Visualization of Internet Macroscopic Topology Structure
ZHANG Jun ,ZHAO Hai , YANG Bo
Computer Science. 2011, 38 (Z10): 249-252. 
Abstract PDF(386KB) ( 892 )   
RelatedCitation | Metrics
Aiming at the complexity of Internet macroscopic topology structure, we studied the visualization of Internet topology structure at AS level. We designed the algorithms on visualization of Internet topology using several popular strategies of distribution notes. The results showed that these strategies could not exhibit the structural features of Internet topology, and did not apply to the visualization of Internet. So we designed a new algorithm, which is the strategy of center-level distribution nodes. The results showed that the strategy well illustrated the power-low feature and hierarchical feature of Internet topology. It provides a powerful means for directly observing on Internet microscopic topology structure.
Research of Three-Queue Scheduling Algorithms Based on Priority
GU Yu ,ZHOU Liang , DING Qiu-lin
Computer Science. 2011, 38 (Z10): 253-256. 
Abstract PDF(347KB) ( 734 )   
RelatedCitation | Metrics
For solving the shortage of scheduling algorithms on the Hadoop platform, the paper proposed an improved scheduling algorithm-TriplcQueuc algorithm. After taking full account of data locality, the Triple-Qucue algorithm designs a improved computational model of priority, which can distinguish the user's job levels clearly and ensure a certain degree of fairness so as to reduce the job execution time and avoid wasting system resources. The results of experiment show that the algorithm improves the efficiency significantly and solves the problem of data locality better with the increased amount of data.
Benefits of Network Coding for Live Streaming Multicast over Wireless Channel
HAN Li， QIAN Huan-yang
Computer Science. 2011, 38 (Z10): 257-259. 
Abstract PDF(358KB) ( 438 )   
RelatedCitation | Metrics
For wireless channel is inherently lossy, it is challengeable to maintain the quality of service(QOS) for live streaming. We proposed a well-designed light weighted negative-ACKnowledgment(NACK) oriented reliable multicast protocol, which combines the NGbased repair in its design. NORM repair process uses time slot as the base mechanism,which results in long repair cycle. In our protocol,fecdback round algorithm is applied to optimize the repair processing.Benefits of network coding for live streaming multicast over wireless channel was also analyzed in this paper. Experiment results show that the payload throughput of our protocol is about 0. 5 times greater than that of NORM.
Web Service-based Embedded BSP Remote Testing Framework
CHI Jian，，BAI Xiao-ying, WAN Guo-liang, HU Lin-ping
Computer Science. 2011, 38 (Z10): 260-264. 
Abstract PDF(458KB) ( 487 )   
RelatedCitation | Metrics
In the embedded I3SP test process, supposing we establish all test environments for each product and their development team, the testing cost is very expensive. Using the remote testing method can reduce testing cost, shared test environment, effectively reuse test cases. Web service is an object deployed in the Web on, it is based on XML, open standard technology on the Web, and has platform independence, interopcrability, functional characteristics of reuse and secure communications. In the paper a framework for embedded system BSP remote test coverage which embedded 13SP test in the entire process was presented, and the framework is divided into test center and test portal. Using SOAP and RESh, two styles of Web services, the user can access the BSP remote test through a unified Web interface.
One Variety Conjectures of Modified Bubble Sort Network
SHI Hai-zhong, MA Ji-yong, NIU Pan-feng, HOU Fei-fei
Computer Science. 2011, 38 (Z10): 265-267. 
Abstract PDF(291KB) ( 401 )   
RelatedCitation | Metrics
Modified bubble sort networks arc important cayley graphs model in networks design. One variety conjectures of modified bubble sort networks were proposed as follows : for any integer n>=3 , modified bubble sort networks Y are a union of i edgcdisjoint hamiltonian cycles and n一2i perfect matchings of Y，and 1<=i.We proved the conjec到lures are true for i=1，2.
Research on Dynamic Task Allocation for MAS Based on Hybrid Genetic and Ant Colony Algorithm
ZHANG Jin, LAO Yao-qin
Computer Science. 2011, 38 (Z10): 268-270. 
Abstract PDF(244KB) ( 661 )   
RelatedCitation | Metrics
In multi agent systems(MAS)，because of the complexity and the difference between respective agents, the dynamic task allocation for multi agent systems is a NP-hard combinatorial optimization problem. According to the dy- namic characteristic of task allocation, first this paper established the mathematical model of task allocation and the target function. And then the hybrid genetic and ant colony algorithm which possesses the trait such as rapid iteration,poshive reaction and distribution, was put forward to achieve combinatorial optimization of task allocation. Finally, the simulation experiments demonstrated that, the algorithm is accomplished in convergence efficiency and solution precision can significantly enhance the performance of MAS.
Research and Performance Analysis of Reliable Transport Protocol ACK Mechanism over Satellite Networks
WANG Jin-miao, XU Peng-wen
Computer Science. 2011, 38 (Z10): 271-272. 
Abstract PDF(252KB) ( 654 )   
RelatedCitation | Metrics
Based on near-earth orbit satellite network, analyzed the existing reliable transport protocol ACK mechanism for space communications. Studied on the SOPS-TP SNACK mechanism, spatial information to improve transport to SCPS-TP SNACK mechanism, did the simulation experiments and performance comparison analysis for several typical TCP extensions protocol.
Performance Analysis of AODV Routing Based on Different Mac Access Mechanism
GHAI Jian-hua， GHANG Yu-fang, XIONG Zhong-yang
Computer Science. 2011, 38 (Z10): 273-275. 
Abstract PDF(243KB) ( 485 )   
RelatedCitation | Metrics
In order to improve the comprehensive performance of network, this paper fully consided the influence factor at the data link layer and network layer, compared and analysed of switching methods in the different Mac access protocol, selected an appropriate routing and access protocol for Ad Hoc. Simulating the scene based on Mac layer of 802. lla and 802. 11Ext routing in NS-2,the paper fully analyzed and summarized AODV protocol performance about normalized routing load and route discovery frequency and end-to-end average delay and packet delivery ratio. The results show that 802. 11Ext has many obvious advantages, it is more stable and suitable for mobile network.
Research on Improving the Performance of TCP for Heterogeneous Networks
HAN Tao, HUANG You-rui, QU Li-guo , SHI Ming
Computer Science. 2011, 38 (Z10): 279-281. 
Abstract PDF(244KB) ( 604 )   
RelatedCitation | Metrics
In wired network, the packet loss is caused by network congestion. TC;P protocol was designed for wired network. But it isn't adapted to the wired-wireless networks anymore because packet loss is mainly caused by link errors in wireless networks. So it proposed a new protocol (named TCP-Ackflag) based on TC;P. It judges network congestion according to trend of relative time delay in receiver. Then the receiver sends an ACK with network congestion flag bit(NCF) to the sender. For the maximum throughput, the sender checks the NCF in ACK which is received recently when it has found the packet loss. It will deal with network congestion or fast retransmit according to network congestion flag bit in ACK. The simulation results show the accuracy and sensitivity in this programs on the network congestion to determine arc greatly improved, and on this basis to ensure the network transmission performance.
Code-shifted Reference UWB Transceiver and its Performance Analysis in WSN Environment
XU Ghi-meng QIAN Hui , YU Lun
Computer Science. 2011, 38 (Z10): 282-285. 
Abstract PDF(329KB) ( 368 )   
RelatedCitation | Metrics
A novel ultra-widcbandCUW13) transceiver based on codcshifted reference(CSR) was introduced. By modeling and simulation on MATLAI3, the bit error performance sensor network environment It shows that the CSR receiver of the system was analyzed and compared under wireless is more rohust to narrowhand interference than the conventional transmitted reference( I}R) receiver and with a lower complexity. Moreover, simulation the shorter results reveal the relation between the shifting used, the better N13I codes and the NI3I mitigation capacity of CSR-UWI3 receiver or the more random mitigation capacity will be achieve, which provides guidelines for optimization shifting codes code and improving performance for CSR transceiver.
Network Congestion Control Based on Qualitative Dynamic Probabilistic Networks
QIAN Min, TANG Ke-sheng
Computer Science. 2011, 38 (Z10): 286-287. 
Abstract PDF(255KB) ( 495 )   
RelatedCitation | Metrics
Network congestion has become a widespread concern. At present, research based on network congestion control has present some specific methods and suggestions, but they arc not able to solve the network congestion well.Qualitative Dynamic Probabilistic Networks(QDPNs) are one of the most efficient models in the uncertain knowledge and dynamically reasoning field. This paper presented a network congestion control method based on QDPNs. This method can effectively predict network congestion, and then we can get the corresponding congestion control strategy according to the prediction before.
Research on the Technology of Middleware of Distribution Spectrum Monitoring System
JIANG Mei-lei, DING Li-li, BAI Yong-bing, GUO Yong-kang, KONG Xiang-yuan
Computer Science. 2011, 38 (Z10): 288-292. 
Abstract PDF(410KB) ( 484 )   
RelatedCitation | Metrics
In allusion to the question that electromagnetic environment has become more and more complicated, the related technologies of the spectrum of existing monitoring systems was in depth studied, and its own characteristics was analyzed, and on this basis, the reasons of using a distributed spectrum monitoring system was discussed. Secondly, for the demand of the issue, this paper put forward a design concept of distributed spectrum monitoring system which is based on middleware, using the middleware to achieve the distribution of tasks and transmission of the results when coping with multiple testing tasks. Finally, designed and implemented the middleware, and the reliability and perform- ancc of middlcwarc were tested.
Application of Multiple Description Coding and Network Coding in Wireless Sensor Network
LI Man, LIU Fang-yu ， LU Jing， ZHOU Wci
Computer Science. 2011, 38 (Z10): 293-295. 
Abstract PDF(259KB) ( 483 )   
RelatedCitation | Metrics
Multiple description coding can prevent the loss of the image data and the dependence of the single share data effectivcly,which can ensure the quality of the images received by the terminal nodes. Network coding can improve the network bandwidth utilization rate effectively. In order to adapt to the reliable transmission and save the bandwidth of the wireless sensor network, this paper proposed the ideology of combining multiple description coding with network coding, which takes multiple paths transmission as a foundation.
Internet Traffic Prediction Based on Wavelet Neural Network
HUANU Wei , HE Ye, XIA Hui
Computer Science. 2011, 38 (Z10): 296-298. 
Abstract PDF(321KB) ( 916 )   
RelatedCitation | Metrics
The time series of network traffic data is modeled and forecasted based on wavclet neural network. According to the situation that the network prediction based on BP neural network is not well exact, the wavelet theory was introduced into BP neural network. On the basis of wavelet theory in reference multi solution analysis techniques to improve the model based on BP neural network, the IP network traffic forecasting model based on wavelet neural network was built. We used wavclet multi-solution analysis techniques to decompose the traffic signal and then employed the decomposed component sectuences to train the I3P neural network. The results of the experiment prove that the wavelet neural network is superior to the BP neural netw ork method in prediction performance. And wavclet neural network is the suitable and effective method for forecasting Internet traffic.
High Data Rate Wireless Industrial Networks Test-bed for TDMA MAC Development: Design and Experimentation
LIN Jun-ru, ZENU Peng, YU Hai-bin
Computer Science. 2011, 38 (Z10): 299-304. 
Abstract PDF(631KB) ( 1096 )   
RelatedCitation | Metrics
With the development of wireless technology, using wireless technology in industrial environment becomes more and more popular, meanwhile researchers pay more attention to TD MA mechanism due to its capability to avoid collision which makes wireless communication behavior much more determinate, but most current researches arc limited to simulations and experimental studies are rare. To bridge this gap, we developed and implemented a high data rate wireless networks testbed based on I}DMA mechanism and commodity IEEE 802. 11 hardware, the test bed can be used for filed level industrial wireless technology's development and experiment, and experimental evaluation shows the test bed can support TDMA applications that rectuire time slot schedule in millisecond.
Convex Region Fault-tolerance Based Topology Control Algorithm
SUN Ruo-zi， YUAN Jian ， SHAN Xiu-ming， REN Yong
Computer Science. 2011, 38 (Z10): 305-307. 
Abstract PDF(236KB) ( 376 )   
RelatedCitation | Metrics
At present, most studies utilize connectivity to evaluate fault tolerance of wireless networks. As a metric of fault tolerance, connectivity fails to consider spatial relativity of failed nodes and assumes that any node group can fail simultaneously. In fact, the faults generally have strong spatial correlativity in wireless networks. It is particularly true in military application that the nodes located in the same limited area will fail simultaneously such as due to the damage of an enemy bomb. Therefore, connectivity hardly satisfies the fault tolerant design requirements for wireless networks.To capture the feature of the spatial correlations of faults, the notion of convex region fault tolerance was introduced and based on it,a fault-tolerant topology control algorithm named as convex region fault tolerant algorithm(C-RFT) was proposed. It is proved theoretically that GRI门can preserve the convex region fault tolerance of the original graph and simulation results demonstrate that the topology generated by C-RI门' has lower logical degree and transmission rathus compared with original graph.
Utility-based Resource Management Strategy in Wireless Data Network
WU Yi-duo CHEN Xiao-guang
Computer Science. 2011, 38 (Z10): 308-311. 
Abstract PDF(337KB) ( 393 )   
RelatedCitation | Metrics
A utility-based resource management strategy in wireless data network was proposed in this paper. The strutegy achieves a balance between throughput and rate oscillation of data service and takes into account the impact of both rate and power on the system performance. Numerical results show a low oscillation of rate and an efficient improvement of the system performance in poor channel condition.
Research on Path Capacity Estimation for IPv6 Networks
TANG Jun , PEI Chang-xing ,SU B0
Computer Science. 2011, 38 (Z10): 312-314. 
Abstract PDF(339KB) ( 442 )   
RelatedCitation | Metrics
Packet dispersion technique is one of the useful path capacity estimation methodology and usually employs continuous sending policy to send probing packets. 13ut the accuracy of measurement is affected by the lower utilization of transmission rate at the sender. Based on fragmentation mechanism, a novel scheme of path capacity estimation for IPv6 networks was proposed. An original probing packet with its size larger than Path Maximum Transfer Unit is generated at the sender, and then be split into a serial of equal-sized fragments by the protocol stack. It is shown by extensive experimental results that the proposed scheme can lead to lower dispersion of the probing packets at the sender and a greater capability against the cross traffic, compared with the classical tool called pathrate.
Performance Evaluation of Information Dissemination Protocol in WSNs Based on RS Erasure Codes
DU Jun-zhao ， LIU Hui ， LI Xiao-jun ， ZHANG Ying-jun ， ZHANG Yun-yang
Computer Science. 2011, 38 (Z10): 315-318. 
Abstract PDF(408KB) ( 578 )   
RelatedCitation | Metrics
In wireless sensor networks(WSNs) , the energy supply, storage capacity and computation power of sensor node are constrained. Furthermore, the irregular link and variable topology are common. Hence, it is difficult to design and implement a reliable and energy efficient network protocol. Well-designed network protocol can not only reduce network load, but also help to save energy of sensor nodes, therefore prolonging the network life. In this paper, an informalion dissemination protocol based on RS erasure codes was proposed and implemented in TinyOS platform, which is a widely used operating system in WSNs. We analyzed the performance of the protocol in theory for single hop case, and we also made a performance comparison with flood information dissemination protocol in the I}OSSIM. I}he simulation results show that the proposed information dissemination protocol based on RS erasure codes obviously reduces the number of packets to transmit, improves the packet delivery ratio, and saves network energy consumption.
Research on Data Gathering Protocols for Vehicle Sensor Networks
YU Ling-fei， SONG Chao ， WANG Xiao-min ， GONG Hai-gang ， SHE Kun
Computer Science. 2011, 38 (Z10): 319-322. 
Abstract PDF(396KB) ( 597 )   
RelatedCitation | Metrics
Vehicle Sensor Networks( VSNS) compose of many vehicles equipped with different types of sensors, which are data centric mobile sensor networks. Compared with traditional wireless sensor networks, the nodes of VSNS move rapidly, leading to intermittent connectivity and frequent topology change, so that data transmissions in VSNS depend on opportunistic transmissions among nodes,which degrades the performance of data delivery. The state of the arts of the research on vehicle sensor networks was discussed. Introduced with the idea of delay tolerant networks and opportunistic networks into VSNs, the hot research issues on vehicle sensor networks were presented.
Transplantation of Embedded Operating System Tinyos for Wireless Sensor Network Nodes
CHENG Long ， YANG Bo
Computer Science. 2011, 38 (Z10): 323-325. 
Abstract PDF(275KB) ( 644 )   
RelatedCitation | Metrics
The TinyOS system has received much attention as a wireless sensor network operation system for its syntactic model, event driven architecture and easy programming environment, And the CC2430 chip is widely used for wireless sensor network nodes with high performance, low price and low power cos>n But the CC2430 chip is not supported by hinyOS system. After an analysis of tinyOS principle, the programming language NesC and its compiling process,the transplantation was performed including porting NesC and CC2430’s components like Timer, Uart, ADC etc, and its application was tested. The test result shows that the TinyOS system can run on the CC2430 chip, the components work well,and the transplantation is successful. Based on the transplantation, two extended applications were proposed and realized including an improved priority-based scheduling mechanism and the formation of star network.
Novel Architecture Network for Cognitive Radio
PANG Long， WU Jue-bo
Computer Science. 2011, 38 (Z10): 326-330. 
Abstract PDF(512KB) ( 438 )   
RelatedCitation | Metrics
Due to the growing bandwidth, business and the existing fixed frequency management mode, the wireless network is facing great challenges that the network resources are becoming more and more shortage. The dynamic changes of heterogeneous network environment causes more conflicts between resource shortage and business needs, so it seriously restricts the deployment and operation of wireless network in the present and future. I'o solve the above problem,this paper made a detailed discussion and analysis to the existing protocols of wireless network, and it summarized the characteristics and existing problems including the cognitive function of IEEE 802. 22，IEEE 1900. 4 and ETSI RRS. It proposed a novel architecture for cognitive wireless network based on the cognitive theory and method of wireless network. This model contains system frequency management, network planning management, heavy configuration management, wireless resource management, cognitive ring processing and cognitie information load mode etc. According to this architecture, it will be better to coordinate and support network learning, reasoning, forecasting, fusion, decision-making and reconfiguration.
Reputation-based Evaluation Model for P2P
HUANG Jun-hu , YU Hui-qun
Computer Science. 2011, 38 (Z10): 331-335. 
Abstract PDF(374KB) ( 451 )   
RelatedCitation | Metrics
With the development of the P2P(Peer to Peer) technology, it's important to judge the reliability of the request peer. One reputation-based evaluation model for P2P is introduced to calculate the reputation value of each peer while the process of P2P and judge whether the request peer is reliable. "hhe model combines the past experience with other's suggestions. Through the experiments, it is proved that the model not only is able to protect normal peers from malicious peers, but also improves the ability to resist the attack from groups of the malicious peers.
Research of the Mixed Softswitching Based on SIP and H.248 Protocol
DAI Xiao-dong , CHEN Wen-xing
Computer Science. 2011, 38 (Z10): 336-337. 
Abstract PDF(269KB) ( 1239 )   
RelatedCitation | Metrics
In the background of rapid development of the softswitching,according to the traditional network reconstruclion brings the huge cost investment,the paper put forward the Networking model of the mixed softswitching based on SIP and H.248protocol,then made planning of the transformation of China's existing network.
Ethernet Priority-based Flow Control Simulation Design
GONG Xia-qing,DOU Jun
Computer Science. 2011, 38 (Z10): 338-340. 
Abstract PDF(326KB) ( 401 )   
RelatedCitation | Metrics
With the rapid development of the Internet, there are a series of problems in the normal operation of the network systems, and the most prominent problem is network congestion caused by the overload traffic. hhe author studied a variety of flow control methods, and by the way of priority-based dueuing scheduling, the author used the OPNET network simulation software to simulate the three kinds of designed flow control mechanisms, finally solved the problems of the higher priority data flow not getting a timely response and the fairness issues in Ethernet.
Delay Analysis and Simulation Design of High-speed Ethernet
YANG Jia-li , DOU Jun
Computer Science. 2011, 38 (Z10): 341-344. 
Abstract PDF(383KB) ( 759 )   
RelatedCitation | Metrics
With the rapid development of the Ethernet technologies, Ethernet has become one of the core technologies in future communication domain. And user experience may be affected by QoS parameters of services typically include delay,jitter,packet loss rate and so on. For real-time audio and video services, end-to-end delay of data is most critical.Based on the exist Ethernet standards,summarized the main factors of end-to-end delay,and theoretical analysis of different delayes on the proportion of totoal delay. Finally carried out a simulation model designed to lOG/40G/1006 Ethernet, which proves the design is feasible and correct.
Research of Path Planning with Mobile Anchor in WSN Localization
DANG Xiao-chao, LI Xiao-yan
Computer Science. 2011, 38 (Z10): 345-349. 
Abstract PDF(370KB) ( 360 )   
RelatedCitation | Metrics
The mobile anchor localization is more practical method in wireless sensor network node localization, it need to consider the problem about moving path, if plan the effective and reasonable path, it can obtain higher location accuracy. Take the sensor nodes as figure vertexs, then use the thoughts of TSP and ant colony algorithm to search for an optimal path. hhrough the theoretical analysis and simulations show that formed paths can cover the entire network and adap to the random distribution node localization in wireless sensor network.
Study on Segmented Address Allocation Algorithm
ZHOU Wei, TIAN Yong , ZHAO Huan-xin , XIONG Hui
Computer Science. 2011, 38 (Z10): 350-352. 
Abstract PDF(246KB) ( 378 )   
RelatedCitation | Metrics
The address allocation mechanism is presented in each network, which is the basis for communication and data transmission. This paper presented an address allocation method with segmented model and analyzes its principles,while introduced the tree routing algorithm based on the distribution of this address.
Wireless Organization Network
LIU Xing-bing, ZHENG Xue-feng
Computer Science. 2011, 38 (Z10): 353-355. 
Abstract PDF(272KB) ( 382 )   
RelatedCitation | Metrics
The wireless organization network is the nature of the relation between the network nodes of the infrastructureless wireless network. Besides having characteristics of the infrastructurcless wireless networks, the network has center node, and the position of between nodes arc relatively fixed. hhis special network application temporary communications in the field rescue and military activities. The first reviews structure and characteristics of the intercom system, packet radio networks, mobile ad hoc networks, they don't include the wireless organization networks characteristics. Defined the wireless organization networks related model, analyzed the characteristics and the key of the wireless organization network.
Dynamic Job Scheduling Model of Mobile Sensor Sink in Wireless Sensor
ZHUO Cui-min LI Lu-qun
Computer Science. 2011, 38 (Z10): 356-358. 
Abstract PDF(297KB) ( 354 )   
RelatedCitation | Metrics
ob scheduling system is the core of data mule and challenging problem in wireless sensor network. How to improve the efficiency of resource and the maximum profit are the ultimate goal of service providers. In at first, by establishing the preemptive priority queuing modle of G/G/l,to meet the QoS of the transmit data at different levels,the linear piecewise functions are used to make the system cost minimum. Furthermore, based on the cost function and profit function of queuing system, to get dynamic allocation rate, and to get the corresponding value which service users and service providers are satisfied with. The results show that, the dynamic resource scheduling system, not only can ensure the different data's QoS requirements, but also can provide the maximize profits for the wireless sensor network service providers.
D7S-LEACH : A Dynamic Cluster Based 7.one-spanned Secure Multi-hop Routing Protocol in WSNs
MIAO Cheng-beil ,BAI Guang-wei,GU Yue-yue
Computer Science. 2011, 38 (Z10): 359-363. 
Abstract PDF(502KB) ( 360 )   
RelatedCitation | Metrics
This paper focused on the performance enhancement of the typical LEACH protocol in security and energy efficiency in wireless sensor networks. Considering security threats faced by the existing LEACH protocol, we proposed a novel dynamic hierarchical cluster-based zoncspanned secure multi-hop routing protocol, so called DZS-LEACH. The main idea is to introduce a dynamic key management scheme in the multi-hop routing protocol to provide communication protection. The DZS-LEACH enables, on the one hand, the scalability of routing mechanism and adaptation to the dy- namic network topology, on the other hand, balances energy consumption by means of partition autonomy and avoids long-distance communication between sensor nodes and sink node. Our simulation experiments demonstrate that theproposed DZS-LEACH may enhance defense ability and reduce data loss caused by network attacks. Meanwhile, the enorgy consumption is reduced significantly and the network lifetime is extended.
Research on Coverage Performance in Wireless Sensor Network
GUO Xiao-ding , XIE Zhong-hong
Computer Science. 2011, 38 (Z10): 364-366. 
Abstract PDF(241KB) ( 454 )   
RelatedCitation | Metrics
To address coverage performance of wireless sensor networks issues,most studies have focused on the optimization of node placement, positioning, etc.，in a complex environment, pay less attention to the quantitative evalualion. The paper first analyzed the performance of the main factors affecting coverage. Secondly, the data fusion model and strategy were discussed to find a basis for model selection. Then from a theoretical point of view of the use of data fusion performance evaluation of the coverage under way and the relationship between the two, found integration of range and network density and coverage relationship, an optimal integration of environment related application range can be obtained by experiment or experience derived through the analysis of the approximate solution.
Improvement of Less Packet Loss S-MAC Protocol for Wireless Sensor Networks
ZHOU Xiang-yun, QIAN Hui, YU Lun
Computer Science. 2011, 38 (Z10): 367-369. 
Abstract PDF(250KB) ( 497 )   
RelatedCitation | Metrics
According to the packet loss problem in S-MAC protocol, this paper proposed an optimized scheme which based on the cache queue principle and simplified the format of group data for S-MAC protocol. Combined with the Acfive Message(AM) mechanism of TinyOS, the S-MAC protocol has been implemented on the Mica2 motes, and it has tested the packet loss ratio of MAC layer. hhe result demonstrates that the improved S-MAC protocol has significantly reduced than the original S-MAC protocol in the packet loss ratio and enhances the network throughput.
Using SOM to Recognize Friendship from Mobile Phone Data
CHEN Ai-xiang
Computer Science. 2011, 38 (Z10): 370-375. 
Abstract PDF(526KB) ( 421 )   
RelatedCitation | Metrics
Data collected from mobile phone、have the potential to provide insight into the relational dynamics of individuals. In this paper, using the reality data collected from 94 Nokia 6600 users, an highly effective parsing algorithm named do&dol was designed and realized to construct the communication pattern of a pair phone number. The do&dol algorithm's correctness, theory time complexity and experimental observations were given. With the output of do&dol as training data, a Relationship Recognition System building on SOM neural network was designed and realized. The system RSS can recoginze the reciprocal friends, nonreciprocal friends and reciprocal nonfriends.
Timer Realization Based on UMTS Core Network
GAO Lin ， WANG Quan
Computer Science. 2011, 38 (Z10): 376-379. 
Abstract PDF(409KB) ( 412 )   
RelatedCitation | Metrics
To implement the call connection protocol of UMTS core network, a timer design was proposed by the way of software, developed and researched in the environment of WinCE real-time embedded system. Based on relative time algorithm proposed, the timer program, which data structure is constructed by single linked list and relative time item,creates a single time thread and insertion/deletion functions to realize the multiple-timer logic regulated by UMTS protocol. In the embedded system programming, we applied mutex method to implement the synchronization in communicalion between the timer thread and insertion/deletion functions, and adopted heap management method to realize the dynamic allocation and release of memory. The paper discussed the technique and the structure of the plan with key code and analysed the relative WinCE mechanisms and UMTS protocols. Experiments prove that the design, which has the qualities of low hardware occupation and high program efficiency, with good real time ability, is suitable for timer programming in communication protocols based on embedded system.
Research on Relay Selection Strategy in Cooperation Communication
YAN Li-yuan, WANG Yue, CHEN Chen
Computer Science. 2011, 38 (Z10): 380-384. 
Abstract PDF(432KB) ( 674 )   
RelatedCitation | Metrics
Cooperation communication is a hot research topic in wireless communication presently. hhe first problem to be solved is how to select the cooperative relay in cooperation communication. We Proposed a criterion to evaluate the technology of cooperative relay selection. Then we classified, analyzed and compared these algorithms that proposed in recent years. At last, we look forward to the developed direction of the algorithm of cooperative relay selection.
Application and Study of IOCP in Single Client-mufti Server Model
WANG Zhen, XU Bo, XIE Yong-ping, SUN Jia-feng
Computer Science. 2011, 38 (Z10): 385-388. 
Abstract PDF(406KB) ( 651 )   
RelatedCitation | Metrics
This paper analyzed a single client一mufti-server model based on specific network applications. This paper not only gave the client basic implementation based on IOCP, but also gave the thread scheduling, asynchronous connections IOCP framework method. Aiming at receiving variable length data for the reduest,memory pool management and buffer settings were analyzed and designed. By connecting test and throughput test, results show that this design has capabilities of a large number of connections and efficient data processing. The recommendations of the number setting of IOCP worker threads were given by the experimental methods.
Applied Study on End-to-End QoS Solutions for MPLS VPN
CHEN Jia-yi
Computer Science. 2011, 38 (Z10): 389-391. 
Abstract PDF(292KB) ( 624 )   
RelatedCitation | Metrics
MPLS VPN is the mainstream of present virtual private network technology. In order to transmit the integration of voice, video and critical data in MPI_S VPN, the key is to achicvc cffcctivc QoS guarantcc. Based on the study on DiffServ and MPLS TE,it introduced the MPLS DS-TE. By combining the differentiated Services of DiffServ with the effective end-to-end routing strategy of MPLS TE, and employing the bandwidth constraints model, DS-TE achieves QoS guarantee of end-to-end and differentiated Services in MPI_S VPN.
Research of UniDirectional Link Detection
HAN Qian,CHENG You-qing
Computer Science. 2011, 38 (Z10): 392-393. 
Abstract PDF(140KB) ( 469 )   
RelatedCitation | Metrics
UDLD is a layer protocol that enables devices connected through fiber-optic or twisted-pair Ethernet cables.It monitors a physical connection to detect unidirectional links to avoid spanning-tree topology loops or silent drop traffic. All connected devices must support UDLD for the protocol to successfully identify the unidirectional links. When UDLD detects a unidirectional link, it can administratively shut down the affected port and send you a warning message.
Balanced-energy Sleep Scheduling Scheme Based on Alternating Cluster-head inHigh-density Wireless Mesh Sensor Networks
WU Qiong,FAN Jing,ZHANG Cui,HAO Jun-feng
Computer Science. 2011, 38 (Z10): 394-398. 
Abstract PDF(384KB) ( 324 )   
RelatedCitation | Metrics
Wireless Mesh Sensor Networks(WMSN) topology structure was constructed by combining Wireless Sensor Networks with Wireless Mesh Networks. Energy consumption in the high-density WMSN could be decreased by putting the partial sensor nodes into sleeping state and the energy holes problem could be solved by balancing the network energy consumption. This paper proposed a balanced-energy sleeping scheduling scheme based on alternating cluster head nodes in WMSN. hhe sleeping probability of sensor nodes in balanced-energy network was obtained by building cluster head alter-nated model when different sensor nodes took turns to be cluster head. Analytical and simulation resups show that the scheme assures the network coverage, extends the lifetime and balances the energy consumption compared with Randomized Scheduling scheme.
Novel Location Service for ilrban Vehicular Ad-hoc Networks
LI Xiu-ming,FANG Zhen,LI Shuai,YANG Lu-xia
Computer Science. 2011, 38 (Z10): 399-401. 
Abstract PDF(343KB) ( 418 )   
RelatedCitation | Metrics
We proposed a novel location service for urban vehicular Ad-hoc networks called ILSV (Intersection Location Service for VANET) , a distributed location service algorithm that makes use of the features of street intersections and traffic rules. We demonstrated these traits and its performance by providing extensive simulation in a wide range of urban scenarios. Compared with GLS and HLS, ILSV achieves good results in terms of query success ratios and remarkable scalability with respect to network size.
Game-theoretic Approach to Joint Rate and Power Control for Cognitive Ratdo
GUAN Hong-bo,ZHANG Guang-chun
Computer Science. 2011, 38 (Z10): 402-405. 
Abstract PDF(324KB) ( 390 )   
RelatedCitation | Metrics
We studied joint power and rate control for cognitive radios in the underlay type. Power control is one of the key technology in cognitive radio,and the next generation wireless systems also will be required to support with different transmission rates. In this paper we assumed the problem between second users as a non-cooperative game, and one power control algorithm was proposed,subject to the tolerable interference limits. And it is proved that the Nash ectuilibrium of the algorithm is the existence, uniqueness, the simulation results show that the method has a faster convergence, and can converge to the lower power and higher rates.
Research of TDOA Cooperative Location Algorithm Based on Chan and Taylor
CHEN De-zhang,TANG Hao,WU Ji-da
Computer Science. 2011, 38 (Z10): 406-407. 
Abstract PDF(237KB) ( 2080 )   
RelatedCitation | Metrics
In the system of radio location, Chan algorithm has a small computational and high accuracy in the Gaussian noise environment. However, under the NLOS, it performs degradation. Taylor series expansion method has been widely used for its high accuracy and good robustness. Since the performance of Taylor algorithm depends highly on the initial estimation, a new cooperative location algorithm based on Chan and Taylor algorithm was proposed to inherit the char acteristics of a small computational and the high accuracy and good robustness. The simulations and tests indicate that the cooperative algorithm can effective inhibit adverse noise environment in the NLOS channel, and has stable performance.
Study on Structural Damage Identification Using Bayes' Theorem and mGA
QIAN Xiao-mei,YAN Gang
Computer Science. 2011, 38 (Z10): 408-411. 
Abstract PDF(307KB) ( 494 )   
RelatedCitation | Metrics
This paper proposed an approach for estimating the parameters of the location and size of damage in structure along with the associated uncertainties using I3ayes' Theorem and micro genetic algorithm mGA). After obtaining the measured information, combined with the damage model, the posterior probability density function (PDF) of the pares meters of the damage was updated according to the Bayes' Theorem, thus the damage was identified with uncertainties.To maximize the updated PDF of damage parameters, mGA was employed to search out the global optimum values of damage parameters. The proposed approach was applied to damage identification for plate structure, and numerical study was performed to demonstrate its effectiveness.
Data Model for Intelligent Community Power
GENG Wei-jian,XU Xiao-long,Li Ling-juan,CHEN Jian-xin,YANG Geng
Computer Science. 2011, 38 (Z10): 412-415. 
Abstract PDF(355KB) ( 852 )   
RelatedCitation | Metrics
An intelligent community power data model was proposed in this paper for providing data and relational support for the smart grid, and building the low-carbon, convenient and energy-saving intelligent community. The demand analysis of the data model was discussed about store queries, communication requirements and data flow analysis. According to the demand and function of the community, the data model was constructed. Finally, an application demo waspresented to verify our model. The results show that the data mode is feasible and available.
Research and Application of Scorm Metadata in Semantic Retrieval of Education Resources
LIU Qian， LI Hua
Computer Science. 2011, 38 (Z10): 416-418. 
Abstract PDF(243KB) ( 388 )   
RelatedCitation | Metrics
This paper introduced Scorm structure and metadata standard, described the contributing relationship among Scorm metadata, ontology and semantic retrieval, and mainly described the semantization process of study object, in addition,it presented the semantization example on base of the actual university subject,which shows the important apphcanons of the Scorm norms in semantic retrieving of education resources.
Technology and Application of Rich Client Based on AJAX
CHEN Bi-feng
Computer Science. 2011, 38 (Z10): 419-420. 
Abstract PDF(262KB) ( 619 )   
RelatedCitation | Metrics
AJAX namely asynchronous JavaScript and XML，uses JavaScript, HTML，DOM technology to design Web rich client with server background asynchronous interaction, the interaction can't interrupt the user' screen operation, it can provide better service response.月AX makes the traditional client based on Web design, and makes the same effect stand-alone GUI way of distributed system based on Web design, has produced important influence. Compared with traditional Web development way of comparison, this paper introduced core technologies and basic principle of useing AJAX Web to develope application system.
Remote Control System Based on SMS
CHEN Liang,LI Wang-yang,WU Guo-zhang,DENG　Qi,LI Yang
Computer Science. 2011, 38 (Z10): 421-422. 
Abstract PDF(183KB) ( 444 )   
RelatedCitation | Metrics
SMS remote control system utilizes the existing GSM SMS service with low-cost hardware equipment to ereate a system for remote monitoring and remote control. The system can be controlled and monitored via SMS from anywhere that is covered by the USM service. Devices that connect to the system can be turn on or off by sending SMS to　the system. Meanwhile the status of the system can be requested via SMS. The system can also be programmed to send　specific SMS to predetermined number if any event or condition is triggered. Utilizing GSM/ GPRS MODEM main control system and one wireless modem, the system could establish a control network that is more from a master. Furthermore makes the network of Smart Home System come true.
New Particle Swarm Optimization Algorithm for the Design of the Adaptive Notch Filter
ZHANG Jie, JIANG Shi-qi
Computer Science. 2011, 38 (Z10): 423-424. 
Abstract PDF(236KB) ( 772 )   
RelatedCitation | Metrics
In signal processing ficld,disturbanee and noise signal often exists in the received signal. Adaptive notch filter, as one of the optimal filter, is the best structure to eliminate the low frequency interference. In this paper, the particle swarm optimization was applied to the adaptive notch filter, it can get useful signal by the adaptive algorithm to adjusting its weight and eliminating the low frequency interference. Then,a new PSO algorithm was proposed to improve the local convergence and the speed of convergence, the simulation results show that the algorithm is efficient and hasgood global optimization ability.
Contacts Recognition of Optical Touch System Based on Features Outlines
CHAI Shuo,WANG Dong,LIU Jin-yao,WANG Xiao-qing,CHEN Ge
Computer Science. 2011, 38 (Z10): 425-427. 
Abstract PDF(236KB) ( 403 )   
RelatedCitation | Metrics
In recent years, optical touch system is a gradually rising solution of touch system, and it recognized the touch-point based on the method of mass tracking from computer vision recognition. The paper put forward a new method applied to contacts recognition of optical touch system, first, it carves up the image gathered by the camera by two thresholds and extracts the contours, and then, it computes the minimum external rectangular of the bright spot, at last,it eliminates the invalid contacts based on the area and the aspect ratio of the features outlines. This method using OpenCV1.0,on the premise not affecting handling efficiency basically,realizes the accurate contacts recognition.
Advanced Evolution of Power Glitch Attack and Resistance Techniques
DUAN Xiao-yi ，LI Li ， WU Yu-hua ， JIN Ji-fang
Computer Science. 2011, 38 (Z10): 428-431. 
Abstract PDF(332KB) ( 2376 )   
RelatedCitation | Metrics
Power glitch attacks arc fast changes in the power supplied to the device and designed to affect its normal operation. I3y this way,the cpu can be made to execute a number of completely different wrong instructions. This paper summarized the latest development of power glitch attack and defense techniques. Aimed at various implementations of attack on RSA signature With Chinese Reminder I}hcorem, attack on RSA signature without CRh and attack on EEPROM were described. Then the available countermeasures of power glitch were shown, which consist of MASK methods, detecting voltage glitch attacks. Moreover, the relative merits of these countermeasures were analyzed.
Research on Cloud Computing in Smart Grid
LI Qi-lin， ZHOU Ming-tian
Computer Science. 2011, 38 (Z10): 432-433. 
Abstract PDF(271KB) ( 627 )   
RelatedCitation | Metrics
The goal of this paper is to investigate the cloud computing in smaert grid. First of all,we introduced the basic concept of cloud computing and analyzed its major characteristics. Secondly, we combined cloud computing with smart grid and presented the view of smart cloud. Subsequently, we looked deeper into the three key issues, including construction of smart cloud, resource management and security policy. Finally, we pointed out future directions of research and concluded the paper.
Feature Extraction of Speech Signal Based on Empirical Mode Decomposition
WANG Hui,Li Sheng-hua
Computer Science. 2011, 38 (Z10): 434-436. 
Abstract PDF(201KB) ( 624 )   
RelatedCitation | Metrics
Effectively extracting feature information of speech signal is the key of speech recognition. By empirical mode decomposition method, a series of intrinsic mode function can be got.Extraction process of intrinsic mode function is to reduce its redundancy. Experimental results show that the empirical mode decomposition method can decrease the recognition error rate. EMD is an effective method. It is feasible to extract the feature from speech signals with EMD.
Design and Realization of the Network Video Platform on SOPC
HE Bin HE Jun
Computer Science. 2011, 38 (Z10): 437-439. 
Abstract PDF(357KB) ( 373 )   
RelatedCitation | Metrics
SOPC is an important application of programmable device in the embedded system. Based on SOPC, a general network video platform was introduced, which can receive images from the Ethernet, and process them, then transfer them to terminal equipment for display via digital video interface. In this paper, creation of hardware and software platform and a method to test this system were described in detail. On this platform,a variety of network video application can be achieved, such as video surveillance, remote video display.
Review on E-voting System Using RFID Technology and its Security
LIU Chun,ZHANG Jian-xue
Computer Science. 2011, 38 (Z10): 440-443. 
Abstract PDF(355KB) ( 516 )   
RelatedCitation | Metrics
Radio-frequency identification(RFID) is the use of a RFID tag applied to a product for identification and tracking using the radio waves. An active RF)D tag contains a battery and is able to transmit signals when an external source has been successfully identified. RFID technology application has being applied in our life widely. In this paper, we viewed the RFID technology applied in a basic o-voting system and discussed its security. The RFID system shows the advantages over the currently existing optical voting system on verifying the voters, recounting and public bulletin board. Remote voting may be realized based on the RFID technology. I}he RFID technology separates the votes from the voting equipments(software and hardware) and makes it more verifiable.
Real-time Performance Analysis of GOOSE Communication Network in Smart Substation
FAN Rong-quan，XIAO Hong，LI Qi-lin
Computer Science. 2011, 38 (Z10): 444-446. 
Abstract PDF(266KB) ( 906 )   
RelatedCitation | Metrics
GOOSE is the model of generic object oriented substation event defined in IEC 61850. It's very important for implementing co-operation between IEDs in smart substation. With rapid advances of the smart substation technology based on IEC61850,GOOSE has widespread application. We attempted to identify the mode of the transmission mechanism and work flow of UOOSE, and the real-time performances of two kinds of network topologies of GOOSE were evaluated by the OPNEI} simulation tool as well.
Drools Rules Engine in the Application of Modern Logistics Information Platform
LU Ge-hao, LI Shi-jin, WU Chao-fan
Computer Science. 2011, 38 (Z10): 447-450. 
Abstract PDF(289KB) ( 812 )   
RelatedCitation | Metrics
Rule engine is a technology which owns a very broad application prospects. First introduced its concept and function, also the application background of the system. Then mainly introduced the working mechanism of rules engine and the RISES. Finally, used the drools to solve the realisation of the rule engine based on the logistics system, and then discussed the advantage and the disadvantage about the rule engine, also concerned on the future development of this technology.
Wireless Multiple-node Image Acquisition System Implementation and Application
QIU Le-le, HU Yan-jun , XU Yao-hua , JIANG Xin-hong GAO Wei WEI Hai-yan
Computer Science. 2011, 38 (Z10): 451-453. 
Abstract PDF(288KB) ( 370 )   
RelatedCitation | Metrics
The paper firstly introduced the network scheme integrates mobile network and sensor network. Then it gave a further presentation in the hardware design of the solar panel supplying power and the software design of upper computer. Finally, the whole system was tested under indoor and outdoor environment. Test results shows the network cquipments can rapid convergence to form a sensor network that is low cost, easy extension, easy to control. In addition,under indoor and outdoor environment,upper software can reconstruct clear images.
Research of Time Delay Estimation Based on GCC Algorithm
LIANG Yu , MA Liang , NA Xia , CHEN Chen
Computer Science. 2011, 38 (Z10): 454-456. 
Abstract PDF(235KB) ( 2825 )   
RelatedCitation | Metrics
In the system of radio location, AOA TOA and TDOA are the most development potential location technology of the cellular mobile station. hhe time delay estimation of TIX)A requires very high precision. The higher accuracy of measurement, the residual will be smaller which is introduced. On this basis, the research of time delay estimation adopts new GCC algorithm which is based on periodic cross-spectral and cross-power spectrum. The simulation results show that the improved time delay estimation algorithm in the influence of harsh noise environment shows a relatively good robustness.
Implementing of OPNET Based GOOSE Simulation Platform
Li Qi- lin,FAN Rong-quan,XIAO Hong
Computer Science. 2011, 38 (Z10): 457-458. 
Abstract PDF(262KB) ( 641 )   
RelatedCitation | Metrics
With the wide application of GOOSE in smart substation, the investigation of real-time and reliability of GOOSE appears increasingly important. Due to the complexity of GOOSE and high cost of research, the traditional measured method is not good enough to meet the research demands. However, the simulation analysis method can work well in the field. The method of implementing GOOSE simulation platform based on the OPNET was introduced. The platform can be widely applied in various kinds of analysis and research of GOOSE.
Study and Implementation of FoxNews-WFL Based on Web Application
WANG Rong， LIU Fu-ying
Computer Science. 2011, 38 (Z10): 459-460. 
Abstract PDF(231KB) ( 389 )   
RelatedCitation | Metrics
FoxNcws's WFL(Work Flow Control System) can sign automaticly. This paper introduced FoxNcws_WFI system based on ASP. NET+C#Technology and introduced it's key programs. FoxNews_ WFL can do something in office without paper and sign News.
Study and Implementation of FoxNews-MID Based on Android C2DM
ZHANG Jing, LIU Fu-ying
Computer Science. 2011, 38 (Z10): 461-463. 
Abstract PDF(251KB) ( 482 )   
RelatedCitation | Metrics
FoxNews_MID network news emergency management system using Android cloud computing message frame(C2DM) technology can push emergency information to the remote handheld mobile terminals for the current social stability. This paper discusses the FoxNews_ MIDs function haracteristics,and discusses the key technology and gives the realization of the key programs. The operation shows that,FoxNews_MID system can be realized based on the C2DM pushing information to the remote hold mobile terminal, based on Andriod handheld terminal receiving information, based on Andriod handheld terminal uploading local news information and digital media data.
Evaluation Model on Competitive Power of Enterprise Based on Hopfield Neural Networks
LI Guo-hui
Computer Science. 2011, 38 (Z10): 464-466. 
Abstract PDF(303KB) ( 729 )   
RelatedCitation | Metrics
Considering the nonlinear characteristics of competitive power evaluation and the existence of many nonquantitative factors in the evaluation system, a Hopfield neural network model of evaluation on competitive power was built in this paper according to the evaluating data given by the experts. By utilizing the properties of association and memory of neural network that can approximate any nonlinear continuous function, the model can calculate quantified cvaluation and has higher efficiency than that of existing evaluation system. The method of applying Hopfield neural network to competitive power evaluation can overcome subjective factors in the process of expert assessment, avoid complex process of traditional competitive power evaluation and also has broad applicability.
Discussion about Algorithm of Calculating Source Location Based on TDOA
TANG Hao, WU Ji-da, LU Dong-sheng
Computer Science. 2011, 38 (Z10): 467-469. 
Abstract PDF(214KB) ( 658 )   
RelatedCitation | Metrics
At present, small and medium size radio monitoring stations with their low cost, small volume, convenient in maintenance etc advantages are widely applied, have gradually become the industry trend. However, numerous small stadons currently only have monitoring function, doesri t have the direction-finding function, and bring a lot of inconvenfence to the unknown source orientation. So it is particularly important to research method of locating based on TDOA Time Difference of Arrival). This paper discussed the method of calculating unknown source to defined position, based on temporal difference between unknown source and the different stations. Finally, it was implemented with C language.
Radio Monitoring System Integration Based on ESB
CHEN Zhi-gang , CHEN Chen ,SHEN Li , LI Ying-hong
Computer Science. 2011, 38 (Z10): 470-472. 
Abstract PDF(240KB) ( 380 )   
RelatedCitation | Metrics
The radio business is in rapid development, and the monitoring system of Yunnan radio does not satisfy its existing requirements.Therefore,improving the system automation levcl,fully realizing consummation radio information system platform construction, integrating various information system are imminent And using ESI3, Web service integration method is the best method, solves key problems of the agreement decoupling and interface, substantially achieves integration system task.
Design and Implementation of Automatic Tank Gauging System Based on Remote Sectional Technologies
LIU Rong-zhi
Computer Science. 2011, 38 (Z10): 473-476. 
Abstract PDF(420KB) ( 525 )   
RelatedCitation | Metrics
On basis of analyzing the important influence of oil level on the automatic tank gauge,a new type of remote sectional measurement system for oil tank and its principle ware introduced. This paper described the design,implementation and on-site application of the system,focusing on analysis of the practical application level gauge results for the oil field station library to provide technical support for automated measurement. The promotion and application of the technologies enable automatic monitoring of oil tank liquid level, reduce the employee labor intensity, increase the overall efficiency, and achieve the purpose of automatic management of the tank liquid level.
Research of Network Congestion Control of Ubiquitous Service
ZHANG De-gan LIU Wei-wei CHEN Xu-yan WANG Yuan-yuan
Computer Science. 2011, 38 (Z10): 576-278. 
Abstract PDF(309KB) ( 474 )   
RelatedCitation | Metrics
With the development of social science, the traditional network services model has been replaced by a new model called for pervasive computing model. And then the coexistence of a variety of terminal equipments network situanon comes up. When the task is in the migration of network services,the generation of congestion is inevitable. The result is that congestion has a direct impact on the transmission performance of networks. For the problems of the current traditional algorithm,for example congestion problems,a new congestion control algorithm DARed was designed. that the algorithm in ubiquitous computing environment has shown excellent performance is shown by NS2 simulation experimenu. It can be effective for avoiding for network congestion, and meet the universal service requirements.
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.