Recent advances in wireless communication and technologies have given rise to low-cost sensor networks. Sensor networks comprise of low-cost, low-power nodes that are densely deployed in the environment to monitor a specific state of the environment, for example: temperature, light, sound, speed or radiation. This paper presents a new data forwarding algorithm for sensor networks that takes into consideration the direction of the message, the positional relevance of a node to the message and the available power at that node. We conclude this paper by discussing an experimental study of the performance of the proposed data forwarding protocol for sensor networks.
{"title":"A context-aware data forwarding algorithm for sensor networks","authors":"A. Gopalan, T. Znati","doi":"10.1109/ANSS.2005.6","DOIUrl":"https://doi.org/10.1109/ANSS.2005.6","url":null,"abstract":"Recent advances in wireless communication and technologies have given rise to low-cost sensor networks. Sensor networks comprise of low-cost, low-power nodes that are densely deployed in the environment to monitor a specific state of the environment, for example: temperature, light, sound, speed or radiation. This paper presents a new data forwarding algorithm for sensor networks that takes into consideration the direction of the message, the positional relevance of a node to the message and the available power at that node. We conclude this paper by discussing an experimental study of the performance of the proposed data forwarding protocol for sensor networks.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158607","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 study was conducted to compare fifteen approaches to improve Latin hypercube designs for computer experiments, based on simulation tests and statistical analyses ANOVA. Kriging models were employed to approximate twenty test functions. Validation at 5000 or 10,000 points was conducted to find prediction errors. The results show that there are statistically significant differences between the approximate results of employing different designs, but more often the difference is not significant. In most cases, the number of runs or the sample size has stronger impact on the accuracy than do different designs. When the dimension is low, a small size increment can often reduce more error than do "better designs". To get the desired precision by one-stage method, enough samples may be needed regardless what design is used. Sample size determination may need much more attention for computer experiments.
{"title":"Could enough samples be more important than better designs for computer experiments?","authors":"Longjun Liu","doi":"10.1109/ANSS.2005.17","DOIUrl":"https://doi.org/10.1109/ANSS.2005.17","url":null,"abstract":"A study was conducted to compare fifteen approaches to improve Latin hypercube designs for computer experiments, based on simulation tests and statistical analyses ANOVA. Kriging models were employed to approximate twenty test functions. Validation at 5000 or 10,000 points was conducted to find prediction errors. The results show that there are statistically significant differences between the approximate results of employing different designs, but more often the difference is not significant. In most cases, the number of runs or the sample size has stronger impact on the accuracy than do different designs. When the dimension is low, a small size increment can often reduce more error than do \"better designs\". To get the desired precision by one-stage method, enough samples may be needed regardless what design is used. Sample size determination may need much more attention for computer experiments.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125496723","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 reliable multicast applications, packet loss needs to be reported by having group members send feedback messages. This results in the well-known feedback implosion problem. The available feedback control mechanisms can be classified as timer-based, hierarchy-based and router-assisted, among which the timer-based approach is more preferable due to its simplicity and flexibility. This paper compares the performance of a set of multicast protocols that use either the traditional timer-based feedback control or a combination of the traditional timers and some representatives in the feedback control. We investigate how the use of representatives and deterministic timers improves feedback control performance.
{"title":"A comparison of multicast feedback control mechanisms","authors":"S. Wu, S. Banerjee, Xiaobing Hou","doi":"10.1109/ANSS.2005.5","DOIUrl":"https://doi.org/10.1109/ANSS.2005.5","url":null,"abstract":"In reliable multicast applications, packet loss needs to be reported by having group members send feedback messages. This results in the well-known feedback implosion problem. The available feedback control mechanisms can be classified as timer-based, hierarchy-based and router-assisted, among which the timer-based approach is more preferable due to its simplicity and flexibility. This paper compares the performance of a set of multicast protocols that use either the traditional timer-based feedback control or a combination of the traditional timers and some representatives in the feedback control. We investigate how the use of representatives and deterministic timers improves feedback control performance.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123472980","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}
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolate the entanglement as source of simulation complexity. However, it was shown that this methodology is not efficient in the presence of total entanglement, and the probability of such a situation grows exponentially with the number of qubits [ M. Udrescu, L. Prodan, M Vladutiu (2004) ]. The bubble bit technique is designed to avoid the entangled representation of the quantum state, thus allowing the HDL structural description of the quantum circuit, which requires polynomial resources for simulation. We provide experimental runtimes, obtained by simulation of quantum arithmetic and Grover's algorithm circuits, which indicate substantial runtime speedup.
当在经典计算机上执行时，量子电路的模拟通常是一个指数级的工作。基于硬件描述语言的方法能够隔离作为仿真复杂性来源的纠缠。然而，研究表明，这种方法在存在总纠缠的情况下并不有效，而且这种情况的概率随着量子比特的数量呈指数增长[M. Udrescu, L. Prodan, M. Vladutiu(2004)]。气泡位技术旨在避免量子态的纠缠表示，从而允许对量子电路进行HDL结构描述，这需要多项式资源进行模拟。我们提供了通过模拟量子算法和Grover算法电路获得的实验运行时间，表明运行速度有很大的提高。
{"title":"The bubble bit technique as improvement of HDL-based quantum circuits simulation","authors":"M. Udrescu, L. Prodan, M. Vladutiu","doi":"10.1109/ANSS.2005.43","DOIUrl":"https://doi.org/10.1109/ANSS.2005.43","url":null,"abstract":"When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolate the entanglement as source of simulation complexity. However, it was shown that this methodology is not efficient in the presence of total entanglement, and the probability of such a situation grows exponentially with the number of qubits [ M. Udrescu, L. Prodan, M Vladutiu (2004) ]. The bubble bit technique is designed to avoid the entangled representation of the quantum state, thus allowing the HDL structural description of the quantum circuit, which requires polynomial resources for simulation. We provide experimental runtimes, obtained by simulation of quantum arithmetic and Grover's algorithm circuits, which indicate substantial runtime speedup.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128842810","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 analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described by a Markov chain that can be solved mathematically. The phase-type distributions that are used to describe non-Markovian distributions have to be approximated. An approach for the fast and accurate approximation of discrete phase-type distributions is presented. This can be a step towards a practical state space-based simulation method, whereas formerly this approach often had to be discarded as unfeasible due to high memory and runtime costs. Discrete phases also fit in well with current research on proxel-based simulation. They can represent infinite support distribution functions with considerably fewer Markov chain states than proxels. Our hope is that such a combination of both approaches will lead to a competitive simulation algorithm.
{"title":"Approximation of discrete phase-type distributions","authors":"Claudia Isensee, G. Horton","doi":"10.1109/ANSS.2005.12","DOIUrl":"https://doi.org/10.1109/ANSS.2005.12","url":null,"abstract":"The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described by a Markov chain that can be solved mathematically. The phase-type distributions that are used to describe non-Markovian distributions have to be approximated. An approach for the fast and accurate approximation of discrete phase-type distributions is presented. This can be a step towards a practical state space-based simulation method, whereas formerly this approach often had to be discarded as unfeasible due to high memory and runtime costs. Discrete phases also fit in well with current research on proxel-based simulation. They can represent infinite support distribution functions with considerably fewer Markov chain states than proxels. Our hope is that such a combination of both approaches will lead to a competitive simulation algorithm.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121020599","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 presents a new verification and validation (V&V) technique for simulation using dynamic policy enforcement. Constraints are formally specified as policies, and they will be used to check whether simulation satisfies these policies at runtime. This paper also proposes a development framework where policies are developed along with system development and V&V. Once policies are extracted from requirements and specified in a policy specification language, the rest of the development work is automatically performed by the tools in the framework. Both security requirements and functional requirements can be specified as policies and dynamically enforced during the simulation. An automated tool is available for policy specification and enforcement, and it is fully integrated with the simulation infrastructure. This paper also presents a sample system that is modeled and simulated, and policies are used to verify and validate the system model. The paper also discusses the overhead imposed to perform this kind of automated policy-based V&V compared to the hard-coded implementation of the same approach.
{"title":"Simulation verification and validation by dynamic policy enforcement","authors":"W. Tsai, Xinxin Liu, Yinong Chen, R. Paul","doi":"10.1109/ANSS.2005.42","DOIUrl":"https://doi.org/10.1109/ANSS.2005.42","url":null,"abstract":"This paper presents a new verification and validation (V&V) technique for simulation using dynamic policy enforcement. Constraints are formally specified as policies, and they will be used to check whether simulation satisfies these policies at runtime. This paper also proposes a development framework where policies are developed along with system development and V&V. Once policies are extracted from requirements and specified in a policy specification language, the rest of the development work is automatically performed by the tools in the framework. Both security requirements and functional requirements can be specified as policies and dynamically enforced during the simulation. An automated tool is available for policy specification and enforcement, and it is fully integrated with the simulation infrastructure. This paper also presents a sample system that is modeled and simulated, and policies are used to verify and validate the system model. The paper also discusses the overhead imposed to perform this kind of automated policy-based V&V compared to the hard-coded implementation of the same approach.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121789984","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}
We propose, implement and evaluate new energy conservation schemes for efficient data propagation in wireless sensor networks. Our protocols are adaptive, i.e. locally monitor the network conditions and accordingly adjust towards optimal operation choices. This dynamic feature is particularly beneficial in heterogeneous settings and in cases of redeployment of sensor devices in the network area. We implement our protocols and evaluate their performance through a detailed simulation study using our extended version of ns-2. In particular we combine our schemes with known communication paradigms. The simulation findings demonstrate significant gains and good trade-offs in terms of delivery success, delay and energy dissipation.
{"title":"Power conservation schemes for energy efficient data propagation in heterogeneous wireless sensor networks","authors":"I. Chatzigiannakis, A. Kinalis, S. Nikoletseas","doi":"10.1109/ANSS.2005.37","DOIUrl":"https://doi.org/10.1109/ANSS.2005.37","url":null,"abstract":"We propose, implement and evaluate new energy conservation schemes for efficient data propagation in wireless sensor networks. Our protocols are adaptive, i.e. locally monitor the network conditions and accordingly adjust towards optimal operation choices. This dynamic feature is particularly beneficial in heterogeneous settings and in cases of redeployment of sensor devices in the network area. We implement our protocols and evaluate their performance through a detailed simulation study using our extended version of ns-2. In particular we combine our schemes with known communication paradigms. The simulation findings demonstrate significant gains and good trade-offs in terms of delivery success, delay and energy dissipation.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122775463","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}
Transmission power control in mobile ad-hoc networks is a major issue for reliable end to end communication. Many researches have shown that the minimum transmission power that is required to keep the wireless network connected achieves the optimal throughput performance in wireless devices. By prolonging the network lifetime the overall performance substantially increases. Particularly when delay sensitive packets/multimedia streams are sent from a wireless device to another, the end to end communication must offer sufficient reliability and integrity. This paper describes a quantitative approach based on incoming traffic flow which bounds an asynchronous operation where each node evaluates dissimilar sleep-wake schedules. This scheme is entirely based on each node's incoming sleep-history traffic. Different sleep-wake schedules are continuously influenced for each node by packets and multimedia streams which are uniformly injected into the network. Simulation study is carried out for the energy conservation evaluation of the proposed model taking into account a number of metrics and estimation of the effects of incrementing the sleep time duration to conserve energy. Results show that the proposed method could be applied to infrastructure less networks to provide reliability for multimedia and delay sensitive packets without a significant increase in the power consumption.
{"title":"Handling delay sensitive contents using adaptive traffic-based control method for minimizing energy consumption in wireless devices","authors":"C. Mavromoustakis, H. Karatza","doi":"10.1109/ANSS.2005.24","DOIUrl":"https://doi.org/10.1109/ANSS.2005.24","url":null,"abstract":"Transmission power control in mobile ad-hoc networks is a major issue for reliable end to end communication. Many researches have shown that the minimum transmission power that is required to keep the wireless network connected achieves the optimal throughput performance in wireless devices. By prolonging the network lifetime the overall performance substantially increases. Particularly when delay sensitive packets/multimedia streams are sent from a wireless device to another, the end to end communication must offer sufficient reliability and integrity. This paper describes a quantitative approach based on incoming traffic flow which bounds an asynchronous operation where each node evaluates dissimilar sleep-wake schedules. This scheme is entirely based on each node's incoming sleep-history traffic. Different sleep-wake schedules are continuously influenced for each node by packets and multimedia streams which are uniformly injected into the network. Simulation study is carried out for the energy conservation evaluation of the proposed model taking into account a number of metrics and estimation of the effects of incrementing the sleep time duration to conserve energy. Results show that the proposed method could be applied to infrastructure less networks to provide reliability for multimedia and delay sensitive packets without a significant increase in the power consumption.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126329080","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}
Mohamed Abd El-Salam Ahmed, K. Yonis, Abdul-Rahman Elsahfei, Gabriel A. Wainer
Simulation-based analysis can help to design, study and configure computer networks, in order to assess the best possible solution to particular problems. The authors proposed the creation of a tool for modeling and simulation (M&S) of networks built on the DEVS formalism. DEVS allows for the formal definition of discrete event models interacting together, which can be used to analyze properties about the systems we model. These models can be executed under different simulation environments, and they can be easily integrated with models of other phenomena, described with different techniques. Here, the definition and implementation of a library of DEVS models constructed as the initial building block for such a network simulator based on the CD++ tool was presented.
{"title":"Design and implementation of a library of network protocols in CD++","authors":"Mohamed Abd El-Salam Ahmed, K. Yonis, Abdul-Rahman Elsahfei, Gabriel A. Wainer","doi":"10.1109/ANSS.2005.18","DOIUrl":"https://doi.org/10.1109/ANSS.2005.18","url":null,"abstract":"Simulation-based analysis can help to design, study and configure computer networks, in order to assess the best possible solution to particular problems. The authors proposed the creation of a tool for modeling and simulation (M&S) of networks built on the DEVS formalism. DEVS allows for the formal definition of discrete event models interacting together, which can be used to analyze properties about the systems we model. These models can be executed under different simulation environments, and they can be easily integrated with models of other phenomena, described with different techniques. Here, the definition and implementation of a library of DEVS models constructed as the initial building block for such a network simulator based on the CD++ tool was presented.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131238295","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 Internet is a large, complex, heterogeneous system operating at very high speeds and consisting of a large number of users. Researchers use a suite of tools and techniques in order to understand the performance of networks: measurements, simulations, and deployments on small to medium-scale testbeds. This work considers a novel addition to this suite: a class of methods to scale down the topology of the Internet that enables researchers to create and observe a smaller replica, and extrapolate its performance to the expected performance of the larger Internet. The key insight that we leverage in this work is that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows. Hence, one might hope that the network properties can be captured by a topology that consists of the congested links only. We show that for a network that is shared by TCP flows it is possible to achieve this kind of performance scaling. We also show that simulating a scaled topology can be up to two orders of magnitude faster than simulating the original topology.
{"title":"Performance preserving network downscaling","authors":"Fragkiskos Papadopoulos, K. Psounis, R. Govindan","doi":"10.1109/ANSS.2005.36","DOIUrl":"https://doi.org/10.1109/ANSS.2005.36","url":null,"abstract":"The Internet is a large, complex, heterogeneous system operating at very high speeds and consisting of a large number of users. Researchers use a suite of tools and techniques in order to understand the performance of networks: measurements, simulations, and deployments on small to medium-scale testbeds. This work considers a novel addition to this suite: a class of methods to scale down the topology of the Internet that enables researchers to create and observe a smaller replica, and extrapolate its performance to the expected performance of the larger Internet. The key insight that we leverage in this work is that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows. Hence, one might hope that the network properties can be captured by a topology that consists of the congested links only. We show that for a network that is shared by TCP flows it is possible to achieve this kind of performance scaling. We also show that simulating a scaled topology can be up to two orders of magnitude faster than simulating the original topology.","PeriodicalId":270527,"journal":{"name":"38th Annual Simulation Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133336974","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
扫码关注我们
求助内容：
应助结果提醒方式：