The deployment of wireless applications or protocols in the context of Mobile Ad-hoc NETworks (MANETs), often requires to step through a simulation phase. For the results of the simulation to be meaningful, it is important that the model on which is based the simulator matches as closely as possible the reality. In this paper we present the simulation results of a straightforward algorithm using several popular simulators (OPNET Modeler, NS-2, GloMoSim). The results tend to show that significant divergences exist between the simulators. This can be explained partly by the mismatching of the modelisation of each simulator and also by the different levels of detail provided to implement and configure the simulated scenarios.
{"title":"On the accuracy of MANET simulators","authors":"D. Cavin, Y. Sasson, A. Schiper","doi":"10.1145/584490.584499","DOIUrl":"https://doi.org/10.1145/584490.584499","url":null,"abstract":"The deployment of wireless applications or protocols in the context of Mobile Ad-hoc NETworks (MANETs), often requires to step through a simulation phase. For the results of the simulation to be meaningful, it is important that the model on which is based the simulator matches as closely as possible the reality. In this paper we present the simulation results of a straightforward algorithm using several popular simulators (OPNET Modeler, NS-2, GloMoSim). The results tend to show that significant divergences exist between the simulators. This can be explained partly by the mismatching of the modelisation of each simulator and also by the different levels of detail provided to implement and configure the simulated scenarios.","PeriodicalId":344182,"journal":{"name":"Principles of Mobile Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126789345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we analyze the node spatial distribution generated by nodes moving according to the random waypoint model, which is widely used in the simulation of mobile ad hoc networks. We extend an existing analysis for the case in which nodes are continuously moving (i.e., the pause time is 0) to the more general case in which nodes have arbitrary pause times between movements. We also generalize the mobility model, allowing the nodes to remain stationary for the entire simulation time with a given probabilit . Our analysis shows that the structure of the resulting as asymptotic spatial density is composed by three distinct components: the initial, the pause and the mobilit component. The relative values of these components depend on the mobilit parameters. We derive an explicit formula of the one-dimensional node spatial density, and an approximated formula for the two-dimensional case.The quality of this approximation is verified through experimentation, which shows that the accuracy heavily depends on the choice of the mobilit parameters.
{"title":"An analysis of the node spatial distribution of the random waypoint mobility model for ad hoc networks","authors":"G. Resta, P. Santi","doi":"10.1145/584490.584500","DOIUrl":"https://doi.org/10.1145/584490.584500","url":null,"abstract":"In this paper we analyze the node spatial distribution generated by nodes moving according to the random waypoint model, which is widely used in the simulation of mobile ad hoc networks. We extend an existing analysis for the case in which nodes are continuously moving (i.e., the pause time is 0) to the more general case in which nodes have arbitrary pause times between movements. We also generalize the mobility model, allowing the nodes to remain stationary for the entire simulation time with a given probabilit . Our analysis shows that the structure of the resulting as asymptotic spatial density is composed by three distinct components: the initial, the pause and the mobilit component. The relative values of these components depend on the mobilit parameters. We derive an explicit formula of the one-dimensional node spatial density, and an approximated formula for the two-dimensional case.The quality of this approximation is verified through experimentation, which shows that the accuracy heavily depends on the choice of the mobilit parameters.","PeriodicalId":344182,"journal":{"name":"Principles of Mobile Computing","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133927717","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 proposes to define a caching service for Web Services in mobile wireless ad-hoc networks. The paper discusses many of the issues that need to be tackled in order to realize such a service, and proposes some solutions, some of which are based on previous experience with distributed object caching.
{"title":"Caching web services in mobile ad-hoc networks: opportunities and challenges","authors":"R. Friedman","doi":"10.1145/584490.584508","DOIUrl":"https://doi.org/10.1145/584490.584508","url":null,"abstract":"This paper proposes to define a caching service for Web Services in mobile wireless ad-hoc networks. The paper discusses many of the issues that need to be tackled in order to realize such a service, and proposes some solutions, some of which are based on previous experience with distributed object caching.","PeriodicalId":344182,"journal":{"name":"Principles of Mobile Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133563398","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}
Seamless handover is a fundamental concern in any system with mobility. It is the attempt to provide a given QoS also during the process of migration from one domain (e.g. served by an access point) to another. Its major goal is to hide from the application (or user) any difference between the normal service offered within a domain and during a migration.In this paper we characterize the notion of "seamless handover" in a general framework, identify the fundamental problems, discuss different aspects of this notion, and give a taxonomy of possible approaches to achieve it. We also review concrete examples in mobile computing and mobile computation, map these approaches to our classification and propose a unified architectural framework for implementing seamless handover.
{"title":"General approaches for implementing seamless handover","authors":"M. Endler, Vera Nagamuta","doi":"10.1145/584490.584494","DOIUrl":"https://doi.org/10.1145/584490.584494","url":null,"abstract":"Seamless handover is a fundamental concern in any system with mobility. It is the attempt to provide a given QoS also during the process of migration from one domain (e.g. served by an access point) to another. Its major goal is to hide from the application (or user) any difference between the normal service offered within a domain and during a migration.In this paper we characterize the notion of \"seamless handover\" in a general framework, identify the fundamental problems, discuss different aspects of this notion, and give a taxonomy of possible approaches to achieve it. We also review concrete examples in mobile computing and mobile computation, map these approaches to our classification and propose a unified architectural framework for implementing seamless handover.","PeriodicalId":344182,"journal":{"name":"Principles of Mobile Computing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121401981","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
扫码关注我们
求助内容：
应助结果提醒方式：