1

1.Throughput Optimization of Heterogeneous IEEE 802.11 DCF

Networks

ABSTRACT
This paper presents the throughput analysis of an M-group heterogeneous IEEE 802.11 DCF
network where nodes in different groups have distinct input rates and initial backoff window
sizes. An explicit expression of the network steady-state operating point is obtained based on
the fixed-point equation of the limiting probability of successful transmission of Headof-
Line (HOL) packets given that the channel is idle, which is shown to be closely dependent on
the backoff parameters of saturated groups and the input rates of unsaturated groups. Both the
network throughput and the group throughput performance are further characterized, and the
maximum network throughput is derived as an explicit function of the holding times of HOL
packets in successful transmission and collision states. The analysis reveals that to achieve
the maximum network throughput, the optimal set of input rates of unsaturated groups and
initial backoff window sizes of saturated groups should satisfy a constraint that is determined
by the group sizes of saturated groups.

INTRODUCTION
In this paper, the analytical framework proposed in is extended to an M-group heterogeneous
IEEE 802.11 DCF network. It is assumed that nodes in the same group have identical input
rates and initial backoff window sizes, but the parameters differ from group to group. The
network steady-state operating point is characterized by using the limiting probability of
successful transmission of HOL packets given that the channel is idle, p. Based on the state
characterization of HOL packets, the fixed-point equation of p is derived, and the single
steady-state point pB is obtained as an explicit function of the holding times of HOL packets
in successful transmission and collision states, the input rate of each unsaturated group, and
the group size and the initial backoff window size of each saturated group. Both the desired
stable point pL and the undesired stable point pA of homogeneous IEEE 802.11 DCF
networks are included as special cases of pB when M = 1.





2

DESIGN METHODOLOGY
THROUGHPUT OPTIMIZATION OF A TWO-GROUP NETWORK
For an unsaturated network, its throughput always equals the aggregate input rate, which is
independent of backoff parameters. If the network is partially-saturated or fully saturated,in
contrast, that the throughput performance can be further optimized by tuning the backoff
parameters of the saturated groups. The throughput performance of a partially-saturated and a
fully-saturated two group network are focused.
a) Partially-saturated Two-group Network:
A partially-saturated two-group network has one unsaturated group and one saturated group.
It is demonstrated that if there is only one saturated group in the network, both the network
throughput and the throughput of the saturated group can be maximized by tuning its initial
backoff window size.
b)Fully-saturated Two-group Network:
The network becomes fully-saturated if both groups are saturated. In this case,that the
network throughput and the group throughput cannot be simultaneously maximized. In
particular, to maximize the network throughput, the initial backoff window is sized.

CONCLUSION
The network steady-state operating point pB is derived as an explicit function of the input
rates of unsaturated groups and the initial backoff window sizes of saturated groups, based on
which the group throughput and the network throughput performance can be further
characterized. Explicit expressions of the maximum network throughputmax and the
optimal initial backoff window sizes {W(i) m } to achieve max are obtained. The analysis
shows that to optimize the network throughput performance, the initial backoff window sizes
of saturated groups should be properly enlarged as their groups sizes or the input rates of
unsaturated groups increase. In this case, the group throughput of each saturated group is
inversely proportional to the ratio of its initial backoff window size and the group size,
indicating that groups with a larger ratio have lower group throughput. The analysis provides
direct guidance on the network design and performance optimization of IEEE 802.11 DCF
networks.



3

2.Channel Condition Based Contention Window Adaptation in
IEEE 802.11 WLANs

ABSTRACT
There have been several mechanisms to tune the Contention Window (CW) with the aim to
achieve the optimal throughput in the IEEE 802.11 WLAN, however, the mechanisms do not
specifically address a proper setting of the backoff parameters under nonsaturated conditions.
Noting that typical 802.11 networks are usually non-saturated, in this paper, we analytically
derive the CW sizes that maximize the WLAN system throughput under both saturated and
non-saturated conditions. Then, using the CW sizes derived, we propose a distributed
algorithm that enables each station to dynamically adapt its CW according to the channel
congestion status. The performance of the proposed algorithm is investigated through
simulation.

INTRODUCTION
The IEEE 802.11 access scheme incorporates two access methods: while efforts have been
made to support real-time services by using Point Coordination Function (PCF), the method
operates primarily based on centralized scheduling and polling techniques. A more
reasonable model of operation is known to be that of random access, Distributed
Coordination Function (DCF) for asynchronous,contention-based, distributed access to the
channel. The IEEE 802.11 adopts a binary exponential backoff algorithmTo improve the
efficiency of the IEEE 802.11 backoff protocol, feedback based mechanisms have been
proposed for adapting the stations backoff stage to the network congestion and maximizing
channel utilization. When the network is congested, a station operating under the IEEE
802.11, has to suffer from collisions, to increase the CW size for each transmitted packet,
incurring a high collision probability and hence, degrading channel utilization. Virtual
Backoff Algorithm (VBA), that adopts the sequencing technique with the aim to minimize
the number of collisions and to increase the system throughput. However, the VBA scheme
still suffers from collisions unless the network operates under a steady state where the
number of active stations is fixed since all the stations are initialized with the same sequence
number. in the non-saturated condition, two optimal CW sizes for idle and busy slots are
derived and they are used to adjust the CW size at a finer granularity.


4

DESIGN METHODOLOGY
CONTENTION WINDOW OPTIMIZATION:
To provide a backoff algorithm for stations in the 802.11WLAN, based on the congestion
status, we need to first analyze the optimized CWs in both saturated and non-saturated
conditions.
OPTIMIZED CONTENTION WINDOW IN UNSATURATED CONDITION:
The CW size optimized under nonsaturated condition.They introduce two different maximum
CW sizes for a station according to whether the current slot in which a packet arrives to the
station, is idle or busy when the stations buffer is empty.
BACKOFF SCHEME:
If the buffer at the station is not empty, the station estimates *. Otherwise, and are
employed by the station so that the CW could be reduced or increased quickly according to
the current channel condition.

CONCLUSION
In this paper ,they analytically derived the CW sizes optimized for achieving the maximum
throughput under both saturated and non-saturated conditions. Then, using the CW sizes
derived,they proposed a distributed algorithm that enables each station to dynamically adapt
its CW size according to the channel status. The results demonstrated that the proposed
backoff scheme provides a remarkable performance improvement in terms of the packet
transmission delay in the MAC layer, while maintaining an optimal throughput closer to the
theoretical throughput limit of the IEEE 802.11 DCF access scheme than AOB and VBA-
NCS. Further, that the mechanism provides traffic differentiation and still offers a
performance improvement in the wireless environment with channel errors and in the
multiple-AP environment. Lastly, one direction of our future research is to investigate
backoff solutions for achieving fair and efficient channel allocation in various multiple-AP
environments.






5

3.A Unified Analysis of IEEE 802.11 DCF Networks: Stability,
Throughput, and Delay

ABSTRACT
In this paper, a unified analytical framework is established to study the stability,
throughput, and delay performance of homogeneous buffered IEEE 802.11 networks with
Distributed Coordination Function (DCF). Two steady-state operating points are
characterized using the limiting probability of successful transmission of Head-of-Line
(HOL) packets p given that the network is in unsaturated or saturated conditions. The
analysis shows that a buffered IEEE 802.11 DCF network operates at the desired stable point
p pL if it is unsaturated. pL does not vary with backoff parameters, and a stable throughput
can be always achieved at pL. If the network becomes saturated, in contrast, it operates at the
undesired stable point p pA, and a stable throughput can be achieved at pA if and only if
the backoff parameters are properly selected. The stable regions of the backoff factor q and
the initial backoff window size W are derived, and illustrated in cases of the basic access
mechanism and the request-to-send/clear-to-send (RTS/CTS) mechanism. It is shown that the
stable regions are significantly enlarged with the RTS/CTS mechanism, indicating that
networks in the RTS/CTS mode are much more robust. Nevertheless, the delay analysis
further reveals that lower access delay is incurred in the basic access mode for unsaturated
networks. If the network becomes saturated, the delay performance deteriorates regardless of
which mode is chosen. Both the first and the second moments of access delay at pA are
sensitive to the backoff parameters, and shown to be effectively reduced by enlarging the
initial backoff window size W.

INTRODUCTION
DCF is based on the Carrier Sense Multiple Access (CSMA) protocol with two access
mechanisms including the basic access mechanism and the request-to-send/clear-to-send
(RTS/CTS) mechanism. As a random access protocol, DCF inherits the merits of minimum
coordination and distributed control, which, on the other hand, also renders difficulty in
modeling and performance evaluation.A widely adopted model of IEEE 802.11 DCF
networks model was well supported simple analytical tool, to evaluate the throughput
performance when the network becomes saturated, i.e., each node always has a packet to
transmit. In current IEEE 802.11 DCF networks, Binary Exponential Backoff (BEB) is

6

adopted (i.e., the backoff factor q is fixed to be 1=2), and small values of initial backoff
window size and cutoff phase are selected. The analysis shows that the default standard
setting leads to suboptimal performance,and may cause significant degradation when the
network size or the traffic level increases. The stable region of initial backoff window size W
with BEB is characterized,and the optimal W to achieve the maximum throughput is obtained
as a linear function of the number of nodes n. The delay analysis further reveals that the
fundamental reason behind the observed short-term unfairness of BEB is a high second
moment of access delay in both the basic access and the RTS/CTS modes. To improve the
delay performance at the saturated point, a large initial backoff window size W should be
adopted .

DESIGN METHODOLOGY
This paper presents the stability, throughput, and delay analysis of buffered IEEE 802.11
DCF networks. It is revealed that an IEEE 802.11 DCF network has two steady-state points.
It operates at the desired stable point pL if it is unsaturated, and a stable throughput can be
always achieved at pL. If it becomes saturated, it shifts to the undesired stable point pA, and a
stable throughput can be achieved if and only if the backoff parameters are properly selected
from their corresponding stable regions.Both the maximum stable throughput and the stable
region of backoff factor q are derived, and shown to be crucially dependent on the holding
times of HOL packets in successful transmission and collision states, _T and _F .With a
decrease of _F , the stable region is enlarged and becomes less sensitive to system
parameters, which justifies the observation that an IEEE 802.11 DCF network in the
RTS/CTS mode is more robust than that in the basic access mode. The delay analysis further
shows that for unsaturated networks, both the first and second moments of access delay grow
with _T and the initial backoff window size W,implying that better delay performance can be
achieved in the basic access mode with a small W. If the network is saturated at the undesired
stable point pA, on the other hand, a large W becomes desirable in both modes to prevent the
capture phenomenon.

CONCLUSION
In current IEEE 802.11 DCF networks, the backoff factor q is fixed to be 1=2, and small
values of initial backoff window size W and cutoff phase K are usually selected. It is shown
that in the basic access mode, there exists a huge gap between the maximum throughput that

7

can be achieved with the default standard setting and the optimum throughput. To eliminate
the gap, a large cutoff phase K should be selected, and the initial backoff window size W
should be linearly adjusted with the network size n . Moreover, the delay analysis shows that
with the default standard setting, a saturated IEEE 802.11 DCF network suffers from serious
short-term unfairness due to a high second moment of access delay no matter which mode is
chosen. To improve the delay performance at the saturated point, a large initial backoff
window size W should be adopted, which nevertheless may cause unnecessarily long delay if
the network is unsaturated.It should be noted that throughout the paper, we assume that each
node is equipped with a buffer of infinite size, and each HOL packet has no limit on the
number of retransmission attempts. In practical networks, however, packets may be dropped
due to: 1) a finite buffer size; and 2) a limit on the number of retransmissions. Intuitively, the
buffer size does not affect the contention process of HOL packets, and hence, the analysis
presented in this paper remains valid for the finite buffer size case. The effect of retry limit,
in contrast, could be prominent when the network becomes saturated.



















8

4.IEEE 802.11 Saturation Throughput Analysis in the Presence of
Hidden Terminals

ABSTRACT
Hidden terminals are common in IEEE 802.11 and cause the degradation of throughput.
Despite the importance of the hidden terminal problem, there have been a relatively small
number of studies that consider the effect of hidden terminals on IEEE 802.11 throughput,
and many are not accurate for a wide range of conditions. This paper present an accurate new
analytical saturation throughput model for the infrastructure case of IEEE 802.11 in the
presence of hidden terminals.

INTRODUCTION
Hidden terminals are common in IEEE 802.11 because the communication and carrier-sense
ranges of the access point and clients vary significantly due to obstacles, interference,
transmission power, antenna gain, and location. Despite work toward alleviating the effects
of hidden terminals, either by deployment or node design , in real deployments with the
standard protocol, there will be hidden terminal situations. Hidden terminals effectively
disable the carrier sense capability of the protocol and negatively affect the performance of
system. Much of existing work is centered on the ad hoc or multihop cases rather than the far
more common, basic infrastructure case. There are several reasons for the inaccuracy of the
extended Bianchis model. A key assumption when extending Bianchis model is that the
state of the two stations is decoupled. That the conditional collision probability is not
constant, but rather increases with the retransmission stage in scenarios. The variation of the
conditional collision probability is especially severe when the number of stations is small.

DESIGN METHODOLOGY
In this paper, they present an accurate new Markov chain model reflecting the variation of the
conditional collision probability as a function of the retransmission stage for the saturation
throughput for IEEE 802.11 in the presence of hidden terminals for the general infrastructure
cases. The new model takes into account the interactions between the two stations by jointly
modeling the backoff stage of each of the two stations.



9

CONCLUSION
Hidden terminals are common in IEEE 802.11, and performance degradations they cause
have been widely known.Despite the importance of the hidden terminal, the studies that
consider the effect of hidden terminals on IEEE 802.11 throughput are small and inaccurate.
We present an accurate saturation throughput model for IEEE 802.11 for general
infrastructure scenarios with hidden terminals.The results in this paper are focused on the
case with a single access point, they plan to extend the work to the a more general case with
multiple access points that is now common throughout enterprises and universities.



















10

5. A Prioritized Adaptive Scheme for Multimedia Services over
IEEE 802.11 WLANs

ABSTRACT
IEEE 802.11e protocol enables QoS differentiation between different traffic types, but
requires MAC layer support and assigns traffic with static priority. This paper proposes an
intelligent Prioritized Adaptive Scheme (iPAS) to provide QoS differentiation for
heterogeneous multimedia delivery over wireless networks. iPAS assigns dynamic priorities
to various streams and determines their bandwidth share by employing a probabilistic
approach-which makes use of stereotypes. Unlike existing QoS differentiation solutions, the
priority level of individual streams in iPAS is variable and considers service types and
network delivery QoS parameters (i.e. delay, jitter, and packet loss rate). A bandwidth
estimation technique is adopted to provide network conditions and the IEEE 802.21
framework is used to enable control information exchange between network components
without modifying existing MAC protocol. Simulations and real life tests demonstrate how
better results are obtained when employing iPAS than when either IEEE 802.11 DCF or
802.11e EDCA mechanisms are used. The iPAS key performance benefits are as follows: 1)
better fairness in bandwidth allocation; 2) higher throughput than 802.11 DCF and 802.11e
EDCA with up to 38% and 20%, respectively; 3)enables definite throughput and delay
differentiation between streams.

INTRODUCTION
The original IEEE 802.11 protocol adopts the CSMA/CA mechanism to manage the wireless
channel access. However,the 802.11 standard is only designed for best effort service and
incorporates limited QoS differentiation support with regard to multimedia applications and
mobile devices.The IEEE 802.11e has been developed to overcome the QoS problem of
traditional 802.11 networks, introducing support for differentiation between four different
classes of traffic:voice, video, best effort and background . However, when the 802.11e
channel is occupied by high priority traffic,the low priority traffic might suffer from
starvation due to the low channel access opportunity. This paper proposes the intelligent
Prioritized Adaptive Scheme (iPAS), which provides QoS differentiation between multiple
streams during wireless multimedia delivery. iPAS assigns dynamic priorities to various
streams and determines their bandwidth share by employing a stereotypes-based

11

approach.The priority level of individual stream is variable and depends on stream-related
characteristics (i.e. device resolution, battery left, and application type) and network delivery
related QoS parameters (i.e. delay, jitter, and loss). iPAS is incorporated into the IEEE
802.21 framework , supporting both network information gathering and dissemination.

DESIGN METHODOLOGY
IPAS SYSTEM ARCHITECTURE:

Fig.The block structure of the iPAS-based multimedia delivery system.
Fig. presents the iPAS system architecture which consists of two main blocks: iPAS server
and iPAS client. The iPAS server is responsible with managing bandwidth resources using a
stereotype-based resource allocation mechanism and a bandwidth estimation scheme . The
iPAS client collects information about stream preferences, which is sent as feedback to the
iPAS server.The multimedia traffic is delivered using Real-time Transport Protocol (RTP)
and the feedback is transmitted using Real-time Control Protocol (RTCP) . The Server and
Client Communication Agent situated at the two communicating sides of the system,
respectively, establish and manage the communication link. IEEE 802.21 MIH Function and
MIH User modules are utilized to gather feedback information from lower and upper layers
of the multimedia gateway system,respectively.The fig. indicates the feedback exchanged
between different system components. MBE feedback consists of information regarding

12

packet size, number of clients, MAC layer loss and round trip time. iPAS feedback consists
of data regarding the service type, screen characteristics, power consumption level, data
delivery delay, delay jitter and packet loss.

CONCLUSION
This paper proposes an intelligent Prioritized Adaptive Scheme (iPAS) to provide both QoS
differentiation over IEEE 802.11 networks. iPAS algorithm assigns dynamic priorities to
multimedia streams and suggests a proportional bandwidth share according to the results of a
bandwidth allocation process. This process employs a novel stereotype based bandwidth
allocation solution which considers both network delivery QoS-related parameters such as
delay, jitter,and packet loss rate. The following conclusions have been drawn. 1) iPAS
achieves higher and more stable fairness index than 802.11 DCF and 802.11e EDCA for all
four service types with increasing network load; 2) iPAS can differentiate the bandwidth
share among different streams according to the priority level. iPAS allocates higher
throughput for both voice and video traffic in comparison with those of 802.11 DCF and
802.11e EDCA, demonstrating good QoS support for multimedia services.It is also observed
that iPAS achieves the highest aggregate throughput for the entire range of network loads
tested. The aggregate throughput of iPAS is higher than those of 802.11 DCF and 802.11e
EDCA with up to 38% and 20%,respectively; 3) iPAS and 802.11e EDCA both provide delay
differentiation for the four service types (i.e., voice traffic experience the lowest delay and
best-effort traffic achieve the highest delay); 4) iPAS obtains the lowest packet loss rate for
the entire range of network loads. In the case of heavy traffic load, packet loss rate was lower
with 18% and 34%, for iPAS than the rates recorded for 802.11 DCF and 802.11e
EDCA,respectively.







13

6.On the Rate Adaptation Techniques of IEEE 802.11 Networks
for Industrial Applications

ABSTRACT
The performance of the IEEE 802.11 WLAN are influenced by the wireless channel
characteristics that reflect on the signal-to-noise ratio (SNR), particularly in industrial
communication systems, that often operate in harsh environments. In order to cope with SNR
reductions, the IEEE 802.11 WLAN specification suggests to adapt (reduce) the transmission
rate, since the modulation techniques employed at the lower rates are more robust. However,
the standard does not define any rate adaptation (RA) technique, leaving the actual
implementation to the device manufacturers choice. In this paper we focus on RA techniques
for industrial communication systems that are typically subjected to tight reliability and
timing requirements. In detail, we compare the performance figures of a general purpose
widespread technique,namely the automatic rate fallback (ARF), with those of the RA
techniques actually implemented on two commercially available IEEE 802.11 devices via a
set of practical experiments. The obtained results show that these techniques are
characterized by a relevant number of packet retransmissions that may introduce a
considerable randomness on the service time, possibly leading to performance degradation.
Consequently,we propose two new techniques and evaluate their behavior by means of
numerical simulations carried out for typical industrial traffic profiles. The outcomes are
encouraging since the proposed RA techniques show in most cases better performance than
ARF.

INTRODUCTION
In this paper, they explicitly focus on the RA techniques of IEEE 802.11 networks deployed
in industrial communication systems. In the initial part, we compare the performance of ARF
with those of the RA techniques adopted by two commercially available access points (APs)
actually employed in a hybrid (Ethernet/IEEE 802.11) network. This assessment is carried
out using both a Markov chain model of ARF and a prototype implementation of the hybrid
network . Subsequently, we propose two new RA techniques specifically designed for
industrial communications and evaluate their behavior by means of numerical simulations.



14

DESIGN METHODOLOGY
For a static channel, more than 10% of the packets are not successfully delivered at the first
attempt by the ARF station, whereas this index raises up to almost 20% for the Siemens AP
and even more for the 3Com one. Also, these percentages increase consistently in case a
dynamic channel is considered. The final effect may be an intolerable increase of the service
time as well as of its randomness. Moreover, particularly for a fast varying channel, packets
might be dropped due to the overcoming of the maximum retransmission limit, possibly
causing serious drawbacks to the behavior of the applications that rely on the communication
system [34]. As a consequence,there is the need to explore new RA techniques capable of
both keeping the number of retransmissions as low as possible and,at the same time, ensuring
adequate values of the service time. The first technique, which is referred as static
retransmission rate ARF (SARF), behaves like ARF with the difference that, in order to limit
the number of transmission attempts, each packet retransmission takes place at the lowest rate
(6 Mbps), providing in this way the highest success probability. Also, the successful
retransmission of a packet is not considered as an event that resets the number of consecutive
failures K . In other words, after two consecutive failed transmissions at rate ri interleaved by
a successful retransmission at 6 Mbps, the SARF technique selects the rate ri-1 for the
transmission of the next packet. The second technique, referred as fast rate reduction ARF
(FARF), is a modified version of ARF that in case of failure immediately selects 6 Mbps as
the next rate. In practice, for the FARF technique we have and 6 Mbps.

CONCLUSION
The assessment on the RA techniques for IEEE 802.11 devices carried out in the first part of
this paper showed that these techniques are often unsuitable for industrial applications, due to
the relevant randomness they introduce that negatively reflects on the statistics of the service
time. Consequently, we proposed two alternative RA techniques, namely SARF and
FARF,purposely designed to cope with the specific requirements of industrial communication
systems, whose implementation does not require any significant modification to the existing
standards. A performance analysis of these techniques carried out via numerical simulations
revealed that both of them, particularly in the presence of traditional industrial traffic,
perform better than ARF. Moving to a more general traffic profile for which packets of
greater payloads were employed, ARF provides better results for a static channel model,
whereas both SARF and FARF reveal more effective for a fast varying dynamic channel. As
a consequence, the obtained results lead to conclude that the two proposed RA techniques

15

represent an interesting opportunity for the multirate support of IEEE 802.11devices
employed for industrial communications. Clearly, the complete validation of the two
techniques may be only obtained by means of practical experiments. Thus, the first of the
future activities is represented by the actual implementation of both the SARF and FARF
techniques on IEEE 802.11 devices. Finally, more accurate models of the devices employed
in industrial communication systems have to be obtained. Indeed, it has been experimentally
assessed that the RA techniques adopted by the two APs we used behave quite differently
from ARF (and they are not documented), so that it is then impossible to carry out any
theoretical and/or simulative analysis to determine the performance of a network employing
this type of device.

























16

REFERENCES
1.Throughput Optimization of Heterogeneous IEEE 802.11 DCF Networks Yayu Gao,
Xinghua Sun, and Lin Dai, Member, IEEE, IEEE TRANSACTIONS ON WIRELESS
COMMUNICATIONS, VOL. 12, NO. 1, JANUARY 2013.
2.Channel Condition Based Contention Window Adaptation in IEEE 802.11 WLANs
Kunho Hong, Student Member, IEEE, SuKyoung Lee, Member, IEEE, Kyungsoo Kim, and
YoonHyuk Kim, IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 60, NO. 2,
FEBRUARY 2012.
3. A Unified Analysis of IEEE 802.11 DCF Networks: Stability, Throughput, and Delay
Lin Dai, Member, IEEE, and Xinghua Sun, IEEE TRANSACTIONS ON MOBILE
COMPUTING, VOL. 12, NO. 8, AUGUST 2013,
4. IEEE 802.11Saturation Throughput Analysis in the Presence of Hidden Terminals
Beakcheol Jang and Mihail L. Sichitiu, IEEE/ACM TRANSACTIONS ON NETWORKING,
VOL. 20, NO. 2, APRIL 2012 .
5. A Prioritized Adaptive Scheme for Multimedia Services over IEEE 802.11 WLANs
Zhenhui Yuan, Member, IEEE, and Gabriel-Miro Muntean, Member, IEEE, IEEE
TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 10, NO. 4,
DECEMBER 2013.
6.On the Rate Adaptation Techniques of IEEE 802.11 Networks for Industrial Applications
Stefano Vitturi, Lucia Seno, Federico Tramarin, Member, IEEE, and Matteo Bertocco,
Member, IEEE, IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 9, NO.
1, FEBRUARY 2013.