C. Goumopoulos, A. Kameas, Erik Berg, Ioannis Calemis
Awareness systems are a class of computer mediated communication systems that help individuals or groups build and maintain a peripheral awareness of each other. In this paper a service-oriented platform is presented, that supports awareness and informal social communication between community members, distributed over multiple smart home environments. The ASTRA platform, developed in the context of an EU research project, provides a generalized solution to the development of awareness applications that are based on the concept of pervasive awareness, i.e., where awareness information is generated as a result of using personal and home devices and smart objects, which capture and exchange information about the user semi-autonomously.
{"title":"A Service-Oriented Platform for Pervasive Awareness Systems","authors":"C. Goumopoulos, A. Kameas, Erik Berg, Ioannis Calemis","doi":"10.1109/WAINA.2009.197","DOIUrl":"https://doi.org/10.1109/WAINA.2009.197","url":null,"abstract":"Awareness systems are a class of computer mediated communication systems that help individuals or groups build and maintain a peripheral awareness of each other. In this paper a service-oriented platform is presented, that supports awareness and informal social communication between community members, distributed over multiple smart home environments. The ASTRA platform, developed in the context of an EU research project, provides a generalized solution to the development of awareness applications that are based on the concept of pervasive awareness, i.e., where awareness information is generated as a result of using personal and home devices and smart objects, which capture and exchange information about the user semi-autonomously.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"70 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":"123128373","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 the promising high-speed differentiated-services (diffserv) wireless broadband networks specifically 802.16 standard, bandwidth scheduling algorithms play important role in providing the Quality-of-Service (QoS) guarantees required by many applications. Most of the research is focused on packet scheduling, but it is not clear yet which scheduling algorithms will work best with 802.16. Our scheme is a refined version of the modified Deficit Round Robin (MDRR) technique proposed by Fattah and Leung. We modify the redistribution strategy of MDRR to achieve better performance in terms of delay, throughput and fairness, and analyze the performance of our scheme via exhaustive packet-level simulations, under realistic wireless scenarios. In this paper, a new scheduling discipline called Customized Deficit Round Robin (CDRR) is presented, while preserving the simplicity available in the original DRR design which is fair, efficient and in addition has a low latency bound. The performance of our scheme is compared with MDRR using the OPNET simulator. The comparison is carried out, by investigating the latency and bandwidth sharing properties of the algorithms.
{"title":"Fair and Latency Aware Uplink Scheduler In IEEE 802.16 Using Customized Deficit Round Robin","authors":"Elmabruk Laias, I. Awan, P. Chan","doi":"10.1109/WAINA.2009.101","DOIUrl":"https://doi.org/10.1109/WAINA.2009.101","url":null,"abstract":"In the promising high-speed differentiated-services (diffserv) wireless broadband networks specifically 802.16 standard, bandwidth scheduling algorithms play important role in providing the Quality-of-Service (QoS) guarantees required by many applications. Most of the research is focused on packet scheduling, but it is not clear yet which scheduling algorithms will work best with 802.16. Our scheme is a refined version of the modified Deficit Round Robin (MDRR) technique proposed by Fattah and Leung. We modify the redistribution strategy of MDRR to achieve better performance in terms of delay, throughput and fairness, and analyze the performance of our scheme via exhaustive packet-level simulations, under realistic wireless scenarios. In this paper, a new scheduling discipline called Customized Deficit Round Robin (CDRR) is presented, while preserving the simplicity available in the original DRR design which is fair, efficient and in addition has a low latency bound. The performance of our scheme is compared with MDRR using the OPNET simulator. The comparison is carried out, by investigating the latency and bandwidth sharing properties of the algorithms.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"35 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":"116659667","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}
Safety information of evacuee is the most important for relief activities in disasters. Here tofore, we have been discussed about required conditions for computer systems destined for supporting effective relief activities after disasters. In addition, on the basis of the above, we also have been proposed a network construction algorithm and have been performed preliminary evaluation about the installation locations among wireless stations and wireless link connectivity. In this paper, we discuss more about network architecture using heterogeneous wireless link and development of application model using at shelters in order to step forward for the realization of our network system.
{"title":"Wireless Distributed Network System for Relief Activities after Disasters A Construction Policy of Heterogeneous Network Architecture","authors":"Tetsuya Shigeyasu, Misako Urakami, H. Matsuno","doi":"10.1109/WAINA.2009.171","DOIUrl":"https://doi.org/10.1109/WAINA.2009.171","url":null,"abstract":"Safety information of evacuee is the most important for relief activities in disasters. Here tofore, we have been discussed about required conditions for computer systems destined for supporting effective relief activities after disasters. In addition, on the basis of the above, we also have been proposed a network construction algorithm and have been performed preliminary evaluation about the installation locations among wireless stations and wireless link connectivity. In this paper, we discuss more about network architecture using heterogeneous wireless link and development of application model using at shelters in order to step forward for the realization of our network system.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"07 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":"127214154","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 recent years, dome display has become popular, and it is desired to establish a method to create dome image contents easily. In this study, psychophysical experiment was conducted to measure the three-dimensional sensation that was felt in the dome environment quantitatively. Based on the result of this experiment, the layered image representation method was developed. In this method, dome image is generated by placing the two-dimensional layered images in the three-dimensional space. The user can feel the three-dimensional sensation from the image by moving the layers or view position effectively. In addition, the scenario description language and the renderer were developed so that the usual creator can produce the dome image contents easily without the programming. This method was applied to produce some dome image contents and the effectiveness of this method was evaluated.
{"title":"Layer-Based Dome Contents Creation Using Scenario Description Language","authors":"T. Ogi, Daisuke Furuyama, T. Fujise","doi":"10.1109/WAINA.2009.207","DOIUrl":"https://doi.org/10.1109/WAINA.2009.207","url":null,"abstract":"In recent years, dome display has become popular, and it is desired to establish a method to create dome image contents easily. In this study, psychophysical experiment was conducted to measure the three-dimensional sensation that was felt in the dome environment quantitatively. Based on the result of this experiment, the layered image representation method was developed. In this method, dome image is generated by placing the two-dimensional layered images in the three-dimensional space. The user can feel the three-dimensional sensation from the image by moving the layers or view position effectively. In addition, the scenario description language and the renderer were developed so that the usual creator can produce the dome image contents easily without the programming. This method was applied to produce some dome image contents and the effectiveness of this method was evaluated.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"2011 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":"127357599","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}
Every node in a wireless ad hoc network is both end host (it generates its own data and routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no incentive to cooperatively forward traffic for others, since this kind of forwarding is not costless. In this paper, we use game theory to analyze cooperative mechanisms, and derive optimal criteria in forwarding.
{"title":"Cooperative Packet Relaying in Wireless Multi-hop Networks","authors":"Lu Yan","doi":"10.1109/WAINA.2009.11","DOIUrl":"https://doi.org/10.1109/WAINA.2009.11","url":null,"abstract":"Every node in a wireless ad hoc network is both end host (it generates its own data and routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no incentive to cooperatively forward traffic for others, since this kind of forwarding is not costless. In this paper, we use game theory to analyze cooperative mechanisms, and derive optimal criteria in forwarding.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"21 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":"122396216","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}
One of the novel benefits of virtualization is its ability to emulate many hosts with a single physical machine. This approach is often used to support at-scale testing for large-scale distributed systems. To better understand the precise ways in which virtual machines differ from their physical counterparts, we have started to quantify some of the timing artifacts that appear to be common to two modern approaches to virtualization. Here we present several systematic experiments that highlight four timing artifacts, and begin to decipher their origins within virtual machine implementations. These micro-benchmarks serve as a means to better understand the mappings that exist between virtualized and real-world testing infrastructure. Our goal is to develop a reusable framework for micro-benchmarks that can be customized to quantify artifacts associated with specific cluster configurations and workloads. This type of quantification can then be used to better anticipate behavioral characteristics at-scale in real settings.
{"title":"Quantifying Artifacts of Virtualization: A Framework for Mirco-Benchmarks","authors":"Chris Matthews, Y. Coady, S. Neville","doi":"10.1109/WAINA.2009.118","DOIUrl":"https://doi.org/10.1109/WAINA.2009.118","url":null,"abstract":"One of the novel benefits of virtualization is its ability to emulate many hosts with a single physical machine. This approach is often used to support at-scale testing for large-scale distributed systems. To better understand the precise ways in which virtual machines differ from their physical counterparts, we have started to quantify some of the timing artifacts that appear to be common to two modern approaches to virtualization. Here we present several systematic experiments that highlight four timing artifacts, and begin to decipher their origins within virtual machine implementations. These micro-benchmarks serve as a means to better understand the mappings that exist between virtualized and real-world testing infrastructure. Our goal is to develop a reusable framework for micro-benchmarks that can be customized to quantify artifacts associated with specific cluster configurations and workloads. This type of quantification can then be used to better anticipate behavioral characteristics at-scale in real settings.","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":"122690143","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}
Yasuaki Teshirogi, J. Sawamoto, N. Segawa, E. Sugino
The earthquake with the seismic center around the coast of Miyagi Prefecture and the oceanic trench of southern Sanriku is expected to occur with high probability. Enforcement of comprehensive anti-tsunami measures is expected with high emergency in the Sanriku region across Miyagi and Iwate Prefecture. Consequently, a system is required that prefectures, cities, towns and villages collect swiftly and accurately the tsunami monitoring information that is necessary for evacuation behavior, relief and recovery activities, and deliver and share to the local residents. Regarding the disaster information service "Area Mail" that NTT DoCoMo started newly, it is possible to deliver information simultaneously for afflicted limited areas unlike traditional mobile e-mail system. It is thought that the Area Mail can be used to notify not only to inhabitants but also to the tourists (including foreigners) at the time of the disaster. Furthermore, because Area Mail covers the main fishery region in the coast, service to fishery workers is possible while they operate along the coast. They can avoid tsunami damage even in very early stages of an event. In this study, some issues of applying the Area Mail to tsunami warning for fishery workers are extracted. And a prototype is built to assess the feasibility.
{"title":"A Proposal of Tsunami Warning System Using Area Mail Disaster Information Service on Mobile Phones","authors":"Yasuaki Teshirogi, J. Sawamoto, N. Segawa, E. Sugino","doi":"10.1109/WAINA.2009.75","DOIUrl":"https://doi.org/10.1109/WAINA.2009.75","url":null,"abstract":"The earthquake with the seismic center around the coast of Miyagi Prefecture and the oceanic trench of southern Sanriku is expected to occur with high probability. Enforcement of comprehensive anti-tsunami measures is expected with high emergency in the Sanriku region across Miyagi and Iwate Prefecture. Consequently, a system is required that prefectures, cities, towns and villages collect swiftly and accurately the tsunami monitoring information that is necessary for evacuation behavior, relief and recovery activities, and deliver and share to the local residents. Regarding the disaster information service \"Area Mail\" that NTT DoCoMo started newly, it is possible to deliver information simultaneously for afflicted limited areas unlike traditional mobile e-mail system. It is thought that the Area Mail can be used to notify not only to inhabitants but also to the tourists (including foreigners) at the time of the disaster. Furthermore, because Area Mail covers the main fishery region in the coast, service to fishery workers is possible while they operate along the coast. They can avoid tsunami damage even in very early stages of an event. In this study, some issues of applying the Area Mail to tsunami warning for fishery workers are extracted. And a prototype is built to assess the feasibility.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"169 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":"114260320","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 aims of this research are to expand the observation of queueing behavior to explore managing queueing activity for self-similar traffic using the network simulator, and to clarify the causes of different features focusing on the bottleneck link. We attached the Pareto on/off traffic over TCP on ns-2 simulator and observed temporal queue length and congestion window size of TCP on the source node, from which certain properties were extracted. Self-similar property is preserved on the no-restricted bottleneck link even if the congestion window on TCP is consumed on the source node for long-range dependent input. On the other hand, the bursty TCP traffic creates the same consuming pattern for efficient queue resource even if the long-range dependent traffics are generated.
{"title":"Queue Length Behavior on Restricted Link Under Bursty Self-similar TCP Traffic","authors":"T. Nakashima","doi":"10.1109/WAINA.2009.88","DOIUrl":"https://doi.org/10.1109/WAINA.2009.88","url":null,"abstract":"The aims of this research are to expand the observation of queueing behavior to explore managing queueing activity for self-similar traffic using the network simulator, and to clarify the causes of different features focusing on the bottleneck link. We attached the Pareto on/off traffic over TCP on ns-2 simulator and observed temporal queue length and congestion window size of TCP on the source node, from which certain properties were extracted. Self-similar property is preserved on the no-restricted bottleneck link even if the congestion window on TCP is consumed on the source node for long-range dependent input. On the other hand, the bursty TCP traffic creates the same consuming pattern for efficient queue resource even if the long-range dependent traffics are generated.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"72 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":"122088251","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. Bottaro, L. Gürgen, M. Vincent, François-Gaël Ottogalli, Stéphane Seyvoz
Time and cost efficient software maintenance is promoted to remotely manage devices distributed inthe home network. In addition to the currently largely adopted monolithic software management, modular multi-tier software management needs are arising in order to respond to the requirements of various market actors using heterogeneous software platforms, e.g., Linux distributions, OSGi, .NET, MIDP. This paper defines a generic software management model, Genex, which provides a homogeneous view over these different types of platforms. The objective is to use a single generic platform that can manage several underlying heterogeneous platforms at a time. The paper also introduces our initial implementations ofthe model and presents some experimentation results.
{"title":"Software Management of Heterogeneous Execution Platforms","authors":"A. Bottaro, L. Gürgen, M. Vincent, François-Gaël Ottogalli, Stéphane Seyvoz","doi":"10.1109/WAINA.2009.188","DOIUrl":"https://doi.org/10.1109/WAINA.2009.188","url":null,"abstract":"Time and cost efficient software maintenance is promoted to remotely manage devices distributed inthe home network. In addition to the currently largely adopted monolithic software management, modular multi-tier software management needs are arising in order to respond to the requirements of various market actors using heterogeneous software platforms, e.g., Linux distributions, OSGi, .NET, MIDP. This paper defines a generic software management model, Genex, which provides a homogeneous view over these different types of platforms. The objective is to use a single generic platform that can manage several underlying heterogeneous platforms at a time. The paper also introduces our initial implementations ofthe model and presents some experimentation results.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"20 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":"116590313","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 introduces LIFT, a combination of a cluster-based service discovery approach with a cross-layer service discovery scheme in order to discover services in Mobile Ad Hoc Networks. In this new proposal, High Capability Devices (HCD) are differentiated from Limited Capability Devices (LCD). HCD are set up as the cluster leaders in each cluster so as to perform most of the service discovery activities. Consequently, messages, memory, energy, computing processes, and bandwidth were reduced due to the optimum usage of network resources. We implemented LIFT on the network simulator Ns-2 under various mobility conditions and cluster topologies. In order to know if our model achieves its goal to minimize resources, we havecompared LIFT with another well-known solution (AODV-SD) in terms of control message overhead and energy consumption. After carrying out many trials and simulations, LIFT improved previous results in the area.
{"title":"LIFT: An Efficient Cross-Layer Service Discovery Protocol in MANET","authors":"Miguel A. Wister, Dante Arias Torres","doi":"10.1109/WAINA.2009.37","DOIUrl":"https://doi.org/10.1109/WAINA.2009.37","url":null,"abstract":"This paper introduces LIFT, a combination of a cluster-based service discovery approach with a cross-layer service discovery scheme in order to discover services in Mobile Ad Hoc Networks. In this new proposal, High Capability Devices (HCD) are differentiated from Limited Capability Devices (LCD). HCD are set up as the cluster leaders in each cluster so as to perform most of the service discovery activities. Consequently, messages, memory, energy, computing processes, and bandwidth were reduced due to the optimum usage of network resources. We implemented LIFT on the network simulator Ns-2 under various mobility conditions and cluster topologies. In order to know if our model achieves its goal to minimize resources, we havecompared LIFT with another well-known solution (AODV-SD) in terms of control message overhead and energy consumption. After carrying out many trials and simulations, LIFT improved previous results in the area.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"66 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":"129594113","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
扫码关注我们
求助内容：
应助结果提醒方式：