# Patent

## Title
System and method for remote and mobile patient monitoring service using heterogeneous wireless access networks

## Abstract

A system and method for remote and mobile patient monitoring service is provided using heterogeneous wireless access in which each patient is equipped with a remote monitoring device with a heterogeneous wireless transceiver. This can be a value-added service provided by a Healthcare service provider (i.e., a hospital or healthcare center) for which the Healthcare service provider can pay to the wireless network service provider (i.e., a network operator). With heterogeneous wireless access, a remote/mobile patient can use different types of wireless technologies (e.g., WiMAX-based WMAN and WiFi-based WLAN technologies) to transfer monitored bio-signal data to the healthcare center. The monitoring device can buffer and then transmit the bio-signal data to the healthcare center through the heterogeneous radio access network. In this device, there can be two buffers used to store bio-signal data, each with different priority. The scheduler in this device can make an optimal decision on data transmission. Also, a method is provided to minimize the cost of network connections for remote/mobile patient monitoring.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application claims priority of U.S. provisional patent application Ser. No. 61/102,667 filed Oct. 3, 2008 and hereby incorporates the same provisional application by reference herein in its entirety.


TECHNICAL FIELD
The present disclosure is related to the field of eHealth wireless technologies, in particular, remote and mobile patient monitoring wireless technologies.
BACKGROUND
eHealth (Electronic Health) is an emerging medical service paradigm, which employs information processing and communications to enhance traditional medical services. Remote patient monitoring is an eHealth service, which is used to monitor biosignal data of patients in a stable condition. The biosignal data of a remote/mobile patient can be transferred and processed for diagnosis (e.g., cardiac disease patients by monitoring electrocardiogram (“ECG”) signal and blood pressure or diabetes patients by monitoring sugar level). Remote patient monitoring services can reduce the frequency of face-to-face meetings between patients and healthcare staff and also shorten the time required for treatment acceptance and better management of medication doses to patients. Wireless technologies have been used to improve the flexibility of remote patient monitoring to continuously monitor the status of patients even in presence of mobility. Related works on heterogeneous wireless networks and remote patient monitoring systems can be summarized as follows.
A. Heterogeneous Wireless Networks
Network selection is one of the major issues in heterogeneous wireless access [3]-[7]. The decision on network selection by a mobile user depends on the preference, application requirements, and network condition [3]. An intelligent network selection algorithm based on user utility was proposed in [4]. This user utility is a function of the transmission rate, and different applications can have different utility functions. The network selection algorithm in [5] took both network performance and network access cost into account. In [8], the problem of radio resource allocation for different service providers in a heterogeneous wireless environment was formulated as a noncooperative game and the solution was obtained in terms of allocated bandwidth in different service areas. In [9], a bandwidth aggregation scheme for real-time applications in heterogeneous wireless network was proposed. This scheme uses the earliest delivery path first (EDPF) scheduling to choose packets from different applications to be transmitted over multiple wireless interfaces so that the delay requirements are satisfied. In [10], to alleviate network congestion, a hierarchical radio resource management framework was designed for an integrated wireless local area network (“WLAN”) and cellular network.
Since mobile users need to be handed over between different types of networks (i.e., vertical handoff) mobility management is a significant issue in a heterogeneous wireless access environment [11]-[16]. The problem of admission control for vertical handoff in an integrated WLAN and code division multiple access (“CDMA”) cellular network was proposed in [11] where an optimization problem was formulated as a Markov decision process to minimize call blocking probability while satisfying the throughput and packet delay requirements. In [12], a performance analysis model was proposed for vertical handoff an integrated cellular network and WLAN.
B. eHealth Services Using Wireless Communications
For patients with cardiac diseases, ECG signal can be monitored and transmitted wirelessly to the healthcare center [17]-[19]. GSM (Global System for Mobile Communication) technology and wireless application protocol (WAP) were used in the airmed-cardio system [19] to provide out-of-hospital follow-up services to cardiac patients. Although a cellular network can provide wireless connectivity to highly-mobile patients, its capacity is limited. Besides cellular technology, new wireless technologies (e.g., IEEE 802.16-based (also known as Worldwide Interoperability for Microwave Access (“WiMAX”)) wireless metropolitan area network (“WMAN”) and IEEE 802.11/WiFi-based wireless local area network (“WLAN”)) are also adopted for remote patient monitoring services [20]-[24]. In [21], application of IEEE 802.16/WiMAX-based broadband wireless access technology for mobile telemedicine services (e.g., communication between an ambulance and hospital) was discussed. Also, in [21], a bandwidth allocation and admission control scheme was designed specifically for telemedicine services over a WiMAX network. WiFi technology, which provides large transmission capacity in a small coverage area, can be used locally in a hospital, clinic, and home environment for patient monitoring, clinical alarm notification, workstation on wheels [22], ECG monitoring [23], and telehomecare. Also, WiFi networks are suitable to provide best-effort data communication services for commercial and support applications (e.g., guest access and patient billing [22]).
The concept of using heterogeneous wireless access networks for remote monitoring service was introduced in [25], where a general system model was presented for different eHealth services (e.g., intra-hospital, pre-hospital, tele-homecare, and follow-up services) based on heterogeneous wireless access. Also, a bandwidth allocation and admission control method was developed based on resource sharing using game theory. However, optimization of capacity reservation in the radio access network and issues related to queue management and transmission scheduling in a patient-attached device were not considered.
However, since the traditional remote patient monitoring systems rely on a single wireless technology, they are unable to guarantee that the patients will be “always-connected” with the eHealth service provider (e.g., healthcare center) when the patient roams through different locations.
It is, therefore, desirable to provide a patient monitoring system that implements wireless technologies to enable continuous and ubiquitous patient monitoring wherever and whenever the patient needs.
SUMMARY
An architecture of a remote/mobile patient monitoring service based on the heterogeneous wireless access is provided. eHealth service providers can provide such a value-added service to guarantee the “always-connected” feature “anytime, anywhere” to the patients. The eHealth service provider can be connected with the core network of the wireless network operator. This core network can be connected with any one of the different radio access networks (i.e., IEEE 802.16-based WMAN and IEEE 802.11-based WLAN). A patient-attached device can be employed at or placed on the patient to buffer and control the transmission of biosignal data from sensors on the patient to the radio access network. The biosignal data with different priority can be differentiated by storing the data in the different queues whereby the scheduler can decide to retrieve and transmit data from these different queues according to quality-of-service (“QoS”) requirements. A method to optimize the cost and performance of this remote/mobile patient monitoring service is also provided.
Broadly stated, a system is provided for the remote and mobile monitoring of at least one patient, comprising: a heterogeneous wireless access network providing communication between at least one eHealth service provider and the at least one patient; and at least one monitoring device disposed on the at least one patient, the at least one monitoring device having at least one sensor configured for collecting bio-signal data from the at least one patient, the at least one monitoring device further comprises a heterogeneous wireless transceiver configured to communicate the bio-signal data to the eHealth service provider over the heterogeneous wireless access network.
Broadly stated, a method is provided for buffering and transmitting bio-signal data from a patient-attached monitoring device to an eHealth service provider over a heterogeneous wireless access network, the method comprising the steps of: providing a heterogeneous wireless access network providing communication between at least one eHealth service provider and at least one patient; providing at least one monitoring device and attaching the at least one monitoring device to the at least one patient, the at least one monitoring device having at least one sensor configured for collecting bio-signal data from the at least one patient, the bio-signal data comprising one or more of the group consisting of critical data and normal data, the at least one monitoring device further comprising a heterogeneous wireless transceiver configured to communicate the bio-signal data to the eHealth service provider over the heterogeneous wireless access network; receiving bio-signal data from the at least one monitoring device, the bio-signal data collected by the at least one monitoring device from the at least one patient; packeting and buffering the bio-signal data into at least one queue; and connecting the at least one queue to the heterogeneous wireless transceiver and transmitting the bio-signal data to the eHealth service provider over the heterogeneous wireless access network.
Broadly stated, a system is provided for buffering and transmitting bio-signal data from a patient-attached monitoring device to an eHealth service provider over a heterogeneous wireless access network, comprising: collection means for collecting bio-signal data from the at least one patient, the bio-signal data comprising one or more of the group consisting of critical data and normal data; communications means for communicating the bio-signal data to the eHealth service provider over the heterogeneous wireless access network; means for receiving bio-signal data from the collection means; means for packeting and buffering the bio-signal data into at least one queue; and means for connecting the at least one queue to the communications means and transmitting the bio-signal data to the eHealth service provider over the heterogeneous wireless access network.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1(a) is a block diagram depicting a system model of a remote patient monitoring system.
FIG. 1(b) is a block diagram depicting the decision flow-chart of the remote patient monitoring system of FIG. 1(a).
FIG. 2(a) is a block diagram depicting a sample service area for the remote patient monitoring system of FIG. 1(a).
FIG. 2(b) is a block diagram depicting a mobility state transition diagram for the sample service area of FIG. 2(a).
FIG. 3 is a block diagram depicting the state transitions for a Markov decision process model for the sample service area of FIG. 2(a).
FIG. 4 is a line diagram depicting the cases of connections of patients.
FIG. 5 is a three-dimensional graph depicting the costs of reserving connections for patients.
FIG. 6(a) is a two-dimensional graph depicting the number of reserved connections as compared to the total number of patients.
FIG. 6(b) is a two-dimensional graph depicting the average total cost as compared to the total number of patients.
FIG. 7 is a two-dimensional graph depicting the number of reserved connections as compared to the price of normal WLAN connections.
FIG. 8 is a two-dimensional graph depicting the probability of a patient to access a reserved connection.
FIG. 9(a) is a two-dimensional graph depicting the average queuing delay.
FIG. 9(b) is a two-dimensional graph depicting the connection cost as compared to the normal data packet arrival probability.
FIG. 10 is a two-dimensional graph depicting the average delay and connection costs from a Q-learning algorithm.



DETAILED DESCRIPTION OF EMBODIMENTS
To support biosignal data collection, a general network model for the remote patient monitoring service is shown in FIG. 1(a). The two major entities in this network are the healthcare service provider (e.g., clinic, hospital, or healthcare center) and the network service provider (or network operator). Monitored biosignal data from the patients can be transferred through a radio access network and core network owned by the network service provider to the healthcare service provider. The remote monitoring device can be connected with the sensors attached to a chronic patient whose health condition is stable, for example, a patient with hypertension or with cardiac diseases. The monitored data can be packetized and buffered into the queues based on the priority. In one embodiment, there can be two types of queues in this device—one for critical data (e.g., blood pressure, pulse rate, heart rate) and the other for normal data (e.g., ECG signal). The scheduler can connect the queues for critical and normal data with the heterogeneous wireless transceiver that can dynamically adapt and connect to the healthcare service provider by using an available wireless network.
In one embodiment, a remote and mobile patient monitoring service architecture can use heterogeneous wireless access in which each patient can be equipped with a remote monitoring device with a heterogeneous wireless transceiver (FIG. 1(a)). With heterogeneous wireless access, a mobile patient can use different types of wireless technologies (e.g., WiMAXbased WMAN and WiFi-based WLAN technologies) to transfer monitored biosignal data to the healthcare center. The monitoring device can buffer and then transmit the biosignal data to the healthcare center through the heterogeneous radio access network. This is a value-added service that can be provided by an eHealth service provider (i.e., a hospital or healthcare center) for which the eHealth service provider can pay the wireless network service provider (i.e., a network operator). To optimize the cost for this value-added service, the eHealth service provider has to buy a certain number of connections to be reserved for the patients. This can be formulated as an optimization problem and can be solved using a stochastic programming technique [1] so that the optimal number of reserved connections can be determined to minimize the cost of the eHealth service provider under randomness of connection demand due to the mobility of the patients.
While the eHealth service provider buys the reserved wireless connections for its patients on a long-term basis, the patient-attached monitoring device has to schedule the transmission of biosignal data according to the current network condition on a short-term basis (FIG. 1(b)). Since different queues can be used to buffer different types of biosignal data (i.e., critical and normal monitored data), the scheduler at the patient-attached device has to decide whether to transmit data using the available wireless connections, as well as the queue from which data is to be transmitted. This decision problem at the scheduler can be formulated as a constrained Markov decision process (“CMDP”) [2] with an objective to minimizing the cost of wireless access while satisfying the queueing delay requirements for different biosignal data. However, to obtain the optimal policy for the CMDP model, a linear programming problem needs to be solved which incurs large computational complexity. Therefore, an implementation-friendly algorithm based on Q-learning can be implemented to obtain the solution online. The performance of the remote patient monitoring service architecture can be extensively evaluated. The proposed architecture along with the optimization formulation can be useful for an eHealth service provider to minimize the service cost while maintaining the quality-of-service (QoS) requirements for remote and mobile patient monitoring.
In one embodiment, the system model and optimization formulation presented herein can be used for many eHealth services. In another embodiment, the system and method can be used in the monitoring of ECG signals for patients with cardiac diseases. The ECG signal can be sampled by an ECG device/sensor. The data can then be packetized and stored in a queue as “normal” data waiting for transmission over wireless connections. However, if an abnormal event is detected (e.g., heart rate becomes too low), a special message with the detailed information of the event (e.g., location, time, and condition of the patient) can be generated and stored in a separate queue as “critical” data. In this case, priority can be given to the transmission of “critical” data, so that the patient can be treated promptly. The rest of this application is organized as follows. The architecture of the remote patient monitoring service is described in Section I. Section II presents the optimization formulations to minimize the cost of the proposed remote patient monitoring service. Section III presents the performance evaluation results. Conclusions are stated in Section IV.
I. ARCHITECTURE OF REMOTE PATIENT MONITORING SERVICE USING HETEROGENEOUS WIRELESS ACCESS
A. Network Model
To support biosignal data collection, a general network model for the remote patient monitoring service is shown in FIG. 1(a). Two major entities in this network are the eHealth service provider (e.g., clinic, hospital, or healthcare center) and the network service provider (or network operator). Monitored biosignal data from the patients can be transferred through a radio access network and core network owned by the network service provider to the eHealth service provider. The network operator can offer two types of wireless connections, namely, reserved and on-demand connections. In particular, the eHealth service provider can buy the reserved connections in advance to be used by its patients for a fixed period of time (e.g., a week). However, at a particular time, the reserved connections may not be enough to accommodate all demand from the patients for transmitting biosignal data. Therefore, extra network capacity (i.e., on-demand connections in this case) can be bought for the exceeding demand. The price of an on-demand connection is assumed to be higher than that of a reserved connection.
In one embodiment, a service area can comprise a set of locations. For example, in the service area shown in FIG. 2(a), wireless access to WMAN and WLAN are available (e.g., IEEE 802.16 and IEEE 802.11). While WLAN access is available only in some locations, WMAN access can be available in all locations of a service area. Remote and mobile patients can connect to either a WLAN or the WMAN. The prices charged for a reserved connection and an on-demand WLAN connection at location l are denoted by Pres,lwl and Pond,lwl respectively, and the prices for the WMAN connections are denoted by Pres,lwm and Pond,lwm. It is assumed that Pres,lwl≦Pond,lwl and Pres,lwm≦Pond,lwm.
B. Patient-Attached Monitoring Device
The remote monitoring device can be connected with the sensors attached to a patient whose health condition is stable, for example, a patient with hypertension or with cardiac diseases (FIG. 1(a)). The monitored data can be packetized and, based on its priority, it can be buffered in one of the two queues—one for critical data (e.g., blood pressure, pulse rate, heart rate) and the other for normal data (e.g., ECG signal). The scheduler can connect to the queues for critical and normal data with the heterogeneous wireless transceiver. To minimize the connection cost and satisfy the delay requirements, the scheduler can make two decisions—1) whether to transmit data or not and, in the case of transmission, 2) which queue to transmit from. The duration of a transmission slot can be assumed to be fixed during which one packet can be transmitted. This transmission slot can be composed of the negotiation period between a device and a WMAN base station or WLAN access point, and the data transmission period.
C. Patient Mobility Model
In another embodiment, a patient can move among different locations with different availability of wireless access networks. A set of locations in a service area is denoted by L. For example, in FIG. 2(a), this set can be defined as follows: L={Ma, Ro, Cl, Ho} whose elements represent the mall, road, clinic, and home, respectively. At the mall and a clinic, a patient can have access to both WLAN and WMAN. While traveling on the road, only WMAN connectivity can be available. Given a set of locations in a service area, the mobility of a patient can be modeled by using a Markov chain. The state of this Markov chain can be the location that is observed at the end of a transmission slot. The transition from location l to l′ is indicated by probability Tl,l′, and the probability transition matrix is denoted by T. The steady-state probability that a patient will be in any location can be obtained by solving πT=π and π1=1 where 1 is a vector of ones, π is a vector defined as follows: π=[ . . . π(l) . . . ], in which π(l) is the steady-state probability that a patient will be at location l.
II. OPTIMIZATION OF WIRELESS CONNECTIVITY COST FOR PATIENT MONITORING SERVICE
In one embodiment, an optimization problem for the eHealth service provider to buy the reserved connections from the network operator can be formulated as a stochastic programming (“SP”) problem. The solution of this SP can give the number of reserved connections at a particular location, which can minimize the expected cost of network access under uncertainty of the number of patients in different locations in a service area. Another optimization problem based on a CMDP can be formulated for the patient-attached monitoring device to schedule packet transmissions so that the delay requirements for different biosignal data are satisfied while, at the same time, the network access cost can also minimized. Therefore, both of these optimization models together can improve the efficiency of the proposed remote monitoring service architecture.
A. Optimization of Connection Buying by eHealth Service Provider
1) Probability Distribution of Patients in Different Locations:
In one embodiment, Np can denote the total number of patients in a service area A, and Ti can denote the mobility transition probability matrix of patient i. The mobility transition probability matrix for all patients TA in service area A can be obtained from:

TA=T1 . . . Tl. . . TNp  (1)

where  denotes Kronecker product.

The steady-state probability of a patient to be at a particular location can be obtained by solving πTA=π and π1=1. In this case, the steady-state probability for patient i at location li is denoted by π(l1, . . . , li, . . . , lNp). Then, the probability of having nl patients at a location l can be obtained from:




  
    
      
        
          
            Pr
            (
            
              ...
              ⁢
              
                
              
              ,
              
                n
                i
              
              ,
              ...
            
            ⁢
            
              
            
            )
          
          =
          
            
              ∑
              
                
                  n
                  l
                
                =
                
                  
                    ∑
                    
                      
                        l
                        i
                      
                      =
                      l
                    
                  
                  ⁢
                  1
                
              
            
            ⁢
            
              π
              ⁡
              
                (
                
                  
                    l
                    1
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    l
                    i
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    l
                    
                      N
                      p
                    
                  
                
                )
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            for
            ⁢
            
              
            
            ⁢
            
              
                ∑
                
                  l
                  ∈
                  L
                
              
              ⁢
              
                n
                l
              
            
          
          =
          
            
              N
              p
            
            .
          
        
      
    
    
      
        (
        2
        )
      
    
  




Note that the term





  
    ∑
    
      
        l
        i
      
      =
      l
    
  
  ⁢
  1




above indicates the number of patients at location l. For the special case of all patients having the same π, the probability of having nl patients at location l can be simply obtained based on a multinomial distribution.

2) Formulation of Stochastic Programming:
In another embodiment, a two-stage stochastic programming (SP) with recourse [1] can be used to obtain the number of reserved connections in WLAN and WMAN in a service area. In the first stage, the eHealth service provider can make a decision on the number of reserved connections to be bought from a network operator. The decision in this stage has to be made without complete information on the random number of patients in each location requesting to transmit biosignal data. The number of reserved connections to be bought at location l for accessing WLAN and WMAN is denoted by xlwl and xlwm, respectively. In the second stage, the eHealth service provider can observe the actual number of patients in a particular location (i.e., realization) and makes a decision to buy on-demand connections if the number of patients is larger than the number of available reserved connections. The number of on-demand connections to be bought at location l for accessing WLAN and WMAN are denoted by ylwl and ylwm, respectively. The decision in the second stage (i.e., ylwl and ylwm) can be referred to as a recourse, which is an action used to handle the uncertainty arising due to the mobility of the patients.
The SP problem can be formulated as follows:




  
    
      
        
          Minimize
          ⁢
          
            :
          
          ⁢
          
            
          
          ⁢
          
            
              ∑
              
                l
                ∈
                
                  L
                  wl
                
              
            
            ⁢
            
              
                P
                
                  res
                  ,
                  l
                
                wl
              
              ⁢
              
                x
                l
                wl
              
            
          
        
        +
        
          
            ∑
            
              l
              ∈
              
                L
                wm
              
            
          
          ⁢
          
            
              P
              
                res
                ,
                l
              
              wm
            
            ⁢
            
              x
              l
              wm
            
          
        
        +
        
          
            E
            ω
          
          ⁢
                    ⁢
          
            (
            
              x
              ,
              ω
            
            )
          
        
      
    
    
      
        (
        3
        )
      
    
  
  
    
      
        
          
            
              Subject
              ⁢
              
                
              
              ⁢
              to
              ⁢
              
                :
              
              ⁢
              
                
              
              ⁢
              
                x
                l
                wl
              
            
            +
            
              
                y
                l
                wl
              
              ⁡
              
                (
                ω
                )
              
            
          
          ≥
          
            
              
                n
                ^
              
              l
            
            ⁡
            
              (
              ω
              )
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            l
          
          ∈
          
            L
            wl
          
        
      
    
    
      
        (
        4
        )
      
    
  
  
    
      
        
          
            
              x
              l
              wm
            
            +
            
              
                y
                l
                wm
              
              ⁡
              
                (
                ω
                )
              
            
          
          ≥
          
            
              
                n
                ^
              
              l
            
            ⁡
            
              (
              ω
              )
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            l
          
          ∈
          
            L
            wm
          
        
      
    
    
      
        (
        5
        )
      
    
  
  
    
      
        
          x
          l
          wl
        
        ,
        
          x
          l
          wm
        
        ,
        
          y
          l
          wl
        
        ,
        
          
            y
            l
            wm
          
          ≥
          0
        
      
    
    
      
        (
        6
        )
      
    
  




where Lwl and Lwm denote, respectively, the sets of locations in which only WMAN access or only WLAN access is available (i.e., Lwl∪Lwm=L) and ω=( . . . , nl, . . . ) for l∈L (i.e., ω represents a network access scenario). Eω denotes the expectation over all scenarios. In this case, the number of patients {circumflex over (n)}l requesting to transmit data at location l is a function of ω, i.e., {circumflex over (n)}l(ω)=vlnl where vl is the probability that a patient in location l will transmit data. The constraints in (4) and (5) are used to ensure that all requesting patients can transmit data through either reserved or on-demand connections. Note that the condition “≧” is required for the constraints in (4) and (5), since the decision xlwl and xlwm could be larger than the number of patients {circumflex over (n)}l(ω). Therefore, the condition of equality may not be satisfied without making ylwl(ω) and ylwm(ω) negative which will violate the constraint in (6).
The objective defined in (3) has two parts—the cost incurred in the first stage for the reserved connections (i.e.,




  
    
      ∑
      
        l
        ∈
        
          L
          wl
        
      
    
    ⁢
    
      
        P
        
          res
          ,
          l
        
        wl
      
      ⁢
      
        x
        l
        wl
      
    
  
  +
  
    
      ∑
      
        l
        ∈
        
          L
          wm
        
      
    
    ⁢
    
      
        P
        
          res
          ,
          l
        
        wm
      
      ⁢
      
        x
        l
        wm
      
    
  




and the cost incurred in the second stage due to buying extra on-demand connections, which can be referred to as the recourse cost (i.e., Eω(x,ω)). This expected recourse cost can be obtained from:





  
    
      
        
          
            E
            ω
          
          ⁢
                    ⁢
          
            (
            
              x
              ,
              ω
            
            )
          
        
        =
        
          
            ∑
            ω
          
          ⁢
          
            
              Pr
              ⁡
              
                (
                ω
                )
              
            
            ⁢
            
              (
              
                
                  
                    y
                    l
                    wl
                  
                  ⁢
                  
                    P
                    
                      ond
                      ,
                      l
                    
                    wl
                  
                
                +
                
                  
                    y
                    l
                    wm
                  
                  ⁢
                  
                    P
                    
                      ond
                      ,
                      l
                    
                    wm
                  
                
              
              )
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




The optimization formulation in (3)-(6) and (7) can be solved by using integer linear programming. Then, the average total cost for the eHealth service provider can be obtained as in (8).




  
    
      
        
          A
          ⁢
          
            
          
          ⁢
          T
          ⁢
          
            
          
          ⁢
          C
        
        =
        
          
            ∑
            ω
          
          ⁢
          
            
              Pr
              (
              
                ...
                ⁢
                
                  
                
                ,
                
                  n
                  l
                
                ,
                ...
              
              ⁢
              
                
              
              )
            
            ⁢
            
              
                (
                
                  
                    
                      ∑
                      
                        l
                        ∈
                        L
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          j
                          ∈
                          
                            {
                            
                              wl
                              ,
                              wm
                            
                            }
                          
                        
                      
                      ⁢
                      
                        
                          x
                          l
                          j
                        
                        ⁢
                        
                          P
                          
                            res
                            ,
                            l
                          
                          j
                        
                      
                    
                  
                  +
                  
                    
                      ∑
                      
                        l
                        ∈
                        L
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          j
                          ∈
                          
                            {
                            
                              wl
                              ,
                              wm
                            
                            }
                          
                        
                      
                      ⁢
                      
                        
                          max
                          ⁡
                          
                            (
                            
                              0
                              ,
                              
                                
                                  
                                    n
                                    ^
                                  
                                  l
                                
                                -
                                
                                  x
                                  l
                                  j
                                
                              
                            
                            )
                          
                        
                        ⁢
                        
                          P
                          
                            ond
                            ,
                            l
                          
                          j
                        
                      
                    
                  
                
                )
              
              .
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




B. Optimization of Transmission Scheduling at Patient-Attached Monitoring Device
In another embodiment, the decisions on transmission scheduling can be made based on the number of reserved connections in each location which is a solution of the SP formulation described above. The patient-attached device can take the queue state and location into account when making a decision. The problem of optimal decision-making can be formulated as a CMDP to minimize the cost while the delay requirements for transmission of biosignal data are satisfied. The modeling assumptions, the problem formulation, and the solution approach for the CMDP are described below.
1) Packet Arrival Process:
In one embodiment, the packet arrival processes of critical and normal data can be modeled as a Markovian arrival process (MAP) which can be represented by matrices Ac(a) and An(a) for a∈{0,1} packet arrivals corresponding to critical and normal data. This matrix can be defined as follows:




  
    
      
        
          A
          ⁡
          
            (
            a
            )
          
        
        =
        
          [
          
            
              
                
                  
                    A
                    
                      1
                      ,
                      1
                    
                  
                  ⁡
                  
                    (
                    a
                    )
                  
                
              
              
                
                  
                    A
                    
                      1
                      ,
                      2
                    
                  
                  ⁡
                  
                    (
                    a
                    )
                  
                
              
              
                ...
              
              
                
                  
                    A
                    
                      1
                      ,
                      K
                    
                  
                  ⁡
                  
                    (
                    a
                    )
                  
                
              
            
            
              
                ⋮
              
              
                
                  
                
              
              
                
                  
                
              
              
                ⋮
              
            
            
              
                
                  
                    A
                    
                      K
                      ,
                      1
                    
                  
                  ⁡
                  
                    (
                    a
                    )
                  
                
              
              
                
                  
                    A
                    
                      K
                      ,
                      2
                    
                  
                  ⁡
                  
                    (
                    a
                    )
                  
                
              
              
                ...
              
              
                
                  
                    A
                    
                      K
                      ,
                      K
                    
                  
                  ⁡
                  
                    (
                    a
                    )
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        9
        )
      
    
  




where Ak,k′(a) is the probability that the arrival phase changes from k to k′ and a packets arrive. K is the total number of phases of this MAP. To obtain the average arrival rate λ, the steady-state probability of the arrival process δ can be obtained from solving δ(A(0)+A(1))=δ and δ1=1. The average packet arrival rate is obtained from:

λ=δA(1)1  (10)

2) Constrained Markov Decision Process Formulation:
The formulation of CMDP can be defined by a state space, a set of actions/control, a set of constraints, and cost. The state space can be expressed as in (11):

Ω={(Xn,An,Xc,Ac,L,C);0≦Xn≦Bn,0≦Xc≦Bc,L∈L,C∈W}  (11)

where Bn and Bc denote the queue sizes corresponding to critical data and normal data, Xc and Xn denote the number of packets in the queues, and Ac and An denote the phases of packet arrivals for critical and normal data, respectively. L denotes the location and C denotes the wireless connections available to the patient. The set of available wireless connections is defined as:

W={reserved WLAN,on-demand WLAN,reserved WMAN,on-demand WMAN}  (12)

For the service area in FIG. 2, the transitions among the states defined in Ω are shown in FIG. 3. In this embodiment, at the mall, there can be three available wireless connections, i.e., reserved WLAN, on-demand WLAN, and reserved WMAN. Since we assume that Pond,lwl<Pond,lwm, on-demand WLAN connection can be used instead of an on-demand WMAN connection.
The set of feasible actions at a composite state s can be defined as Us⊂{1, 2, 3}, which corresponds to transmission of critical data, transmission of normal data, and no transmission, respectively. In this case, the transition probability matrix for states in Ω will be different due to the different actions. For a patient at location l∈Lwl we first obtain the probabilities of transmitting data using reserved and on-demand connections in WLAN and WMAN. The type of connection (i.e., reserved or on-demand) and the target network (i.e., WLAN or WMAN) for transmission from each patient can be assigned by the network operator given the total number of requesting patients in a location. The low-cost reserved connections can be used first, while the on-demand connections will be used only when reserved connections are inadequate to accommodate all requesting patients.
For patients in location l∈Lwl, the cases that need to be considered are as follows (FIG. 4):

    
    
        Case 1 ({circumflex over (n)}l≦xlwl for l∈Lwl): In this case, the number of patients requesting to transmit data at location l can be smaller than or equal to the number of reserved WLAN connections. Therefore, all the patients can transmit using the reserved WLAN connections. The probability of using a reserved connection is ρres,lwl=1.
        Case 2 ({circumflex over (n)}l>xlwl for l∈Lwl): In this case, the number of patients requesting to transmit data at location l can be larger than the number of reserved WLAN connections. Therefore, some patients can use reserved WMAN connections (if available) or on-demand WLAN connections for transmitting data. The corresponding two cases are as follows:
    
    






  Case
  ⁢
  
    
  
  ⁢
  2.1
  ⁢
  
    
  
  ⁢
  
    (
    
      
        
          ∑
          
            
              l
              ′
            
            ∈
            
              L
              wm
            
          
        
        ⁢
        
          
            n
            ^
          
          
            l
            ′
          
        
      
      ≥
      
        
          ∑
          
            
              l
              ′
            
            ∈
            
              L
              wm
            
          
        
        ⁢
        
          x
          
            l
            ′
          
          wm
        
      
    
    )
  
  ⁢
  
    :
  




In this case, the number of patients in locations l′∈Lwm, where only WMAN access is available, can be larger than or equal to the number of reserved WMAN connections. Therefore, some patients at location l will have to use reserved or on-demand WLAN connections. The probabilities of using reserved and on-demand WLAN connections are given, respectively, by





  
    ρ
    
      res
      ,
      l
    
    wl
  
  =
  
    
      
        
          x
          l
          wl
        
        
          
            n
            ^
          
          l
        
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        ρ
        
          ond
          ,
          l
        
        wl
      
    
    =
    
      
        
          
            
              n
              ^
            
            l
          
          -
          
            x
            l
            wl
          
        
        
          
            n
            ^
          
          l
        
      
      .
    
  




    
    
        Case 2.2 (Σl′∈Lwm{circumflex over (n)}l′<Σl′∈Lwmxl′wm): In this case, the number of patients in locations where only WMAN access is available, can be smaller than the number of reserved WMAN connections. As a result, some of the additional patients at location l can use reserved WMAN connections. However, there are two corresponding cases as follows:
    
    






  Case
  ⁢
  
    
  
  ⁢
  2.2
  ⁢
  .1
  ⁢
  
    
  
  ⁢
  
    (
    
      
        
          
            ∑
            
              
                l
                ′
              
              ∈
              
                L
                wm
              
            
          
          ⁢
          
            x
            
              l
              ′
            
            wm
          
        
        -
        
          
            ∑
            
              
                l
                ′
              
              ∈
              
                L
                wm
              
            
          
          ⁢
          
            
              n
              ^
            
            
              l
              ′
            
          
        
      
      ≥
      
        
          
            n
            ^
          
          l
        
        -
        
          x
          l
          wl
        
      
    
    )
  
  ⁢
  
    :
  




In this case, the number of available reserved WMAN connections can be larger than or equal to the number of additional patients at location l. Therefore, all additional patients at location l can use the reserved WMAN connections. The probabilities of using reserved WLAN and WMAN connections are given by:





  
    ρ
    
      res
      ,
      l
    
    wl
  
  =
  
    
      
        
          x
          l
          wl
        
        
          
            n
            ^
          
          l
        
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        ρ
        
          res
          ,
          l
        
        wm
      
    
    =
    
      
        
          
            
              n
              ^
            
            l
          
          -
          
            x
            l
            wl
          
        
        
          
            n
            ^
          
          l
        
      
      .
    
  








  Case
  ⁢
  
    
  
  ⁢
  2.2
  ⁢
  .2
  ⁢
  
    
  
  ⁢
  
    (
    
      
        
          
            ∑
            
              
                l
                ′
              
              ∈
              
                L
                wm
              
            
          
          ⁢
          
            x
            
              l
              ′
            
            wm
          
        
        -
        
          
            ∑
            
              
                l
                ′
              
              ∈
              
                L
                wm
              
            
          
          ⁢
          
            
              n
              ^
            
            
              l
              ′
            
          
        
      
      <
      
        
          
            n
            ^
          
          l
        
        -
        
          x
          l
          wl
        
      
    
    )
  
  ⁢
  
    :
  




In this case, the number of available reserved WMAN connections can be smaller than the number of additional patients at location l. Therefore, some of the patients at location l will use the reserved WMAN connections or on-demand WLAN connections. The probabilities of using reserved and on-demand connections in WLAN and WMAN are given by:




  
    
      
        ρ
        
          res
          ,
          l
        
        wl
      
      =
      
        
          x
          l
          wl
        
        
          
            n
            ^
          
          l
        
      
    
    ,
    
      

    
    ⁢
    
      
        ρ
        
          ond
          ,
          l
        
        wl
      
      =
      
        
          
            
              n
              ^
            
            l
          
          -
          
            x
            l
            wl
          
          -
          
            (
            
              
                
                  ∑
                  
                    
                      l
                      ′
                    
                    ∈
                    
                      L
                      wm
                    
                  
                
                ⁢
                
                  x
                  
                    l
                    ′
                  
                  wm
                
              
              -
              
                
                  ∑
                  
                    
                      l
                      ′
                    
                    ∈
                    
                      L
                      wm
                    
                  
                
                ⁢
                
                  
                    n
                    ^
                  
                  
                    l
                    ′
                  
                
              
            
            )
          
        
        
          
            n
            ^
          
          l
        
      
    
    ,
    and
  




  
    
      ρ
      
        res
        ,
        l
      
      wm
    
    =
    
      
        
          
            
              ∑
              
                
                  l
                  ′
                
                ∈
                
                  L
                  wm
                
              
            
            ⁢
            
              x
              
                l
                ′
              
              wm
            
          
          -
          
            
              ∑
              
                
                  l
                  ′
                
                ∈
                
                  L
                  wm
                
              
            
            ⁢
            
              
                n
                ^
              
              
                l
                ′
              
            
          
        
        
          
            n
            ^
          
          l
        
      
      .
    
  



Then, for a patient at a location where only WMAN access is available, the probability of using reserved and on-demand WMAN connections can be obtained. For patients in location l∈Lwm, there are two cases as follows:




  Case
  ⁢
  
    
  
  ⁢
  1
  ⁢
  
    
  
  ⁢
  
    (
    
      
        
          ∑
          
            l
            ∈
            
              L
              wm
            
          
        
        ⁢
        
          
            n
            ^
          
          l
        
      
      ≤
      
        
          ∑
          
            l
            ∈
            
              L
              wm
            
          
        
        ⁢
        
          x
          l
          wm
        
      
    
    )
  
  ⁢
  
    :
  




This corresponds to the case that the number of requesting patients to transmit data is smaller than or equal to the number of reserved WMAN connections. Therefore, all patients can use the reserved connections. The probability of using a reserved WMAN connection is κres,lwm=1.





  Case
  ⁢
  
    
  
  ⁢
  2
  ⁢
  
    
  
  ⁢
  
    (
    
      
        
          ∑
          
            l
            ∈
            
              L
              wm
            
          
        
        ⁢
        
          
            n
            ^
          
          l
        
      
      >
      
        
          ∑
          
            l
            ∈
            
              L
              wm
            
          
        
        ⁢
        
          x
          l
          wm
        
      
    
    )
  
  ⁢
  
    :
  




Some patients can use on-demand WMAN connections. The probabilities of using reserved and on-demand connections in a WMAN are given by:





  
    κ
    
      res
      ,
      l
    
    wm
  
  =
  
    
      
        
          
            ∑
            
              l
              ∈
              
                L
                wm
              
            
          
          ⁢
          
            x
            l
            wm
          
        
        
          
            n
            ^
          
          l
        
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        κ
        
          ond
          ,
          l
        
        wm
      
    
    =
    
      
        
          
            
              ∑
              
                l
                ∈
                
                  L
                  wm
                
              
            
            ⁢
            
              
                n
                ^
              
              l
            
          
          -
          
            
              ∑
              
                l
                ∈
                
                  L
                  wm
                
              
            
            ⁢
            
              x
              l
              wm
            
          
        
        
          
            n
            ^
          
          l
        
      
      .
    
  




Let cl denote a vector of probability of connection availability at location l which can be defined as follows:




  
    
      
        
          c
          l
        
        =
        
          {
          
            
              
                
                  [
                  
                    
                      ρ
                      
                        res
                        ,
                        l
                      
                      wl
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      ρ
                      
                        ond
                        ,
                        l
                      
                      wl
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      ρ
                      
                        res
                        ,
                        l
                      
                      wm
                    
                  
                  ]
                
              
              
                
                  l
                  ∈
                  
                    L
                    wi
                  
                
              
            
            
              
                
                  [
                  
                    
                      κ
                      
                        res
                        ,
                        l
                      
                      wm
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      κ
                      
                        ond
                        ,
                        l
                      
                      wm
                    
                  
                  ]
                
              
              
                
                  
                    l
                    ∈
                    
                      L
                      wm
                    
                  
                  ,
                
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




The transition matrix L combining the state transitions of location and connection availability (i.e., L and C) can be constructed based on the mobility transition matrix of a patient T with elements Tl,l′. The elements in transition matrix L are denoted by Ll,l′, which can be obtained from:




  
    
      
        
          
            L
            ⋁
          
          
            l
            ,
            
              l
              ′
            
          
        
        =
        
          {
          
            
              
                
                  
                    
                      T
                      
                        l
                        ,
                        
                          l
                          ′
                        
                      
                    
                    ⁢
                    I
                  
                  ,
                
              
              
                
                  l
                  =
                  
                    l
                    ′
                  
                
              
            
            
              
                
                  
                    
                      T
                      
                        l
                        ,
                        
                          l
                          ′
                        
                      
                    
                    ⁢
                    
                      1
                      T
                    
                    ⁢
                    
                      c
                      
                        l
                        ′
                      
                    
                  
                  ,
                
              
              
                
                  l
                  ≠
                  
                    l
                    ′
                  
                
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




where I is an identity matrix.
Next, the state transitions for the packets in queue for critical data and phase of arrival process (i.e., Xc and Ac) can be combined with those of location and available of connections. There are two cases corresponding to action u∈Us. First, the case of action u=1 (i.e., a packet is retrieved from the queue for critical data for transmission) is considered.
Let βres,lwl, βond,lwl, βres,lwm, βond,lwm denote the probabilities of successful transmission using reserved and on-demand WLAN and WMAN connections at location l. The location- and connection-dependent departure process for the packets in a queue can be represented in a matrix D(d) (i.e., d packet departs where d∈{0,1}). The elements of this matrix are denoted by Dl,l′(d) and can be obtained as follows:




  
    
      
        D
        ⋁
      
      
        l
        ,
        
          l
          ′
        
      
    
    ⁡
    
      (
      1
      )
    
  
  =
  
    {
    
      
        
          
            
              [
              
                
                  
                    
                      β
                      
                        res
                        ,
                        l
                      
                      wl
                    
                  
                  
                    
                      
                    
                  
                  
                    
                      
                    
                  
                
                
                  
                    
                      
                    
                  
                  
                    
                      β
                      
                        ond
                        ,
                        l
                      
                      wl
                    
                  
                  
                    
                      
                    
                  
                
                
                  
                    
                      
                    
                  
                  
                    
                      
                    
                  
                  
                    
                      β
                      
                        res
                        ,
                        l
                      
                      wm
                    
                  
                
              
              ]
            
            ,
          
        
        
          
            l
            =
            
              
                l
                ′
              
              ∈
              
                L
                wl
              
            
          
        
      
      
        
          
            [
            
              
                
                  
                    β
                    
                      res
                      ,
                      l
                    
                    wm
                  
                
                
                  
                    
                  
                
              
              
                
                  
                    
                  
                
                
                  
                    β
                    
                      ond
                      ,
                      l
                    
                    wm
                  
                
              
            
            ]
          
        
        
          
            l
            =
            
              
                l
                ′
              
              ∈
              
                L
                wm
              
            
          
        
      
      
        
          
            0
            ,
          
        
        
          otherwise
        
      
    
  




{hacek over (D)}l,l(0)=I−{hacek over (D)}l,l(1)  (15)

where 0 is a matrix of zeros. Note that the size of matrix Dc is the same as that of L.
Let Q(u=1) denote the transition matrix for action u=1 with elements denoted by Qq,q′(u) where the number of packets in the queue for critical data changes from q to q′ for q,q′∈{0, 1, . . . , Bc}. This can be obtained as in (16). For actions u=2,3 (i.e., the patient-attached device will transmit normal data or not transmit any data, respectively), no packet is retrieved from the queue for critical data. The derivation of the transition matrix Q(u=2,3) is similar to that of Q(u=1). However, the departure probability matrices become D(0)=I and D(1)=0, since no packet from the queue for critical data is transmitted.
Next, the state transitions for the packets in queue for normal data and phase of arrival process (i.e., Xn and An) can be combined. Again, there can be two cases corresponding to action u. First, the case of action u=2 (i.e., a packet is retrieved from the queue for normal data for transmission) is considered.




  
    
      
        
          
            
              Q
              ⋁
            
            
              q
              ,
              
                q
                ′
              
            
          
          ⁡
          
            (
            u
            )
          
        
        =
        
          {
          
            
              
                
                  
                    L
                    ⊗
                    
                      
                        A
                        c
                      
                      ⁡
                      
                        (
                        0
                        )
                      
                    
                  
                  ,
                
              
              
                
                  q
                  =
                  
                    
                      q
                      ′
                    
                    =
                    0
                  
                
              
            
            
              
                
                  
                    L
                    ⊗
                    
                      
                        A
                        c
                      
                      ⁡
                      
                        (
                        1
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    q
                    =
                    0
                  
                  ,
                  
                    
                      q
                      ′
                    
                    =
                    1
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        L
                        ×
                        
                          D
                          ⁡
                          
                            (
                            1
                            )
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        c
                      
                      ⁡
                      
                        (
                        0
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    q
                    =
                    
                      {
                      
                        1
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          B
                          c
                        
                      
                      }
                    
                  
                  ,
                  
                    
                      q
                      ′
                    
                    =
                    
                      q
                      -
                      1
                    
                  
                
              
            
            
              
                
                  
                    
                      
                        (
                        
                          L
                          ×
                          
                            D
                            ⁡
                            
                              (
                              0
                              )
                            
                          
                        
                        )
                      
                      ⊗
                      
                        
                          A
                          c
                        
                        ⁡
                        
                          (
                          0
                          )
                        
                      
                    
                    +
                    
                      
                        (
                        
                          L
                          ×
                          
                            D
                            ⁡
                            
                              (
                              1
                              )
                            
                          
                        
                        )
                      
                      ⊗
                      
                        
                          A
                          c
                        
                        ⁡
                        
                          (
                          1
                          )
                        
                      
                    
                  
                  ,
                
              
              
                
                  
                    q
                    =
                    
                      {
                      
                        1
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          
                            B
                            c
                          
                          -
                          1
                        
                      
                      }
                    
                  
                  ,
                  
                    
                      q
                      ′
                    
                    =
                    q
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        L
                        ×
                        
                          D
                          ⁡
                          
                            (
                            0
                            )
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        c
                      
                      ⁡
                      
                        (
                        1
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    q
                    =
                    
                      {
                      
                        1
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          
                            B
                            c
                          
                          -
                          1
                        
                      
                      }
                    
                  
                  ,
                  
                    
                      q
                      ′
                    
                    =
                    
                      q
                      +
                      1
                    
                  
                
              
            
            
              
                
                  
                    
                      
                        (
                        
                          L
                          ×
                          
                            D
                            ⁡
                            
                              (
                              0
                              )
                            
                          
                        
                        )
                      
                      ⊗
                      
                        
                          A
                          c
                        
                        ⁡
                        
                          (
                          0
                          )
                        
                      
                    
                    +
                    
                      (
                      
                        L
                        ⊗
                        
                          
                            A
                            c
                          
                          ⁡
                          
                            (
                            1
                            )
                          
                        
                      
                      )
                    
                  
                  ,
                
              
              
                
                  q
                  =
                  
                    
                      q
                      ′
                    
                    =
                    
                      B
                      c
                    
                  
                
              
            
            
              
                
                  0
                  ,
                
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
    
      
        (
        16
        )
      
    
  
  
    
      
        
          
            
              P
              ⋁
            
            
              p
              ,
              
                p
                ′
              
            
          
          ⁡
          
            (
            u
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      Q
                      ⁡
                      
                        (
                        
                          u
                          =
                          2
                        
                        )
                      
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        0
                        )
                      
                    
                  
                  ,
                
              
              
                
                  p
                  =
                  
                    
                      p
                      ′
                    
                    =
                    0
                  
                
              
            
            
              
                
                  
                    
                      Q
                      ⁡
                      
                        (
                        
                          u
                          =
                          2
                        
                        )
                      
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        1
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    p
                    =
                    0
                  
                  ,
                  
                    
                      p
                      ′
                    
                    =
                    1
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        
                          Q
                          ⁡
                          
                            (
                            
                              u
                              =
                              2
                            
                            )
                          
                        
                        ×
                        
                          I
                          ⊗
                          
                            D
                            ⁡
                            
                              (
                              1
                              )
                            
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        0
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    p
                    =
                    
                      {
                      
                        1
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          B
                          n
                        
                      
                      }
                    
                  
                  ,
                  
                    
                      p
                      ′
                    
                    =
                    
                      p
                      -
                      1
                    
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        
                          Q
                          ⁡
                          
                            (
                            
                              u
                              =
                              2
                            
                            )
                          
                        
                        ×
                        
                          I
                          ⊗
                          
                            D
                            ⁡
                            
                              (
                              0
                              )
                            
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        0
                        )
                      
                    
                  
                  +
                
              
              
                
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        
                          Q
                          ⁡
                          
                            (
                            
                              u
                              =
                              2
                            
                            )
                          
                        
                        ×
                        
                          I
                          ⊗
                          
                            D
                            ⁡
                            
                              (
                              1
                              )
                            
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        1
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    p
                    =
                    
                      {
                      
                        1
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          
                            B
                            n
                          
                          -
                          1
                        
                      
                      }
                    
                  
                  ,
                  
                    
                      p
                      ′
                    
                    =
                    p
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        
                          Q
                          ⁡
                          
                            (
                            
                              u
                              =
                              2
                            
                            )
                          
                        
                        ×
                        
                          I
                          ⊗
                          
                            D
                            ⁡
                            
                              (
                              0
                              )
                            
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        1
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    p
                    =
                    
                      {
                      
                        1
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          
                            B
                            n
                          
                          -
                          1
                        
                      
                      }
                    
                  
                  ,
                  
                    
                      p
                      ′
                    
                    =
                    
                      p
                      +
                      1
                    
                  
                
              
            
            
              
                
                  
                    
                      (
                      
                        
                          Q
                          ⁡
                          
                            (
                            
                              u
                              =
                              2
                            
                            )
                          
                        
                        ×
                        
                          I
                          ⊗
                          
                            D
                            ⁡
                            
                              (
                              0
                              )
                            
                          
                        
                      
                      )
                    
                    ⊗
                    
                      
                        A
                        n
                      
                      ⁡
                      
                        (
                        0
                        )
                      
                    
                  
                  +
                
              
              
                
                  
                
              
            
            
              
                
                  
                    (
                    
                      
                        Q
                        ⁡
                        
                          (
                          
                            u
                            =
                            2
                          
                          )
                        
                      
                      ⊗
                      
                        
                          A
                          n
                        
                        ⁡
                        
                          (
                          1
                          )
                        
                      
                    
                    )
                  
                  ,
                
              
              
                
                  p
                  =
                  
                    
                      p
                      ′
                    
                    =
                    
                      B
                      n
                    
                  
                
              
            
            
              
                
                  0
                  ,
                
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




Let P(u=2) denote the transition matrix for action u=2 with elements denoted by {hacek over (P)}p,p′(u) where the number of packets in the queue for normal data changes from p to p′ for p, p′∈{0, 1, . . . , Bn}. This can be obtained as in (17). Note that the Kronecker product of I is required to scale the size of the resulting matrix to be identical for all {hacek over (P)}p,p′(u). For actions u=1,3, no packet is retrieved from the queue for normal data. The derivation of transition matrix P(u=1,3) is similar to that of P(u=2). However, the departure probability matrices become D(0)=I and D(1)=0, since there is no transmitted packet. Also, Q(u=2) in (17) is replaced with either Q(u=1) or Q(u=3). The cost can be defined as a function of price paid to the network operator if a patient transmits data using an on-demand connection, and the delay incurred for critical and normal data. The immediate connection cost can be a function of state s∈Ω and action u∈Us and it can be defined as follows:




  
    
      
        
          
            C
            con
          
          ⁡
          
            (
            
              s
              ,
              u
            
            )
          
        
        =
        
          {
          
            
              
                
                  
                    P
                    
                      res
                      ,
                      l
                    
                    wl
                  
                  ,
                
              
              
                
                  C
                  =
                  
                    reserved
                    ⁢
                    
                      
                    
                    ⁢
                    WLAN
                  
                
              
            
            
              
                
                  
                    P
                    
                      ond
                      ,
                      l
                    
                    wl
                  
                  ,
                
              
              
                
                  C
                  =
                  
                    on
                    ⁢
                    
                      -
                    
                    ⁢
                    demand
                    ⁢
                    
                      
                    
                    ⁢
                    WLAN
                  
                
              
            
            
              
                
                  
                    P
                    
                      res
                      ,
                      l
                    
                    wm
                  
                  ,
                
              
              
                
                  C
                  =
                  
                    reserved
                    ⁢
                    
                      
                    
                    ⁢
                    WMAN
                  
                
              
            
            
              
                
                  
                    P
                    
                      ond
                      ,
                      l
                    
                    wm
                  
                  ,
                
              
              
                
                  C
                  =
                  
                    on
                    ⁢
                    
                      -
                    
                    ⁢
                    
                      d
                    
                    ⁢
                    emand
                    ⁢
                    
                      
                    
                    ⁢
                    WMAN
                  
                
              
            
            
              
                
                  0
                  ,
                
              
              
                otherwise
              
            
          
        
      
    
    
      
        (
        18
        )
      
    
  




for u=1,2 and L=l. The delay depends on the number of packets in the queue and arrival rate. The delay costs Cc,del and Cn,del for critical and normal data can be defined as follows [26]:




  
    
      
        
          
            
              C
              
                c
                ,
                del
              
            
            ⁡
            
              (
              s
              )
            
          
          =
          
            
              X
              c
            
            
              λ
              c
            
          
        
        ,
        
          
            
              C
              
                n
                ,
                del
              
            
            ⁡
            
              (
              s
              )
            
          
          =
          
            
              X
              n
            
            
              λ
              n
            
          
        
      
    
    
      
        (
        19
        )
      
    
  




where λc and λn are the average arrival rates of critical and normal data, respectively. These average arrival rates can be obtained from (10).
The objective function for the scheduler at the patient attached monitoring device is the expected long-term average weighted cost due to the price paid for the connections and the delay incurred. Let μ(s) denote the stationary policy (i.e., the probability of taking action u at state s). The objective function can be defined as follows:




  
    
      
        
          J
          ⁡
          
            (
            μ
            )
          
        
        =
        
          
            lim
            
              t
              ->
              ∞
            
          
          ⁢
          
            sup
            ⁢
            
              1
              t
            
            ⁢
            
              
                ∑
                
                  
                    t
                    ′
                  
                  =
                  1
                
                t
              
              ⁢
              
                E
                ⁡
                
                  [
                  
                    C
                    ⁡
                    
                      (
                      
                        
                          s
                          
                            t
                            ′
                          
                        
                        ,
                        
                          μ
                          ⁡
                          
                            (
                            
                              s
                              
                                t
                                ′
                              
                            
                            )
                          
                        
                      
                      )
                    
                  
                  ]
                
              
            
          
        
      
    
    
      
        (
        20
        )
      
    
  
  
    
      
        
          C
          ⁡
          
            (
            
              s
              ,
              
                μ
                ⁡
                
                  (
                  s
                  )
                
              
            
            )
          
        
        =
        
          
            
              w
              con
            
            ⁢
            
              
                C
                con
              
              ⁡
              
                (
                
                  s
                  ,
                  u
                
                )
              
            
          
          +
          
            
              w
              
                c
                ,
                del
              
            
            ⁢
            
              
                C
                
                  c
                  ,
                  del
                
              
              ⁡
              
                (
                s
                )
              
            
          
          +
          
            
              w
              
                n
                ,
                del
              
            
            ⁢
            
              
                C
                
                  n
                  ,
                  del
                
              
              ⁡
              
                (
                s
                )
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




where st is the state at transmission slot t, wcon, wc,del and wn,del denote the weights corresponding to connection cost, delay cost for critical and normal data, respectively. Due to the nature of biosignal data, the delay requirements are to be satisfied. An optimization problem based on CMDP can then be formulated as follows:




  
    
      
        
          Minimize
          ⁢
          
            :
          
          ⁢
          
            
          
          ⁢
          
            J
            ⁡
            
              (
              μ
              )
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            Subject
            ⁢
            
              
            
            ⁢
            to
            ⁢
            
              :
            
            ⁢
            
              
            
            ⁢
            
              
                lim
                
                  t
                  ⟶
                  ∞
                
              
              ⁢
              
                sup
                ⁢
                
                  1
                  t
                
                ⁢
                
                  
                    ∑
                    
                      
                        t
                        ′
                      
                      =
                      1
                    
                    t
                  
                  ⁢
                  
                    E
                    ⁡
                    
                      [
                      
                        
                          C
                          
                            c
                            ,
                            del
                          
                        
                        ⁡
                        
                          (
                          
                            
                              s
                              
                                t
                                ′
                              
                            
                            ,
                            μ
                          
                          )
                        
                      
                      ]
                    
                  
                
              
            
          
          ≤
          
            D
            
              c
              ,
              req
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            
              lim
              
                t
                ⟶
                ∞
              
            
            ⁢
            
              sup
              ⁢
              
                1
                t
              
              ⁢
              
                
                  ∑
                  
                    
                      t
                      ′
                    
                    =
                    1
                  
                  t
                
                ⁢
                
                  E
                  ⁡
                  
                    [
                    
                      
                        C
                        
                          n
                          ,
                          del
                        
                      
                      ⁡
                      
                        (
                        
                          
                            s
                            
                              t
                              ′
                            
                          
                          ,
                          μ
                        
                        )
                      
                    
                    ]
                  
                
              
            
          
          ≤
          
            D
            
              n
              ,
              req
            
          
        
      
    
    
      
        (
        22
        )
      
    
  




where Dc,req and Dn,req denote the maximum average delays measured in transmission slots.
3) Solution Approach Based on Linear Programming:
The optimal solution in terms of policy μ* for a patient-attached device can be obtained by transforming the constrained optimization formulation in (22) into linear programming (LP) [27]. Let φ(s,u) denote the steady-state probability corresponding to state s∈Ω and action u. An equivalent LP problem can be formulated to obtain the optimal solution of φ(s,u) as follows:




  
    
      
        Minimize
        ⁢
        
          :
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              
                s
                ∈
                Ω
              
              ,
              
                u
                ∈
                
                  U
                  s
                
              
            
          
          ⁢
          
            
              φ
              ⁡
              
                (
                
                  s
                  ,
                  u
                
                )
              
            
            ⁢
            
              (
              
                
                  
                    
                      
                        
                          w
                          con
                        
                        ⁢
                        
                          
                            C
                            con
                          
                          ⁡
                          
                            (
                            
                              s
                              ,
                              u
                            
                            )
                          
                        
                      
                      +
                    
                  
                
                
                  
                    
                      
                        
                          w
                          
                            c
                            ,
                            del
                          
                        
                        ⁢
                        
                          
                            C
                            
                              c
                              ,
                              del
                            
                          
                          ⁡
                          
                            (
                            s
                            )
                          
                        
                      
                      +
                      
                        
                          w
                          
                            n
                            ,
                            del
                          
                        
                        ⁢
                        
                          
                            C
                            
                              n
                              ,
                              del
                            
                          
                          ⁡
                          
                            (
                            s
                            )
                          
                        
                      
                    
                  
                
              
              )
            
          
        
      
    
    
      
        (
        23
        )
      
    
  
  
    
      
        
          Subject
          ⁢
          
            
          
          ⁢
          to
          ⁢
          
            :
          
          ⁢
          
            
          
          ⁢
          
            
              ∑
              
                
                  s
                  ∈
                  Ω
                
                ,
                
                  u
                  ∈
                  
                    U
                    s
                  
                
              
            
            ⁢
            
              
                φ
                ⁡
                
                  (
                  
                    s
                    ,
                    u
                  
                  )
                
              
              ⁢
              
                
                  C
                  
                    c
                    ,
                    del
                  
                
                ⁡
                
                  (
                  
                    s
                    ,
                    u
                  
                  )
                
              
            
          
        
        ≤
        
          D
          
            c
            ,
            req
          
        
      
    
    
      
        (
        24
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            
              
                ∑
                
                  
                    s
                    ∈
                    Ω
                  
                  ,
                  
                    u
                    ∈
                    
                      U
                      s
                    
                  
                
              
              ⁢
              
                
                  φ
                  ⁡
                  
                    (
                    
                      s
                      ,
                      u
                    
                    )
                  
                
                ⁢
                
                  
                    C
                    
                      n
                      ,
                      del
                    
                  
                  ⁡
                  
                    (
                    
                      s
                      ,
                      u
                    
                    )
                  
                
              
            
            ≤
            
              D
              
                n
                ,
                req
              
            
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  ∑
                  
                    u
                    ∈
                    
                      U
                      
                        s
                        ′
                      
                    
                  
                
                ⁢
                
                  φ
                  ⁡
                  
                    (
                    
                      
                        s
                        ′
                      
                      ,
                      u
                    
                    )
                  
                
              
              =
              
                
                  ∑
                  
                    
                      s
                      ∈
                      Ω
                    
                    ,
                    
                      u
                      ∈
                      
                        U
                        s
                      
                    
                  
                
                ⁢
                
                  
                    φ
                    ⁡
                    
                      (
                      
                        s
                        ,
                        u
                      
                      )
                    
                  
                  ⁢
                  
                    p
                    ⁡
                    
                      (
                      
                        
                          
                            s
                            ′
                          
                          ❘
                          s
                        
                        ,
                        u
                      
                      )
                    
                  
                
              
            
            ,
          
        
      
    
    
      
        (
        25
        )
      
    
  
  
    
      
        
          for
          ⁢
          
            
          
          ⁢
          
            s
            ′
          
        
        ∈
        Ω
      
    
    
      
        (
        26
        )
      
    
  
  
    
      
        
          
            ∑
            
              
                s
                ∈
                Ω
              
              ,
              
                u
                ∈
                
                  U
                  s
                
              
            
          
          ⁢
          
            φ
            ⁡
            
              (
              
                s
                ,
                u
              
              )
            
          
        
        =
        1
      
    
    
      
        (
        27
        )
      
    
  
  
    
      
        
          
            φ
            ⁡
            
              (
              
                s
                ,
                u
              
              )
            
          
          ≥
          0
        
        ,
        
          ∀
          
            s
            ∈
            
              Ω
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              
                ∀
                
                  u
                  ∈
                  
                    U
                    s
                  
                
              
            
          
        
      
    
    
      
        (
        28
        )
      
    
  




The constraints in (24) and (25) can be used to ensure that the long-term average queueing delay of critical and normal data are maintained below target levels of Dc,req and Dn,req, respectively. The constraint in (26) can be derived from the Chapman-Kolmogorov equation. In particular, the steady-state probability of the next state s′ is equal to the product of the steady-state probability of the current state s and probability of state transition p(s′|s, u) if action u is taken. Note that this state transition probability p(s′|s,u) is an element of matrix P(u) which is defined in (17). Constraints in (27) and (28) can be used to ensure that the sum of all steady-state probabilities is one, and all probabilities are non-negative, respectively. Let the optimal solution from the linear programming be denoted by φ*(s,u). Then, an optimal policy is obtained from the probability θ(u,μ*(s)) of using policy u∈Us in state s∈Ω. This probability θ(u,μ*(s)) can be obtained as follows:




  
    
      
        
          
            θ
            ⁡
            
              (
              
                u
                ,
                
                  
                    μ
                    *
                  
                  ⁡
                  
                    (
                    s
                    )
                  
                
              
              )
            
          
          =
          
            
              
                φ
                *
              
              ⁡
              
                (
                
                  s
                  ,
                  u
                
                )
              
            
            
              
                ∑
                
                  
                    u
                    ′
                  
                  ∈
                  
                    U
                    s
                  
                
              
              ⁢
              
                
                  φ
                  *
                
                ⁡
                
                  (
                  
                    s
                    ,
                    
                      u
                      ′
                    
                  
                  )
                
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            
              
                ∑
                
                  
                    u
                    ′
                  
                  ∈
                  
                    U
                    s
                  
                
              
              ⁢
              
                
                  φ
                  *
                
                ⁡
                
                  (
                  
                    s
                    ,
                    
                      u
                      ′
                    
                  
                  )
                
              
            
          
          >
          0.
        
      
    
    
      
        (
        29
        )
      
    
  




Note that the relationship between the SP formulation in (3)-(6) and the CMDP formulation in (22) can be based on the number of reserved connections (i.e., xlwl and xlwm). The solution of stochastic programming affects the probabilities of a patient to use reserved and on-demand connections in WLAN and WMAN (i.e., ρc,lj and κc,lj where c∈{res,ond} and j∈{wl,wm}) as shown in FIG. 1(b).
4) Implementation Based on Q-Learning:
Although the CMDP formulation above provides an optimal policy, solving the equivalent LP problem can be computationally expensive. In particular, the number of decision variables of the LP problem is 3×|L|Kn×Kc×Bn×Bc, where 3 indicates three possible actions, Kn and Kc denote the number of phases of packet arrivals for critical and normal data, respectively. The linear programming problem with the above decision variables has to be solved in an off-line manner. However, if the system parameters change dynamically over time, an on-line algorithm would be required. Therefore, an alternative method based on Q-learning is investigated which is much simpler to implement. This algorithm learns and adapts the scheduling action according to the incurred cost due to the price paid for wireless connections and due to packet transmission delays. This Q-learning algorithm is similar to the off-policy temporal difference learning method in [28]. Let Q(s,u) denote the Q-value corresponding to action u at state s. The algorithm works as follows.

    
    
        1: Initialize Q(s,u)
        2: loop
        3: if rand( )≦e then
        4: Choose action u randomly
        5: else
        6: Choose action u which yields the lowest Q(s,u), i.e., arg minuQ(s,u)
        7: end if
        8: Perform action u and observe the state transition (i.e., from state s to s′) and the cost Ccon(s,u), Cc,del(s) and Cn,del(s) due to connection cost and delays
    
    


9:

Q(s,u)←Q(s,u)+ζ((wconCcon(s,u)+wc,delCc,del(s)+wn,delCn,del(s))+γmaxu′Q(s′,u′)−Q(s,u))

    
    
        10: s←s′
        11: end loop
    
    


In the above algorithm, e is the probability of performing explorations of the available actions. rand( )∈[0,1] is a random number generator. ζ and γ are the weights for updating the Q-value. For numerical results, these parameters are chosen as follows: e=0.2, ζ=0.5, and γ=0.4.
Note that if the value of e is large, the algorithm can frequently choose a random action, which can degrade the performance (i.e., cost becomes larger). However, if the value of e is small, the algorithm can slowly converge. The parameter ζ (i.e., learning rate) indicates the weight of updating Q-value. If the value of ζ is large, the current Q-value depends largely on the immediate received cost and the Q-value will fluctuate. As a result, the algorithm may not be stable at the steady state. However, if the value of ζ is small, the algorithm can slowly converge. The parameter γ is the discount factor. The value of this parameter will be chosen based on the worth of cost in the future. The appropriate values of these parameters can be obtained based on simulation.
III. PERFORMANCE EVALUATION
A. Parameter Setting
In one embodiment, the service area shown in FIG. 2(a) can comprise 7 patients, and each patient can have an identical mobility model described by the following probability transition matrix:




  
    
      
        
          T
          i
        
        =
        
          [
          
            
              
                
                  1
                  -
                  σ
                
              
              
                σ
              
              
                0
              
              
                0
              
            
            
              
                0.0003333
              
              
                0.9993333
              
              
                0.0001667
              
              
                0.0001667
              
            
            
              
                0
              
              
                0.0003333
              
              
                0.9996667
              
              
                0
              
            
            
              
                0
              
              
                0.0000833
              
              
                0
              
              
                0.9999167
              
            
          
          ]
        
      
    
    
      
        (
        30
        )
      
    
  




where σ is the probability that a patient moves from the mall to road (e.g., σ=0.0001667). In this case, the mean durations for which a patient can be at the mall, road, clinic, and home are 100, 25, 50, and 200 minutes, respectively. The prices of reserved and on-demand WLAN and WMAN connections are set as follows: Pres,lwl=0.1, Pond,lwl=0.4, Pres,lwm=0.2, Pond,lwm=0.6 for l∈{Ma, Ro} (i.e., at the mall and road, respectively), and Pres,Clwl=0.05 and Pres,Howl=0.01 at the clinic and home, respectively.
The packet arrival processes of critical and normal data are assumed to be Bernoulli. In this case, the packet arrivals are denoted by Ac=αc and An=αn, where αc and αn denote the probabilities that the critical and normal data packets are generated in a transmission slot. The length of a transmission slot can be 1 minute. For numerical results, these packet arrival rates are assumed to be αc=0.1 and αn=0.8. The packet size for normal data is 25.6 kb and that for critical data is 5.1 kb [22]. The queue sizes for critical and normal data can be 5 and 10 packets, respectively. The successful packet transmission probabilities can be assumed to be βres,lwl=βond,lwl=βres,lwm=βond,lwm=0.98. The weights to compute the cost can be as follows: wcon=1.00, wc,del=0.05, and wn,del=0.03. The delay requirements of the critical and normal data can be Dc,req=2 and Dn,req=5 transmission slots, respectively. The probability of packet transmission by a patient can be approximated from the packet arrival rate as follows: vl≈min(αc+αn,1).
B. Numerical Results
1) Cost of eHealth Service Provider:
FIG. 5 shows average total cost under different number of reserved WLAN and WMAN connections at the mall and on the road (i.e., xMawl and xRowm, respectively). We observe that there can be an optimal number of reserved connections obtained from the SP formulation for which the average total cost is minimized. This is because the patients are more likely to transmit data using reserved connections and thus minimize cost since the price of a reserved connection is lower than that of an on-demand connection. Again, since the demand of the transmission from patients is random, too many reserved connections incur large cost to the eHealth service provider.
Next, the number of total patients in a service area is varied. The number of reserved connections (i.e., xlwl, xlwm) obtained from solving the SP formulation, and the average number of patients transmitting packet (i.e., ┌{circumflex over (n)}┐) are shown in FIG. 6(a). The corresponding average total costs are shown in FIG. 6(b) when the SP solution and the average number of patients are used to buy reserved connections from a network operator (i.e., denoted by legends “SP” and “Average”, respectively). As expected, when the total number of patients increases, the average total cost can increase due to increasing demand for wireless connectivity. It is observed that the SP solution can be larger than that of average number of patients (FIG. 6(a)). However, the cost can be lower (FIG. 6(b)). With the SP solution, since more number of reserved connections are bought in advance, the cost incurred due to buying extra on-demand connections can be lower. Consequently, the total cost can be lower.
The number of reserved connections obtained from SP and the corresponding average total costs are shown in FIG. 7 as the price of on-demand WLAN connections varies. As expected, when the price of an on-demand connection increases, the eHealth service provider can minimize the cost by buying more reserved connections. If the reserved connections are not enough to meet the demand from the patients, a higher cost will be incurred to purchase on-demand connections. The average total cost, which increases as the price increases, can be a piecewise-linear function of the price of on-demand connections.
Then, the mobility parameter for the patients (i.e., the duration of a patient to be in the mall) can be varied by adjusting σ in (30). The probabilities of a patient to access reserved WLAN and WMAN connections are shown in FIG. 8. As the duration of a patient in the mall increases, the probability of accessing reserved WLAN connections can decrease. However, the probability of accessing reserved WMAN connections increases, since more number of patients spill from WLAN to WMAN. Also, when the SP solution is compared with the average number of patients, the probabilities of accessing reserved connections obtained from the SP solution can be larger than those obtained based on the average number of patients. This result confirms the earlier observation that the cost can be lower when the SP solution is used (compared to that when the average number of patients is used for buying connections).
2) Scheduler Performance at the Patient-Attached Remote Monitoring Device:
The average delay and connection cost per patient are shown in FIGS. 9(a) and (b), respectively, with variations in packet arrival probabilities of both critical and normal data. In one embodiment, it is observed that the transmission delay for critical data can be smaller than that of normal data due to the different weights in the objective function defined in (21). Also, the average delay for critical data can decrease at αn=0.5 since the scheduling of a patient-attached device changes the action from transmitting normal data (i.e., u=2) to transmitting critical data (i.e., u=1), so that the delay for critical data can be minimized. Consequently, the delay for normal data can increase rapidly. As the packet arrival probabilities increase, the connection cost per patient can increase, since the scheduler chooses to transmit data (i.e., u=1,2) more often to reduce the average transmission delay.
3) Scheduler Implementation Using Q-Learning:
FIG. 10 shows the convergence of the Q-learning algorithm. Also, the cost and delay performances of the Q-learning algorithm can be compared with those obtained from the CMDP formulation. With the Q-learning algorithm, the patient-attached device can learn and adapt its decision. Although the connection cost per patient obtained from the Q-learning is larger than that from the optimal solution, the delays for both critical and normal data can be maintained below the required limits, and the Q-learning algorithm is easy to implement. Note that the delays and connection costs from the Q-learning algorithm can be larger than those from the optimal solution, partly due to the random action selection in line 4 of the above algorithm, which is required to update the Q-value if the network state changes.
IV. CONCLUSION
An architecture for remote patient monitoring service based on heterogeneous wireless access has been presented. eHealth service providers can provide such a value-added service to mobile patients to guarantee the “always-connected” feature “anytime, anywhere”. With a view to minimizing the service cost for the eHealth service provider under demand uncertainty due to the mobility of the patients, a stochastic programming problem has been formulated to obtain the optimal number of reserved connections. Also, at the patient-attached device, the transmission scheduling of biosignal data with different priority is optimized to minimize the connection cost and satisfy the delay requirements. A constrained Markov decision process formulation has been used to obtain the optimal transmission scheduling decision. The performance of the remote patient monitoring service architecture has been evaluated from different system aspects.
Although a few embodiments have been shown and described, it will be appreciated by those skilled in the art that various changes and modifications might be made without departing from the scope of the invention. The terms and expressions used in the preceding specification have been used herein as terms of description and not of limitation, and there is no intention in the use of such terms and expressions of excluding equivalents of the features shown and described or portions thereof, it being recognized that the scope of the invention is defined and limited only by the claims that follow.
REFERENCES


    [1] P. Kall and S. W. Wallace, Stochastic Programming, Wiley John & Sons, January 1995.
    [2] E. Altman, Constrained Markov Decision Processes: Stochastic Modeling, Chapman & Hall/CRC, March 1999.
    [3] Q. Song and A. Jamalipour, “A network selection mechanism for next generation networks,” in Proc. IEEE International Conference on Communications (ICC), vol. 2, pp. 1418-1422, May 2005.
    [4] O. Ormond, J. Murphy, and G.-M. Muntean, “Utility-based intelligent network selection in beyond 3G systems,” in Proc. IEEE International Conference on Communications (ICC), vol. 4, pp. 1831-1836, June 2006.
    [5] W. W. Shen and Q. Q.-A. Zeng, “Cost-function-based network selection strategy in integrated wireless and mobile networks,” IEEE Trans. Veh. Technol., vol. 57 no. 6, pp. 3778-3788, November 2008.
    [6] L.-C. Wang, A. Chen, and H.-H. Chen, “Network selection with joint vertical and horizontal handoff in heterogeneous WLAN and mobile WiMax systems,” in Proc. IEEE Vehicular Technology Conference (VTC) Spring, pp. 794-798, April 2007.
    [7] F. Bari and V. Leung, “Application of ELECTRE to network selection in a hetereogeneous wireless network environment,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 3810-3815, March 2007.
    [8] D. Niyato and E. Hossain, “A noncooperative game-theoretic framework for radio resource management in 4G heterogeneous wireless access networks,” IEEE Trans. Mobile Computing, vol. 7, no. 3, pp. 332-345, March 2008.
    [9] K. Chebrolu and R. R. Rao, “Bandwidth aggregation for real-time applications in heterogeneous wireless networks,” IEEE Transactions on Mobile Computing, vol. 5, no. 4, pp. 388-403, April 2006.
    [10] G. T. Karetsos, S. A. Kyriazakos, E. Groustiotis, F. D. Giandomenico, and I. Mura, “A hierarchical radio resource management framework for integrating WLANs in cellular networking environments,” IEEE Wireless Communications, vol. 12, no. 6, pp. 11-17, December 2005.
    [11] F. Yu and Y. Krishnamurthy, “Optimal joint session admission control in integrated WLAN and CDMA cellular networks with vertical handoff,” IEEE Transactions on Mobile Computing, vol. 6, no. 1, pp. 126-139, January 2007.
    [12] W. Song, H. Jiang, and W. Zhuang, “Performance analysis of the WLAN-first scheme in cellular/WLAN interworking,” IEEE Transactions on Wireless Communications, vol. 6, no. 5, pp. 1932-1952, May 2007.
    [13] M. Bernaschi, F. Cacace, G. Iannello, S. Za, and A. Pescape, “Seamless internetworking of WLANs and cellular networks: Architecture and performance issues in a Mobile IPv6 scenario,” IEEE Wireless Commun., vol. 12, no. 3, pp. 73-80, June 2005.
    [14] N. Shenoy and R. Montalvo, “A framework for seamless roaming across cellular and wireless local area networks,” IEEE Wireless Commun., vol. 12, no. 3, pp. 50-57, June 2005.
    [15] E. S.-Navarro, Y. Lin, and V. W. S. Wong, “An MDP-based vertical handoff decision algorithm for heterogeneous wireless networks,” IEEE Trans. Veh. Technol., vol. 57, no. 2, pp. 1243-1254, March 2008.
    [16] V. S. Azhari, M. Smadi, and T. D. Todd, “Fast client-based connection recovery for soft WLAN-to-cellular vertical handoff,” IEEE Trans. Veh. Technol., vol. 57, no. 2, pp. 1089-1102, March 2008.
    [17] B. Bernard, K. Paul, O. Juan, T. Betty, and S. Fontaine, “Telemedicine: A solution to the followup of rural trauma patients,” J. American College of Surgeons, vol. 192, no. 4, pp. 447-452, 2001.
    [18] R. Fensli, E. Gunnarson, and O. Hejlesen, “A wireless ECG system for continuous event recording and communication to a clinical alarm station,” in Proc. International Conference of IEEE Engineering in Medicine and Biology Society (IEMBS), vol. 1, pp. 2208-2211, September 2004.
    [19] C. H. Salvador, M. P. Carrasco, M. A. G. de Mingo, A. M. Carrero, J. M. Montes, L. S. Martin, M. A. Cavero, I. F. Lozano, and J. L. Monteagudo, “Airmed-cardio: A GSM and Internet services-based system for out-of-hospital follow-up of cardiac patients,” IEEE Trans. Inform. Technol. Biomed., vol. 9, no. 1, pp. 73-85, March 2005.
    [20] E. Guainella, E. Borcoci, M. Katz, P. Neves, M. Curado, F. Andreotti, and E. Angori, “WiMAX technology support for applications in environmental monitoring, fire prevention and telemedicine,” in Proc. IEEE Mobile WiMAX Symposium, pp. 125-131, March 2007.
    [21] D. Niyato, E. Hossain, and J. Diamond, “IEEE 802.16/WiMAX-based broadband wireless access and its application for telemedicine/eHealth services,” IEEE Wireless Commun., vol. 14, no. 1, pp. 72-83, February 2007.
    [22] S. D. Baker and D. H. Hoglund, “Medical-grade, mission-critical wireless networks,” IEEE Eng. Med. Biol. Mag., vol. 27, no. 2, pp. 86-95, March-April 2008.
    [23] J. C. Tejero-Calado, C. Lopez-Casado, A. Bernal-Martin, M. A. Lopez-Gomez, M. A. Romero-Romero, G. Quesada, J. Lorca, and R. Rivas, “IEEE 802.11 ECG monitoring system,” in Proc. International Conference of IEEE Engineering in Medicine and Biology Society (IEMBS), pp. 7139-7142, January 2006.
    [24] Y.-H. Lin, I.-C. Jan, P. C.-I. Ko, Y.-Y. Chen, J.-M. Wong, and G.-J. Jan, “A wireless PDA-based physiological monitoring system for patient transport,” IEEE Trans. Inform. Technol. Biomed., vol. 8, no. 4, pp. 439-447, December 2004.
    [25] D. Niyato E. Hossain, and J. Diamond, “Fourth generation heterogeneous wireless access networks for eHealth services: Architecture and radio resource management,” Invited Chapter in Mobile Telemedicine: A Computing and Networking Perspective, Auerbach Publications, 2008.
    [26] D. V. Djonin, A. K. Karmokar, and V. K. Bhargava, “Joint rate and power adaptation for type-I hybrid ARQ systems over correlated fading channels under different buffer-cost constraints,” IEEE Trans. Veh. Technol., vol. 57, no. 1, pp. 421-435, January 2008.
    [27] M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley-Interscience, March 1994.
    [28] R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction (Adaptive Computation and Machine Learning), MIT press, 1998.

## Claims

1. A system for the remote and mobile monitoring of at least one patient, comprising:
a heterogeneous wireless access network providing communication between at least one eHealth service provider and the at least one patient, the heterogeneous wireless access network configured to provide a number of reserved connections between the eHealth service provider and the at least one patient, wherein the number of reserved connections minimizes cost to the eHealth service provider under randomness of connection demand due to mobility of the at least one patient;
at least one monitoring device disposed on the at least one patient, the at least one monitoring device comprising at least one sensor configured for collecting bio-signal data from the at least one patient, the at least one monitoring device further comprises a heterogeneous wireless transceiver configured to communicate the bio-signal data to the eHealth service provider over the heterogeneous wireless access network;
wherein the bio-signal data is disposed in at least one queue comprising one or more of a group consisting of a critical data queue and a normal data queue; and
and wherein the at least one monitoring device further comprises a scheduler configured to optimize the scheduling of the transmission of the bio-signal data by scheduling the transmission of the bio-signal data at a time when a cost of wireless access is minimized while satisfying queuing delay requirements for different bio-signal data.

2. The system as set forth in claim 1, wherein the wireless access network further comprises at least one radio access network operatively connected to the eHealth service provider for transferring received bio-signal data from the at least one patient.

3. The system as set forth in claim 2, wherein the wireless access network further comprises two or more radio access networks operatively connecting the at least one patient to the e-Health service provider.

4. The system as set forth in claim 1, wherein the scheduler is further configured to optimize the scheduling of the transmission of the bio-signal data to the eHealth service provider over the wireless access network in accordance with one or more of a group consisting of a Packet Arrival Process, a Constrained Markov Decision Process, a Solution Approach Based on Linear Programming and a Q-Learning algorithm.

5. The system as set forth in claim 1, wherein the bio-signal data comprises one or more of a group consisting of blood pressure, pulse rate, heart rate, electrocardiogram signal and sugar level.

6. A method for transmitting bio-signal data to an eHealth service provider over a heterogeneous wireless access network, the method comprising the steps of:
providing a heterogeneous wireless access network providing communication between at least one eHealth service provider and at least one patient;
determining a number of reserved connections on the heterogeneous wireless access network between the at least one eHealth service provider and the at least one patient, wherein the number of reserved connections minimizes cost to the eHealth service provider under randomness of connection demand due to mobility of the at least one patient;
providing at least one monitoring device and attaching the at least one monitoring device to the at least one patient, the at least one monitoring device having at least one sensor configured for collecting bio-signal data from the at least one patient, the bio-signal data comprising one or more of a group consisting of critical data and normal data, the at least one monitoring device further comprising a heterogeneous wireless transceiver configured to communicate the bio-signal data to the eHealth service provider over the heterogeneous wireless access network;
collecting bio-signal data from the at least one patient by the at least one monitoring device;
packetizing and buffering the collected bio-signal data into at least one queue, wherein critical data is packetized and buffered into a critical data queue and normal data is packetized and buffered into a normal data queue, the at least one queue comprising the critical data queue and the normal data queue;
optimizing the scheduling of the transmission of the queued bio-signal data by scheduling the transmission at a time when a cost of wireless access is minimized while satisfying queuing delay requirements for different bio-signal data; and
g) connecting the at least one queue to the heterogeneous wireless transceiver and transmitting the queued bio-signal data to the eHealth service provider over the heterogeneous wireless access network.

7. The method as set forth in claim 6, wherein the collected bio-signal data is transmitted to the eHealth service provider over the reserved connections.

8. The method as set forth in claim 6, further comprising the step of establishing a connection between the heterogeneous wireless transceiver and the eHealth service provider over the heterogeneous wireless access network on an on-demand basis.

9. The method as set forth in claim 6, wherein the step of optimizing the scheduling of the transmission of the bio-signal data further comprises the steps of:
determining whether or not to transmit the bio-signal data from the at least one queue;
matching the bio-signal data in the at least one queue to at least one wireless connection of the heterogeneous wireless access network; and
determining the number of packets of bio-signal data in the at least one queue.

10. The method as set forth in claim 9, further comprising the step of determining the number of reserved wireless connections available to connect to the heterogeneous wireless access network and relaying this information to a scheduler.

11. The method as set forth in claim 6, wherein the step of optimizing the scheduling the transmission of the bio-signal data is in accordance with one or more of a group consisting of a Packet Arrival Process, a Constrained Markov Decision Process, a Solution Approach Based on Linear Programming and a Q-Learning algorithm.

12. The method as set forth in claim 6, wherein the bio-signal data comprises one or more of a group consisting of blood pressure, pulse rate, heart rate, electrocardiogram signal and sugar level.

13. The method as set forth in claim 6, wherein the step of determining the optimal number of reserved connections further comprises the step of determining a probability that the at least one patient will be at a particular location in accordance with a mobility transition probability matrix.

14. The method as set forth in claim 13, further comprising the step of providing a number of reserved connections in accordance with the determined probability that the at least one patient will be at the particular location.

15. The method as set forth in claim 14, further comprising the step of providing a number of on-demand connections when the number of patients at the particular location is larger than the number of reserved connections.

16. A method for transmitting bio-signal data to an eHealth service provider over a heterogeneous wireless access network, the method comprising the steps of:
providing a heterogeneous wireless access network providing communication between at least one eHealth service provider and at least one patient;
determining a number of reserved connections on the heterogeneous wireless access network between the at least one eHealth service provider and the at least one patient, wherein the number of reserved connections minimizes cost to the eHealth service provider under randomness of connection demand due to mobility of the at least one patient;
providing at least one monitoring device and attaching the at least one monitoring device to the at least one patient, the at least one monitoring device having at least one sensor configured for collecting bio-signal data from the at least one patient, the bio-signal data comprising one or more of a group consisting of critical data and normal data, the at least one monitoring device further comprising a heterogeneous wireless transceiver configured to communicate the bio-signal data to the eHealth service provider over the heterogeneous wireless access network;
collecting bio-signal data from the at least one patient by the at least one monitoring device;
e) packetizing and buffering the collected bio-signal data into at least one queue, wherein critical data is packetized and buffered into a critical data queue and normal data is packetized and buffered into a normal data queue, the at least one queue comprising the critical data queue and the normal data queue;
optimizing the scheduling of the transmission of the queued bio-signal data by scheduling the transmission at a time when a cost of wireless access is minimized while satisfying queuing delay requirements for different bio-signal data; and
connecting the at least one queue to the heterogeneous wireless transceiver and transmitting one or both of the critical data and the normal data to the eHealth service provider over the heterogeneous wireless access network.

17. The method as set forth in claim 16, wherein one or both of the collected critical data and the collected normal data is transmitted to the eHealth service provider over the reserved connections.

18. The method as set forth in claim 16, further comprising the step of establishing a connection between the heterogeneous wireless transceiver and the eHealth service provider over the heterogeneous wireless access network on an on-demand basis.

19. The method as set forth in claim 16, further comprising the step of determining whether or not to transmit one or both of the critical data and the normal data from the at least one sensor.

20. The method as set forth in claim 16, further comprising the step of optimizing the transmission of one or both of the critical data and the normal data in accordance with one or more of a group consisting of a Packet Arrival Process, a Constrained Markov Decision Process, a Solution Approach Based on Linear Programming and a Q-Learning algorithm.

21. The method as set forth in claim 16, wherein the bio-signal data comprises one or more of a group consisting of blood pressure, pulse rate, heart rate, electrocardiogram signal and sugar level.

22. The method as set forth in claim 16, wherein the step of determining the optimal number of reserved connections further comprises the step of determining a probability that the at least one patient will be at a particular location in accordance with a mobility transition probability matrix.

23. The method as set forth in claim 22, further comprising the step of providing a number of reserved connections in accordance with the determined probability that the at least one patient will be at the particular location.

24. The method as set forth in claim 23, further comprising the step of providing a number of on-demand connections when the number of patients at the particular location is larger than the number of reserved connections.