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}
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}
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}
Guido Moritz, C. Cornelius, F. Golatowski, D. Timmermann, R. Stoll
Device centric Service-oriented Architectures have shown to be applicable in the automation industry for interconnecting manufacturing devices and enterprise systems, thus, establishing comprehensive heterogeneous service architectures. A similar scenario can also be found in the domain of integrated circuits where a growing number of components is being interconnected by a network inside a single chip. Thus, service-oriented concepts seem promising to be used for the abstract composition of on-chip components. However, tight constraints on power consumption and performance have to be considered when a compound service shall be executed. In this paper, it will be described that the consideration of such constraints is profoundly beneficial. From this starting point, we argue that such an approach can also be useful in the context of wireless sensor networks with its large number of distributed, heterogeneous sensor nodes and limited energy sources.
{"title":"Differences and Commonalities of Service-Oriented Device Architectures, Wireless Sensor Networks and Networks-on-Chip","authors":"Guido Moritz, C. Cornelius, F. Golatowski, D. Timmermann, R. Stoll","doi":"10.1109/WAINA.2009.31","DOIUrl":"https://doi.org/10.1109/WAINA.2009.31","url":null,"abstract":"Device centric Service-oriented Architectures have shown to be applicable in the automation industry for interconnecting manufacturing devices and enterprise systems, thus, establishing comprehensive heterogeneous service architectures. A similar scenario can also be found in the domain of integrated circuits where a growing number of components is being interconnected by a network inside a single chip. Thus, service-oriented concepts seem promising to be used for the abstract composition of on-chip components. However, tight constraints on power consumption and performance have to be considered when a compound service shall be executed. In this paper, it will be described that the consideration of such constraints is profoundly beneficial. From this starting point, we argue that such an approach can also be useful in the context of wireless sensor networks with its large number of distributed, heterogeneous sensor nodes and limited energy sources.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"24 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":"122546011","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}
Kenji Ohnishi, Yuki Arase, T. Hara, T. Uemukai, S. Nishio
While Bookmark and Screen-memo memorize Web pages for future re-visit, re-visiting Web pages by using Bookmark or Screen-memo still requires a large amount of operation for cellular-phone users since the screen sizes of cellular phones are generally much smaller than the sizes of Web pages. In this paper, we describe the design and implementation of a content clipping system for Web browsing using cellular phones. This system presents multiple candidates for clipping a content, then, mobile users can easily specify the clipped target. Moreover, this system semi-automatically generates tags attached to the contents and automatically classifies the clipped contents. By using this system, users can easily specify contents of interest in Web pages and re-visit them with simple operations.
{"title":"A Content Clipping System for Web Browsing Using Cellular Phones","authors":"Kenji Ohnishi, Yuki Arase, T. Hara, T. Uemukai, S. Nishio","doi":"10.1109/WAINA.2009.184","DOIUrl":"https://doi.org/10.1109/WAINA.2009.184","url":null,"abstract":"While Bookmark and Screen-memo memorize Web pages for future re-visit, re-visiting Web pages by using Bookmark or Screen-memo still requires a large amount of operation for cellular-phone users since the screen sizes of cellular phones are generally much smaller than the sizes of Web pages. In this paper, we describe the design and implementation of a content clipping system for Web browsing using cellular phones. This system presents multiple candidates for clipping a content, then, mobile users can easily specify the clipped target. Moreover, this system semi-automatically generates tags attached to the contents and automatically classifies the clipped contents. By using this system, users can easily specify contents of interest in Web pages and re-visit them with simple operations.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"37 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":"123965850","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}
Over the last few years, target tracking in wireless sensor networks has become a topic of particular interest. This paper presents a tracking system intended for deployment in distributed Wireless Sensor Networks. The approach is inspired from the concept of deploying sensor nodes in an ad-hoc manner and based on the aggregate amount of information they provide, perform tracking of mobile objects. Static sensor nodes, with known locations, act as anchor nodes providing range-only measurements at each time step. The proposed system is modeled using a nonlinear state-space model which re¿ects a real world tracking scenario. The batch of range measurements made available at each sampling step, is used to estimate the target's desired kinematic properties. In order to infer the state of the target at each time step, a Particle Filter algorithm has been designed to approximate the required posterior distribution of the state vector. The system's operation was simulated and execution examples demonstrate the algorithm's accuracy as well as the ability to effectively cope with manoeuvring targets.
{"title":"A Range-Only Tracking Algorithm for Wireless Sensor Networks","authors":"E. Mazomenos, J. Reeve, N. White","doi":"10.1109/WAINA.2009.84","DOIUrl":"https://doi.org/10.1109/WAINA.2009.84","url":null,"abstract":"Over the last few years, target tracking in wireless sensor networks has become a topic of particular interest. This paper presents a tracking system intended for deployment in distributed Wireless Sensor Networks. The approach is inspired from the concept of deploying sensor nodes in an ad-hoc manner and based on the aggregate amount of information they provide, perform tracking of mobile objects. Static sensor nodes, with known locations, act as anchor nodes providing range-only measurements at each time step. The proposed system is modeled using a nonlinear state-space model which re¿ects a real world tracking scenario. The batch of range measurements made available at each sampling step, is used to estimate the target's desired kinematic properties. In order to infer the state of the target at each time step, a Particle Filter algorithm has been designed to approximate the required posterior distribution of the state vector. The system's operation was simulated and execution examples demonstrate the algorithm's accuracy as well as the ability to effectively cope with manoeuvring targets.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"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":"126126145","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}
Digital Ecosystem is defined as “an open, loosely coupled, domain clustered, demand-driven, self-organizing and agent-based environment, in which each species is proactive and responsive for its own benefit and profit” [1]. Species in the Digital Ecosystem can play dual roles, which are service requester (client) service provider (server). A service provider enters the Digital Ecosystem by publishing a service metadata in the service factory, in which the service metadata can be clustered by domain-specific ontologies provided by the Digital Ecosystem. Two issues emerge here. First of all, vast and heterogeneous service metadata are ubiquitous before the Digital Ecosystem technology emerges. It is a challenge for the Digital Ecosystem to organize these metadata. In order to solve this issue, an automatic service metadata clustering approach could be desired. However, this could educe the second issue – the automatic association between service concepts and service metadata could not agree with service providers’ perceptions, as a result of the differences among individual understandings. To solve the two issues, in this paper, we present a hybrid ontology-based metadata clustering methodology comprising an extended case-based reasoning algorithm-based automatic concept-metadata association approach and a service provider-oriented concept-metadata association approach.
{"title":"A Hybrid Service Metadata Clustering Methodology in the Digital Ecosystem Environment","authors":"Hai Dong, F. Hussain, E. Chang","doi":"10.1109/WAINA.2009.205","DOIUrl":"https://doi.org/10.1109/WAINA.2009.205","url":null,"abstract":"Digital Ecosystem is defined as “an open, loosely coupled, domain clustered, demand-driven, self-organizing and agent-based environment, in which each species is proactive and responsive for its own benefit and profit” [1]. Species in the Digital Ecosystem can play dual roles, which are service requester (client) service provider (server). A service provider enters the Digital Ecosystem by publishing a service metadata in the service factory, in which the service metadata can be clustered by domain-specific ontologies provided by the Digital Ecosystem. Two issues emerge here. First of all, vast and heterogeneous service metadata are ubiquitous before the Digital Ecosystem technology emerges. It is a challenge for the Digital Ecosystem to organize these metadata. In order to solve this issue, an automatic service metadata clustering approach could be desired. However, this could educe the second issue – the automatic association between service concepts and service metadata could not agree with service providers’ perceptions, as a result of the differences among individual understandings. To solve the two issues, in this paper, we present a hybrid ontology-based metadata clustering methodology comprising an extended case-based reasoning algorithm-based automatic concept-metadata association approach and a service provider-oriented concept-metadata association approach.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"17 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":"125764442","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
扫码关注我们
求助内容：
应助结果提醒方式：