Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code to the Scattered Random Network Coding (SRNC) scheme over a multi-hop wireless channel was studied. An interleaver was implemented for bit scattering in the SRNC with the purpose of dividing the encoded data into protected blocks and vulnerable blocks to achieve error diversity in one modulation symbol while randomising errored bits in both blocks. By combining the interleaver with the convolution encoder, the network decoder in the receiver would have enough number of correctly received network coded blocks to perform the decoding process efficiently. Extensive simulations were carried out to study the performance of three systems: 1) SRNC with convolutional encoding, 2) SRNC; and 3) A system without convolutional encoding nor interleaving. Simulation results in terms of block error rate for a 2-hop wireless transmission scenario over an Additive White Gaussian Noise (AWGN) channel were presented. Results showed that the system with interleaving and convolutional code achieved better performance with coding gain of at least 1.29 dB and 2.08 dB on average when the block error rate is 0.01 when compared with system II and system III respectively.
{"title":"Joint Random Linear Network Coding and Convolutional Code with Interleaving for Multihop Wireless Network","authors":"M. Susanto, Yim-Fun Hu, P. Pillai","doi":"10.1109/WAINA.2013.156","DOIUrl":"https://doi.org/10.1109/WAINA.2013.156","url":null,"abstract":"Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code to the Scattered Random Network Coding (SRNC) scheme over a multi-hop wireless channel was studied. An interleaver was implemented for bit scattering in the SRNC with the purpose of dividing the encoded data into protected blocks and vulnerable blocks to achieve error diversity in one modulation symbol while randomising errored bits in both blocks. By combining the interleaver with the convolution encoder, the network decoder in the receiver would have enough number of correctly received network coded blocks to perform the decoding process efficiently. Extensive simulations were carried out to study the performance of three systems: 1) SRNC with convolutional encoding, 2) SRNC; and 3) A system without convolutional encoding nor interleaving. Simulation results in terms of block error rate for a 2-hop wireless transmission scenario over an Additive White Gaussian Noise (AWGN) channel were presented. Results showed that the system with interleaving and convolutional code achieved better performance with coding gain of at least 1.29 dB and 2.08 dB on average when the block error rate is 0.01 when compared with system II and system III respectively.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"67 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":"132174157","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 selection of Cloud providers, whose offers best fit the requirements of a particular application, is a complex issue due to the heterogeneity of the Cloud services, resources, technology and service levels offered by the several providers. In this paper, we illustrate a model for the resolution of a problem of choice between alternatives, when numerous and often contradictory points of view must be taken simultaneously in consideration. We describe its implementation inside Cloud Agency to broker the proposals that best fit user's needs.
{"title":"Multi-objective Decision Support for Brokering of Cloud SLA","authors":"Alba Amato, S. Venticinque","doi":"10.1109/WAINA.2013.149","DOIUrl":"https://doi.org/10.1109/WAINA.2013.149","url":null,"abstract":"The selection of Cloud providers, whose offers best fit the requirements of a particular application, is a complex issue due to the heterogeneity of the Cloud services, resources, technology and service levels offered by the several providers. In this paper, we illustrate a model for the resolution of a problem of choice between alternatives, when numerous and often contradictory points of view must be taken simultaneously in consideration. We describe its implementation inside Cloud Agency to broker the proposals that best fit user's needs.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"200 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":"132149817","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}
Semantic Interoperability is one of the most important open challenges in the Knowledge Management field. In this work, we propose a framework for making easier information exchanging operations among heterogeneous information sources, over the Cloud. Exploiting the Semantic Web technologies, the framework has the objective of allowing semantic interoperability among distributed software agents preserving not only semantics of transmitted messages, but also the subjectivity of agent's world vision in the communication process. The proposed system, in fact, will help users in the digital documents exchanging activities by extracting the related relevant information and coding their informative contents in a shape capable of preserving the original semantics, also in the case of communications agents using different or incompatible vocabularies. The framework is a an evolution of semantic interoperable methodologies towards cloud computer technologies, thus guaranteeing several advantages in terms of usability, scalability and fault tolerance. In particular, we implemented a prototype that provides interoperability functionalities in the E-Health domain, managing information coming from heterogeneous sources.
{"title":"A Framework for Semantic Interoperability over the Cloud","authors":"F. Amato, A. Mazzeo, V. Moscato, A. Picariello","doi":"10.1109/WAINA.2013.218","DOIUrl":"https://doi.org/10.1109/WAINA.2013.218","url":null,"abstract":"Semantic Interoperability is one of the most important open challenges in the Knowledge Management field. In this work, we propose a framework for making easier information exchanging operations among heterogeneous information sources, over the Cloud. Exploiting the Semantic Web technologies, the framework has the objective of allowing semantic interoperability among distributed software agents preserving not only semantics of transmitted messages, but also the subjectivity of agent's world vision in the communication process. The proposed system, in fact, will help users in the digital documents exchanging activities by extracting the related relevant information and coding their informative contents in a shape capable of preserving the original semantics, also in the case of communications agents using different or incompatible vocabularies. The framework is a an evolution of semantic interoperable methodologies towards cloud computer technologies, thus guaranteeing several advantages in terms of usability, scalability and fault tolerance. In particular, we implemented a prototype that provides interoperability functionalities in the E-Health domain, managing information coming from heterogeneous sources.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"23 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":"122141878","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 coming age of "big data'' has been a recent focus of IT companies, governments, and even the World Economic Forum (WEF). The rapid, exponential growth of global data outpaces Moore's law improvements in computing and storage efficiency, creating a growing "energy wall'' in coping with global data. We observe in this paper that this problem is significantly exacerbated by (needed) security mechanisms. We propose for more systematically designed energy-aware security mechanisms.
{"title":"A Case for Energy-Aware Security Mechanisms","authors":"Xun Li, F. Chong","doi":"10.1109/WAINA.2013.5","DOIUrl":"https://doi.org/10.1109/WAINA.2013.5","url":null,"abstract":"The coming age of \"big data'' has been a recent focus of IT companies, governments, and even the World Economic Forum (WEF). The rapid, exponential growth of global data outpaces Moore's law improvements in computing and storage efficiency, creating a growing \"energy wall'' in coping with global data. We observe in this paper that this problem is significantly exacerbated by (needed) security mechanisms. We propose for more systematically designed energy-aware security mechanisms.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"14 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":"116858975","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}
Markus Jung, J. Weidinger, W. Kastner, Alex C. Olivieri
Building automation is a vital part of many use cases related to energy efficiency and smart living in the context of smart cities. State of the art building automation systems like KNX, BACnet or ZigBee are based on control networks mainly used for local control scenarios using non-IP communications. This paper presents an integration approach for building automation systems using an IPv6 enabled service-oriented architecture allowing interconnecting heterogeneous technologies into a large-scale distributed control system. Details on the concept, a proof of concept implementation and performance evaluation results of a multi-protocol gateway are presented, offering a per-device IPv6 interface using a novel CoAP/EXI protocol binding for oBIX. The integration approach aims at providing a homogeneous integration layer that can be used to build advanced control scenarios that might arise in the context of smart cities.
{"title":"Building Automation and Smart Cities: An Integration Approach Based on a Service-Oriented Architecture","authors":"Markus Jung, J. Weidinger, W. Kastner, Alex C. Olivieri","doi":"10.1109/WAINA.2013.200","DOIUrl":"https://doi.org/10.1109/WAINA.2013.200","url":null,"abstract":"Building automation is a vital part of many use cases related to energy efficiency and smart living in the context of smart cities. State of the art building automation systems like KNX, BACnet or ZigBee are based on control networks mainly used for local control scenarios using non-IP communications. This paper presents an integration approach for building automation systems using an IPv6 enabled service-oriented architecture allowing interconnecting heterogeneous technologies into a large-scale distributed control system. Details on the concept, a proof of concept implementation and performance evaluation results of a multi-protocol gateway are presented, offering a per-device IPv6 interface using a novel CoAP/EXI protocol binding for oBIX. The integration approach aims at providing a homogeneous integration layer that can be used to build advanced control scenarios that might arise in the context of smart cities.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"4 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":"115490512","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}
Golam Sarwar, R. Boreli, E. Lochin, A. Mifdaoui, Guillaume Smith
Reliable in order multipath data transfer under asymmetric heterogeneous network conditions has known problems related to receiver's buffer blocking, caused by out of order packet arrival. Several mitigation techniques have been proposed to address this issue mostly by using various packet retransmission schemes, load-balancing and bandwidth-estimation based mechanisms. In comparison to the existing reactive techniques for buffer block mitigation, we propose a novel and yet simpler to implement, delay aware packet scheduling scheme for multipath data transfer over asymmetric network paths, that proactively minimizes the blocking inside receiver's buffer. Our initial simulation results show that, in comparison to the default round robin packet scheduler, by using our proposed delay aware packet scheduling scheme, we can significantly improve overall performance while notably minimizing the receiver's buffer usage, which is also beneficial for multi-homed hand-held mobile devices with limited buffering capacity, which, due to their multi-homing and heterogeneous wireless network features (i.e. availability of 3G and Wi-Fi) are also one of the most common use cases for multi-path transport.
{"title":"Mitigating Receiver's Buffer Blocking by Delay Aware Packet Scheduling in Multipath Data Transfer","authors":"Golam Sarwar, R. Boreli, E. Lochin, A. Mifdaoui, Guillaume Smith","doi":"10.1109/WAINA.2013.80","DOIUrl":"https://doi.org/10.1109/WAINA.2013.80","url":null,"abstract":"Reliable in order multipath data transfer under asymmetric heterogeneous network conditions has known problems related to receiver's buffer blocking, caused by out of order packet arrival. Several mitigation techniques have been proposed to address this issue mostly by using various packet retransmission schemes, load-balancing and bandwidth-estimation based mechanisms. In comparison to the existing reactive techniques for buffer block mitigation, we propose a novel and yet simpler to implement, delay aware packet scheduling scheme for multipath data transfer over asymmetric network paths, that proactively minimizes the blocking inside receiver's buffer. Our initial simulation results show that, in comparison to the default round robin packet scheduler, by using our proposed delay aware packet scheduling scheme, we can significantly improve overall performance while notably minimizing the receiver's buffer usage, which is also beneficial for multi-homed hand-held mobile devices with limited buffering capacity, which, due to their multi-homing and heterogeneous wireless network features (i.e. availability of 3G and Wi-Fi) are also one of the most common use cases for multi-path transport.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"29 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":"115495871","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}
Javier Reyes, J. Orduña, G. Vigueras, Rafael Tornero
The era of distributed computing, where applications are executed on platforms like clusters, grids and/or clouds of computers, have shown the need for taking into account the communications that take place on distributed computer architectures when executing applications. In that environment, different communication-aware mapping techniques were proposed for improving the system performance, both for off-chip and for on-chip networks. Some of these proposals are based on heuristic search for finding pseudo-optimal assignments of a given population of tasks and processing elements. The technology improvement has allowed a significant increase in the problem size, multiplying the number of processor cores in each chip. Therefore, the proposals based on heuristic search must be accelerated in order to search in larger exploration domains within the same execution times. In this paper, we propose a comparative study of the parallel version of the local search method for communication-aware task mapping techniques. Unlike other comparative studies of heuristic methods implemented on GPUs, we compare the performance provided by the parallel version for GPUs with the performance provided by a MPI parallel version in terms of execution times and fitness values provided. The MPI version was executed on a cluster optimized for MPI applications. Also, we have considered a GPU with Fermi architecture and we have mapped the local search algorithm onto the GPU in order to improve the performance. The results show that the parallel implementation on a single GPU provides similar fitness function values than the MPI implementation on the cluster. However, the execution times required by the GPU implementation are significantly lower than the ones required by the MPI implementation, and these differences increase as so does size of the parallel system.
{"title":"Acceleration of Communication-Aware Task Mapping Techniques through GPU Computing","authors":"Javier Reyes, J. Orduña, G. Vigueras, Rafael Tornero","doi":"10.1109/WAINA.2013.38","DOIUrl":"https://doi.org/10.1109/WAINA.2013.38","url":null,"abstract":"The era of distributed computing, where applications are executed on platforms like clusters, grids and/or clouds of computers, have shown the need for taking into account the communications that take place on distributed computer architectures when executing applications. In that environment, different communication-aware mapping techniques were proposed for improving the system performance, both for off-chip and for on-chip networks. Some of these proposals are based on heuristic search for finding pseudo-optimal assignments of a given population of tasks and processing elements. The technology improvement has allowed a significant increase in the problem size, multiplying the number of processor cores in each chip. Therefore, the proposals based on heuristic search must be accelerated in order to search in larger exploration domains within the same execution times. In this paper, we propose a comparative study of the parallel version of the local search method for communication-aware task mapping techniques. Unlike other comparative studies of heuristic methods implemented on GPUs, we compare the performance provided by the parallel version for GPUs with the performance provided by a MPI parallel version in terms of execution times and fitness values provided. The MPI version was executed on a cluster optimized for MPI applications. Also, we have considered a GPU with Fermi architecture and we have mapped the local search algorithm onto the GPU in order to improve the performance. The results show that the parallel implementation on a single GPU provides similar fitness function values than the MPI implementation on the cluster. However, the execution times required by the GPU implementation are significantly lower than the ones required by the MPI implementation, and these differences increase as so does size of the parallel system.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"14 4 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":"116432891","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}
Noura Aljeri, K. Abrougui, M. Almulla, A. Boukerche
Recently we have witnessed a growing interest in Vehicular Ad hoc Networks from the ITS community. Several potential applications of Vehicular Networks aiming at integrating service discovery mechanisms and the latest Internet access technologies are envisioned. However, several challenging issues, such as gateway discovery among others, remain to be resolved before VANET technology becomes a commodity. Indeed, in this case, it is very essential to provide clients with gateway services that better suit their requests while balancing the load on the gateways, in order to reduce the gateways congestion problem. In this paper, we propose to evaluate the performance of a load balanced and introduce a new QoS gateway discovery protocol (Collaged) that permits the connection to heterogeneous wireless networks. The protocol guarantees balancing the load at the gateways levels, as well as the routing paths between gateways and gateway requesters. It also permits gateway requesters to choose and connect to the gateways that satisfy the QoS required by the vehicles. We present our protocol, and discuss its performance evaluation using an extensive set of simulation experiments. Our results indicate that significant improvement were achieved using QoSLAGAD protocol when compared to LAGAD while guaranteeing QoS and balancing the gateways' load.
{"title":"A Performance Evaluation of Load Balancing and QoS-aware Gateway Discovery Protocol for VANETs","authors":"Noura Aljeri, K. Abrougui, M. Almulla, A. Boukerche","doi":"10.1109/WAINA.2013.232","DOIUrl":"https://doi.org/10.1109/WAINA.2013.232","url":null,"abstract":"Recently we have witnessed a growing interest in Vehicular Ad hoc Networks from the ITS community. Several potential applications of Vehicular Networks aiming at integrating service discovery mechanisms and the latest Internet access technologies are envisioned. However, several challenging issues, such as gateway discovery among others, remain to be resolved before VANET technology becomes a commodity. Indeed, in this case, it is very essential to provide clients with gateway services that better suit their requests while balancing the load on the gateways, in order to reduce the gateways congestion problem. In this paper, we propose to evaluate the performance of a load balanced and introduce a new QoS gateway discovery protocol (Collaged) that permits the connection to heterogeneous wireless networks. The protocol guarantees balancing the load at the gateways levels, as well as the routing paths between gateways and gateway requesters. It also permits gateway requesters to choose and connect to the gateways that satisfy the QoS required by the vehicles. We present our protocol, and discuss its performance evaluation using an extensive set of simulation experiments. Our results indicate that significant improvement were achieved using QoSLAGAD protocol when compared to LAGAD while guaranteeing QoS and balancing the gateways' load.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"6 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":"117039779","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}
With the development of web services and its extension with Semantic Web augmented-Semantic Web Services (SWS), the modern approaches for business-to-business integration (B2Bi) focus on their business process integration between enterprises. Cross-enterprise collaboration is one of challenges on the B2Bi research nowadays. With the support of Semantic Web technologies, the gap between business and IT communities has been reduced in order to tackle the challenge. Semantic Web-based approaches for BPM have been foreseen as a promising solution with taking advantages of Semantic Web technologies such as ontologies, SWS. Taking into account the challenge of dynamically forming collaborative business processes with attached services into the execution, in this paper, based on our previous work, we propose a semantic framework for forming a dynamic collaboration of business processes within our BizKB systems for across-enterprise collaboration. We focus on a dynamic service discovery based on the consensus methodology.
{"title":"A Ontological Collaborative Framework for Bussiness Process Integration","authors":"M. Hoang, T. Nguyen, H. Hoang","doi":"10.1109/WAINA.2013.188","DOIUrl":"https://doi.org/10.1109/WAINA.2013.188","url":null,"abstract":"With the development of web services and its extension with Semantic Web augmented-Semantic Web Services (SWS), the modern approaches for business-to-business integration (B2Bi) focus on their business process integration between enterprises. Cross-enterprise collaboration is one of challenges on the B2Bi research nowadays. With the support of Semantic Web technologies, the gap between business and IT communities has been reduced in order to tackle the challenge. Semantic Web-based approaches for BPM have been foreseen as a promising solution with taking advantages of Semantic Web technologies such as ontologies, SWS. Taking into account the challenge of dynamically forming collaborative business processes with attached services into the execution, in this paper, based on our previous work, we propose a semantic framework for forming a dynamic collaboration of business processes within our BizKB systems for across-enterprise collaboration. We focus on a dynamic service discovery based on the consensus methodology.","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":"123425414","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}
In this paper we propose a redeployment scheme of Wireless Sensor Network (WSN) nodes based on a stochastic process. WSN suffers from formation of hole in the network due to its asymmetric deployment, unbalanced energy consumption and intentional destruction of nodes in the network. The dynamic increase in Quality-of-Service (QoS) parameters such as coverage and connectivity also may lead to formation of holes which in turn degrades the performance of the network. Therefore, in order to maintain a desired QoS, a sensor redeployment scheme is important in WSN. During its lifecycle, a sensor node experiences active, sleep, diagnose, vulnerable, repair, and fail states. We analyze the Markov process and obtain the steady state probabilities for all the states. The availability of the nodes is presented with the help of SHARPE tool. Our work utilizes Discrete-Time Markov Chain and a Semi-Markov Process to illustrate the probabilities of WSN node in various states. The required redeployment nodes are then computed based on a stochastic analysis of the system and subject to the QoS requirements of the network.
{"title":"A Stochastic Process Based Framework of Redeployment Model for Wireless Sensor Network","authors":"Ravindara Bhatt, R. Datta","doi":"10.1109/WAINA.2013.176","DOIUrl":"https://doi.org/10.1109/WAINA.2013.176","url":null,"abstract":"In this paper we propose a redeployment scheme of Wireless Sensor Network (WSN) nodes based on a stochastic process. WSN suffers from formation of hole in the network due to its asymmetric deployment, unbalanced energy consumption and intentional destruction of nodes in the network. The dynamic increase in Quality-of-Service (QoS) parameters such as coverage and connectivity also may lead to formation of holes which in turn degrades the performance of the network. Therefore, in order to maintain a desired QoS, a sensor redeployment scheme is important in WSN. During its lifecycle, a sensor node experiences active, sleep, diagnose, vulnerable, repair, and fail states. We analyze the Markov process and obtain the steady state probabilities for all the states. The availability of the nodes is presented with the help of SHARPE tool. Our work utilizes Discrete-Time Markov Chain and a Semi-Markov Process to illustrate the probabilities of WSN node in various states. The required redeployment nodes are then computed based on a stochastic analysis of the system and subject to the QoS requirements of the network.","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":"123753023","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
扫码关注我们
求助内容：
应助结果提醒方式：