This paper proposes a variation to the classic implementation of Automatic Repeat reQuest (ARQ) which is particularly suitable for the long delay channels, as can be found, for example, in the underwater environment. The proposed technique, called Selective Repeat with a Second Replica ARQ, (SR)^2 ARQ, follows the same rationale as Selective Repeat ARQ, but, upon NACK reception, schedules two retransmissions, one taking place immediately, and the other put in a special queue to be released after further retransmissions, but before new packet transmissions. We propose an exact analysis of this technique, proving its ability of trading throughput for shorter delivery delay; thus, it is suitable for scenarios where the required data rate is not high, but a timely data delivery is very important, as is the case, for example, for underwater monitoring applications.
{"title":"Analysis of an Automatic Repeat Request Scheme Addressing Long Delay Channels","authors":"L. Badia, P. Casari, M. Levorato, M. Zorzi","doi":"10.1109/WAINA.2009.172","DOIUrl":"https://doi.org/10.1109/WAINA.2009.172","url":null,"abstract":"This paper proposes a variation to the classic implementation of Automatic Repeat reQuest (ARQ) which is particularly suitable for the long delay channels, as can be found, for example, in the underwater environment. The proposed technique, called Selective Repeat with a Second Replica ARQ, (SR)^2 ARQ, follows the same rationale as Selective Repeat ARQ, but, upon NACK reception, schedules two retransmissions, one taking place immediately, and the other put in a special queue to be released after further retransmissions, but before new packet transmissions. We propose an exact analysis of this technique, proving its ability of trading throughput for shorter delivery delay; thus, it is suitable for scenarios where the required data rate is not high, but a timely data delivery is very important, as is the case, for example, for underwater monitoring applications.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131594011","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}
This article aims at giving some new theoretical properties of threshold Boolean automata networks which are good mathematical objects to model biological regulatory networks. The objective is the emphasis of a necessary condition for which these networks, when they are governed by a non-linear evolution law, are sensitive to the influence of boundary conditions. Then, this paper opens an argued discussion about the notion of "symmetrisability'' of regulatory networks which is relevant to understand some specific dynamical behaviours of real biological networks, and shows that this notion allows to explain an important feature of the emph{Arabidopsis thaliana} floral morphogenesis model.
{"title":"Loss of Linearity and Symmetrisation in Regulatory Networks","authors":"J. Demongeot, E. Ch., Sylvain Sené","doi":"10.1109/WAINA.2009.64","DOIUrl":"https://doi.org/10.1109/WAINA.2009.64","url":null,"abstract":"This article aims at giving some new theoretical properties of threshold Boolean automata networks which are good mathematical objects to model biological regulatory networks. The objective is the emphasis of a necessary condition for which these networks, when they are governed by a non-linear evolution law, are sensitive to the influence of boundary conditions. Then, this paper opens an argued discussion about the notion of \"symmetrisability'' of regulatory networks which is relevant to understand some specific dynamical behaviours of real biological networks, and shows that this notion allows to explain an important feature of the emph{Arabidopsis thaliana} floral morphogenesis model.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127708426","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 introduce a new idea of Revision Tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. Revision Tree with hierarchical 3D structure is visualized in space and operated by users to refer the past space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communication among many users over computer network. Using this method, the users as group members can progress collaborative work and confirm the past CVE without prior communication even if some of the group members do not participate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.
{"title":"Asynchronous Collaborative Support System by Revision Tree Method","authors":"Hiroki Ogasawara, Y. Shibata","doi":"10.1109/WAINA.2009.180","DOIUrl":"https://doi.org/10.1109/WAINA.2009.180","url":null,"abstract":"In this paper, we introduce a new idea of Revision Tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. Revision Tree with hierarchical 3D structure is visualized in space and operated by users to refer the past space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communication among many users over computer network. Using this method, the users as group members can progress collaborative work and confirm the past CVE without prior communication even if some of the group members do not participate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124983204","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}
Large scale search engines nowadays use distributed Web crawlers to collect Web pages because it is impractical for a single machine to download the entire Web. Load balancing of such crawlers is an important task because of limitations in memory/resources of each crawling machine. Existing distributed crawlers use simple URL hashing based on site names as their partitioning policy. This can be done in a distributed environment using consistent hashing to dynamically manage joining and leaving of crawling nodes. This method is formally claimed to be load balanced in cases that hashing method is uniform. Given that the Web structure abides by power law distribution according to existing statistics, we argue that it is not at all possible for a uniform random hash function based on site's URL to be load balanced for case of large scale distributed Web crawlers. We show the truth of this claim by applying Web statistics to consistent hashing as it is used in one of famous Web crawlers. We also report some experimental results to demonstrate the effect of load balancing when we just rely on hash of host names.
{"title":"Load Balancing Using Consistent Hashing: A Real Challenge for Large Scale Distributed Web Crawlers","authors":"M. Nasri, M. Sharifi","doi":"10.1109/WAINA.2009.96","DOIUrl":"https://doi.org/10.1109/WAINA.2009.96","url":null,"abstract":"Large scale search engines nowadays use distributed Web crawlers to collect Web pages because it is impractical for a single machine to download the entire Web. Load balancing of such crawlers is an important task because of limitations in memory/resources of each crawling machine. Existing distributed crawlers use simple URL hashing based on site names as their partitioning policy. This can be done in a distributed environment using consistent hashing to dynamically manage joining and leaving of crawling nodes. This method is formally claimed to be load balanced in cases that hashing method is uniform. Given that the Web structure abides by power law distribution according to existing statistics, we argue that it is not at all possible for a uniform random hash function based on site's URL to be load balanced for case of large scale distributed Web crawlers. We show the truth of this claim by applying Web statistics to consistent hashing as it is used in one of famous Web crawlers. We also report some experimental results to demonstrate the effect of load balancing when we just rely on hash of host names.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125226743","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}
As semantic web grows, security concerns increase. One concern is controlling accesses to resources in this environment. In order to infer whether the access is allowed or not, different information of different entities including contextual information should be involved. From access control point of view, we divide the entities in semantic web into three categories: resources (objects), requesters (subjects), and environment (infrastructure, time, and location). In this paper, we present a semantic-based context-aware access control framework to be applied in semantic web, considered as a multi-domain environment. To handle context information in the framework, we propose a context ontology to represent contextual information and employ it in the inference engine. The proposed ontology classifies the context of a semantic web environment and represents the elements of contextual information and their relationship in an abstract level. We illustrate how the access control framework handles the contextual information with the proposed context ontology.
{"title":"Handling Context in a Semantic-Based Access Control Framework","authors":"M. Ehsan, M. Amini, R. Jalili","doi":"10.1109/WAINA.2009.87","DOIUrl":"https://doi.org/10.1109/WAINA.2009.87","url":null,"abstract":"As semantic web grows, security concerns increase. One concern is controlling accesses to resources in this environment. In order to infer whether the access is allowed or not, different information of different entities including contextual information should be involved. From access control point of view, we divide the entities in semantic web into three categories: resources (objects), requesters (subjects), and environment (infrastructure, time, and location). In this paper, we present a semantic-based context-aware access control framework to be applied in semantic web, considered as a multi-domain environment. To handle context information in the framework, we propose a context ontology to represent contextual information and employ it in the inference engine. The proposed ontology classifies the context of a semantic web environment and represents the elements of contextual information and their relationship in an abstract level. We illustrate how the access control framework handles the contextual information with the proposed context ontology.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132148609","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}
Developing a capacity to test distributed systems hinges on being able to generate the workloads that these systems are to process. Appropriate tools must not only generate these workloads in real-time, but must also be able to sweep through a range of possible workload characteristics to support sensitivity and robustness analyses. Currently, the majority of prior work in this area, including Harpoon, ns-2, OpNet, and tcp replay, has focused on the reproduction of workload traces at the network-level. However, for many distributed systems, reproducing application-level workload characteristics is more informative from a testing perspective. This work details such an application-level workload generation tool. The tool itself is distributed and, hence, easily scales to using multiple machines to re-create complex multi-homed workloads. Furthermore, the tool supports the standard abilities to produce both statistically-described workloads, as well as reinstantiating previously-captured workload traces.
{"title":"A Distributed Application-Level IT System Workload Generator","authors":"C. Mueller, M. Horie, S. Neville","doi":"10.1109/WAINA.2009.121","DOIUrl":"https://doi.org/10.1109/WAINA.2009.121","url":null,"abstract":"Developing a capacity to test distributed systems hinges on being able to generate the workloads that these systems are to process. Appropriate tools must not only generate these workloads in real-time, but must also be able to sweep through a range of possible workload characteristics to support sensitivity and robustness analyses. Currently, the majority of prior work in this area, including Harpoon, ns-2, OpNet, and tcp replay, has focused on the reproduction of workload traces at the network-level. However, for many distributed systems, reproducing application-level workload characteristics is more informative from a testing perspective. This work details such an application-level workload generation tool. The tool itself is distributed and, hence, easily scales to using multiple machines to re-create complex multi-homed workloads. Furthermore, the tool supports the standard abilities to produce both statistically-described workloads, as well as reinstantiating previously-captured workload traces.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133301605","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}
M. El-Azhari, Othman A. Al-Amoudi, M. Woodward, I. Awan
Discovering and maintaining routes between nodes are one of the biggest challenges in MANETs the ultimate goal of the MANET community is to provide a set of standardized protocols that can be both robust and scalable. This paper proposes routing protocols based on the {heading direction angle + Number of Hops, Number of Hops + heading direction angle, the best heading direction angle route}. The first one is designed to calculate the angle direction and when the angles are the same take the best hop count. The second one is designed to calculate the best hop count and when the hops counts are the same take the best angle direction. The last one is designed to calculate the average of all heading direction angles in the route and find the best route from the source to the destination. We measure the performance of the proposed approach by comparing it with the well known On-Demand (reactive) routing protocol (AODV).
{"title":"Performance Analysis in AODV Based Protocols for MANETs","authors":"M. El-Azhari, Othman A. Al-Amoudi, M. Woodward, I. Awan","doi":"10.1109/WAINA.2009.82","DOIUrl":"https://doi.org/10.1109/WAINA.2009.82","url":null,"abstract":"Discovering and maintaining routes between nodes are one of the biggest challenges in MANETs the ultimate goal of the MANET community is to provide a set of standardized protocols that can be both robust and scalable. This paper proposes routing protocols based on the {heading direction angle + Number of Hops, Number of Hops + heading direction angle, the best heading direction angle route}. The first one is designed to calculate the angle direction and when the angles are the same take the best hop count. The second one is designed to calculate the best hop count and when the hops counts are the same take the best angle direction. The last one is designed to calculate the average of all heading direction angles in the route and find the best route from the source to the destination. We measure the performance of the proposed approach by comparing it with the well known On-Demand (reactive) routing protocol (AODV).","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114603203","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}
Goshi Sato, Daisuke Asahizawa, Yasuhiro Kawano, Y. Shibata
In this paper, we introduce a mobile network for disaster communication network by combination of different wireless LANs and mobile network. Currently available wireless LANs such as IEEE802.11b,g,j,n, IEEE802.16, cellular network are combined with a mobile router and loaded on a car to build a cognitive radio LAN node. Using multiple mobile network nodes, a large disaster communication network is organized. A communication path between nodes has multiple links and the suitable links among them is selected based on the distance, power and transmission frequency. By multi-hopping those nodes, user can communicate with other user and send/receive disaster information even though some of information infrastructure are damaged. In this paper, we designed a wireless mobile network with currently available different wireless LANs and constructed a prototyped system to evaluate the functional and performance.
{"title":"Disaster Information Network by Cognitive Radio LANs","authors":"Goshi Sato, Daisuke Asahizawa, Yasuhiro Kawano, Y. Shibata","doi":"10.1109/WAINA.2009.178","DOIUrl":"https://doi.org/10.1109/WAINA.2009.178","url":null,"abstract":"In this paper, we introduce a mobile network for disaster communication network by combination of different wireless LANs and mobile network. Currently available wireless LANs such as IEEE802.11b,g,j,n, IEEE802.16, cellular network are combined with a mobile router and loaded on a car to build a cognitive radio LAN node. Using multiple mobile network nodes, a large disaster communication network is organized. A communication path between nodes has multiple links and the suitable links among them is selected based on the distance, power and transmission frequency. By multi-hopping those nodes, user can communicate with other user and send/receive disaster information even though some of information infrastructure are damaged. In this paper, we designed a wireless mobile network with currently available different wireless LANs and constructed a prototyped system to evaluate the functional and performance.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121501342","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}
Dynamical systems like neural networks based on lateral inhibition have a large field of applications in image processing, robotics and morphogenesis modelling. In this paper, we deal with a double approach, image processing and neural networks modelling both based on lateral inhibition in Markov random field to understand a degenerative disease, the retinitis pigmentosa.
{"title":"Imaging and Modelling of a Degenerative Disease of Retina","authors":"M. Tayyab, Y. Usson, T. Léveillard, J. Demongeot","doi":"10.1109/WAINA.2009.129","DOIUrl":"https://doi.org/10.1109/WAINA.2009.129","url":null,"abstract":"Dynamical systems like neural networks based on lateral inhibition have a large field of applications in image processing, robotics and morphogenesis modelling. In this paper, we deal with a double approach, image processing and neural networks modelling both based on lateral inhibition in Markov random field to understand a degenerative disease, the retinitis pigmentosa.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013134","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}
R. Tynan, M. O'Grady, Gregory M. P. O'Hare, C. Muldoon
The number of active nodes in a WSN deployment governs both the longevity of the network and the accuracy of applications using the network's data. As node hibernation techniques become more sophisticated, it is important that an accurate evaluation methodology is employed to ensure fair comparisons across different techniques. Examining both energy and accuracy ensures a claim of increased longevity can be contrasted against its associated drop, if any, in application accuracy. This change can also be as a result of increased latency and the accuracy encapsulates many aspects of WSN performance in one metric. In this work, we detail the first in a series of experiments designed to demonstrate WSN trade offs using a mobility tracking application to benchmark accuracy. Additionally, we demonstrate experimental evidence for a potential adaptive mobility tracking protocol.
{"title":"Benchmarking Latency Effects on Mobility Tracking in WSNs","authors":"R. Tynan, M. O'Grady, Gregory M. P. O'Hare, C. Muldoon","doi":"10.1109/WAINA.2009.120","DOIUrl":"https://doi.org/10.1109/WAINA.2009.120","url":null,"abstract":"The number of active nodes in a WSN deployment governs both the longevity of the network and the accuracy of applications using the network's data. As node hibernation techniques become more sophisticated, it is important that an accurate evaluation methodology is employed to ensure fair comparisons across different techniques. Examining both energy and accuracy ensures a claim of increased longevity can be contrasted against its associated drop, if any, in application accuracy. This change can also be as a result of increased latency and the accuracy encapsulates many aspects of WSN performance in one metric. In this work, we detail the first in a series of experiments designed to demonstrate WSN trade offs using a mobility tracking application to benchmark accuracy. Additionally, we demonstrate experimental evidence for a potential adaptive mobility tracking protocol.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"57 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123313650","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
扫码关注我们
求助内容：
应助结果提醒方式：