ssignment like CSMA and ALOHA. Such protocols have a high flexibility and they are widely applied in the wireless LANs. Systems can be developed by the use of more than one of these categories  .
Most of the suggested protocols in the category of contention-based are used the techniques of carrier sense multiple access (CSMA). In CSMA, the node has special carrier sensing capabilities. Before starting transmitting, the node must sense the channel. If it found that the channel is busy, then the access will be postponed to the next retrying  .
CSMA has two extensions, collision detection (CSMA/CD) and collision avoidance (CSMA/CA)  . In collision detection, the sender will be able to detect the collision after it happens and thus stop transmitting data. In collision avoidance, the node applies technique that avoids the collision before it happens, but with no guarantees.
Usually it is difficult to detect collisions in a wireless node. Many methods were proposed to address this problem, but even these approaches unable to grants enough ability for nodes to detect all collisions types. Therefore, IEEE 802.11 MAC protocol with CSMA/CA was suggested to be the standard protocol used in wireless local area networks (LANs)   .
Two access methods are provided by IEEE 802.11 access scheme: Distributed Coordination Function (DCF) and Point Coordination Function (PCF). The former is for contention-based access scheme with asynchronous transferring, while the latter is for the contention-free and centralized access scheme  . The DCF method is involved in the CSMA/CA category for MAC protocols.
3.2. Binary Exponential Backoff
Wastage of channel utilization is mainly caused by collisions as well as the idle times resulted by the access distribution  . Binary exponential backoff (BEB) is regarded as an adaptive behavior provided by the IEEE 802.11 DCF mechanism in order to address such wastage.
Each node wants to send a frame, sets a random time for accessing the channel, this amount of time is varying based on the number of collisions which occurred earlier for that frame. If an ACK frame was not received, a node will assume that the corresponding packet was dropped by the collision, and thus it will retransmit this packet after invoking BEB. Backoff time is increased using BEB technique at each time the collision occurs, because this may indicate that the network is congested.
The BEB   - works as follows: Slot_Time is a unit of a constant length used to measure the time, also can be just called slot. In order to implement Binary Exponential Backoff scheme, each node has the Backoff Counter (BC), which is the counter used to compute the required empty slots of time for waiting before attempting to transmit. Before scheduling of a new transmission, the node should wait for random interval which is within a range that is uniformly distributed between 0 and the size of the current contention window (CW). Backoff value is defined as the following:
where the function Random ( ) returns a number selected randomly between 0 and 1.
If the node senses that the channel is busy, it will pause its backoff counter and postpone the transmission. After the end of the ongoing transmission, if it senses that the channel is idle then it will resume the counter again. At each time slot, the value of backoff counter is reduced by one. If its value becomes zero, and if the channel is found not busy for the time interval Distributed Inter Frame Space (DIFS), the node will (re)start trying to access it again.
If the node accessed the channel and successfully sent the packet, it will wait for the acknowledgment (ACK) frame from the receiver within SIFS interval (Short Inter Frame Space), which is less than DIFS. On the other hand, if the node needs to access but the channel is busy, it will stop the decreasing of the counter and preserve its value to be resumed in the next attempt of transmission.
If two nodes chose the same random backoff value, both of them will start transmission simultaneously, and thus the collision will occur. In this case, the sender nodes will detect the collision because of the absence of an ACK for their frames. So, every node will apply the exponential backoff algorithm. Firstly, the size of the contention window (CW) will be doubled. Next, it will choose a random number and assign it to the value of its backoff counter. Then, it will start decreasing the counter until it equals zero. Finally, the node will attempt to retransmit again. If it is successful, it will reset the value of CW to the minimum CWmin.
The initial value of contention window size is CWmin. At each unsuccessful (re)transmission, the size of contention window will be doubled, to reduce the contention. If this size reaches the maximum value CWmax, the protocol will stop the retransmission, discard all not transmitted packets, and reset the size to CWmin. Figure 1 shows the DCF protocol  .
3.3. DCF and RTS/CTS Access Mechanism
RTS/CTS exchanging can optionally extend the Binary exponential Backoff access mechanism of IEEE 802.11 DCF. When the node gets to access the channel, it will send the announcement for its incoming transmission rather than sending the actual data packets. This can be applied by sending a request to send (RTS) control packet to the receiver.
If the receiver is ready to receive the data, it will reply by sending a clear to send (CTS) control packet. Using this technique, all other nodes within the range will be informed about this transmission. So, they will not disturb it. Both the control packets include the expected transmission length, thus the channel will be reserved efficiently for this transmission  .
3.4. Performance Anomaly
In wireless channels, there are many reasons that affect the quality of signals, such as the noise, attenuation and interference. This may cause unsuccessful reception of the frames. The implications of these errors are more
Figure 1. DCF protocol.
critical with 802.11 DCF, because it is not possible to distinguish between fail transmissions and collisions. When the frame is lost, the node will implement the exponential backoff process.
If the node uses a lower bit rate, this may result in a lower frame error rate and thus a better throughput. Unfortunately, diversity of bit rates, either by changing the bit rate for the same node or by the existence of nodes with different bit rates originally, causes a performance anomaly. Slower rate nodes consume longer time for transmission than faster rate nodes. As a result, there will be less time for fast nodes with an idle channel, and thus the throughput will be reduced  .
4. Related Work
Congestion control has a significant importance in wireless sensor networks. Scaling up wireless sensor networks by adding more sensors in a larger area implies increasing the traffic volume while the capacity of the channel around the bottlenecks cannot be increased easily, specifically with low-cost and low-energy constraints.
Resolving congestion does not guarantee fairness  , because in reality they are two different problems, although they are related in terms of their effects on the throughput of the network.
Fairness is one of the most important goals in wireless sensor networks. This issue becomes even more serious for networks with multi data rates. Usually, nodes with the low data rates have a longer occupancy time of the channel than other nodes, and thus will degrade the whole throughput of the network. Nodes may use different data rates because of the conditions of the channel, different generations of technologies, or simply based on their distance from the sink node  .
As wireless sensor networks are usually used in surveillance fields, the fair access to the network between all nodes must be ensured in order to enable the sink nodes to get a complete view of the monitored area. Cooperative MAC Protocol suggested in  to tackle this problem. Low data rate node assisted by a high rate node (called helper node) in its transmission. In order to reduce the occupancy time of the channel, it used two transmissions with high data rates, rather than only one transmission with a low data rate.
Fairness has different definitions based on different criteria. Regarding time scales, there are two types of fairness: the first type is called long-term fairness while the second is called short-term fairness  .
Long-term fairness gives equal probabilities of accessing the channel successfully among all competing nodes on a long-term scale. Short-term fairness gives the same thing, but within shorter time intervals. With short-term fairness, each node can access the channel after a short period of time that results in brief delays. Actually, short term fairness fulfils the long-term fairness, but not vice versa.
IEEE 802.11 MAC protocol provides good short-term fairness for the networks with a limited number of nodes  . But with large number of nodes, it does not provide short term fairness due to the use of exponential backoff by nodes that have collided packets, and thus results in more opportunities of transmission for other nodes.
All nodes choose their random backoff intervals from the similar contention range most of the time. So, they will have the same likelihood of channel access and thus IEEE 802.11 DCF MAC protocol achieves time-based fairness among nodes with similar bit rates  . If all nodes use the same frame size, 802.11 MAC protocol also provides throughput-based fairness (i.e. equal throughput shares). However, throughput fairness maybe caused bandwidth underutilization in multi-rate wireless networks. Also there are two other types of fairness: max-min fairness and proportional fairness. It was proved that if all nodes have the same weight, then the proportional fairness will be equivalent to the time-based fairness in the networks with multi data rates. Moreover, it was proved that the max-min fairness and throughput-based fairness are equivalent under the same condition. It is also argued that the proportional fairness achieves trade-off between throughput and fairness in the network  .
The standard 802.11 MAC protocol achieves max-min fairness in the utilization of the bandwidth. In multi data rate networks, the nodes with low data rate will consume more air-time and this differs from max-min fairness in the use of the bandwidth. Proportional fairness with respect to the use of the bandwidth is nearly equal to the max-min fairness with respect to the use of air-time  .
Proportional fair scheduling at each access point (AP) was proposed in order to get the balance between the aggregate throughput and the fairness in serving all nodes  . Proportional fair scheduling also achieves the trade-off between fairness and efficiency if there is a single AP that supports multi-rates.
Proportional fairness at the access point is for the distribution of the bandwidth on nodes in proportion to their data rates, or assigning the time equally among them if there is a single AP and all nodes with similar priority. In the case of multiple AP, proportional fairness will work by maximizing the sum of logarithms of bandwidth allocated for each node  .
Fair allocation was proposed  for coverage overlapping cells, in order to achieve the proportional fairness. Each new arrival mobile station (MS) will be linked to only one base station (BS). Under this constraint, Bin et al.  try to maximize the logarithm of total data rate for all mobile stations. Hence, every single BS must work on maximizing the logarithm of total data rate over its assigned MSs by allocating radio resources in a proportionally fair manner. They formulate general model of proportional fairness for overlapping coverage in multiple wireless cells.
The fair rate allocation problem was considered  to monitor the entire coverage area and maximize the total proportionally fairness in WSNs with regular topologies where the aforementioned problem was studied for WSNs with regular topologies that used slotted Aloha MAC layer. Narayanan et al.  conclude that, the best topology for the proportionally fair throughput is triangular, square and then hexagonal with respect to the growth size of the network, going from small, medium, to large respectively.
Proportional Fairness Backoff (PFB) scheme was proposed to overcome the funneling effects of the converge-cast patterns in WSNs   . Sensors that are in the area around the sink will have larger number of packets than far away sensors. Because of this disproportionate number of accumulated packets, it is very important to decrease the collisions number as well as increasing the throughput to mitigate this funneling effect in the Intensity Region, the region of the funnel.
Yuanfang et al.   proposed a new scheme, PFB which provides additional opportunities of channel access to the nodes that are closer to the sink in order to address the funneling effect problem.
This problem has many effects in WSNs such as reducing the amount of the data gathered by the sink, shortening the lifetime of the sensors, breaking the stability as well as decreasing the whole throughput of WSN.
The probabilistic approach  provides the proportional fairness without having to solve an optimization problem. Load estimation strategy is used in this approach to estimate the total traffic load for each node, and thus adjusting the contention window according to the difference between the current share of the channel and the required one. So, each node will get a share of the channel that is appropriate to its traffic load. Hence, proportional fairness will be achieved among nodes.
In the next Section, we provide the details of our proposed protocol: Fair MAC protocol (FMAC).
Wireless sensor networks are usually used in the monitoring applications. When a certain event happens in the monitored area, a large number of sensors will need to transmit their data simultaneously. But because of the WSNs nature, it is possible to find heterogeneous nodes with different data rates. Nodes with lower data rate will occupy channel for longer duration; this will result into higher delays and degrades the whole throughput of the network.
Another issue is that because of this many-to-one data transfer model, all nodes send to the sink, it is important to increase the throughput and reduce the number of collisions in order to mitigate funneling effects in the intensity region, the region of the funnel around the sink. We intend to find a new scheme which will reduce the collisions and utilize the idle slots of time, as well as providing more opportunities to the nodes that have higher data rates. Ultimately, we should achieve the proportional fairness among all nodes in the network.
Fair MAC Protocol (FMAC)
We propose the Fair MAC protocol (FMAC) which is based on the idea of using the medium delay periods within the backoff relative to the data rates of the nodes. This will give more opportunities to access the channel for the fast nodes and thus addresses the performance anomaly problem. The use of the medium periods within the backoff reduces the collisions and utilizes the idle time slots.
In FMAC, when the nodes want to calculate the backoff exponential value (BE), they also retrieve the data rate in order to calculate the medium delay (MD) value. Based on the data rate value, it will choose the value of the medium period (MP). MP is the value that determines how the percentage of MD should be from the actual backoff delay (B_Time). After computing the value of MP, which will be between 10 and 25 for fast nodes and between 26 and 40 for low nodes, this value will be used directly to get the percentage of MD from the current backoff delay value. MD value ranges between 10% and 40% of the current backoff delay. Calculations are done as follows:
where B_Time is the actual backoff delay selected randomly by the node using the values: BE = 1, 2,3,4,5 and the unit backoff period (UBP).
The main stages of the proposed protocol are shown below in Figure 2 where we only concentrate on the case when the node needs to apply the modified backoff algorithm.
Firstly, the node calculates the actual backoff delay (B_Time). Secondly, it retrieves its data rate internally. Considering the data rate to be high or low can vary depending on the type of application used which highlights the important of selecting the right threshold.
If the node has a high data rate, then MP value will be selected randomly from 10 to 25. Else, if the node has a slow data rate, then MP value will be chosen randomly between 26 and 40. Next, the value of MP will be used to get the value of the percentage MD. After the period MD has elapsed, the channel will be assessed. If the channel is found idle, then the node will start the sending process. While if the channel is not idle, the node will
Figure 2. Flow chart of the main stages of FMAC.
continue the backoff process using the remaining time (R_Time), after subtracting the value of the elapsed MD, from the actual backoff delay (B_Time).
Assigning different values of MP for the nodes that have different data rates gives different opportunities for these nodes. In other words, the nodes that have a high data rate will be able to assess the channel after a relatively small delay (MD) from the actual backoff delay (B_Time). This means that if the collision occurs, the fast nodes will get more opportunity to access the channel after starting to apply the backoff process.
On the other hand, slow nodes will have a bigger value of MP and thus they will wait more time (MD) in order to be able to assess the channel. Of course, this will reduce their chances to access the channel, because it may be captured by the fast nodes.
FMAC is expected to contribute significantly in reducing the collisions because of the low probability of choosing the same random number for the backoff delay by any two nodes, and also choosing the same random number for the medium delay by these two nodes.
A very important point that must be taken into account here is that although FMAC gives more opportunity to access the channel for the fast nodes, it does not cause starvation for the slow nodes. This is because all these medium delay periods are actually applied within the main frame of the standard backoff process. FMAC enables both of the fast and slow nodes to assess the channel before the end of the actual backoff delay in order to utilize the idle slots of time and reduce the delay.
Another important point is that medium delay periods used in FMAC is similar to those periods defined in Improved Binary Exponential Backoff (IBEB)  , but not the same. Since IBEB does not focus mainly on achieving proportional fairness. Also, the computation of interim periods in IBEB is done more than once and without considering the data rate of the nodes.
6. Simulation and Performance Analysis
We implement Fair MAC protocol (FMAC) discussed in Section 4 using Network Simulator NS-2 version 2.35 under Linux (Fedora 19).
Simulated area is 350 m × 350 m. It contains 11 static nodes deployed randomly without assuming densely deployment but with ensuring the connectivity of the network. One of the nodes is the sink node which is every time located at the middle of the area and it assumed that it has stronger capabilities than other nodes. The remaining nodes are sensor nodes which are sending their data only to the sink in a one hop manner.
We assume the applications that involve sink-oriented transmissions  . We consider the uplink direction of the transmissions in a saturated network; each node always has data to be sent.
Nowadays, there are many applications need higher data rates than those that were used in old WSNs. these new applications include: media streaming (audio and video data), target tracking, exploration of disaster and critical controlling  - . So, we assume high data rates which are similar to those that provided by 802.11 protocol.
Figure 3 shows an example of the assumed simulation area. In this Figure, the random topology with 20 sensor nodes is shown. There are 14 fast nodes and 6 slow nodes. The number of slow and fast nodes was selected randomly.
FMAC protocol is employed as the protocol for MAC layer. The performance of FMAC protocol is compared every time with that of the standard 802.11 MAC protocol. The mechanism of sending of RTS/CTS is used to safely access the channel for both protocols.
We use different data rates to represent the fast nodes and the slow nodes selecting 2 Mbps and 1 Mbps for this purpose respectively; according to the rates which are provided by the standard MAC 802.11, because of comparison issues.
Constant Bit Rate (CBR), based on the UDP protocol, used as traffic source generator. The number of sent packets was varied by tuning the interval of CBR. However, all nodes have the same interval along the single experiment.
We increase the number of sensor nodes gradually from 10 to 50 nodes in order to test the scalability of our protocol. Although that the numbers of slow and fast nodes are chosen randomly, we ensure that at least 30% of all nodes are slow nodes. We choose this percentage in order to see the impact of slow nodes clearly. Also the number of sent packets was increased gradually from 200 to 1000 packets to ensure the performance of our protocol under different traffic loads.
Figure 3. The virtual simulation area.
The time of simulation is 200 seconds and each experiment was done 30 times, then the average was calculated to produce the graphs for the results provided later. Table 1 shows a summary of the important parameters of the simulation. The values of other parameters unchanged as defined in the files of NS-2.
The major matrices used in this research to evaluate the performance of our proposed protocol are as follows: number of collisions, energy consumption, end-to-end delay, throughput aggregation for the network as a whole and Jain’s fairness index. We also make a comparison of the throughput for all the fast nodes with the throughput for all the slow nodes. The simulation results are provided in the next Section with Illustrative graphs.
7. Results and Discussion of Implications
All networks that are based on contention between nodes mainly experience the problem of collisions. As long as the number of collisions is increasing, the retransmission number is also increased, and thus more energy is consumed. Of course, this will affect the overall performance of the network, especially because of the limited resources in WSN.
On the other hand, as mentioned before, the performance anomaly, which is caused by slow nodes, will degrade the overall throughput of the network. So, we focus in this research on studying and analyzing these main related metrics.
Although using of RTS/CTS mechanism solves the collision problem that is caused by the hidden terminal problem to some extent, there is still another reason for the collision. This reason is the probability of choosing the same number of the backoff interval time by two nodes that are in the range of each other. Figure 4 shows the comparison of collisions number for FMAC protocol and the standard 802.11 protocol under different sizes of the network.
The average number of collisions was reduced clearly when FMAC protocol is used instead of the standard MAC 802.11 protocol with different number of sent packets. Figure 4 shows that when the number of sent packets is increasing, the difference between FMAC and standard MAC 802.11 becomes bigger.
Collisions also tested under different loads; different numbers of sent packets, the results are shown in Figure 5. Although both protocols have a similar number of collisions with small number of nodes as in Figure 5, when increasing the number of nodes there is a noticeable difference for FMAC favor. There is about 4.33% reduction of the collisions number with FMAC protocol.
7.2. End to End Delay
End to end delay also has an effect on the performance of the network as a whole. Figure 6 and Figure 7 show
Figure 4. Comparison of collisions number for FMAC and standard MAC 802.11 (30 nodes).
Figure 5. Comparison of collisions number for FMAC and standard MAC 802.11 (600 packets).
Figure 6. Comparison of end-to-end delay for FMAC and standard MAC 802.11 (40 nodes).
Table 1. Important parameters of the simulation.
the comparison of end-to-end delay for both FMAC protocol and the standard MAC 802.11 protocol under different loads.
We can see from Figure 6 that end-to-end delay with FMAC protocol is slightly bigger than that with the standard MAC 802.11 protocol. However, the delay for both protocols is increased with the increase of the number of sent packets.
In Figure 7, we increase the number of nodes in the network and compare end-to-end delay for both two mentioned protocols.
We can see clearly that the delay with FMAC protocol is very similar to that with the standard MAC 802.11 protocol in all cases. However, the delay becomes a slightly bigger with the largest network size. FMAC increases the average end-to-end delay with only around 0.27%. As a result, such delay is insignificant in WSNs.
7.3. Energy Consumption
The secret of success for any protocol proposed to be applied in WSNs is the power saving.
In Figure 8 we provide the comparison of the average consumed power per node for FMAC and the standard MAC 802.11 protocol under different number of sent packets. When increasing number of sent packets, nodes in FMAC protocol consume a slightly less power than the standard MAC 802.11 protocol. However, both protocols consume more energy with heavy load.
Figure 8 shows the increase in energy consumption becomes slower with high loads, while Figure 9 shows the average consumed power per node for our proposed protocol and the standard MAC 802.11 protocol under different sizes of the network.
In Figure 9 we see that the consumed energy by both protocols is also increased as long as the size of the
Figure 7. Comparison of end-to-end delay for FMAC and standard MAC 802.11 (200 packets).
Figure 8. Comparison of energy consumption for FMAC and standard MAC 802.11 (20 nodes).
network increased. But, with significantly difference in favor of FMAC protocol. FMAC consumed less power than the standard MAC 802.11 protocol.
FMAC utilizes the idle time and reduces the number of retransmissions since the collisions were reduced. The average energy consumption is reduced by about 0.011% when applying FMAC. Although this is a small value, it considered sufficient to ensure that our protocol does not cause more energy consumption.
7.4. Aggregation Throughput
One of the main objectives of the proposed protocol is enhancing the aggregate throughput of the network as a whole. Figure 10 presents the comparison of aggregate throughput for FMAC and the standard MAC 802.11 protocols with different number of sent packets. As Figure 10 indicates when increasing the number of packets sent, FMAC protocol achieves greater throughput than the standard MAC 802.11 protocol. This means that the aggregate throughput of the network becomes larger when using FMAC protocol in a network of high load.
Aggregate throughput for FMAC and the standard MAC 802.11 protocols with different sizes of the network is shown in Figure 11. It shows that FMAC protocol still gives better throughput than the standard MAC 802.11 protocol. Of course, this significant difference in favor of FMAC is due to its ability to decrease the collisions.
Generally, FMAC protocol achieved an increase in the average aggregate throughput in all cases of about 1.9% higher than the standard MAC 802.11 protocol.
7.5. Proportional Fairness
WSN is usually used for monitoring purposes, which require gathering information from a large number of nodes in a fair manner as possible, while caring about throughput and aggregation throughput per node.
Figure 9. Comparison of energy consumption for FMAC and standard MAC 802.11 (1000 packets).
Figure 10. Comparison of aggregate throughput for FMAC and standard MAC 802.11 (50 nodes).
We are focusing on achieving proportional fairness between slow nodes and fast nodes. So, we calculate the average throughput for all fast nodes and then we compare this average with the average throughput for all slow nodes. Every time there is about 30% of nodes that have slow data rate.
Figure 12 shows this comparison for the standard 802.11 MAC protocol with different number of nodes, while Figure 13 shows the same thing but for FMAC protocol. The average of the throughput for all slow nodes is still larger than the average of the throughput for all fast nodes while the size of the network is increasing with the standard MAC 802.11 protocol as shown in Figure 12. Despite this, the slow nodes constitute only about 30%
Figure 11. Comparison of aggregate throughput for FMAC and standard MAC 802.11 (400 packets).
Figure 12. Comparison throughput of fast and slow nodes in standard MAC 802.11 (200 packets).
Figure 13. Comparison throughput of fast and slow nodes in FMAC (200 packets).
of the total number of nodes in the network. On the other hand, we can see in Figure 13 that the average of throughput for all slow nodes clearly becomes less than the average of the throughput for all fast nodes when applying FMAC protocol while the size of the network is increasing.
The same comparison between these two protocols is shown in Figure 14 and Figure 15 respectively, but this time with a different number of sent packets. In Figure 14, we can see that the difference in the average throughput for all slow nodes and the average throughput for all fast nodes becomes more significance when the number of sent packets is increased with the standard MAC 802.11 protocol. Again, the slow nodes that comprise about only 30% of the total number of nodes in the network have a higher average of throughput.
We can see exactly the opposite in Figure 15; the average of the throughput for all slow nodes significantly becomes less than the average of the throughput for all fast nodes when the number of sent packets is increased with FMAC 802.11 protocol. FMAC protocol achieves proportional fairness, between slow and fast nodes, more than the standard MAC 802.11 in all cases. But the difference is noticed more clearly with increasing of number of sent packets. This is due the fact that FMAC protocol gives more chance for the fast nodes to access the channel.
7.6. Fairness Index
Fairness index measures how the channel is shared equally by all nodes. It is concerned with the minimum number of transmitted packets by any individual node in the network relative to the maximum number of transmitted packets by any of the nodes in the network  . Jain’s index gives the fairness criterion taking into account all the nodes in the network  . Hence, the higher value of this index, the better fairness between all nodes. Jain’s fairness index is given by  :
Figure 14. Comparison throughput of fast and slow nodes in standard MAC 802.11 (10 nodes).
Figure 15. Comparison throughput of fast and slow nodes in FMAC (10 nodes).
where n is the number of all contending nodes and xi is share of the allocation which given for the ith node.
We compute Jain’s fairness index twice. The first time is for FMAC protocol with different sizes of the network and for the average number of sent packets. Figure 16 shows the comparison of this index for FMAC and the standard MAC 802.11 protocol.
The second time is shown in Figure 17, which is also for FMAC protocol but with different loads in the network and for the average number of nodes with the comparison of the standard MAC 802.11 protocol.
From both Figure 16 and Figure 17, it is clear that the value of Jain’s fairness index for FMAC protocol is higher than the standard MAC 802.11 protocol in all cases. As the load in the network increases, the difference between the values of the index for both two protocols becomes bigger. Also we can see in Figure 16 that with the largest network size, the value of the index for FMAC protocol becomes very close to 1, which is the maximum value of Jain’s fairness index and it indicates a higher achieved fairness.
8. Conclusion and Future Work
The main objective of the proposed algorithm is to design a new MAC protocol that achieves proportional fairness between nodes with different data rates in WSNs. Fair MAC protocol (FMAC) aims to enhancing the aggregate throughput as well as achieving the proportional fairness between all nodes in the network by reducing the collisions number and utilizing the idle slots of time.
The core idea of FMAC protocol is that each node computes a medium delay period in proportion to its data rate, directly after the computation of the actual backoff delay period. Then, when the medium period has
Figure 16. Comparison of Jain’s fairness index of FMAC and standard MAC 802.11 (average load).
Figure 17. Comparison of Jain’s fairness index of FMAC and standard MAC 802.11 (average number of nodes).
elapsed, it will check the channel to be idle. If the channel is busy, the node will continue the backoff process with remaining delay of the actual period. This will achieve proportional fairness and maximize the aggregate throughput by giving more probability to access the channel for the fast nodes. FMAC protocol is compatible with the standard IEEE 802.11, only small changes are required. However, the proposed protocol is also applicable in WLANs because it does not mainly depend on the nature of WSNs.
The experimental results show that when using FMAC the transmission becomes faster with less power consumption due to the better utilization of idle time slots. Also the average number of collisions is reduced by 4% and the average aggregation throughput increased by 1.9%. Using Jain’s fairness index, FMAC protocol obtains higher values. Thus, experimental results indicate that FMAC protocol achieves its main objectives.
The experiments also reveal some interesting future work such as achieving more aggregated throughput by adjusting the interim delay periods more specifically. Also we may compare our protocol against other protocols in existence today, analytically and/or using the simulation. Another possible future direction would be to perform the proposed protocol in different environments or using real world experiments.
This paper was supported by NSTIP strategic technologies program project number 10-INF1184-02 in the Kingdom of Saudi Arabia.