Due to the rapid growth of high data rate applications substantial amount of energy is consumed by base station's equipment. In order to save energy, it is better to deploy fewer base stations (BSs), switch off as many as possible, or use low power consuming ones. However, quality of service (QoS) is usually sacrificed to achieve such savings. In this paper, we reduce the number of BSs to save energy and study the performance of four routing schemes employing our city vehicular simulator to fulfil the QoS. While utilising the ad hoc mode, we show that it is important to put the maximum proportion of vehicles' transceivers to the sleeping mode in order to save energy. To achieve this, we propose a new double cluster head (DCH) scheme in which only cluster heads (CHs) can undertake inter cluster communication. Our simulation results reveal that the proposed DCH scheme consumes 45% less energy compared to the fully functional vehicle-to-roadside (V2R) scenario and approximately 88% less energy compared to other routing schemes while attaining the required QoS.
{"title":"Energy Efficient Double Cluster Head Routing Scheme in a City Vehicular Network","authors":"Hamdi Idjmayyel, B. Qazi, J. Elmirghani","doi":"10.1109/WAINA.2013.37","DOIUrl":"https://doi.org/10.1109/WAINA.2013.37","url":null,"abstract":"Due to the rapid growth of high data rate applications substantial amount of energy is consumed by base station's equipment. In order to save energy, it is better to deploy fewer base stations (BSs), switch off as many as possible, or use low power consuming ones. However, quality of service (QoS) is usually sacrificed to achieve such savings. In this paper, we reduce the number of BSs to save energy and study the performance of four routing schemes employing our city vehicular simulator to fulfil the QoS. While utilising the ad hoc mode, we show that it is important to put the maximum proportion of vehicles' transceivers to the sleeping mode in order to save energy. To achieve this, we propose a new double cluster head (DCH) scheme in which only cluster heads (CHs) can undertake inter cluster communication. Our simulation results reveal that the proposed DCH scheme consumes 45% less energy compared to the fully functional vehicle-to-roadside (V2R) scenario and approximately 88% less energy compared to other routing schemes while attaining the required QoS.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122100279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Quentin Perret, Gabriel Charlemagne, Stelios Sotiriadis, N. Bessis
This study presents a soft deadline scheduler for distributed systems that aims of exploring data locality management. In Hadoop, neither the Fair Scheduler nor the Capacity Scheduler takes care about deadlines defined by the user for a job. Our algorithm, named as Cloud Least Laxity First (CLLF), minimizes the extra-cost implied from tasks that are executed over a cloud setting by ordering each of which using its laxity and locality. By using our deadline scheduling algorithm, we demonstrate prosperous performance, as the number of available nodes needed in a cluster in order to meet all the deadlines is minimized while the total execution time of the job remains in acceptable levels. To achieve this, we compare the ability of our algorithm to meet deadlines with the Time Shared and the Space Shared scheduling algorithms. At last we implement our solution in the CloudSim simulation framework for producing the experimental analysis.
本文提出了一种分布式系统的软截止日期调度程序，旨在探索数据局部性管理。在Hadoop中，Fair Scheduler和Capacity Scheduler都不关心用户为作业定义的截止日期。我们的算法名为Cloud Least Laxity First (CLLF)，它通过使用松散性和局部性对每个任务进行排序，从而最大限度地减少在云设置上执行的任务所隐含的额外成本。通过使用我们的截止日期调度算法，我们展示了良好的性能，因为集群中满足所有截止日期所需的可用节点数量被最小化，而作业的总执行时间保持在可接受的水平。为了实现这一点，我们比较了我们的算法与时间共享和空间共享调度算法满足最后期限的能力。最后，我们在CloudSim仿真框架中实现了我们的解决方案，并进行了实验分析。
{"title":"A Deadline Scheduler for Jobs in Distributed Systems","authors":"Quentin Perret, Gabriel Charlemagne, Stelios Sotiriadis, N. Bessis","doi":"10.1109/WAINA.2013.194","DOIUrl":"https://doi.org/10.1109/WAINA.2013.194","url":null,"abstract":"This study presents a soft deadline scheduler for distributed systems that aims of exploring data locality management. In Hadoop, neither the Fair Scheduler nor the Capacity Scheduler takes care about deadlines defined by the user for a job. Our algorithm, named as Cloud Least Laxity First (CLLF), minimizes the extra-cost implied from tasks that are executed over a cloud setting by ordering each of which using its laxity and locality. By using our deadline scheduling algorithm, we demonstrate prosperous performance, as the number of available nodes needed in a cluster in order to meet all the deadlines is minimized while the total execution time of the job remains in acceptable levels. To achieve this, we compare the ability of our algorithm to meet deadlines with the Time Shared and the Space Shared scheduling algorithms. At last we implement our solution in the CloudSim simulation framework for producing the experimental analysis.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128478597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Villanueva, J. Albusac, Luis Jiménez, D. Villa, J. C. López
When we talk about smart cities, one of the key pillars is a smart management of traffic and transport infrastructure. In this paper, we propose an architecture to support highway monitoring in smart cities. Starting from a project to reduce cost of maintenance tasks in highways, we develop a comprehensive architecture for effectively monitor and manage future highways. Highway's security fence monitoring, environmental pollution, frozen asphalt warning, real-time accident detection, adapting speed limits to weather conditions, are examples of applications of our architecture.
{"title":"Architecture for Smart Highway Real Time Monitoring","authors":"F. Villanueva, J. Albusac, Luis Jiménez, D. Villa, J. C. López","doi":"10.1109/WAINA.2013.55","DOIUrl":"https://doi.org/10.1109/WAINA.2013.55","url":null,"abstract":"When we talk about smart cities, one of the key pillars is a smart management of traffic and transport infrastructure. In this paper, we propose an architecture to support highway monitoring in smart cities. Starting from a project to reduce cost of maintenance tasks in highways, we develop a comprehensive architecture for effectively monitor and manage future highways. Highway's security fence monitoring, environmental pollution, frozen asphalt warning, real-time accident detection, adapting speed limits to weather conditions, are examples of applications of our architecture.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129161143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Geon Yong Park, Hee-seong Kim, Hwi Woon Jeong, H. Youn
Wireless sensor network consists of hundreds to thousands of sensor nodes gathering various data including temperature, sound, location, etc. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. It is usually difficult to recharge or replace the sensor nodes which have limited battery capacity. Energy efficiency is thus a primary issue in maintaining the network. In this paper we propose an efficient cluster head selection method using K-means algorithm to maximize the energy efficiency of wireless sensor network. It is based on the concept of finding the cluster head minimizing the sum of Euclidean distances between the head and member nodes. Computer simulation shows that the proposed approach allows better performance than the existing hierarchical routing protocols such as LEACH and HEED in terms of network lifetime.
{"title":"A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network","authors":"Geon Yong Park, Hee-seong Kim, Hwi Woon Jeong, H. Youn","doi":"10.1109/WAINA.2013.123","DOIUrl":"https://doi.org/10.1109/WAINA.2013.123","url":null,"abstract":"Wireless sensor network consists of hundreds to thousands of sensor nodes gathering various data including temperature, sound, location, etc. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. It is usually difficult to recharge or replace the sensor nodes which have limited battery capacity. Energy efficiency is thus a primary issue in maintaining the network. In this paper we propose an efficient cluster head selection method using K-means algorithm to maximize the energy efficiency of wireless sensor network. It is based on the concept of finding the cluster head minimizing the sum of Euclidean distances between the head and member nodes. Computer simulation shows that the proposed approach allows better performance than the existing hierarchical routing protocols such as LEACH and HEED in terms of network lifetime.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Although numerous processes are executed in disaster response management (DRM), methods and tools of business process management (BPM) are often deemed inapplicable. Since recent approaches extend classical functionalities of workflow management systems (WFMS), their feasibility for DRM should be re-evaluated. In this paper, we discuss tactical disaster response as a promising field for applying WFMS. The main results are twofold: firstly, it is shown that current approaches are addressing a major challenge of DRM, namely the provision of increased flexibility for adapting workflow models "on the fly". Secondly, methods and tools for business process analysis are discussed with regard to their additional potential for improving DRM. Therefore, the discussion in this paper is expected to stimulate further research for improving by highlighting novel research areas that might not be addressed with the appropriate priority in the BPM community.
{"title":"Using Workflow Management Systems to Improve Disaster Response Processes","authors":"Marlen Hofmann, Stefan Sackmann, Hans Betke","doi":"10.1109/WAINA.2013.14","DOIUrl":"https://doi.org/10.1109/WAINA.2013.14","url":null,"abstract":"Although numerous processes are executed in disaster response management (DRM), methods and tools of business process management (BPM) are often deemed inapplicable. Since recent approaches extend classical functionalities of workflow management systems (WFMS), their feasibility for DRM should be re-evaluated. In this paper, we discuss tactical disaster response as a promising field for applying WFMS. The main results are twofold: firstly, it is shown that current approaches are addressing a major challenge of DRM, namely the provision of increased flexibility for adapting workflow models \"on the fly\". Secondly, methods and tools for business process analysis are discussed with regard to their additional potential for improving DRM. Therefore, the discussion in this paper is expected to stimulate further research for improving by highlighting novel research areas that might not be addressed with the appropriate priority in the BPM community.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121448997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Clouds offer resources as services, which are charged on the basis of their actual usage. An approach that is currently spreading, to face possible problems linked to a low quality of service offered, is the adoption of Service Level Agreements (SLAs). In this paper we propose the adoption of a simulation-based approach for supporting a framework in charge of SLA management in cloud applications. The idea stems from the consideration that to face the inevitable impact on QoS of the cloud elasticity, it is necessary to evaluate in a predictive way the performance properties of the many different configurations among which the automatic cloud management can choose to allocate resources to customers. This paper proposes the architecture of the framework for SLA management in clouds, identifying the requirements implied by the simulation to be performed and suggesting the adoption of a simulation engine that fits with the proposed requirements.
{"title":"A Proposal of a Simulation-Based Approach for Service Level Agreement in Cloud","authors":"M. Rak, Antonio Cuomo, Umberto Villano","doi":"10.1109/WAINA.2013.208","DOIUrl":"https://doi.org/10.1109/WAINA.2013.208","url":null,"abstract":"Clouds offer resources as services, which are charged on the basis of their actual usage. An approach that is currently spreading, to face possible problems linked to a low quality of service offered, is the adoption of Service Level Agreements (SLAs). In this paper we propose the adoption of a simulation-based approach for supporting a framework in charge of SLA management in cloud applications. The idea stems from the consideration that to face the inevitable impact on QoS of the cloud elasticity, it is necessary to evaluate in a predictive way the performance properties of the many different configurations among which the automatic cloud management can choose to allocate resources to customers. This paper proposes the architecture of the framework for SLA management in clouds, identifying the requirements implied by the simulation to be performed and suggesting the adoption of a simulation engine that fits with the proposed requirements.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126418249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The classification of consumable media by mining relevant text for their identifying features is a subjective process. Previous attempts to perform this type of feature mining have generally been limited in scope due to having limited access to user data. Many of these studies used human domain knowledge to evaluate the accuracy of features extracted using these methods. In this paper, we mine book review text to identify nontrivial features of a set of similar books. We make comparisons between books by looking for books that share characteristics, ultimately performing clustering on the books in our data set. We use the same mining process to identify a corresponding set of characteristics in users. Finally, we evaluate the quality of our methods by examining the correlation between our similarity metric, and user ratings.
{"title":"Mining Online Book Reviews for Sentimental Clustering","authors":"Eric Lin, S. Fang, Jie Wang","doi":"10.1109/WAINA.2013.172","DOIUrl":"https://doi.org/10.1109/WAINA.2013.172","url":null,"abstract":"The classification of consumable media by mining relevant text for their identifying features is a subjective process. Previous attempts to perform this type of feature mining have generally been limited in scope due to having limited access to user data. Many of these studies used human domain knowledge to evaluate the accuracy of features extracted using these methods. In this paper, we mine book review text to identify nontrivial features of a set of similar books. We make comparisons between books by looking for books that share characteristics, ultimately performing clustering on the books in our data set. We use the same mining process to identify a corresponding set of characteristics in users. Finally, we evaluate the quality of our methods by examining the correlation between our similarity metric, and user ratings.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128080594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
On recent years, much effort has been put in analyzing the performance of large-scale distributed systems like grids, clouds and inter-clouds with respect to a diversity of resources and user requirements. A common way to achieve this is by using simulation frameworks for evaluating novel models prior to the development of solutions in highly cost settings. In this work we focus on the SimIC simulation toolkit as an innovative discrete event driven solution to mimic the inter-cloud service formation, dissemination, and execution phases, processes that are bundled in the inter-cloud meta-scheduling (ICMS) framework. Our work has meta-inspired characteristics as we determine the inter-cloud as a decentralized and dynamic computing environment where meta-brokers actas distributed management nodes for dynamic and real-time decision making in an identical manner. To this extend, we study the performance of service distributions among clouds based on a variety of metrics (e.g. execution time and turnaround) when different heterogeneous inter-cloud topologies are taking place. We also explore the behavior of the ICMS for different user submissions in terms of their computational requirements. The aim is to produce the results for a benchmark analysis of clouds in order to serve future research efforts on cloud and inter-cloud performance evaluation as benchmarks. The results are diverse in terms of different performance metrics. Especially for the ICMS, an increased performance tendency is observed when the system scales to massive user requests. This implies the improvement on scalability and service elasticity figures.
{"title":"Towards Inter-cloud Simulation Performance Analysis: Exploring Service-Oriented Benchmarks of Clouds in SimIC","authors":"Stelios Sotiriadis, N. Bessis, N. Antonopoulos","doi":"10.1109/WAINA.2013.196","DOIUrl":"https://doi.org/10.1109/WAINA.2013.196","url":null,"abstract":"On recent years, much effort has been put in analyzing the performance of large-scale distributed systems like grids, clouds and inter-clouds with respect to a diversity of resources and user requirements. A common way to achieve this is by using simulation frameworks for evaluating novel models prior to the development of solutions in highly cost settings. In this work we focus on the SimIC simulation toolkit as an innovative discrete event driven solution to mimic the inter-cloud service formation, dissemination, and execution phases, processes that are bundled in the inter-cloud meta-scheduling (ICMS) framework. Our work has meta-inspired characteristics as we determine the inter-cloud as a decentralized and dynamic computing environment where meta-brokers actas distributed management nodes for dynamic and real-time decision making in an identical manner. To this extend, we study the performance of service distributions among clouds based on a variety of metrics (e.g. execution time and turnaround) when different heterogeneous inter-cloud topologies are taking place. We also explore the behavior of the ICMS for different user submissions in terms of their computational requirements. The aim is to produce the results for a benchmark analysis of clouds in order to serve future research efforts on cloud and inter-cloud performance evaluation as benchmarks. The results are diverse in terms of different performance metrics. Especially for the ICMS, an increased performance tendency is observed when the system scales to massive user requests. This implies the improvement on scalability and service elasticity figures.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"347 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125804889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Christian W. Scheiner, Philipp Haas, Niklas Leicht, K. Voigt
Prediction markets illustrate a promising solution to aggregate distributed knowledge playfully. Prediction markets are speculative markets. They are created to aggregate knowledge, which is distributed among the participants in the prediction market. Prediction markets have also been labeled as game market, decision market or virtual stock. The purpose of this study is to summarize recent studies according to the categories basic functionality, design, real or play money, implementation, success factors, and fields of application.
{"title":"Accessing Knowledge with a Game -- A Meta-analysis of Prediction Markets","authors":"Christian W. Scheiner, Philipp Haas, Niklas Leicht, K. Voigt","doi":"10.1109/WAINA.2013.162","DOIUrl":"https://doi.org/10.1109/WAINA.2013.162","url":null,"abstract":"Prediction markets illustrate a promising solution to aggregate distributed knowledge playfully. Prediction markets are speculative markets. They are created to aggregate knowledge, which is distributed among the participants in the prediction market. Prediction markets have also been labeled as game market, decision market or virtual stock. The purpose of this study is to summarize recent studies according to the categories basic functionality, design, real or play money, implementation, success factors, and fields of application.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131560252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mohammed Gharib, E. Emamjomeh-Zadeh, A. Norouzi-Fard, A. Movaghar
Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before resending them. However, storing all keys in every node by this approach is inefficient, if practically possible, in large-scale MANETs due to some limitations such as memory or process capability. In this paper, we propose a new probabilistic key management algorithm for large-scale MANETs. To the best of our knowledge, this is the first method which probabilistically uses asymmetric cryptography to manage the keys in MANETs. In this algorithm, we store only a few keys in each node instead of all. We analytically prove that the network will remain connected with a high probability more than 99:99%. Furthermore, we analytically calculate the average path length in the network and show that this parameter will not have a significant increment using our algorithm. All analytical results are also validated by simulation to make them dependable.
{"title":"A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs","authors":"Mohammed Gharib, E. Emamjomeh-Zadeh, A. Norouzi-Fard, A. Movaghar","doi":"10.1109/WAINA.2013.107","DOIUrl":"https://doi.org/10.1109/WAINA.2013.107","url":null,"abstract":"Mobile ad hoc networks (MANETs) have become very interesting during last years, but the security is the most important problem they suffer from. Asymmetric cryptography is a very useful solution to provide a secure environment in multihop networks where intermediate nodes are able to read, drop or change messages before resending them. However, storing all keys in every node by this approach is inefficient, if practically possible, in large-scale MANETs due to some limitations such as memory or process capability. In this paper, we propose a new probabilistic key management algorithm for large-scale MANETs. To the best of our knowledge, this is the first method which probabilistically uses asymmetric cryptography to manage the keys in MANETs. In this algorithm, we store only a few keys in each node instead of all. We analytically prove that the network will remain connected with a high probability more than 99:99%. Furthermore, we analytically calculate the average path length in the network and show that this parameter will not have a significant increment using our algorithm. All analytical results are also validated by simulation to make them dependable.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131742625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：