Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382469
Meng Hai-Tao
Sensor networks trigger alerts when some conditions are satisfied. However when loss of data happens, a conservative condition may not generate a necessary alert while an aggressive condition may alerts before it really happens. We suggest new classes of conditions that provide a more accurate alert by investigating systems' properties in both replicated and non-replicated architectures. Our main result indicates that a triggering algorithm, used in one of our condition systems, strictly dominates another algorithm for conservative system, yet, both algorithms satisfy the same set of properties. Therefor such algorithm is much promising to be optimized under our conditions.
{"title":"Completeness Conditions for Accurate Alerting in Sensor Networks","authors":"Meng Hai-Tao","doi":"10.1109/COMSWA.2007.382469","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382469","url":null,"abstract":"Sensor networks trigger alerts when some conditions are satisfied. However when loss of data happens, a conservative condition may not generate a necessary alert while an aggressive condition may alerts before it really happens. We suggest new classes of conditions that provide a more accurate alert by investigating systems' properties in both replicated and non-replicated architectures. Our main result indicates that a triggering algorithm, used in one of our condition systems, strictly dominates another algorithm for conservative system, yet, both algorithms satisfy the same set of properties. Therefor such algorithm is much promising to be optimized under our conditions.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121826247","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382448
J. Chin, Ning Zhang, A. Nenadic, L. Yao, J. Brooke
This paper describes our on-going work on the design and development of a context constrained authorisation architecture to support pervasive grid computing. It discusses security implications when bridging pervasive computing and grid computing, and analyses the limitations of current grid authorisation solutions in this pervasive grid environment. We propose some novel grid authorisation enhancements that takes into account not only users' static attributes, but also their dynamic contextual attributes inherent in pervasive computing. The design has adhered to open grid standards and specifications, and is based upon a modular layered approach so that any existing or emerging authorisation mechanisms or solutions can easily be plugged into or unplugged from the architecture. In addition, the architecture can inter-work with and be easily integrated with other grid security building blocks.
{"title":"Towards Context Constrained Authorisation for Pervasive Grid Computing","authors":"J. Chin, Ning Zhang, A. Nenadic, L. Yao, J. Brooke","doi":"10.1109/COMSWA.2007.382448","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382448","url":null,"abstract":"This paper describes our on-going work on the design and development of a context constrained authorisation architecture to support pervasive grid computing. It discusses security implications when bridging pervasive computing and grid computing, and analyses the limitations of current grid authorisation solutions in this pervasive grid environment. We propose some novel grid authorisation enhancements that takes into account not only users' static attributes, but also their dynamic contextual attributes inherent in pervasive computing. The design has adhered to open grid standards and specifications, and is based upon a modular layered approach so that any existing or emerging authorisation mechanisms or solutions can easily be plugged into or unplugged from the architecture. In addition, the architecture can inter-work with and be easily integrated with other grid security building blocks.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127483717","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382553
M. H. Firooz, K. Ronasi, Mohammadreza Pakravan, A. Avanaki
Due to the constraints of P2P networks (such as bandwidth limitation) multiple senders should be employed for reliable multimedia streaming. This paper introduces a mathematic approach to select a set of senders among all available senders to provide the most reliable stream for the receiver. This selection is based on upload bandwidths and availability of peers as well as bandwidth of links connecting the senders and the receiver. Our method is called IPROMISE as it is an improved version of the PROMISE algorithm. Simulation results demonstrate improved media quality delivered to the receiver, while the complexity of sender selection remains the same.
{"title":"IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks","authors":"M. H. Firooz, K. Ronasi, Mohammadreza Pakravan, A. Avanaki","doi":"10.1109/COMSWA.2007.382553","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382553","url":null,"abstract":"Due to the constraints of P2P networks (such as bandwidth limitation) multiple senders should be employed for reliable multimedia streaming. This paper introduces a mathematic approach to select a set of senders among all available senders to provide the most reliable stream for the receiver. This selection is based on upload bandwidths and availability of peers as well as bandwidth of links connecting the senders and the receiver. Our method is called IPROMISE as it is an improved version of the PROMISE algorithm. Simulation results demonstrate improved media quality delivered to the receiver, while the complexity of sender selection remains the same.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125004334","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382562
R. Sudha, M.R. Rajagopalan, M. Selvanayaki, S.Thamarai Selvi
Ubiquitous computing poses the challenge of increased communication, context-awareness and functionality. In a highly dynamic and weekly connected ubiquitous environment, continuous access to the network (synchronous communication) is very difficult. So it's necessary to go for tuple space which provides asynchronous communication without any loss in data. Tuple space offers a coordination infrastructure for communication between autonomous entities by providing a logically shared memory along with data persistence, transactional security as well as temporal and spatial decoupling properties that make it desirable for distributed systems [2] such as ubiquitous computing. In order to automate the task and the system to be intelligent, context awareness is a must. This can be achieved by using semantic web technology. Existing middleware's for ubiquitous computing concentrates on RPC communication paradigm and deals with context-awareness separately. In our approach of constructing the middleware we provide common solution to both communication and context-awareness using ubiquitous semantic space. Ubiquitous semantic space [5] brings together tuple space, semantic web technologies and ubiquitous computing. Hence in this paper, we introduce a context-aware and co-ordination middleware framework for ubiquitous environment using ubiquitous semantic space. Ubiquitous semantic space uses ontologies to define the semantics of various concepts. Using ontologies facilitates different agents in the environments to have a common semantic understanding of different contexts. Ontology is represented using ontology web language, OWL [6]. We have modeled a ubiquitous semantic space ontology structure suitable for communicating conceptual information among the agents. Our model also incorporates context-triggered action which is more useful for real-time ubiquitous application having reactive behavior. For enabling context-triggered action, our model has reactive space into ubiquitous semantic space. Reactive space, stores rules written in SWRL [22], semantic web rule language and fired using JESS [3] reasoner at the appropriate time. The middleware could easily adapt to changes in the environment. The structure of the ubiquitous semantic space is designed in a fashion to have privacy among the communicating devices and the agents. Hence our middleware uses a decentralized architecture which supports asynchronous communication, context-awareness, context-sensitive communication, Privacy sensitive, adaptive to context-changes and reactive to emergency situation.
{"title":"Ubiquitous Semantic Space: A context-aware and coordination middleware for Ubiquitous Computing","authors":"R. Sudha, M.R. Rajagopalan, M. Selvanayaki, S.Thamarai Selvi","doi":"10.1109/COMSWA.2007.382562","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382562","url":null,"abstract":"Ubiquitous computing poses the challenge of increased communication, context-awareness and functionality. In a highly dynamic and weekly connected ubiquitous environment, continuous access to the network (synchronous communication) is very difficult. So it's necessary to go for tuple space which provides asynchronous communication without any loss in data. Tuple space offers a coordination infrastructure for communication between autonomous entities by providing a logically shared memory along with data persistence, transactional security as well as temporal and spatial decoupling properties that make it desirable for distributed systems [2] such as ubiquitous computing. In order to automate the task and the system to be intelligent, context awareness is a must. This can be achieved by using semantic web technology. Existing middleware's for ubiquitous computing concentrates on RPC communication paradigm and deals with context-awareness separately. In our approach of constructing the middleware we provide common solution to both communication and context-awareness using ubiquitous semantic space. Ubiquitous semantic space [5] brings together tuple space, semantic web technologies and ubiquitous computing. Hence in this paper, we introduce a context-aware and co-ordination middleware framework for ubiquitous environment using ubiquitous semantic space. Ubiquitous semantic space uses ontologies to define the semantics of various concepts. Using ontologies facilitates different agents in the environments to have a common semantic understanding of different contexts. Ontology is represented using ontology web language, OWL [6]. We have modeled a ubiquitous semantic space ontology structure suitable for communicating conceptual information among the agents. Our model also incorporates context-triggered action which is more useful for real-time ubiquitous application having reactive behavior. For enabling context-triggered action, our model has reactive space into ubiquitous semantic space. Reactive space, stores rules written in SWRL [22], semantic web rule language and fired using JESS [3] reasoner at the appropriate time. The middleware could easily adapt to changes in the environment. The structure of the ubiquitous semantic space is designed in a fashion to have privacy among the communicating devices and the agents. Hence our middleware uses a decentralized architecture which supports asynchronous communication, context-awareness, context-sensitive communication, Privacy sensitive, adaptive to context-changes and reactive to emergency situation.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122839385","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382414
A. Peddemors, I. Niemegeers, H. Eertink
Mobile devices are increasingly equipped with multiple network interfaces that can dynamically support access to different kinds of wireless and fixed networks. Dealing with these dynamics and heterogeneity is challenging for many types of applications running on mobile devices and is hindered by the lack of a consistent overview of available network resources. In this paper we present a system service which offers an extensible network resource abstraction to applications running on a mobile device. It can be used in conjunction with well-known APIs that provide access to these resources. We argue that the cross-layer and mobility reflecting transparency introduced by the model underpinning this abstraction is essential for applications that need to dynamically adapt to changes in available network resources. Ease of adaptation may reduce the reliance on dedicated mobility management protocols. Furthermore, we show that different types of mobile applications may use this abstraction at various levels of detail, to match their specific decision making needs. We introduce the architecture of the service, discuss experiences with its reference implementation, and show how the system can be extended to accommodate new network technologies. Experiments with a real-world application indicate that uncomplicated application logic suffices for a dynamic network environment.
{"title":"An Extensible Network Resource Abstraction for Applications on Mobile Devices","authors":"A. Peddemors, I. Niemegeers, H. Eertink","doi":"10.1109/COMSWA.2007.382414","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382414","url":null,"abstract":"Mobile devices are increasingly equipped with multiple network interfaces that can dynamically support access to different kinds of wireless and fixed networks. Dealing with these dynamics and heterogeneity is challenging for many types of applications running on mobile devices and is hindered by the lack of a consistent overview of available network resources. In this paper we present a system service which offers an extensible network resource abstraction to applications running on a mobile device. It can be used in conjunction with well-known APIs that provide access to these resources. We argue that the cross-layer and mobility reflecting transparency introduced by the model underpinning this abstraction is essential for applications that need to dynamically adapt to changes in available network resources. Ease of adaptation may reduce the reliance on dedicated mobility management protocols. Furthermore, we show that different types of mobile applications may use this abstraction at various levels of detail, to match their specific decision making needs. We introduce the architecture of the service, discuss experiences with its reference implementation, and show how the system can be extended to accommodate new network technologies. Experiments with a real-world application indicate that uncomplicated application logic suffices for a dynamic network environment.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128565749","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382446
M. V. Reddy, S. Chaudhary
Due to advancement in grid technologies, resources spread across the globe can be accessed using standard general-purpose protocols. Simulations and scientific experiments were earlier restricted due to limited availability of the resources. These are now carried out vigorously in the grid. Grid environments are dynamic in nature. The resources in a grid are heterogeneous in nature and are not under a central control. So scheduling in grid is complex. The initial schedule obtained for an application may not be good as it involves the selection of resources at a future time. The resource characteristics like CPU availability, memory availability, network bandwidth etc keep changing. Rescheduling becomes necessary under these conditions. The research experiment uses the fault-tolerant functionalities of MPICH-V2 to migrate MPI processes. Load-balancing modules, which make a decision of when and where to migrate a process are added into the MPICH-V2 system. Simulations are done to show that process migration is viable rescheduling technique for computationally intensive applications. The research experiment also gives brief descriptions of some existing fault-tolerant MPI implementations.
{"title":"Scheduling in Grid: Rescheduling MPI applications using a fault-tolerant MPI implementation","authors":"M. V. Reddy, S. Chaudhary","doi":"10.1109/COMSWA.2007.382446","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382446","url":null,"abstract":"Due to advancement in grid technologies, resources spread across the globe can be accessed using standard general-purpose protocols. Simulations and scientific experiments were earlier restricted due to limited availability of the resources. These are now carried out vigorously in the grid. Grid environments are dynamic in nature. The resources in a grid are heterogeneous in nature and are not under a central control. So scheduling in grid is complex. The initial schedule obtained for an application may not be good as it involves the selection of resources at a future time. The resource characteristics like CPU availability, memory availability, network bandwidth etc keep changing. Rescheduling becomes necessary under these conditions. The research experiment uses the fault-tolerant functionalities of MPICH-V2 to migrate MPI processes. Load-balancing modules, which make a decision of when and where to migrate a process are added into the MPICH-V2 system. Simulations are done to show that process migration is viable rescheduling technique for computationally intensive applications. The research experiment also gives brief descriptions of some existing fault-tolerant MPI implementations.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130522338","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382614
Y. Reddy, V. Phoha
A novel genetic algorithm application is proposed for adaptive power and subcarrier allocation in multi-user OFDM systems. The proposed method is compared with Eshan's [Ehsan Bakhtiari and Babak H. Khalaj, "A new Joint Power and Subcarrier Allocation Scheme for Multiuser OFDM Systems", 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, Beijing, China, Vol. 2, PP 1959 -1963, Sept 7 -10, 2003.] power and subcarrier allocation algorithm and Wang's modified genetic algorithm [Yongxue Wang et al.,"Adaptive Subcarrier and Bit Allocation for Multiuser OFDM System Based on Genetic Algorithm", IEEE 2005.]. Our method has fast convergence and can handle large allocations of subcarriers to users without performance degradation. The simulation results show that our approach is a viable alternative to existing methods for optimum resource allocation.
提出了一种新的遗传算法应用于多用户OFDM系统的自适应功率和子载波分配。该方法与Eshan的Ehsan Bakhtiari和Babak H. Khalaj的“多用户OFDM系统的一种新的联合功率和子载波分配方案”进行了比较，第14届IEEE个人、室内和移动无线电通信论文集，北京，第2卷，PP 1959 -1963, 2003年9月7 -10日。王永学等，“基于遗传算法的多用户OFDM系统自适应子载波和位分配”，IEEE 2005。该方法收敛速度快，可以处理大量子载波分配给用户而不降低性能。仿真结果表明，该方法是现有资源优化分配方法的可行替代方案。
{"title":"Genetic Algorithm Approach for Resource Allocation in Multi-User OFDM Systems","authors":"Y. Reddy, V. Phoha","doi":"10.1109/COMSWA.2007.382614","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382614","url":null,"abstract":"A novel genetic algorithm application is proposed for adaptive power and subcarrier allocation in multi-user OFDM systems. The proposed method is compared with Eshan's [Ehsan Bakhtiari and Babak H. Khalaj, \"A new Joint Power and Subcarrier Allocation Scheme for Multiuser OFDM Systems\", 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, Beijing, China, Vol. 2, PP 1959 -1963, Sept 7 -10, 2003.] power and subcarrier allocation algorithm and Wang's modified genetic algorithm [Yongxue Wang et al.,\"Adaptive Subcarrier and Bit Allocation for Multiuser OFDM System Based on Genetic Algorithm\", IEEE 2005.]. Our method has fast convergence and can handle large allocations of subcarriers to users without performance degradation. The simulation results show that our approach is a viable alternative to existing methods for optimum resource allocation.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132155022","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382566
S. Srivastava, Subrat Kar
We present an analysis of delay encountered in successfully accessing the random access channel (RACH) of general packet radio service (GPRS) Radio Interface by mobile stations that want to initiate data transfer. The process of RACH access is described and the MS state modeled as a discrete-time Markov chain (DTMC) in order to derive the delay. We evaluate the variation of the radio channel access delay with the maximum attempts, inter attempt time interval, number of mobile users, number of backlogged users, radio priority, rate of incoming data and rate of retransmissions. The blocking probability or the probability of complete channel access failure is also evaluated.
{"title":"Analysis of GPRS Radio Channel Access Delay","authors":"S. Srivastava, Subrat Kar","doi":"10.1109/COMSWA.2007.382566","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382566","url":null,"abstract":"We present an analysis of delay encountered in successfully accessing the random access channel (RACH) of general packet radio service (GPRS) Radio Interface by mobile stations that want to initiate data transfer. The process of RACH access is described and the MS state modeled as a discrete-time Markov chain (DTMC) in order to derive the delay. We evaluate the variation of the radio channel access delay with the maximum attempts, inter attempt time interval, number of mobile users, number of backlogged users, radio priority, rate of incoming data and rate of retransmissions. The blocking probability or the probability of complete channel access failure is also evaluated.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130226538","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382571
A. Panagakis, A. Vaios, I. Stavrakakis
In a delay tolerant network (DTN) the nodes may behave autonomously deciding on their own whether to implement or not the rules of a routing algorithm. In this paper, the effects of node cooperation (or lack of it) are explored for three well-known routing algorithms proposed for DTNs with respect to the message delivery delay and the transmission overhead incurred until message delivery or the termination of the message spreading process. The results show that the sensitivity of the algorithms to the cooperation degree can be high, to the point of making them inferior to algorithms they typically outperform under a fully cooperative environment. Finally, it is demonstrated how a simple mechanism that incorporates the cooperation degree can help improve effectiveness.
{"title":"On the Effects of Cooperation in DTNs","authors":"A. Panagakis, A. Vaios, I. Stavrakakis","doi":"10.1109/COMSWA.2007.382571","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382571","url":null,"abstract":"In a delay tolerant network (DTN) the nodes may behave autonomously deciding on their own whether to implement or not the rules of a routing algorithm. In this paper, the effects of node cooperation (or lack of it) are explored for three well-known routing algorithms proposed for DTNs with respect to the message delivery delay and the transmission overhead incurred until message delivery or the termination of the message spreading process. The results show that the sensitivity of the algorithms to the cooperation degree can be high, to the point of making them inferior to algorithms they typically outperform under a fully cooperative environment. Finally, it is demonstrated how a simple mechanism that incorporates the cooperation degree can help improve effectiveness.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131511542","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}
Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382424
T. H. Labella, I. Dietrich, F. Dressler
We present BARAKA, a new simulator for SANETs. The evaluation of algorithms developed for communication and co-operation in this context is usually accomplished separately. On the one hand, network simulation helps to measure the efficiency of routing or medium access. On the other hand, robot simulators are used to evaluate the physical movements. Using two different simulators might introduce inconsistent results, and might make the transfer on real hardware harder. With the development of methods and techniques for co-operation in Sensor/Actuator Networks (SANETs), the need for integrated evaluation increased. To compensate this demand, we developed BARAKA. This tool provides integrated simulation of communication networks and robotic aspects. Thus, it allows the complete modelling of co-operation issues in SANETs including the performance evaluation of either robot actions or networking aspects while considering mutual impact.
{"title":"BARAKA: A Hybrid Simulator of SANETs","authors":"T. H. Labella, I. Dietrich, F. Dressler","doi":"10.1109/COMSWA.2007.382424","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382424","url":null,"abstract":"We present BARAKA, a new simulator for SANETs. The evaluation of algorithms developed for communication and co-operation in this context is usually accomplished separately. On the one hand, network simulation helps to measure the efficiency of routing or medium access. On the other hand, robot simulators are used to evaluate the physical movements. Using two different simulators might introduce inconsistent results, and might make the transfer on real hardware harder. With the development of methods and techniques for co-operation in Sensor/Actuator Networks (SANETs), the need for integrated evaluation increased. To compensate this demand, we developed BARAKA. This tool provides integrated simulation of communication networks and robotic aspects. Thus, it allows the complete modelling of co-operation issues in SANETs including the performance evaluation of either robot actions or networking aspects while considering mutual impact.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131024937","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
扫码关注我们
求助内容：
应助结果提醒方式：