Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382563
Pramod A. Jamkhedkar, G. Heileman, I. Martínez-Ortiz
Lack of generic digital rights management applications has stunted the growth of the media distribution industry. In this paper we point out the need for middleware services required to develop digital rights management (DRM) applications. Many functionalities are common to most DRM applications and by nature are highly distributed. Standalone DRM applications have found it difficult to implement these services in an efficient manner and have led to closed solutions with limited capabilities. This paper categorizes these functions with reference to a layered DRM framework as middleware services. The characteristics and interface of each of these services is defined along with a prototype implementation of an agent-based negotiations service.
{"title":"Middleware Services for DRM","authors":"Pramod A. Jamkhedkar, G. Heileman, I. Martínez-Ortiz","doi":"10.1109/COMSWA.2007.382563","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382563","url":null,"abstract":"Lack of generic digital rights management applications has stunted the growth of the media distribution industry. In this paper we point out the need for middleware services required to develop digital rights management (DRM) applications. Many functionalities are common to most DRM applications and by nature are highly distributed. Standalone DRM applications have found it difficult to implement these services in an efficient manner and have led to closed solutions with limited capabilities. This paper categorizes these functions with reference to a layered DRM framework as middleware services. The characteristics and interface of each of these services is defined along with a prototype implementation of an agent-based negotiations service.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"252 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":"131435483","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.382410
S. Sitharaman, K. Anantharaman
In this paper, we seek to establish probabilistic bounds of retransmission delays for transporting multilayer video frames over IEEE 802.11e QAP/QSTA with enhanced MAC distributed coordination function (EDCF). We consider an end-to-end multilayer video streaming that uses hybrid FEC/ARQ error detection and control. Under multiple priority levels of IEEE 802.11e MAC EDCF, we first establish steady-state collision probabilities and contention resolution delays, given the number of nodes. We introduce a time-varying Rayleigh slow-fading channel error model and studying its effect on MAC EDCF transmissions. For video transmissions, we model the expected waiting time of EDCF MAC video queue using head-of-line (HOL) priority queueing discipline using the MAC delay distribution derived earlier as service distribution. The total MAC EDCF video (base layer) queueing delay is the sum of expected waiting time of high-priority voice frames, service residual of best-effort data and the expected waiting time of video frames at HOL queue. Next, we model video retransmission events at receiver as renewal-reward process of frame(s) identified for retransmission to establish the "spread"-time between successful renewal events. The "spread"-time is indeed the probabilistic retransmission bound that we seek for a single video frame identified for retransmission. We verify our model and analytical bounds using an in-house multimedia mobile communication platform (MMCP), written entirely in software to study the cross-layer interworking between MAC and transport for IEEE 802.11 and 802.11e MAC. MMCP currently supports MPEG4 single-layer and FGS two-layer with concurrent voice and video streaming capabilities. Our model, when combined with a receiver-based channel feedback, can yield a jitter-free, rate-adaptive and guaranteed "base" video quality.
{"title":"Impact of Retransmission Delays on Multilayer Video Streaming over IEEE 802.1le Wireless Networks","authors":"S. Sitharaman, K. Anantharaman","doi":"10.1109/COMSWA.2007.382410","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382410","url":null,"abstract":"In this paper, we seek to establish probabilistic bounds of retransmission delays for transporting multilayer video frames over IEEE 802.11e QAP/QSTA with enhanced MAC distributed coordination function (EDCF). We consider an end-to-end multilayer video streaming that uses hybrid FEC/ARQ error detection and control. Under multiple priority levels of IEEE 802.11e MAC EDCF, we first establish steady-state collision probabilities and contention resolution delays, given the number of nodes. We introduce a time-varying Rayleigh slow-fading channel error model and studying its effect on MAC EDCF transmissions. For video transmissions, we model the expected waiting time of EDCF MAC video queue using head-of-line (HOL) priority queueing discipline using the MAC delay distribution derived earlier as service distribution. The total MAC EDCF video (base layer) queueing delay is the sum of expected waiting time of high-priority voice frames, service residual of best-effort data and the expected waiting time of video frames at HOL queue. Next, we model video retransmission events at receiver as renewal-reward process of frame(s) identified for retransmission to establish the \"spread\"-time between successful renewal events. The \"spread\"-time is indeed the probabilistic retransmission bound that we seek for a single video frame identified for retransmission. We verify our model and analytical bounds using an in-house multimedia mobile communication platform (MMCP), written entirely in software to study the cross-layer interworking between MAC and transport for IEEE 802.11 and 802.11e MAC. MMCP currently supports MPEG4 single-layer and FGS two-layer with concurrent voice and video streaming capabilities. Our model, when combined with a receiver-based channel feedback, can yield a jitter-free, rate-adaptive and guaranteed \"base\" video quality.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"42 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":"123550148","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.382501
Cempaka Wangi, R. V. Prasad, I. Niemegeers, S. Groot
We have been witnessing developments of many innovative applications in the field of ad hoc wireless networks as well as many projects in the area of user-centric, context aware and ambient assisted networks. This paper introduces a novel framework called FedNets that bridges user centric networks to form an ad hoc federation to achieve group cooperation. Our preliminary study of all the mechanisms, requirements and potential techniques that need to be addressed in this regard is presented. We describe a roadmap towards a fully networked cooperative interaction. We believe that this paper will serve as the basis for our next stages of development, as well as for other similar works in the field of wireless ad hoc networks.
{"title":"Ad Hoc Federation of Networks (FedNets) - Mechanisms and Requirements","authors":"Cempaka Wangi, R. V. Prasad, I. Niemegeers, S. Groot","doi":"10.1109/COMSWA.2007.382501","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382501","url":null,"abstract":"We have been witnessing developments of many innovative applications in the field of ad hoc wireless networks as well as many projects in the area of user-centric, context aware and ambient assisted networks. This paper introduces a novel framework called FedNets that bridges user centric networks to form an ad hoc federation to achieve group cooperation. Our preliminary study of all the mechanisms, requirements and potential techniques that need to be addressed in this regard is presented. We describe a roadmap towards a fully networked cooperative interaction. We believe that this paper will serve as the basis for our next stages of development, as well as for other similar works in the field of wireless ad hoc networks.","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":"127268003","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.382597
Anshul Singhal, Vaibhav Garg, A. Mathuria
We analyze two recent key agreement protocols designed to provide access control in wireless networks. Both protocols are intended to be resistant to denial-of-service attacks. We identify computation DoS attacks against the protocols and model one of the attacks using a cost-based framework proposed by Meadows. We also identify several other security flaws in the protocols. We propose modifications to the protocols to improve their DoS resistance and overall security.
{"title":"Analysis and Enhancement of Two Key Agreement Protocols for Wireless Networks","authors":"Anshul Singhal, Vaibhav Garg, A. Mathuria","doi":"10.1109/COMSWA.2007.382597","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382597","url":null,"abstract":"We analyze two recent key agreement protocols designed to provide access control in wireless networks. Both protocols are intended to be resistant to denial-of-service attacks. We identify computation DoS attacks against the protocols and model one of the attacks using a cost-based framework proposed by Meadows. We also identify several other security flaws in the protocols. We propose modifications to the protocols to improve their DoS resistance and overall security.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"25 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":"122045889","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.382612
H. Song, P. Yalagandula
Measuring real-time end-to-end network path performance metrics is important for several distributed applications such as media streaming systems (e.g., for switching to paths with higher bandwidth and lower jitter) and content distribution systems (e.g., for selecting servers with lower latency). However, it is challenging to perform such end-to-end pairwise measurements in large distributed systems while achieving high accuracy and avoid interfering with existing traffic. On the end hosts, the measurements can overload the machine by causing interference among themselves and other processes. On the network, the measurement packets from different hosts can interfere among themselves and with other flows on bottleneck links. In this paper, we propose a system to monitor end-host and network resources and adapt the number of measurements according to the observed load. Our scheme avoids interference by measuring only a small subset of network paths and reconstructing the entire network path properties from the partial, indirect measurements. Our simulation experiments and real testbed experiments on PlanetLab show that our path selection algorithm working with resource constraints does not adversely affect the accuracy of inference and our system can effectively adapt to the changing resource usage at the end hosts.
{"title":"Real-time End-to-end Network Monitoring in Large Distributed Systems","authors":"H. Song, P. Yalagandula","doi":"10.1109/COMSWA.2007.382612","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382612","url":null,"abstract":"Measuring real-time end-to-end network path performance metrics is important for several distributed applications such as media streaming systems (e.g., for switching to paths with higher bandwidth and lower jitter) and content distribution systems (e.g., for selecting servers with lower latency). However, it is challenging to perform such end-to-end pairwise measurements in large distributed systems while achieving high accuracy and avoid interfering with existing traffic. On the end hosts, the measurements can overload the machine by causing interference among themselves and other processes. On the network, the measurement packets from different hosts can interfere among themselves and with other flows on bottleneck links. In this paper, we propose a system to monitor end-host and network resources and adapt the number of measurements according to the observed load. Our scheme avoids interference by measuring only a small subset of network paths and reconstructing the entire network path properties from the partial, indirect measurements. Our simulation experiments and real testbed experiments on PlanetLab show that our path selection algorithm working with resource constraints does not adversely affect the accuracy of inference and our system can effectively adapt to the changing resource usage at the end hosts.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"151 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":"114343266","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.382498
Hyewon Lee, I. Tinnirello, Jeonggyun Yu, Sunghyun Choi
Recently, along with many emerging applications and services over Wireless LANs (WLANs), the demands for higher-speed WLANs have been growing drastically. However, it is well known that IEEE 802.11 Medium Access Control (MAC) has a high overhead. As a solution to improve the system efficiency, the new IEEE 802.11e MAC introduces Block ACK scheme. In this paper, we mathematically analyze both throughput and delay performances of the 802.11e Block ACK scheme over a noisy channel considering the Block ACK protection scheme. Then, the numerical results are verified with ns-2 simulations.
{"title":"Throughput and Delay Analysis of IEEE 802.1le Block ACK with Channel Errors","authors":"Hyewon Lee, I. Tinnirello, Jeonggyun Yu, Sunghyun Choi","doi":"10.1109/COMSWA.2007.382498","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382498","url":null,"abstract":"Recently, along with many emerging applications and services over Wireless LANs (WLANs), the demands for higher-speed WLANs have been growing drastically. However, it is well known that IEEE 802.11 Medium Access Control (MAC) has a high overhead. As a solution to improve the system efficiency, the new IEEE 802.11e MAC introduces Block ACK scheme. In this paper, we mathematically analyze both throughput and delay performances of the 802.11e Block ACK scheme over a noisy channel considering the Block ACK protection scheme. Then, the numerical results are verified with ns-2 simulations.","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":"122287819","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.382447
Afrasyab Bashir, A. Nagar, H. Tawfik
Contemporary Grid monitoring services lack the functionality to monitor batch-schedulers' job queue information and the status of jobs submitted. Moreover, the monitored data delivered by them is only virtually real-time. The former implies that these services are not capable of monitoring a batch-scheduler's inability to process a particular job. The latter implies that the strategies based solely upon the currency of monitored information can lead to delayed, if not wrong, scheduling and management decisions. Batch-scheduler monitoring is fundamentally imperative for future resource performance predictions that help meta-schedulers in deciding optimal schedules for deadline-constrained jobs. We have developed a meta-scheduler information service (MSIS), which monitors the batch-schedulers for up-to-date information about their job queues, current status of the jobs and the underlying resources. MSIS can be used in its two totally independent modes: as a retrofit API library to enhance capabilities of contemporary grid monitoring services and as a web service. It, in combination with any grid monitoring service, provides comprehensive information which can be used in estimating a resource's future state over a limited period of time.
{"title":"MSIS: Meta-scheduler Infornation Service for Resource Performance Predictors","authors":"Afrasyab Bashir, A. Nagar, H. Tawfik","doi":"10.1109/COMSWA.2007.382447","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382447","url":null,"abstract":"Contemporary Grid monitoring services lack the functionality to monitor batch-schedulers' job queue information and the status of jobs submitted. Moreover, the monitored data delivered by them is only virtually real-time. The former implies that these services are not capable of monitoring a batch-scheduler's inability to process a particular job. The latter implies that the strategies based solely upon the currency of monitored information can lead to delayed, if not wrong, scheduling and management decisions. Batch-scheduler monitoring is fundamentally imperative for future resource performance predictions that help meta-schedulers in deciding optimal schedules for deadline-constrained jobs. We have developed a meta-scheduler information service (MSIS), which monitors the batch-schedulers for up-to-date information about their job queues, current status of the jobs and the underlying resources. MSIS can be used in its two totally independent modes: as a retrofit API library to enhance capabilities of contemporary grid monitoring services and as a web service. It, in combination with any grid monitoring service, provides comprehensive information which can be used in estimating a resource's future state over a limited period of time.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"7 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":"126675372","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.382558
Hamid Mousavi, M. E. Rafiei, A. Movaghar
Web is one the biggest source of information for many. It is also increasingly growing. For easier use of the Web, Web search engines (WSEs) are being used frequently. However, there is little information about the characteristics of the Web and also WSEs. One usual way to analysis these characteristics is to use a uniform sample. In such approaches, instead of working on the entire Web we can work on a small subset of the Web representing entire Web. In this paper, we propose a new method, called bucket-based sampling (BBS), to gather this small but uniform subset of the Web. The analyses show that BBS improves the samples' uniformity, at least 6.95% respecting PAGERANK-SMP, one of the best existing methods. Using samples gathered by BBS, we compare the relative size of seven famous WSEs. We also estimate some important characteristics of the Web. For example we estimate that the size of indexable Web is around 20.14 billion pages.
{"title":"Characterizing the Web Using a New Uniform Sampling Approach","authors":"Hamid Mousavi, M. E. Rafiei, A. Movaghar","doi":"10.1109/COMSWA.2007.382558","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382558","url":null,"abstract":"Web is one the biggest source of information for many. It is also increasingly growing. For easier use of the Web, Web search engines (WSEs) are being used frequently. However, there is little information about the characteristics of the Web and also WSEs. One usual way to analysis these characteristics is to use a uniform sample. In such approaches, instead of working on the entire Web we can work on a small subset of the Web representing entire Web. In this paper, we propose a new method, called bucket-based sampling (BBS), to gather this small but uniform subset of the Web. The analyses show that BBS improves the samples' uniformity, at least 6.95% respecting PAGERANK-SMP, one of the best existing methods. Using samples gathered by BBS, we compare the relative size of seven famous WSEs. We also estimate some important characteristics of the Web. For example we estimate that the size of indexable Web is around 20.14 billion pages.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"18 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":"125665081","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.382619
T. Patra, J. Kuri, P. Nuggehalli
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capacity region has long been known to be NP-hard. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the heuristic is very simple to implement and is not overly sensitive to the threshold value used. We find empirical conditions for our heuristic to be near-optimal as well as network scenarios when our simple heuristic does not perform very well. We provide extensive numerical and simulation results for different parameter settings of our model.
{"title":"On Optimal Performance in Mobile Ad hoc Networks","authors":"T. Patra, J. Kuri, P. Nuggehalli","doi":"10.1109/COMSWA.2007.382619","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382619","url":null,"abstract":"In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capacity region has long been known to be NP-hard. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the heuristic is very simple to implement and is not overly sensitive to the threshold value used. We find empirical conditions for our heuristic to be near-optimal as well as network scenarios when our simple heuristic does not perform very well. We provide extensive numerical and simulation results for different parameter settings of our model.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"71 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":"132903063","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.382486
B. Arunachalan, J. Light, Ian Watson
Healthcare environment integrate several health care services through a high degree of mutual work, mobility and information access from many devices and artifacts. Sharing of information through a fast and reliable transmission media among the services will have a significant impact. The rapid developments in mobile communication technologies and new generations of mobile devices allow users access to stored data even when they travel. This capability has elicited emergency medical data transmission over cellular network. In this paper, we have proposed a message framework for emergency medical data transmission and an agent based implementation mechanism. The HL7 messaging format, a standard adopted for medical data transmission is discussed. The messaging mechanism is used in AMMA; an agent based mobile middleware architecture for reliable transmission of patient data from the ambulance to the hospital over code division multiple access (CDMA) cellular network.
{"title":"Mobile Agent Based Messaging Mechanism for Emergency Medical Data Transmission Over Cellular Networks","authors":"B. Arunachalan, J. Light, Ian Watson","doi":"10.1109/COMSWA.2007.382486","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382486","url":null,"abstract":"Healthcare environment integrate several health care services through a high degree of mutual work, mobility and information access from many devices and artifacts. Sharing of information through a fast and reliable transmission media among the services will have a significant impact. The rapid developments in mobile communication technologies and new generations of mobile devices allow users access to stored data even when they travel. This capability has elicited emergency medical data transmission over cellular network. In this paper, we have proposed a message framework for emergency medical data transmission and an agent based implementation mechanism. The HL7 messaging format, a standard adopted for medical data transmission is discussed. The messaging mechanism is used in AMMA; an agent based mobile middleware architecture for reliable transmission of patient data from the ambulance to the hospital over code division multiple access (CDMA) cellular network.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"8 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":"131409696","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
扫码关注我们
求助内容：
应助结果提醒方式：