Volume 24,Issue 4,2013 Table of Contents
2013, 24(4):663-674.
DOI: 10.3724/SP.J.1001.2013.04379
Abstract:
Software is always dynamically evolving due to additional functionalities, performance tuning, bug fixing, and others. The existing testing techniques are difficult to satisfy the changing testing requirements. Hence, systematic techniques are needed of test case evolution to ensure the quality of evolving software. This paper surveys the test case evolution and compares and analyzes these techniques in detail, including test case selection, test case repairing and test suite augmentation. Finally, the challenges and research directions of test case evolution are proposed.
Software is always dynamically evolving due to additional functionalities, performance tuning, bug fixing, and others. The existing testing techniques are difficult to satisfy the changing testing requirements. Hence, systematic techniques are needed of test case evolution to ensure the quality of evolving software. This paper surveys the test case evolution and compares and analyzes these techniques in detail, including test case selection, test case repairing and test suite augmentation. Finally, the challenges and research directions of test case evolution are proposed.
2013, 24(4):675-695.
DOI: 10.3724/SP.J.1001.2013.04275
Abstract:
As software systems and their operational environments become more and more complex, the topic of software dependability has attracted more and more attention. The software analysis and design are both required to focus on the functionality and the dependability. However, there still lacks an effective approach to consider the functionality and the dependability simultaneously during software analysis and design. Based on cybernetics, this paper proposes a “use case+control case” driven approach for software analysis and design, which aims to address the software functionality and dependability under a unified framework. During requirements analysis, the “use case+control case” model supports the co-modeling of the functional requirements and the dependability requirements. During system design, the design techniques proposed by ICONIX approach are extended to identify the functionality objects that realize the use cases, and the dependability objects that realize the control cases. A case is also used to illustrate the feasibility of the proposed approach.
As software systems and their operational environments become more and more complex, the topic of software dependability has attracted more and more attention. The software analysis and design are both required to focus on the functionality and the dependability. However, there still lacks an effective approach to consider the functionality and the dependability simultaneously during software analysis and design. Based on cybernetics, this paper proposes a “use case+control case” driven approach for software analysis and design, which aims to address the software functionality and dependability under a unified framework. During requirements analysis, the “use case+control case” model supports the co-modeling of the functional requirements and the dependability requirements. During system design, the design techniques proposed by ICONIX approach are extended to identify the functionality objects that realize the use cases, and the dependability objects that realize the control cases. A case is also used to illustrate the feasibility of the proposed approach.
2013, 24(4):696-714.
DOI: 10.3724/SP.J.1001.2013.04272
Abstract:
The Internet provides an open, dynamic, and uncertain environment. A composite service in this environment faces more failure threats caused by resource faults and component failures. The existing failure recovery measures can improve the availability of composite service and at the same time, bring the negative impact on service performance. In this paper, an analytical model considering failure recovery is proposed to quantitatively analyze the performance of composite service with the failure probability and recovery ability through synthesizes the fault taxonomy and recovery strategies of service failure. Queueing Petri nets (QPNs) are used to model the occurrence of failures and the corresponding recovery handling processes, which focuses on targeting the service executing process under retrying and replacement strategies. The inner structure of server node and link QPN models considering failure and recovery impact are expatiated and depicted. On this ground, a performance model of composite service with decentralized execution is given, and five interaction relations are taken into account. Finally, QPME tool is used to simulate and compare the performance measure results under different failure rates, failure styles proportions, and recovery strategies. The numerical results show that this method can quantitatively analyze the impact of failure recovery measure on service performance, and can also be helpful for providing rational solutions to implement failure recovery measure for information service system in uncertain network environments.
The Internet provides an open, dynamic, and uncertain environment. A composite service in this environment faces more failure threats caused by resource faults and component failures. The existing failure recovery measures can improve the availability of composite service and at the same time, bring the negative impact on service performance. In this paper, an analytical model considering failure recovery is proposed to quantitatively analyze the performance of composite service with the failure probability and recovery ability through synthesizes the fault taxonomy and recovery strategies of service failure. Queueing Petri nets (QPNs) are used to model the occurrence of failures and the corresponding recovery handling processes, which focuses on targeting the service executing process under retrying and replacement strategies. The inner structure of server node and link QPN models considering failure and recovery impact are expatiated and depicted. On this ground, a performance model of composite service with decentralized execution is given, and five interaction relations are taken into account. Finally, QPME tool is used to simulate and compare the performance measure results under different failure rates, failure styles proportions, and recovery strategies. The numerical results show that this method can quantitatively analyze the impact of failure recovery measure on service performance, and can also be helpful for providing rational solutions to implement failure recovery measure for information service system in uncertain network environments.
2013, 24(4):715-729.
DOI: 10.3724/SP.J.1001.2013.04260
Abstract:
During the task of acquiring formal specification, an important problem is verifing the correctness of acquired formal specification. In other words, given a problem requirement P, a variety of formal specifications will be acquired, but how to verify the correctness of them all? The different nature of the non- (semi-) formal of problem requirement and formal of specification makes it a challenging software problem and requirement for engineering. This paper proposes a formal derivation method to verify the relative correctness of different forms of Radl specifications corresponding same problem. It achieves this through a proof of the equivalency among different forms of Radl specifications and a certain formal specification Si, which is straightforward to the problem requirement. Si is converted into an execute program using PAR method and PAR platform, and is validated by test. In order to support the method, the study further put forth an extended logic system and aided certified algorithm. This paper uses Radl as formal specification language and elaborates the method using two typical examples in the domains of sort and search, combinational optimization. Practical effects manifest not only can effectively verify relatively correctness of Radl specification, but also has well extendibility. The method has potential theory significance and application value in research areas of formal specifications correctness verification, algorithms optimization and programs equivalency proof.
During the task of acquiring formal specification, an important problem is verifing the correctness of acquired formal specification. In other words, given a problem requirement P, a variety of formal specifications will be acquired, but how to verify the correctness of them all? The different nature of the non- (semi-) formal of problem requirement and formal of specification makes it a challenging software problem and requirement for engineering. This paper proposes a formal derivation method to verify the relative correctness of different forms of Radl specifications corresponding same problem. It achieves this through a proof of the equivalency among different forms of Radl specifications and a certain formal specification Si, which is straightforward to the problem requirement. Si is converted into an execute program using PAR method and PAR platform, and is validated by test. In order to support the method, the study further put forth an extended logic system and aided certified algorithm. This paper uses Radl as formal specification language and elaborates the method using two typical examples in the domains of sort and search, combinational optimization. Practical effects manifest not only can effectively verify relatively correctness of Radl specification, but also has well extendibility. The method has potential theory significance and application value in research areas of formal specifications correctness verification, algorithms optimization and programs equivalency proof.
2013, 24(4):730-748.
DOI: 10.3724/SP.J.1001.2013.04234
Abstract:
A method to quantitatively evaluate the robustness of the obfuscated software is proposed in order for programmers to make a choice in different obfuscating schemes. This method aims to measure software robustness during the obfuscating transform from software complexity change and the increase of code functional obscurity, which are relatively independent, each other. First, a system complexity model is constructed from the perspective of system complexity and the diversity of software information. The model contain such elements as software structure, information flow, branch, and loop at nested level, and tries to reflect the robustness from the obfuscating transform on the complexity level. Second, to quantitatively measure the functional obscurity for the obfuscating transform, the experts index score constructs a model for a single transform is constructed by the experts index score. On this basis, transform obscurity composition models for multiple transforms are proposed. Next, the paper describes how applying these two kinds of models can be used to evaluate whether an obfuscating technique is effective, and can sort the given obfuscating scheme set to choose the best one. Also, some examples and corresponding model algorithms are given. Finally, an instance simulation demonstrates in detail the work process for the proposed models.
A method to quantitatively evaluate the robustness of the obfuscated software is proposed in order for programmers to make a choice in different obfuscating schemes. This method aims to measure software robustness during the obfuscating transform from software complexity change and the increase of code functional obscurity, which are relatively independent, each other. First, a system complexity model is constructed from the perspective of system complexity and the diversity of software information. The model contain such elements as software structure, information flow, branch, and loop at nested level, and tries to reflect the robustness from the obfuscating transform on the complexity level. Second, to quantitatively measure the functional obscurity for the obfuscating transform, the experts index score constructs a model for a single transform is constructed by the experts index score. On this basis, transform obscurity composition models for multiple transforms are proposed. Next, the paper describes how applying these two kinds of models can be used to evaluate whether an obfuscating technique is effective, and can sort the given obfuscating scheme set to choose the best one. Also, some examples and corresponding model algorithms are given. Finally, an instance simulation demonstrates in detail the work process for the proposed models.
2013, 24(4):749-760.
DOI: 10.3724/SP.J.1001.2013.04257
Abstract:
To further improve the fitting and prediction performance of the non-homogeneous Poisson process (MHPP) software reliability growth models (SRGMs), this paper, as the extension work of the NHPP software reliability modeling framework which considers the TEF, will discuss how to integrate both TEF and TCF into the traditional NHPP software reliability modeling process. This is done in order to capture the integrated effect of testing effort and testing coverage on reliability estimation. First, a comprehensive modeling framework for incorporating the TEF and TCF together into the NHPP SRGMs is proposed. Recur to this framework, a new NHPP SRGM (named IS-LO-SRGM) with both the IS-TEF and logistic TCF (LO-TCF) is proposed. Meanwhile, two issues of this proposed framework are discussed respectively (i.e. how to select the most appropriate TEF and TCF for modeling and the parameter estimation). Then, two case studies on two real failure data-sets are presented. The experimental results show that the IS-LO-SRGM nearly yields the best fitting and prediction results compared with the other comparison NHPP SRGMs for two data-sets. Thus, the applicability and effectiveness of this modeling framework are validated. Finally, the imperfect debugging phenomenon is also considered in the modeling framework for a further discussion.
To further improve the fitting and prediction performance of the non-homogeneous Poisson process (MHPP) software reliability growth models (SRGMs), this paper, as the extension work of the NHPP software reliability modeling framework which considers the TEF, will discuss how to integrate both TEF and TCF into the traditional NHPP software reliability modeling process. This is done in order to capture the integrated effect of testing effort and testing coverage on reliability estimation. First, a comprehensive modeling framework for incorporating the TEF and TCF together into the NHPP SRGMs is proposed. Recur to this framework, a new NHPP SRGM (named IS-LO-SRGM) with both the IS-TEF and logistic TCF (LO-TCF) is proposed. Meanwhile, two issues of this proposed framework are discussed respectively (i.e. how to select the most appropriate TEF and TCF for modeling and the parameter estimation). Then, two case studies on two real failure data-sets are presented. The experimental results show that the IS-LO-SRGM nearly yields the best fitting and prediction results compared with the other comparison NHPP SRGMs for two data-sets. Thus, the applicability and effectiveness of this modeling framework are validated. Finally, the imperfect debugging phenomenon is also considered in the modeling framework for a further discussion.
2013, 24(4):761-780.
DOI: 10.3724/SP.J.1001.2013.04355
Abstract:
In face of the growing data volume and search requests, to meet the efficiency of users’ search requests, the database cannot depend just on the SQL query optimization. Improvement must be made upon the physical structures of databases and the search efficiency from the origin. The paper describes four physical structures optimized by commercial databases, summarizes several key technologies in physical structure optimization sphere and introduces several recommendation tools for physical structure optimization now utilized in commercial database. The research directions are presented at last.
In face of the growing data volume and search requests, to meet the efficiency of users’ search requests, the database cannot depend just on the SQL query optimization. Improvement must be made upon the physical structures of databases and the search efficiency from the origin. The paper describes four physical structures optimized by commercial databases, summarizes several key technologies in physical structure optimization sphere and introduces several recommendation tools for physical structure optimization now utilized in commercial database. The research directions are presented at last.
2013, 24(4):781-797.
DOI: 10.3724/SP.J.1001.2013.04374
Abstract:
In Web data integration, selecting data from a Web data source collection such that the specific query intents are satisfied while the number of accesses to data sources is minimized and the quality of returned results are guaranteed is a popular topic. In this paper, using the researches and practices in recent ten years as the background, the study focuses on the evolution and presents research in the area of Web data source selection and classifies Web data source selection methods. In addition, the paper discusses the research motivations, methods and results of relevance-based data source selection and quality-based data source selection. Moreover, the paper introduces the correlation research results and analyzes their destinations, key techniques, merits and demerits. Finally, some directions for future research are put forward.
In Web data integration, selecting data from a Web data source collection such that the specific query intents are satisfied while the number of accesses to data sources is minimized and the quality of returned results are guaranteed is a popular topic. In this paper, using the researches and practices in recent ten years as the background, the study focuses on the evolution and presents research in the area of Web data source selection and classifies Web data source selection methods. In addition, the paper discusses the research motivations, methods and results of relevance-based data source selection and quality-based data source selection. Moreover, the paper introduces the correlation research results and analyzes their destinations, key techniques, merits and demerits. Finally, some directions for future research are put forward.
2013, 24(4):798-809.
DOI: 10.3724/SP.J.1001.2013.04267
Abstract:
A literature retrieval system, which returns user papers domain-related with queries and ranks papers by importance, can help users quickly learn one academic domain. This paper develops a framework for the domain-oriented literature retrieval, which combines links and contents analysis to search and rank important papers in one academic domain. This framework designs a score function that evaluates both importance of the paper and its relevance to the domain. The study first proposes a community-core discovery algorithm, which is capable of finding a collection of papers domain-related with query from citation network and calculates an importance score for each paper. To assign other papers a domain-related score, a supervised non-negative matrix factorization method, using identified domain-related paper as prior knowledge, is also developed. The experiments conducted on synthetic and real datasets demonstrate the feasibility and applicability of this framework.
A literature retrieval system, which returns user papers domain-related with queries and ranks papers by importance, can help users quickly learn one academic domain. This paper develops a framework for the domain-oriented literature retrieval, which combines links and contents analysis to search and rank important papers in one academic domain. This framework designs a score function that evaluates both importance of the paper and its relevance to the domain. The study first proposes a community-core discovery algorithm, which is capable of finding a collection of papers domain-related with query from citation network and calculates an importance score for each paper. To assign other papers a domain-related score, a supervised non-negative matrix factorization method, using identified domain-related paper as prior knowledge, is also developed. The experiments conducted on synthetic and real datasets demonstrate the feasibility and applicability of this framework.
2013, 24(4):810-824.
DOI: 10.3724/SP.J.1001.2013.04262
Abstract:
Because of the low quality of data provided by information systems such as data missing, data conflicts and data duplicate, it is widespread in enterprise that decision-makers are often faced with “rich data but poor information”. To improve the data availability of information systems, the main factors affecting data quality of relational database are studied in this paper, also a unified metadata model based on multi data sources and a data quality assessment model are proposed, and a set of interactive visual analogues for data quality assessment is built. Finally, a visual analysis system for data quality in relational database is developed, which is verified with several enterprise practical cases. It is indicated that the built system can analyze data quality effectively, and then improve the reliability and accuracy of enterprise decision-making.
Because of the low quality of data provided by information systems such as data missing, data conflicts and data duplicate, it is widespread in enterprise that decision-makers are often faced with “rich data but poor information”. To improve the data availability of information systems, the main factors affecting data quality of relational database are studied in this paper, also a unified metadata model based on multi data sources and a data quality assessment model are proposed, and a set of interactive visual analogues for data quality assessment is built. Finally, a visual analysis system for data quality in relational database is developed, which is verified with several enterprise practical cases. It is indicated that the built system can analyze data quality effectively, and then improve the reliability and accuracy of enterprise decision-making.
2013, 24(4):825-842.
DOI: 10.3724/SP.J.1001.2013.04369
Abstract:
Honeypot is a proactive defense technology, introduced by the defense side to change the asymmetric situation of a network attack and defensive game. Through the deployment of the honeypots, i.e. security resources without any production purpose, the defenders can deceive attackers to illegally take advantage of the honeypots and capture and analyze the attack behaviors to understand the attack tools and methods, and to learn the intentions and motivations. Honeypot technology has won the sustained attention of the security community to make considerable progress and get wide application, and has become one of the main technical means of the Internet security threat monitoring and analysis. In this paper, the origin and evolution process of the honeypot technology are presented first. Next, the key mechanisms of honeypot technology are comprehensively analyzed, the development process of the honeypot deployment structure is also reviewed, and the latest applications of honeypot technology in the directions of Internet security threat monitoring, analysis and prevention are summarized. Finally, the problems of honeypot technology, development trends and further research directions are discussed.
Honeypot is a proactive defense technology, introduced by the defense side to change the asymmetric situation of a network attack and defensive game. Through the deployment of the honeypots, i.e. security resources without any production purpose, the defenders can deceive attackers to illegally take advantage of the honeypots and capture and analyze the attack behaviors to understand the attack tools and methods, and to learn the intentions and motivations. Honeypot technology has won the sustained attention of the security community to make considerable progress and get wide application, and has become one of the main technical means of the Internet security threat monitoring and analysis. In this paper, the origin and evolution process of the honeypot technology are presented first. Next, the key mechanisms of honeypot technology are comprehensively analyzed, the development process of the honeypot deployment structure is also reviewed, and the latest applications of honeypot technology in the directions of Internet security threat monitoring, analysis and prevention are summarized. Finally, the problems of honeypot technology, development trends and further research directions are discussed.
2013, 24(4):843-858.
DOI: 10.3724/SP.J.1001.2013.04376
Abstract:
Drive-by-Download is a Web-based attack that targets at downloading and executing malwares on the client side without the user’s notice or consent. It usually takes HTML elements (e.g. JavaScript, VBScript, CSS) as attack vectors, and exploits vulnerabilities in browser and plugins to launch attacks. Drive-by-Download represents as an HTML page or a group of inline-linked HTML pages/scripts. After browsing these pages, vulnerable client sides will automatically download and execute malware. Through the pull-based attack mode, Drive-by-Download can effectively and secretly spread malware to clients and has become an important way to spread malware. In recent years, both the offense-side and defense-side make ongoing development. This paper first introduces the mechanisms and features of Drive-by-Download. Then the paper summarizes and discusses researches on detection, analysis and prevention of Drive-by-Download. Trends of Drive-by-Download and some possible research directions will be discussed at last.
Drive-by-Download is a Web-based attack that targets at downloading and executing malwares on the client side without the user’s notice or consent. It usually takes HTML elements (e.g. JavaScript, VBScript, CSS) as attack vectors, and exploits vulnerabilities in browser and plugins to launch attacks. Drive-by-Download represents as an HTML page or a group of inline-linked HTML pages/scripts. After browsing these pages, vulnerable client sides will automatically download and execute malware. Through the pull-based attack mode, Drive-by-Download can effectively and secretly spread malware to clients and has become an important way to spread malware. In recent years, both the offense-side and defense-side make ongoing development. This paper first introduces the mechanisms and features of Drive-by-Download. Then the paper summarizes and discusses researches on detection, analysis and prevention of Drive-by-Download. Trends of Drive-by-Download and some possible research directions will be discussed at last.
2013, 24(4):859-872.
DOI: 10.3724/SP.J.1001.2013.04255
Abstract:
Location is a crucial part of wireless sensor networks technologies and applications. RSS-based (based on received signal strength) location estimations play an important role in practice. Considering the characteristic that the variance of RSS varies in different estimation points, a practical RSS-based probabilistic model is tailored and established according to the probability-based maximum likelihood in this paper. Next, taking the highly nonlinear characteristic of the object function in this probabilistic model, a location approach using the probability maximum with evolutionary algorithm (PMEA), which corresponds more to the characteristic of communication of the sensors, is proposed to find out the maximum likelihood point. The convergence is proved by the stochastic process. The results of the proposed algorithm, when implemented in a public dataset, show that this proposed probabilistic model and PMEA outperform existing solutions in terms of RSS-based location estimation accuracy.
Location is a crucial part of wireless sensor networks technologies and applications. RSS-based (based on received signal strength) location estimations play an important role in practice. Considering the characteristic that the variance of RSS varies in different estimation points, a practical RSS-based probabilistic model is tailored and established according to the probability-based maximum likelihood in this paper. Next, taking the highly nonlinear characteristic of the object function in this probabilistic model, a location approach using the probability maximum with evolutionary algorithm (PMEA), which corresponds more to the characteristic of communication of the sensors, is proposed to find out the maximum likelihood point. The convergence is proved by the stochastic process. The results of the proposed algorithm, when implemented in a public dataset, show that this proposed probabilistic model and PMEA outperform existing solutions in terms of RSS-based location estimation accuracy.
2013, 24(4):873-886.
DOI: 10.3724/SP.J.1001.2013.04270
Abstract:
In sensor networks, a group key plays an important role in both secure group communication and some security services such as false date filtering. Considering the security threat that there may be plenty of compromised nodes, a new group key management scheme based on random perturbation and secret sharing techniques is proposed (GKRP for short). In the GKRP, base station and local networks manage group keys cooperatively; additionally, some functions such as the broadcast rekeying function and local collaboration function are constructed. Thus, with GKRP, even if there are plenty of compromised nodes, these nodes can be revoked in real-time to ensure group key security. Extensive analyses and simulations show that GKRP can provide a higher level of security because GKRP is not limited to the compromised nodes under certain conditions, which can be satisfied easily. Moreover, GKRP is also more efficient on communication as taking local broadcast and network broadcast to rekey. The storage and computation overheads of GKRP are somewhat higher than some related works; however, they are still lightweight and thus are suitable to sensor networks.
In sensor networks, a group key plays an important role in both secure group communication and some security services such as false date filtering. Considering the security threat that there may be plenty of compromised nodes, a new group key management scheme based on random perturbation and secret sharing techniques is proposed (GKRP for short). In the GKRP, base station and local networks manage group keys cooperatively; additionally, some functions such as the broadcast rekeying function and local collaboration function are constructed. Thus, with GKRP, even if there are plenty of compromised nodes, these nodes can be revoked in real-time to ensure group key security. Extensive analyses and simulations show that GKRP can provide a higher level of security because GKRP is not limited to the compromised nodes under certain conditions, which can be satisfied easily. Moreover, GKRP is also more efficient on communication as taking local broadcast and network broadcast to rekey. The storage and computation overheads of GKRP are somewhat higher than some related works; however, they are still lightweight and thus are suitable to sensor networks.
2013, 24(4):887-899.
DOI: 10.3724/SP.J.1001.2013.04290
Abstract:
Due to the limitation of own resource and the influence of subjective attitude, the nodes in mobile peer-to-peer networks often show selfish behavior. Detecting and stimulating selfish nodes to cooperate is becoming an important research topic recently. By allowing nodes to express their subjective forward attitude freely, the detection mechanism is implemented. Not only is the objective forwarding probability determined by its own resource, but subjective forwarding probability is also determined by selfish nodes that are considered. Therefore, choosing a routing path with the highest integrated forwarding probability can alleviate the influence of selfish nodes. To motivate the excessive selfish nodes to actively cooperate, an incentive and cooperation model based on punishment mechanism is presented. The selfish nodes are punished based on the damage degree of their selfish behavior. The monitor mechanism among nodes and strict punishment mechanism assure that the strategy proof is achieved. Simulation results show that the detection and incentive mechanism can not only discover appropriate routing in the condition of every rational and selfish node has limited resource, but also stimulate selfish nodes to actively cooperate when the degree of nodes’ selfishness is high.
Due to the limitation of own resource and the influence of subjective attitude, the nodes in mobile peer-to-peer networks often show selfish behavior. Detecting and stimulating selfish nodes to cooperate is becoming an important research topic recently. By allowing nodes to express their subjective forward attitude freely, the detection mechanism is implemented. Not only is the objective forwarding probability determined by its own resource, but subjective forwarding probability is also determined by selfish nodes that are considered. Therefore, choosing a routing path with the highest integrated forwarding probability can alleviate the influence of selfish nodes. To motivate the excessive selfish nodes to actively cooperate, an incentive and cooperation model based on punishment mechanism is presented. The selfish nodes are punished based on the damage degree of their selfish behavior. The monitor mechanism among nodes and strict punishment mechanism assure that the strategy proof is achieved. Simulation results show that the detection and incentive mechanism can not only discover appropriate routing in the condition of every rational and selfish node has limited resource, but also stimulate selfish nodes to actively cooperate when the degree of nodes’ selfishness is high.
16 Optimal Cross-Layer Power Control and Congestion Control Providing Energy Saving for Ad Hoc Networks
2013, 24(4):900-914.
DOI: 10.3724/SP.J.1001.2013.04317
Abstract:
The limited energy of the node and the restricted communication bandwidths are two important features of ad hoc networks. The energy of the node is not only a key factor effecting network capacities, but is also a determinant factor in restricting network lifetime. The limited communication bandwidth makes the network more prone to congestion. Hense, it is particular important to design a joint optimal congestion control and power control algorithm by providing energy saving in ad hoc networks. First, the study proposes a network utility maximization problem that provides energy saving, by introducing the cost function of energy consumption to the objective function of the network utility maximization problem, so the performance of the network can be optimized both in the network lifetime and network utility. Secondly, by the dual decomposition method and gradient projection method, the case proposes a joint power control and congestion control algorithm that provides energy saving to solve this problem. In addition, the project analyzes and verifies the convergence of the proposed algorithm. Finally, simulation results in detail are given to demonstrate the efficiency of the proposed algorithm. The network adapt the proposed algorithm can significantly reduce the energy consumption and prolong the network lifetime, while the remaining network throughput basically unchanged.
The limited energy of the node and the restricted communication bandwidths are two important features of ad hoc networks. The energy of the node is not only a key factor effecting network capacities, but is also a determinant factor in restricting network lifetime. The limited communication bandwidth makes the network more prone to congestion. Hense, it is particular important to design a joint optimal congestion control and power control algorithm by providing energy saving in ad hoc networks. First, the study proposes a network utility maximization problem that provides energy saving, by introducing the cost function of energy consumption to the objective function of the network utility maximization problem, so the performance of the network can be optimized both in the network lifetime and network utility. Secondly, by the dual decomposition method and gradient projection method, the case proposes a joint power control and congestion control algorithm that provides energy saving to solve this problem. In addition, the project analyzes and verifies the convergence of the proposed algorithm. Finally, simulation results in detail are given to demonstrate the efficiency of the proposed algorithm. The network adapt the proposed algorithm can significantly reduce the energy consumption and prolong the network lifetime, while the remaining network throughput basically unchanged.
联系方式
- 《Journal of Software 》
- 主办单位：Institute of Software, CAS, China
- 邮编：100190
- 电话：010-62562563
- 电子邮箱：jos@iscas.ac.cn
- 网址：https://www.jos.org.cn
- 刊号：ISSN 1000-9825
- CN 11-2560/TP
- 国内定价：70元
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.
