With the emergence of functional wireless terminals, increased network capacity is needed for wireless LANs. Considering the limited available frequency channels for wireless LAN, improving spatial channel reuse performance of MAC protocol is a key requirement for this purpose. In this paper, we present a novel RTS/CTS reservation scheme for CSMA/CA which improves spatial reuse by taking account for inter-node distance in the network. The main feature of the proposed scheme is that it adaptively change range of NAV (Network Allocation Vector) depending on the distance between a source node and a destination node. The range of NAV is also changed on the current required SINR (Signal and Interference Noise Ratio) which is determined by the current transmission rate, thus this scheme can be used for multirate data transmission. Performance evaluation using a synchronous frame based media access model shows the proposed scheme improves bandwidth efficiency by about 30% at maximum compared with existing CSMA/CA with RTS/CTS.
{"title":"Distance-and-Rate Dependent RTS/CTS Reservation in Wireless LAN for Enhancing Spatial Reuse","authors":"H. Morino, M. Inoue, T. Sanefuji","doi":"10.1109/ISADS.2011.71","DOIUrl":"https://doi.org/10.1109/ISADS.2011.71","url":null,"abstract":"With the emergence of functional wireless terminals, increased network capacity is needed for wireless LANs. Considering the limited available frequency channels for wireless LAN, improving spatial channel reuse performance of MAC protocol is a key requirement for this purpose. In this paper, we present a novel RTS/CTS reservation scheme for CSMA/CA which improves spatial reuse by taking account for inter-node distance in the network. The main feature of the proposed scheme is that it adaptively change range of NAV (Network Allocation Vector) depending on the distance between a source node and a destination node. The range of NAV is also changed on the current required SINR (Signal and Interference Noise Ratio) which is determined by the current transmission rate, thus this scheme can be used for multirate data transmission. Performance evaluation using a synchronous frame based media access model shows the proposed scheme improves bandwidth efficiency by about 30% at maximum compared with existing CSMA/CA with RTS/CTS.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121354146","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 paper describes an assurance diversity network platform for the New-generation Network (NWGN)/Future Internet. The primary focus is on the vision and five concrete network targets to realize the NWGN, which should ultimately contribute to global society over several decades. In the latter half of the paper, we propose a diversity network platform (DNP) concept for effectively accommodating various networks concurrently. In the DNP, physical resources such as network bandwidth, computation, and storage are managed as a logically integrated resource. Optical/electronic, path/packet, and wired/wireless networks are also managed as a unified network. Apart from this, a new network can be created by installing new functions since the unified network is equipped not only with network resources but also computation and storage resources. Later in the paper we describe technological challenges for the assurance DNP that is the DNP with error-tolerant and reliable features.
{"title":"Assurance Diversity Network Platform for NWGN - From New-Generation Network Vision to Multiple Customized Networks","authors":"Toshiaki Suzuki, N. Nishinaga, A. Nakao","doi":"10.1109/ISADS.2011.84","DOIUrl":"https://doi.org/10.1109/ISADS.2011.84","url":null,"abstract":"This paper describes an assurance diversity network platform for the New-generation Network (NWGN)/Future Internet. The primary focus is on the vision and five concrete network targets to realize the NWGN, which should ultimately contribute to global society over several decades. In the latter half of the paper, we propose a diversity network platform (DNP) concept for effectively accommodating various networks concurrently. In the DNP, physical resources such as network bandwidth, computation, and storage are managed as a logically integrated resource. Optical/electronic, path/packet, and wired/wireless networks are also managed as a unified network. Apart from this, a new network can be created by installing new functions since the unified network is equipped not only with network resources but also computation and storage resources. Later in the paper we describe technological challenges for the assurance DNP that is the DNP with error-tolerant and reliable features.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127189972","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}
Autonomous decentralized system (ADS) architecture has been used to construct high assurance control systems like infrastructure systems. Such systems have to be expanded these functions to meet new demands of service. In that case, the method which can be used for the system expansion without any bad influence to the online systems is essential. In this paper, we clarify that a new system expansion method without any bad influence to the online systems. And we apply this method to a railway transport operation control system (ATOS) to expand the system.
{"title":"Establishment Phased-In Constructing Method for System Expansion of Tokyo Metropolitan Railway System","authors":"Daisuke Yagyu, H. Osumi, Hidenari Tokunaga","doi":"10.1109/ISADS.2011.103","DOIUrl":"https://doi.org/10.1109/ISADS.2011.103","url":null,"abstract":"Autonomous decentralized system (ADS) architecture has been used to construct high assurance control systems like infrastructure systems. Such systems have to be expanded these functions to meet new demands of service. In that case, the method which can be used for the system expansion without any bad influence to the online systems is essential. In this paper, we clarify that a new system expansion method without any bad influence to the online systems. And we apply this method to a railway transport operation control system (ATOS) to expand the system.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123558280","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}
Recently, instant messaging service has been widely used by many users. In instant messaging, mobile users need to notify their instant messaging server of activity information periodically, so that their status should be managed and displayed as active at instant messengers of their buddies. The periodic notification, however, prevents instant messenger from entering sleep mode, and thus, results in energy consumption. Although the energy consumption may not be a big problem for desktop PC, which has stable power source, it is significant to mobile stations (MSs) operated with battery. Since a detailed modeling and analysis on energy consumption of MSs is a prerequisite to understand the effect of various parameters on energy consumption deeply and devise an efficient energy management scheme, we develop a more detailed analytical model of state transitions of MSs for instant messaging services. Then, we apply the model to evaluate energy consumption due to instant messaging services, based on steady state probability of MS states.
{"title":"Investigation of Energy Consumption of Mobile Station for Instant Messaging Services","authors":"Y. Chung","doi":"10.1109/ISADS.2011.52","DOIUrl":"https://doi.org/10.1109/ISADS.2011.52","url":null,"abstract":"Recently, instant messaging service has been widely used by many users. In instant messaging, mobile users need to notify their instant messaging server of activity information periodically, so that their status should be managed and displayed as active at instant messengers of their buddies. The periodic notification, however, prevents instant messenger from entering sleep mode, and thus, results in energy consumption. Although the energy consumption may not be a big problem for desktop PC, which has stable power source, it is significant to mobile stations (MSs) operated with battery. Since a detailed modeling and analysis on energy consumption of MSs is a prerequisite to understand the effect of various parameters on energy consumption deeply and devise an efficient energy management scheme, we develop a more detailed analytical model of state transitions of MSs for instant messaging services. Then, we apply the model to evaluate energy consumption due to instant messaging services, based on steady state probability of MS states.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115219055","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}
Aircraft is one of the most dynamic and fast transportation systems. Aircraft is flying at the speed of hundreds km/h and moving in three dimensional space without stopping. Therefore, in air traffic, the situation is dynamically changing from moment to moment, from position to position. Under this dynamic changing situation, air traffic control radar systems are required to monitor aircraft with high safety. Secondary Surveillance Radar (SSR) has been accomplishing this difficult work for a long time. As the number of aircraft with new capability increases, SSR is suffering from data traffic congestions between aircraft and SSR Ground Station (GS). In this paper, we propose the Autonomous Continuous Target Tracking Technology. This technology reduces data traffic in air-ground communication with keeping continuous target tracking .
{"title":"Autonomous Continuous Target Tracking for Multi-sensor Systems and Its Application for Radar Network","authors":"T. Koga","doi":"10.1109/ISADS.2011.98","DOIUrl":"https://doi.org/10.1109/ISADS.2011.98","url":null,"abstract":"Aircraft is one of the most dynamic and fast transportation systems. Aircraft is flying at the speed of hundreds km/h and moving in three dimensional space without stopping. Therefore, in air traffic, the situation is dynamically changing from moment to moment, from position to position. Under this dynamic changing situation, air traffic control radar systems are required to monitor aircraft with high safety. Secondary Surveillance Radar (SSR) has been accomplishing this difficult work for a long time. As the number of aircraft with new capability increases, SSR is suffering from data traffic congestions between aircraft and SSR Ground Station (GS). In this paper, we propose the Autonomous Continuous Target Tracking Technology. This technology reduces data traffic in air-ground communication with keeping continuous target tracking .","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122823633","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 paper treats the Primary-Shadow Replication Scheme to embody fault-tolerant capability in Operation Flight Program (OFP) of small Unmanned Aerial Vehicles (UAV). The recent increase in UAV applications to various autonomous missions demands a highly reliable and safe OFP to cope with unexpected system faults. This paper proposes a modified application of Primary-Shadow TMO's Replication (PSTR)[2]mechanism for quick detection and rectification of system failure with minimum intervention of human pilot. For this purpose the PSTR method is integrated into the Hardware-In-the-Loop Simulation (HILS) environment with a UAV model. Various failure modes in such as receiving UAV's sensor data and sending calculated data to UAV's actuator are simulated and tested to show the enhanced fault-tolerance nature of the OFP. The test results show that 96% of injected faults were successfully detected and recovered, and 94% of shadow OFP was successfully activated within given deadline.
{"title":"Experimental Feasibility Analysis of Primary-Shadow Replication Scheme for I/O Tansmission Fault-Tolerance in Auto-Pilot Program of Small Scale UAV","authors":"Junyeong Kim, Doohyun Kim","doi":"10.1109/ISADS.2011.55","DOIUrl":"https://doi.org/10.1109/ISADS.2011.55","url":null,"abstract":"This paper treats the Primary-Shadow Replication Scheme to embody fault-tolerant capability in Operation Flight Program (OFP) of small Unmanned Aerial Vehicles (UAV). The recent increase in UAV applications to various autonomous missions demands a highly reliable and safe OFP to cope with unexpected system faults. This paper proposes a modified application of Primary-Shadow TMO's Replication (PSTR)[2]mechanism for quick detection and rectification of system failure with minimum intervention of human pilot. For this purpose the PSTR method is integrated into the Hardware-In-the-Loop Simulation (HILS) environment with a UAV model. Various failure modes in such as receiving UAV's sensor data and sending calculated data to UAV's actuator are simulated and tested to show the enhanced fault-tolerance nature of the OFP. The test results show that 96% of injected faults were successfully detected and recovered, and 94% of shadow OFP was successfully activated within given deadline.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114172312","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}
Delaunay overlay networks have a Delaunay graph structure, which has spatial locality. This feature is useful for distributed spatial computing, distributed geographical database systems, and geometric routing networks. An incremental construction method of these networks is proposed. The existing method assumes that each communication node can create overlay connections using IDs with all other nodes via underlay networks. Yet this method cannot be used for deploying underlay networks. To solve this problem, the existing method is enhanced by using detour paths for spatial neighbor-connected networks. We propose a detour path construction procedure, which is useful for introducing position-based heuristic routing to L3 networks, DTNs, and database networks.
{"title":"Distributed Incremental Construction Method of Delaunay Overlay Network Using Detour Paths","authors":"M. Ohnishi, M. Inoue","doi":"10.1109/ISADS.2011.99","DOIUrl":"https://doi.org/10.1109/ISADS.2011.99","url":null,"abstract":"Delaunay overlay networks have a Delaunay graph structure, which has spatial locality. This feature is useful for distributed spatial computing, distributed geographical database systems, and geometric routing networks. An incremental construction method of these networks is proposed. The existing method assumes that each communication node can create overlay connections using IDs with all other nodes via underlay networks. Yet this method cannot be used for deploying underlay networks. To solve this problem, the existing method is enhanced by using detour paths for spatial neighbor-connected networks. We propose a detour path construction procedure, which is useful for introducing position-based heuristic routing to L3 networks, DTNs, and database networks.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418865","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}
A. Bertolino, Antonello Calabrò, F. Giandomenico, M. Martinucci, P. Masci
Model-based analysis is a well-established method to assess the dependability of a system before deployment. It is well known that, in highly dynamic contexts, the accuracy of the analysis results can be limited because unpredictable phenomena may affect the system during its operation. In such contexts, the analysis typically needs to be refined with data obtained from real system executions. In this paper we tackle the issue of refining model-based dependability analysis in automated systems through monitoring. Specifically, we report on our preliminary results on the development of a system that exploits the synergic use of an automated approach for model-based dependability analysis and a flexible monitoring architecture.
{"title":"Automated Refinement of Dependability Analysis through Monitoring in Dynamically Connected Systems","authors":"A. Bertolino, Antonello Calabrò, F. Giandomenico, M. Martinucci, P. Masci","doi":"10.1109/ISADS.2011.46","DOIUrl":"https://doi.org/10.1109/ISADS.2011.46","url":null,"abstract":"Model-based analysis is a well-established method to assess the dependability of a system before deployment. It is well known that, in highly dynamic contexts, the accuracy of the analysis results can be limited because unpredictable phenomena may affect the system during its operation. In such contexts, the analysis typically needs to be refined with data obtained from real system executions. In this paper we tackle the issue of refining model-based dependability analysis in automated systems through monitoring. Specifically, we report on our preliminary results on the development of a system that exploits the synergic use of an automated approach for model-based dependability analysis and a flexible monitoring architecture.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122093584","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 combination of cloud computing, ad hoc networking and proliferation of wireless devices and sensors will be the most significant disruptive technology to transform the way next generation services are supplied and consumed in the communications industry since the introduction of Internet. In this next generation service marketplace, service brokering is emerging as a promising low-risk business model for offering new and value-added services through cross provider service delivery and partnership. The paper presents a service brokering architecture possessing the capabilities necessary to support a service delivery infrastructure for integration, delivery and management of composite services in a multi-provider heterogeneous networks environment.
{"title":"Service Brokering and Mediation: Enabling Next Generation Market and Customer Driven Service Delivery","authors":"K. Cheng, Y. Gottlieb, G. Levin, F. Lin","doi":"10.1109/ISADS.2011.100","DOIUrl":"https://doi.org/10.1109/ISADS.2011.100","url":null,"abstract":"The combination of cloud computing, ad hoc networking and proliferation of wireless devices and sensors will be the most significant disruptive technology to transform the way next generation services are supplied and consumed in the communications industry since the introduction of Internet. In this next generation service marketplace, service brokering is emerging as a promising low-risk business model for offering new and value-added services through cross provider service delivery and partnership. The paper presents a service brokering architecture possessing the capabilities necessary to support a service delivery infrastructure for integration, delivery and management of composite services in a multi-provider heterogeneous networks environment.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129906547","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 number of Web applications handling online transaction is increasing, but verication of the correctness of the Web application design has been done manually. This paper proposes a method for modeling Web applications using two nite-state automata, i.e., a page automaton which species Web page transitions, and an internal state automaton which species internal state transitions of the Web application. General assertions for checking Web application design are proposed, and a theoretical result for deadlock-freeness of Web application is also shown. An example Web application is modeled by the proposed method and checked using the model checker Spin.
{"title":"Modeling Web Applications Design with Automata and Its Verification","authors":"K. Homma, S. Izumi, Kaoru Takahashi, A. Togashi","doi":"10.1109/ISADS.2011.108","DOIUrl":"https://doi.org/10.1109/ISADS.2011.108","url":null,"abstract":"The number of Web applications handling online transaction is increasing, but verication of the correctness of the Web application design has been done manually. This paper proposes a method for modeling Web applications using two nite-state automata, i.e., a page automaton which species Web page transitions, and an internal state automaton which species internal state transitions of the Web application. General assertions for checking Web application design are proposed, and a theoretical result for deadlock-freeness of Web application is also shown. An example Web application is modeled by the proposed method and checked using the model checker Spin.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123997245","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
扫码关注我们
求助内容：
应助结果提醒方式：