Publish/subscribe (P/S) systems have been widely studied and applied in wired networks. However, their deployment on mobile ad hoc networks still presents a lot of challenges especially when there are quality of service (QoS) requirements. In this paper, we approach these challenges by looking first at network routing protocols. We present experimentations that allow to study the reaction of these protocols against QoS degradation that occur at the middleware layer. Based on an empirical study, we show that the routing layer is generally not aware about QoS degradations and so it does not react when they occur. Thus, a reaction in the middleware layer have to be developed in order to achieve a reasonable performance.
{"title":"Experimentations for QoS Evaluation of Publish/Subscribe Systems Deployed on Ad-hoc Network","authors":"Imene Lahyani, M. Jmaiel","doi":"10.1109/WAINA.2011.139","DOIUrl":"https://doi.org/10.1109/WAINA.2011.139","url":null,"abstract":"Publish/subscribe (P/S) systems have been widely studied and applied in wired networks. However, their deployment on mobile ad hoc networks still presents a lot of challenges especially when there are quality of service (QoS) requirements. In this paper, we approach these challenges by looking first at network routing protocols. We present experimentations that allow to study the reaction of these protocols against QoS degradation that occur at the middleware layer. Based on an empirical study, we show that the routing layer is generally not aware about QoS degradations and so it does not react when they occur. Thus, a reaction in the middleware layer have to be developed in order to achieve a reasonable performance.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134460842","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}
J. Demongeot, Adrien Elena, Mathilde Noual, Sylvain Sené
The multi-scale strategy in studying biological regulatory networks analysis is based on two level of analysis. The first level is structural and consists in examining the architecture of the interaction graph underlying the network and the second level is functional and analyse the regulatory properties of the network. We apply this dual approach to the "immunetworks" involved in the control of the immune system. As a result, we show that the small number of attractors of these networks is due to the presence of intersecting circuits in their interaction graphs. We obtain an upper bound of the number of attractors of the whole network by multiplying the number of attractors of each of its strongly connected components. We detect first the strongly connected components in the architecture of the interaction digraph of the network. Secondly, we study the dynamical function of the attractors by looking further inside these components, notably when they form circuits (intersecting or not).
{"title":"Random Boolean Networks and Attractors of their Intersecting Circuits","authors":"J. Demongeot, Adrien Elena, Mathilde Noual, Sylvain Sené","doi":"10.1109/WAINA.2011.154","DOIUrl":"https://doi.org/10.1109/WAINA.2011.154","url":null,"abstract":"The multi-scale strategy in studying biological regulatory networks analysis is based on two level of analysis. The first level is structural and consists in examining the architecture of the interaction graph underlying the network and the second level is functional and analyse the regulatory properties of the network. We apply this dual approach to the \"immunetworks\" involved in the control of the immune system. As a result, we show that the small number of attractors of these networks is due to the presence of intersecting circuits in their interaction graphs. We obtain an upper bound of the number of attractors of the whole network by multiplying the number of attractors of each of its strongly connected components. We detect first the strongly connected components in the architecture of the interaction digraph of the network. Secondly, we study the dynamical function of the attractors by looking further inside these components, notably when they form circuits (intersecting or not).","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132095","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}
Web service failures or degradations directly cause operational inefficiencies and financial losses in Web service-based business processes (WSBP). In today’s competitive Web service market a considerable number of functionally-similar Web services offered by different providers are differentiated by competitive QoS levels and pricing structures. Consequently, dynamic and optimal Web service selection is a significant challenge to business organizations which run such WSBPs. Having a cost-effective and efficient Web service selection approach is becoming an important necessity for such organizations. Current Web service selection approaches offer "one-size-fits-all"; solution, i.e., one optimal service selection for all running BP instances. However, such solutions are neither efficient nor cost-effective given that the service levels of WSBPs are associated with customers classes/profiles, e.g., Gold, Silver or Bronze. Therefore, we propose a group-based Web service selection approach, "one-size-does-not-fit-all", that optimizes multiple QoS criteria and differentiate the service selection based on the BP customers classes/profiles. Our approach shows a very good improvement over existing "one-size-fits-all" approaches; 65% average cost reduction and 30% utility value improvement.
{"title":"One Size Does Not Fit All: A Group-Based Service Selection for Web-Based Business Processes","authors":"Basem Suleiman, Carlos Eduardo da Silva, S. Sakr","doi":"10.1109/WAINA.2011.106","DOIUrl":"https://doi.org/10.1109/WAINA.2011.106","url":null,"abstract":"Web service failures or degradations directly cause operational inefficiencies and financial losses in Web service-based business processes (WSBP). In today’s competitive Web service market a considerable number of functionally-similar Web services offered by different providers are differentiated by competitive QoS levels and pricing structures. Consequently, dynamic and optimal Web service selection is a significant challenge to business organizations which run such WSBPs. Having a cost-effective and efficient Web service selection approach is becoming an important necessity for such organizations. Current Web service selection approaches offer \"one-size-fits-all\"; solution, i.e., one optimal service selection for all running BP instances. However, such solutions are neither efficient nor cost-effective given that the service levels of WSBPs are associated with customers classes/profiles, e.g., Gold, Silver or Bronze. Therefore, we propose a group-based Web service selection approach, \"one-size-does-not-fit-all\", that optimizes multiple QoS criteria and differentiate the service selection based on the BP customers classes/profiles. Our approach shows a very good improvement over existing \"one-size-fits-all\" approaches; 65% average cost reduction and 30% utility value improvement.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133408561","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}
Dynamic spectrum management is the key technology in cognitive radio network, of which the first task is spectrum sensing. So spectrum sensing plays an importance role in cognitive radio network. In this paper a new spectrum sensing algorithm is proposed, which is based on compressive sensing (CS) and multitaper method combined with singular-value decomposition (MTM-SVD) to estimate frequency spectrum and detect spectrum hole. The new algorithm is validated by the data from GSM network, and simulation results show that the new algorithm can achieve good detection performance and afford reduced sampling rate.
{"title":"A Novel Spectrum Sensing Algorithm Based on Compressive Sensing for Cognitive Radio","authors":"Linjing Zhao, X. Chen, Gang Zhang","doi":"10.1109/WAINA.2011.50","DOIUrl":"https://doi.org/10.1109/WAINA.2011.50","url":null,"abstract":"Dynamic spectrum management is the key technology in cognitive radio network, of which the first task is spectrum sensing. So spectrum sensing plays an importance role in cognitive radio network. In this paper a new spectrum sensing algorithm is proposed, which is based on compressive sensing (CS) and multitaper method combined with singular-value decomposition (MTM-SVD) to estimate frequency spectrum and detect spectrum hole. The new algorithm is validated by the data from GSM network, and simulation results show that the new algorithm can achieve good detection performance and afford reduced sampling rate.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125397869","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}
S. Ushio, Yuka Ito, K. Okada, Tomoki Kitahara, Hidenori Tsuji, Satoko Moriguchi, M. Narita, Y. Kato
In this paper, we propose the Network Service Platform (NSP), which is a framework to develop network services using real-world data efficiently, and implement its application. We implemented a prototype system based on NSP using GPS data and image data obtained from cell phones. This service integrates internet services with ubiquitous services by using the Robot Service Network Protocol (RSNP), an open standard protocol for robot services. Through the implementation of the prototype system, we confirm the effectiveness of NSP to develop network services.
本文提出了网络服务平台(Network Service Platform, NSP)，它是一个利用真实数据高效开发网络服务并实现其应用的框架。我们利用GPS数据和手机图像数据实现了一个基于NSP的原型系统。该服务通过使用机器人服务网络协议(RSNP)将互联网服务与无处不在的服务集成在一起，RSNP是机器人服务的开放标准协议。通过原型系统的实现，验证了NSP开发网络业务的有效性。
{"title":"The Digital Travel Diary System Using the Network Service Platform","authors":"S. Ushio, Yuka Ito, K. Okada, Tomoki Kitahara, Hidenori Tsuji, Satoko Moriguchi, M. Narita, Y. Kato","doi":"10.1109/WAINA.2011.110","DOIUrl":"https://doi.org/10.1109/WAINA.2011.110","url":null,"abstract":"In this paper, we propose the Network Service Platform (NSP), which is a framework to develop network services using real-world data efficiently, and implement its application. We implemented a prototype system based on NSP using GPS data and image data obtained from cell phones. This service integrates internet services with ubiquitous services by using the Robot Service Network Protocol (RSNP), an open standard protocol for robot services. Through the implementation of the prototype system, we confirm the effectiveness of NSP to develop network services.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127937828","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}
Raw materials for generating energy and producing goods are not always extracted where they are needed, namely in the sphere of man settlement. It is likely that growing numbers of workers are required to work in remote habitats. Being in such rural conditions is a costly, complex and difficult undertaking for both, the companies and their labour force. The Smart Camp project merges several challenges that we face nowadays. It aims to address the high expenses and emissions from off-grid energy generation. Furthermore, finding a work-life balance and dealing with the concomitant everyday problems in a remote area results in human social and psychological issues. This project also aims to use digital convergence technologies and techniques in order to deal with these challenges. This paper reports the status quo of research that has been done in this area and gives and introduction to the project.
{"title":"SMART CAMP: Benefits of Media and Smart Service Convergence","authors":"Lukas J. Oslislo, A. Talevski, A. Karduck","doi":"10.1109/WAINA.2011.35","DOIUrl":"https://doi.org/10.1109/WAINA.2011.35","url":null,"abstract":"Raw materials for generating energy and producing goods are not always extracted where they are needed, namely in the sphere of man settlement. It is likely that growing numbers of workers are required to work in remote habitats. Being in such rural conditions is a costly, complex and difficult undertaking for both, the companies and their labour force. The Smart Camp project merges several challenges that we face nowadays. It aims to address the high expenses and emissions from off-grid energy generation. Furthermore, finding a work-life balance and dealing with the concomitant everyday problems in a remote area results in human social and psychological issues. This project also aims to use digital convergence technologies and techniques in order to deal with these challenges. This paper reports the status quo of research that has been done in this area and gives and introduction to the project.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125171273","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}
Izabela Moise, M. Hurfin, Linda Zeghache, N. Badache
Mobile devices are now equipped with multiple sensors and networking capabilities. They can gather information about their surrounding environment and interact both with nearby nodes, using a dynamic and self-configurable ad-hoc network, and with distant nodes via the Internet. While the concept of mobile agent is appropriate to explore the ad-hoc network and autonomously discover service providers, it is not suitable for the implementation of strong distributed synchronization mechanisms. Moreover, the termination of a task assigned to an agent may be compromised if the persistence of the agent itself is not ensured. In the case of a transactional mobile agent, we identify two services, Availability of the Sources and Atomic Commit, that can be supplied by more powerful entities located in a cloud. We propose a solution where these two services are provided in a reliable and homogeneous way. To guarantee reliability, the proposed solution relies on a single agreement protocol that orders continuously all the new actions whatever the related transaction and service.
{"title":"Cloud-Based Support for Transactional Mobile Agents","authors":"Izabela Moise, M. Hurfin, Linda Zeghache, N. Badache","doi":"10.1109/WAINA.2011.138","DOIUrl":"https://doi.org/10.1109/WAINA.2011.138","url":null,"abstract":"Mobile devices are now equipped with multiple sensors and networking capabilities. They can gather information about their surrounding environment and interact both with nearby nodes, using a dynamic and self-configurable ad-hoc network, and with distant nodes via the Internet. While the concept of mobile agent is appropriate to explore the ad-hoc network and autonomously discover service providers, it is not suitable for the implementation of strong distributed synchronization mechanisms. Moreover, the termination of a task assigned to an agent may be compromised if the persistence of the agent itself is not ensured. In the case of a transactional mobile agent, we identify two services, Availability of the Sources and Atomic Commit, that can be supplied by more powerful entities located in a cloud. We propose a solution where these two services are provided in a reliable and homogeneous way. To guarantee reliability, the proposed solution relies on a single agreement protocol that orders continuously all the new actions whatever the related transaction and service.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130563051","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 network-engineering (NE) approach for improving the availability of light paths over WDM networks. By rearranging the availability of links, the average availability of light paths can be improved without sacrificing performance in terms of blocking probability and investing extra capital expenditures (CAPEX) and operational expenditures (OPEX).
{"title":"A Simple Network-Engineering Approach for Improving Connection Availability in WDM Networks","authors":"Hung-Yi Chang, I-Kai Chen, Wen-Ching Chiang","doi":"10.1109/WAINA.2011.27","DOIUrl":"https://doi.org/10.1109/WAINA.2011.27","url":null,"abstract":"In this paper, we propose a network-engineering (NE) approach for improving the availability of light paths over WDM networks. By rearranging the availability of links, the average availability of light paths can be improved without sacrificing performance in terms of blocking probability and investing extra capital expenditures (CAPEX) and operational expenditures (OPEX).","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120969777","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}
Currently the user’s web search is disjoint from the resources which is subsequently browsed. Specifically the related instances of the search are not displayed on the following pages. This lack of continuity between the actual search and the web sites displayed may lead to skimming by the user to identify what is relevant on the pages. This paper presents an approach to the continuous modeling of a user’s interests through a browser based plug-in that may be used to inform the intelligent highlighting of content on the browsed pages. Specifically the paper presents two related systems, one for capturing and modeling the user’s browsing behavior and the second for leveraging the power of linked data to highlight information relevant to the user’s interests. The design, implementation and evaluation of both systems are presented as well as a conclusion and outlook for further work.
{"title":"Non-invasive Browser Based User Modeling Towards Semantically Enhanced Personlization of the Open Web","authors":"K. Koidl, Owen Conlan, Lai Wei, Ann Marie Saxton","doi":"10.1109/WAINA.2011.151","DOIUrl":"https://doi.org/10.1109/WAINA.2011.151","url":null,"abstract":"Currently the user’s web search is disjoint from the resources which is subsequently browsed. Specifically the related instances of the search are not displayed on the following pages. This lack of continuity between the actual search and the web sites displayed may lead to skimming by the user to identify what is relevant on the pages. This paper presents an approach to the continuous modeling of a user’s interests through a browser based plug-in that may be used to inform the intelligent highlighting of content on the browsed pages. Specifically the paper presents two related systems, one for capturing and modeling the user’s browsing behavior and the second for leveraging the power of linked data to highlight information relevant to the user’s interests. The design, implementation and evaluation of both systems are presented as well as a conclusion and outlook for further work.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129531946","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}
Behnam Dezfouli, Marjan Radi, M. Nematbakhsh, S. Razak
In the MAC protocols based on the S-MAC scheme, usually the combination of periodic sleep/listen scheduling and four-way handshake mechanism is employed to reduce idle listening and avoid interference. However, this combination greatly degrades network capacity and results in high end-to-end latency. In this paper, we propose Adaptive IAMAC to increase channel utilization and improve communication efficiency, specifically in large-scale sensor networks with low duty cycle. Adaptive IAMAC allows multiple nodes to transmit to their common parent during a frame. Moreover, it includes the adaptive parent selection mechanism, which enables the nodes to change their parent according to the currently overheard control packets at the MAC layer. Through these techniques, Adaptive IAMAC enhances network throughput, reduces end-to-end latency, and moderates the overhead of four-way handshake mechanism. Simulation results confirm that Adaptive IAMAC provides significant improvements over S-MAC in terms of throughput, latency, and energy efficiency.
{"title":"A Medium Access Control Protocol with Adaptive Parent Selection Mechanism for Large-Scale Sensor Networks","authors":"Behnam Dezfouli, Marjan Radi, M. Nematbakhsh, S. Razak","doi":"10.1109/WAINA.2011.124","DOIUrl":"https://doi.org/10.1109/WAINA.2011.124","url":null,"abstract":"In the MAC protocols based on the S-MAC scheme, usually the combination of periodic sleep/listen scheduling and four-way handshake mechanism is employed to reduce idle listening and avoid interference. However, this combination greatly degrades network capacity and results in high end-to-end latency. In this paper, we propose Adaptive IAMAC to increase channel utilization and improve communication efficiency, specifically in large-scale sensor networks with low duty cycle. Adaptive IAMAC allows multiple nodes to transmit to their common parent during a frame. Moreover, it includes the adaptive parent selection mechanism, which enables the nodes to change their parent according to the currently overheard control packets at the MAC layer. Through these techniques, Adaptive IAMAC enhances network throughput, reduces end-to-end latency, and moderates the overhead of four-way handshake mechanism. Simulation results confirm that Adaptive IAMAC provides significant improvements over S-MAC in terms of throughput, latency, and energy efficiency.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133947960","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
扫码关注我们
求助内容：
应助结果提醒方式：