<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">CS</journal-id><journal-title-group><journal-title>Circuits and Systems</journal-title></journal-title-group><issn pub-type="epub">2153-1285</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/cs.2016.79200</article-id><article-id pub-id-type="publisher-id">CS-68620</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Lifetime Enhancement of Cluster Based Wireless Sensor Network through Energy Efficient MAC Protocol
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>B.</surname><given-names>Priya</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>S.</surname><given-names>Solai Manohar</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Electronics and Communication Engineering, Rajalakshmi Engineering College, Chennai, India</addr-line></aff><aff id="aff2"><addr-line>Department of Electrical and Electronics Engineering, Anand Institute of Higher Technology, Chennai, India</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>shanth1@hotmail.com(BP)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>05</day><month>07</month><year>2016</year></pub-date><volume>07</volume><issue>09</issue><fpage>2296</fpage><lpage>2308</lpage><history><date date-type="received"><day>27</day>	<month>March</month>	<year>2016</year></date><date date-type="rev-recd"><day>accepted</day>	<month>20</month>	<year>April</year>	</date><date date-type="accepted"><day>19</day>	<month>July</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  The efficient use of energy is an important performance metric to extend the lifetime of wireless sensor networks. Since major energy consumption of node is due to its transceiver, the design of MAC protocol plays a vital role in sensor network design. In cluster based sensor networks, due to the different functions of member node and cluster head node, the usage of common MAC protocol results increased energy consumption. To overcome this problem, a novel energy efficient hybrid MAC protocol (EEHMAC) for cluster based wireless sensor networks is proposed in this paper. The proposed EEHMAC protocol uses E-TDMA (Energy efficient TDMA) for intra-cluster communication and FDMA (Frequency Division Multiple Access) for inter-cluster communication. IDS (Iterative Deepening Search) based Scheduling algorithm is used for assigning time slot and frequency slot to nodes. Nodes in EEHMAC follow the periodic duty cycle, which reduces the idle listening, and overhearing problems. Simulation results reveal that an average of 18% energy saving is achieved compared to LEACH (Low Energy Adaptive Clustered Hierarchy) protocol and 10% energy is saved in comparison with GH-MAC (Graph theory based Hybrid MAC) protocol. It is evident that delay of EEHMAC is reduced by 17% and throughput is increased by 15% under all traffic conditions. These results demonstrate that EEHMAC performs better than existing MAC protocols in terms of energy efficiency, delay and throughput.
 
</p></abstract><kwd-group><kwd>Channel Allocation</kwd><kwd> Delay Systems</kwd><kwd> Energy</kwd><kwd> Lifetime Estimation</kwd><kwd> Throughput</kwd><kwd> Wireless Sensor Network (WSN)</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>A wireless sensor network (WSN) is a collection of a large number of low cost distributed sensor nodes to monitor physical or environmental conditions, such as temperature, sound, pressure, etc. and cooperatively pass their data through the network to a main location i.e., base station. These nodes are usually equipped with limited energy source. In majority of application scenarios, recharging or replacement of batteries are not possible because of its deployment in harsh and remote environment. This makes energy efficiency an important issue to extend the lifetime of sensor nodes. Because of these reasons, nowadays researchers are focusing on the development of energy aware protocols for wireless sensor networks [<xref ref-type="bibr" rid="scirp.68620-ref1">1</xref>] . Major energy consumption is due to the nodes’ radio during their active period [<xref ref-type="bibr" rid="scirp.68620-ref2">2</xref>] . However, node’s radio can be controlled with efficient design of channel access scheme. Hence, the design of MAC protocol plays a vital role in WSN design.</p><p>There are four major sources of energy waste in MAC protocol: collision, idle listening, overhearing and protocol overhead [<xref ref-type="bibr" rid="scirp.68620-ref3">3</xref>] . Various MAC protocols were designed to save lifetime of sensor node by solving these problems. In 802.11 MAC protocol, idle listening consumes 50% to 100% of energy required for receiving [<xref ref-type="bibr" rid="scirp.68620-ref4">4</xref>] . Therefore, idle listening becomes most important factor of energy waste. Periodic wake-up scheduling where the nodes are in sleep mode or low power mode most of the time is the powerful concept used to overcome the idle listening problem. To take advantages of schedule based and contention based protocols, the concept of hybrid MAC protocols was introduced. To save the energy consumption, clustering concept is used in sensor networks. Normally, a single channel access scheme is used for entire sensor network. However, due to the various functions done by cluster head (CH) node and member node the common MAC protocol for both, results in increased energy consumption. The analysis of different MAC protocols was studied in Section 2.</p><p>The rest of the paper is structured as follows: Section 3 emphasizes on the design of proposed EEHMAC protocol and the heuristic method to select the number of clusters. The results are presented in Section 4 following with the conclusion in Section 5.</p></sec><sec id="s2"><title>2. Related Works</title><p>Energy management is an important research area in the sensor networks. S-MAC [<xref ref-type="bibr" rid="scirp.68620-ref4">4</xref>] and T-MAC [<xref ref-type="bibr" rid="scirp.68620-ref5">5</xref>] are the low duty cycle protocols proposed for maximum energy efficiency. In these protocols, energy efficiency is achieved by reducing idle listening. S-MAC uses periodical sleep to reduce energy consumption due to idle listening and uses message passing approach to delay. In T-MAC, the energy efficiency of S-MAC is improved by 50% - 80% with adaptive wakeup scheduling. However, these protocols have the problem of asymmetric communication patterns. In [<xref ref-type="bibr" rid="scirp.68620-ref6">6</xref>] , different wakeup scheduling is analyzed and method to increase energy efficiency is proposed. Here, multi-parent scheme that assigns multiple forwarding nodes to each node with different wakeup schedule is used. It increased the lifetime of sensor nodes from 40 months to 65 months without degrading the guaranteed delay performance. However, interference free scheduling is not provided in this method. ML-MAC [<xref ref-type="bibr" rid="scirp.68620-ref7">7</xref>] is a distributed contention-based MAC protocol designed for wireless sensor networks that uses periodic listen and sleep concept. ML-MAC divides the active period into L non-overlapping layers and nodes in each layer follows periodic listen/sleep schedule. Due to the short listening time of sensor nodes in ML-MAC, the energy consumption of data transmission is reduced to greater extend. Here, the idle listening time is reduced by the factor of number of layers used. However, delay is increased in this protocol due to the increased waiting time.</p><p>One palpable approach is to use either TDMA or FDMA for interference free scheduling. Nevertheless, TDMA has many other disadvantages [<xref ref-type="bibr" rid="scirp.68620-ref8">8</xref>] like clock synchronization, handling of dynamic topological changes, collision free scheduling etc. The multi channel MAC protocols have disadvantages like broadcast support, network partitioning, channel switching etc. as listed in [<xref ref-type="bibr" rid="scirp.68620-ref9">9</xref>] . HyMAC [<xref ref-type="bibr" rid="scirp.68620-ref10">10</xref>] is a hybrid TDMA/FDMA protocol suitable for WSN applications, designed to provide high throughput and small bounded end-to-end delay. It achieved higher throughput by using simultaneous data transmission with multiple frequencies. However, this protocol always works in the hybrid mode leads to increased energy consumption under low load conditions. Z-MAC [<xref ref-type="bibr" rid="scirp.68620-ref11">11</xref>] is another hybrid MAC protocol, which combines the strength of CSMA and TDMA for better energy efficiency and improved channel utilization. The main feature of Z?MAC is its adaptability to different contention levels of network. However, this protocol is suffered by synchronization problem and not suitable for cluster based sensor networks.</p><p>In energy efficient hybrid MAC protocol for cluster based network [<xref ref-type="bibr" rid="scirp.68620-ref12">12</xref>] , the BMA (Bit Map Assisted) protocol is used for intra cluster communication and nanoMAC protocol is used for inter cluster communication. 25% energy reduction is achieved by using BMA and 40% energy consumption is reduced with nanoMAC. GH-MAC [<xref ref-type="bibr" rid="scirp.68620-ref13">13</xref>] is another hybrid MAC protocol designed for cluster based sensor networks to increase the lifetime and to decrease delay. In this protocol, G-ETDMA (Game theory based energy efficient TDMA) and G-nanoMAC (Game theory based nanoMAC) are used for intra-cluster communication and inter-cluster communication respectively. By using repeated game concept, the energy consumption is estimated in GH-MAC for various load conditions. Compared to E-TDMA, 22% energy consumption is reduced in G-ETDMA due to the avoidance of idle listening. Compared to nanoMAC, 1.6 times less energy is consumed in G-nanoMAC. However, the delay performance is not improved in theses protocols for various traffic loads.</p><p>To solve this issue, an energy efficient hybrid MAC protocol (EEHMAC) that considers the characteristics of sensor node is proposed in this paper. The proposed EEHMAC uses TDMA for intra-cluster communication since the member nodes required to transmit minimum data for short duration. Since CH nodes are required to transmit maximum data for long duration, FDMA is used for inter-cluster communication. To avoid inter channel interference, the number of frequencies is limited to number of clusters and frequency reuse concept is utilized in the proposed protocol. A heuristic method is used to select the optimum number of clusters for varying network density. With the help of simultaneous data transmission, delay of sensor node is reduced to greater extend and energy efficiency is improved. The performance of proposed EEHMAC protocol is estimated in terms of energy efficiency, delay and throughput.</p></sec><sec id="s3"><title>3. EEHMAC Protocol</title><p>The main goal of EEHMAC protocol is to reduce energy consumption and delay, while increasing throughput. By combining the advantages of TDMA and FDMA, the proposed protocol achieves better energy efficiency compared to LEACH and GH-MAC. This protocol is suitable for applications in which data gathered by sensor nodes are delivered to destination in a timely manner.</p><sec id="s3_1"><title>3.1. System Model</title><p>In a cluster based wireless sensor network two types of communication involves namely inter-cluster and intra- cluster communication. Nodes sense the environment and transmit data to the Cluster Head (CH) during intra- cluster communication and CH communicates to the base station and other CH during inter-cluster communication. In intra-cluster communication, the amount of data transmitted is limited but the contention is more. Therefore, the active period is divided into “S” number of slots and is assigned to all users using TDMA approach. In inter-cluster communication, cluster head transmits more data, which is collected from its member nodes. Therefore, the entire active period is given to the CH nodes with “N” different frequencies using FDMA concept. The system model of proposed protocol is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. The duty cycle member node in EEHMAC for intra-cluster communication is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>(a). The active period comprises of multiple time slots that are assigned to member nodes. <xref ref-type="fig" rid="fig2">Figure 2</xref>(b) shows the duty cycle of CH node during inter-cluster communication. Here, the active period is divided with respect to frequency and each CH is assigned with one frequency slot.</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> System model</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x7.png"/></fig><fig-group id="fig2"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> (a) Duty cycle of a CH Intra-cluster communication; (b) Duty cycle of CH in inter-cluster communication.</title></caption><fig id ="fig2_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x8.png"/></fig></fig-group></sec><sec id="s3_2"><title>3.2. Hybrid MAC Protocol</title><p>The hybrid MAC protocol is organized into rounds and each round is subdivided into setup phase and steady state phase. During the setup phase, CH is selected based on the energy level and the selected CH will broadcast the advertisement message. The nodes that can reach the cluster head with minimum energy will join in that cluster. After forming the cluster, CH will assign the TDMA slot and forward it to the member nodes. Then the system enters into the steady state phase. During the assigned time slot, the node will be in the active state and goes to sleep state otherwise.</p><p>Based on the advertisement message broadcasted by the CH, sink will assign the frequency slot to the CH and broadcast during the cluster setup phase. The frame structure of hybrid MAC is shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>. The frame is divided into three fields. The node status field is used to carry the information about node status (i.e.) whether the node has sensed data for transmission or not. If the node does not have data, then the CH will assign the time slot to other nodes that have data. During intra-cluster communication filed, the time is divided into number of time slots and is assigned to member nodes. During the active state if the node does not have data to transmit/receive then immediately it goes to sleep state. Thus, the designed EEHMAC protocol reduces idle listening and overhearing problems of MAC protocol. In the inter-cluster communication field, the entire period is used by the CH for data transmission with different frequencies.</p></sec><sec id="s3_3"><title>3.3. Time Slot and Frequency Slot Assignment</title><p>The network is using ISM band. The entire bandwidth (2.4 GHz) is divided into two parts in the ratio of 1:3. Lower part of the bandwidth is 0.8 GHz and is used for intra-cluster communication. Upper part of the bandwidth is 1.6 GHz and is used for inter-cluster communication. The network is modeled as a graph G = (V, E), in which V is the set of nodes and E represents the link between the nodes. If the nodes i and j are in the communication range then there exists (i, j) ϵ E and (j, i) ϵ E. Based on the relationship between scheduling algorithm and graph theory, NP-hard coloring problem can be used to assign the time slots to the nodes [<xref ref-type="bibr" rid="scirp.68620-ref14">14</xref>] . Slot assigned to one node should not conflict with its one-hop and two-hop neighbor. Therefore, all nodes can transmit/re- ceive data from its neighbors without conflict. A time slot T<sub>k</sub> can be assigned to node i if T<sub>k</sub> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/20-7600643x9.png" xlink:type="simple"/></inline-formula> T (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/20-7600643x10.png" xlink:type="simple"/></inline-formula>)<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/20-7600643x11.png" xlink:type="simple"/></inline-formula>T (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/20-7600643x12.png" xlink:type="simple"/></inline-formula>). Here T (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/20-7600643x13.png" xlink:type="simple"/></inline-formula>) and T (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/20-7600643x14.png" xlink:type="simple"/></inline-formula>) represents the time slot assigned to node i’s one-hop and two-hop neighbors respectively.</p><p>Here the IDS (Iterative Deepening Search) algorithm is used for slot assignment. It combines the space efficiency of Depth First Search (DFS) with the optimality of Breath First Search (BFS) algorithm. For node time slot assignment the scheduling algorithm performs the IDS constructing a tree having cluster head as its root. As each node, i is traversed by IDS, it is assigned a default time slot. For frequency slot assignment the scheduling algorithm performs IDS constructing sink node as its root. <xref ref-type="fig" rid="fig4">Figure 4</xref> shows the operation of scheduling algorithm. In this, f1, f2 and f3 shows assigned frequency slots of cluster head nodes while the t1, t2 and t3 shows the time slots assigned to member nodes. Note that such an assignment allows the nodes to transmit data packets without any collision. Frequency assigned for one CH is not assigned for another CH. Therefore, it is mandatory to determine the number of frequencies required for inter-cluster communication. To avoid collision in frequency</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Frame structure of Hybrid MAC</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x15.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Operation of scheduling algorithm</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x16.png"/></fig><p>slots, one CH is assigned with one frequency. Therefore, the optimum number of clusters in the network will decide the number of frequencies required.</p></sec><sec id="s3_4"><title>3.4. Optimum Number of Frequencies</title><p>A simple model, in which the transmitter dissipates energy to run radio electronics and the power amplifier and the receiver dissipates energy to run radio electronics is considered [<xref ref-type="bibr" rid="scirp.68620-ref15">15</xref>] for calculation of optimum number of frequencies required. <xref ref-type="fig" rid="fig5">Figure 5</xref> describes the energy dissipation model of sensor node radio.</p><p>In the data collection process, first the node will send data to the cluster head and from there the data is forwarded to sink node. Therefore, the total energy spent for data transmission is calculated by combining the energy consumed by member node and by head node.</p><disp-formula id="scirp.68620-formula2"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x17.png"  xlink:type="simple"/></disp-formula><p>Energy spent by the member node to transmit a packet of m bits to its head node of distance d is given by</p><disp-formula id="scirp.68620-formula3"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x18.png"  xlink:type="simple"/></disp-formula><p>where E<sub>elec</sub> is the energy depleted per bit to operate the transceiver circuit, E<sub>ra</sub><sub> </sub>is the radio amplifier energy. Apparently, the distance between the member node and its c luster head is less than the crossover distance, so the energy dissipation follows the Friss free space model (i.e.) d<sup>2</sup> power loss. The network consists of N nodes distributed uniformly in an M &#180; M region. Network is divided into k number of circle clusters and the distance from head node to member node is given by</p><disp-formula id="scirp.68620-formula4"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x19.png"  xlink:type="simple"/></disp-formula><p>The total energy spent by the member node is given by</p><disp-formula id="scirp.68620-formula5"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x20.png"  xlink:type="simple"/></disp-formula><p>Each cluster head will dissipates energy by receiving data from member nodes, by data aggregation and by transmitting the aggregated data to sink node. Thus, the energy spent by the head node during single frame is given by,</p><disp-formula id="scirp.68620-formula6"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x21.png"  xlink:type="simple"/></disp-formula><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Radio energy dissipation model</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x22.png"/></fig><p>In this case, the distance from cluster head node to base station is greater than the cross over distance. Therefore, energy dissipation follows the two-ray ground model (i.e.) d<sup>4</sup> power loss.</p><disp-formula id="scirp.68620-formula7"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x23.png"  xlink:type="simple"/></disp-formula><p>where E<sub>da</sub> is the data aggregation energy and E<sub>TRA</sub> is the transmitter amplifier energy. The total energy spent by the cluster is given by</p><disp-formula id="scirp.68620-formula8"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x24.png"  xlink:type="simple"/></disp-formula><p>By substituting the Equation (6) and Equation (4) in Equation (7), we get</p><disp-formula id="scirp.68620-formula9"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x25.png"  xlink:type="simple"/></disp-formula><p>The total energy consumed by the network is given by</p><disp-formula id="scirp.68620-formula10"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x26.png"  xlink:type="simple"/></disp-formula><p>We can find the optimum number of frequencies by calculating optimum number of clusters. This can be done by setting the derivative of total energy with respect to k to zero.</p><disp-formula id="scirp.68620-formula11"><graphic  xlink:href="http://html.scirp.org/file/20-7600643x27.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.68620-formula12"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x28.png"  xlink:type="simple"/></disp-formula><p>By using the Equation (10), the number of frequencies (clusters) required is calculated. If the optimum number of clusters is increased then the energy consumed by the network will be reduced and thereby increasing lifetime of network.</p></sec><sec id="s3_5"><title>3.5. Energy and Delay Analysis</title><p>Equation (9) defines the energy consumed by the network in a single frame and the total energy consumption is given by Equation (11).</p><disp-formula id="scirp.68620-formula13"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x29.png"  xlink:type="simple"/></disp-formula><p>where N<sub>f</sub> represents the number of frames. In sensor networks, data collection is a time-sensitive function. Therefore, it is important to receive the data in a timely manner. Here, delay is defined as the time taken to transmit the data successfully. In intra-cluster communication, the member node has to wait for node status information and then only it can transmit the data. Therefore, the delay for intra-cluster communication is given by,</p><disp-formula id="scirp.68620-formula14"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x30.png"  xlink:type="simple"/></disp-formula><p>During inter-cluster communication, the CH will transmit the data after collecting it from the member nodes. So, the delay for inter-cluster communication is given by,</p><disp-formula id="scirp.68620-formula15"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/20-7600643x31.png"  xlink:type="simple"/></disp-formula><p>where t<sub>s</sub>, t<sub>r</sub> and t<sub>ag</sub> represents time taken for node status information, data reception and data aggregation respectively. Distance from member node to CH node is smaller than the distance between CH node and base station. Therefore, different timings are used like t<sub>dCH</sub> and t<sub>dBS</sub><sub>. </sub></p></sec></sec><sec id="s4"><title>4. Performance Evaluation</title><p>This section evaluates the energy consumption, end-to-end delay and throughput for various schemes using MATLAB simulation tool. Since LEACH is the basic protocol developed for cluster based networks, the performance of EEHMAC is compared with it. GH-MAC is cluster based MAC protocol that uses adaptive MAC scheme for inter and intra-cluster communication. Therefore, the results of EEHMAC are compared with GH-MAC also. The parameters used for simulation are given in <xref ref-type="table" rid="table1">Table 1</xref>. Simulation is carried out for 1000 s. Random distribution of 100-node network is shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>.</p><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Random distribution of 100-node Network</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x32.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Simulation parameters</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Parameters</th><th align="center" valign="middle" >Values</th></tr></thead><tr><td align="center" valign="middle" >No. of nodes (N)</td><td align="center" valign="middle" >100 - 1000</td></tr><tr><td align="center" valign="middle" >Topology</td><td align="center" valign="middle" >Uniform, Random</td></tr><tr><td align="center" valign="middle" >Size</td><td align="center" valign="middle" >100 &#215; 100</td></tr><tr><td align="center" valign="middle" >Distance to base station</td><td align="center" valign="middle" >100m - 250 m</td></tr><tr><td align="center" valign="middle" >Number of frequencies</td><td align="center" valign="middle" >1 - 14</td></tr><tr><td align="center" valign="middle" >Eda</td><td align="center" valign="middle" >5 nJ/bit</td></tr><tr><td align="center" valign="middle" >Packet size (m)</td><td align="center" valign="middle" >500 bytes</td></tr><tr><td align="center" valign="middle" >Eelec</td><td align="center" valign="middle" >50 nJ/bit</td></tr><tr><td align="center" valign="middle" >Efs</td><td align="center" valign="middle" >10 pJ/bit</td></tr><tr><td align="center" valign="middle" >E<sub>TRA </sub></td><td align="center" valign="middle" >0.0013 pJ/bit</td></tr></tbody></table></table-wrap><sec id="s4_1"><title>4.1. Optimum Number of Clusters</title><p>Since the number of frequencies used in the proposed system depends on the number of clusters in the network, the optimum number of clusters required is calculated and compared with conventional cluster based protocol LEACH. Simulation is run by varying network density from 100 to 1000 and the results are shown in <xref ref-type="fig" rid="fig7">Figure 7</xref>. From <xref ref-type="fig" rid="fig7">Figure 7</xref>, it is evident that, proposed protocol uses less number of clusters compared to existing protocol. If number of clusters is increased then the inter-cluster energy required to transmit data to the base station will be increased. Thus, in proposed EEHMAC protocol, the inter-cluster energy is reduced by reducing number of clusters. For 1000 nodes, EEHMAC uses 7 clusters whereas LEACH uses 11 clusters. Thus by using proposed protocol, we can save network lifetime about 10% - 15%. By varying the distance between node and base station, the optimum number of clusters required for the EEHMAC protocol is calculated and is shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>. If the distance is increased then the number of clusters required for effective communication is reduced. For a distance of 100 m the maximum number of clusters used in the proposed system is 5 when the network density is 500.</p><p>An average energy spent by the nodes for different number of clusters is calculated for EEHMAC and <xref ref-type="fig" rid="fig9">Figure 9</xref> shows the results in comparison with LEACH protocol. Energy consumption is reduced for increase in number</p><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Optimum number of clusters for various network densities</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x33.png"/></fig><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Optimum number of clusters for various base station distance</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x34.png"/></fig><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Average energy consumption for various number of clusters</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x35.png"/></fig><p>of clusters and increased if the number of clusters exceeded the optimum value. If numbers of clusters are less than the optimum size then more number of member nodes has to transmit data for long distance to reach CH node. This results in depletion of node’s energy. When the numbers of clusters are more than optimum value, then the number of transmissions done by the CH to the base station is greater than data aggregation process and leads to increased energy consumption. The result shown in <xref ref-type="fig" rid="fig9">Figure 9</xref> demonstrates that optimum number of clusters should be 4 to 5 for energy efficient operation in 100-node network. In this case, EEHMAC saves energy up to 7% than LEACH. In worst case, when the number of clusters are more than optimum size EEHMAC reduces the energy consumption by 10%. These results prove that lifetime of sensor network is increased by an average of 7% in EEHMAC compared to LEACH.</p><p>For the network having 1000 nodes, total energy consumed by the EEHMAC protocol is calculated by varying the number of frequency slots, and the result is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>0. This graph shows that the total energy consumption is reduced in EEHMAC if more number of frequencies is used. Since, multiple CH transmit data simultaneously using different frequencies, the possibility of collision is reduced. This results in reduced energy consumption. However, in the proposed protocol to reduce the inter channel interference the numbers of frequency slots used are limited to optimum value of number of clusters. For 1000 node network, the optimum number of clusters is 14 and is equal to number of frequency slots.</p></sec><sec id="s4_2"><title>4.2. Energy Analysis</title><p><xref ref-type="fig" rid="fig1">Figure 1</xref>2 shows the frame energy for LEACH, GHMAC and EEHMAC protocols. It is observed that frame energy consumption for proposed protocol is lesser than that of existing protocols. In GHMAC for inter-cluster communication each time the CH node has to do CSMA, leads to additional overhead and increased energy consumption. Whereas the usage of fixed frequency slots for inter-cluster communication in EEHMAC reduced</p><fig id="fig10"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>0</label><caption><title> Energy consumption for different frequency slots</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x36.png"/></fig><fig id="fig11"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>1</label><caption><title> Energy consumption for various network densities</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x37.png"/></fig><fig id="fig12"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>2</label><caption><title> Frame energy for various protocols</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x38.png"/></fig><p>the protocol overhead and results in reduced energy consumption. The proposed EEHMAC protocol reduced the frame energy for k clusters by 23.6% and 12.5% in comparison with LEACH and GHMAC. For CH nodes, the energy consumption is reduced by 20% than GHMAC. Thus, these results demonstrate that EEHMAC performs better than LEACH and GHMAC in terms of energy efficiency under various load conditions.</p></sec><sec id="s4_3"><title>4.3. Delay Analysis</title><p>In this section, we first study the end-to-end (E2E) delay for both GHMAC and EEHMAC while the traffic load is varied from 0.1 to one erlangs. As clearly seen from <xref ref-type="fig" rid="fig1">Figure 1</xref>3 and <xref ref-type="fig" rid="fig1">Figure 1</xref>4, EEHMAC has a smaller delay than GHMAC under all traffic conditions. For increased traffic load, the delay is gradually increased in LEACH and GHMAC. Using CSMA, the probability of getting channel access is reduced in GHMAC due to more number of contenders during maximum traffic load. However in EEHMAC, inter cluster communication is carried out using fixed frequency slots that are assigned during the cluster formation phase. Therefore, the CH node need not wait for the free channel, and thereby decreasing the delay incurred. For example, EEHMAC reduces E2E delay by 19% compared with GHMAC when the number of nodes is 900. Thus, it can be observed that the EEHMAC performance is better than GHMAC in terms of end-to-end delay for all traffic load conditions.</p></sec><sec id="s4_4"><title>4.4. Throughput Analysis</title><p><xref ref-type="fig" rid="fig1">Figure 1</xref>5 shows the throughput performance comparison of EEHMAC protocol with LEACH and GHMAC</p><fig id="fig13"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>3</label><caption><title> Normalized delay for various traffic load</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x39.png"/></fig><fig id="fig14"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>4</label><caption><title> E2E delay Vs density</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x40.png"/></fig><fig id="fig15"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>5</label><caption><title> Throughput of different MAC protocols</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/20-7600643x41.png"/></fig><p>protocols for various traffic load when the distance is constant and topology is the same. Compared to LEACH, EEHMAC improved the throughput of network by 56% and 14% improvement with GH-MAC. This is due to the collision free characteristics of hybrid EEHMAC protocol. However, the probability of collision is increased in GHMAC if numbers of nodes are increased. This results in reduced throughput of GHMAC. Thus, from the figure it is evident that the best MAC protocol in terms of throughput is EEHMAC than LEACH and GHMAC.</p></sec></sec><sec id="s5"><title>5. Conclusions</title><p>In this paper, we introduced EEHMAC, an energy efficient hybrid MAC protocol for cluster based wireless sensor networks. EEHMAC allows member nodes of cluster to use TDMA and FDMA for CH nodes. Scheduling mechanism embedded in the MAC protocol helps to achieve this. This scheduling mechanism not only assigns the channel, but also reduces collision problem and thereby achieved the lifetime extension of sensor nodes. The number of frequency slots is limited to number of clusters. By selecting optimum number of clusters for energy efficient operation and by combining TDMA and FDMA techniques for channel accessing, EEHMAC becomes more energy efficient, more robust to topological changes and fairer in resource allocation. It gracefully adapts to network density and improves energy efficiency as well as throughput.</p><p>The performances of overall MAC scheme evaluated through simulation have shown a significant improvement in energy efficiency by 56.3% and 45.23% compared to LEACH and GHMAC respectively. In comparison with GHMAC, 67.8% throughput is improved in EEHMAC due to its collision free nature. EEHMAC achieved 19% reduction in end-to-end delay in comparison with GHMAC.</p><p>In future, we aim to achieve further enhancement over EEHMAC through the proposal of a more dynamic and efficient mechanism for transmission power control. We also look forward to implement it over test bed to validate the simulation results provided here.</p></sec><sec id="s6"><title>Cite this paper</title><p>B. Priya,S. Solai Manohar, (2016) Lifetime Enhancement of Cluster Based Wireless Sensor Network through Energy Efficient MAC Protocol. Circuits and Systems,07,2296-2308. doi: 10.4236/cs.2016.79200</p></sec><sec id="s7"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.68620-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Mehta, S. and Kwak, K.S. (2007) H-MAC: A Hybrid MAC Protocol for Wireless Sensor Networks. Proceedings of International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC’07), Busan, 8-11 June 2007, 705-706.</mixed-citation></ref><ref id="scirp.68620-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Bachir, A., Dohler, M., Watteyne, T. and Leung, K.K. (2010) MAC Essentials for Wireless Sensor Networks. IEEE Communication Surveys and Tutorials, 12, 222-248. http://dx.doi.org/10.1109/SURV.2010.020510.00058</mixed-citation></ref><ref id="scirp.68620-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Karl, H. and Willig, A. (2005) Protocols and Architectures for Wireless Sensor Networks. Wiley &amp; Sons Ltd., Chichester. http://dx.doi.org/10.1002/0470095121</mixed-citation></ref><ref id="scirp.68620-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Ye, W., Heidemann, J. and Estrin, D. (2002) An Energy-Efficient MAC Protocol for Wireless Sensor Networks. Proceedings of 21st Annual Joint Conference of the IEEE Computer and Communications Societies, New York, 23-27 June 2002, 1567-1576. http://dx.doi.org/10.1109/INFCOM.2002.1019408</mixed-citation></ref><ref id="scirp.68620-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Van Dam, T. and Langendoen, K. (2003) An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks. Proceedings of 1st International Conference on Embedded Networked Sensor Systems, Los Angeles, 5-7 November 2003, 171-180. http://dx.doi.org/10.1145/958491.958512</mixed-citation></ref><ref id="scirp.68620-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Keshavarzian, A., Lee, H. and Venkatraman, L. (2006) Wakeup Scheduling in Wireless Sensor Networks. Proceedings of 7th ACM International Symposium on Mobile Ad-Hoc Networking and computing, Florence, 22-25 May 2006, 322- 333. http://dx.doi.org/10.1145/1132905.1132941</mixed-citation></ref><ref id="scirp.68620-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Jha, M.K., Pandey, A.K., Pal, D. and Mohan, A. (2011) An Energy-Efficient Multi-Layer MAC (ML-MAC) Protocol for Wireless Sensor Networks. AEU-International Journal of Electronics and Communications, 65, 209-216. http://dx.doi.org/10.1016/j.aeue.2010.03.006</mixed-citation></ref><ref id="scirp.68620-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Ye, W., Heidemann, J. and Estrin, D. (2004) Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks. IEEE/ACM Transactions on Networking, 12, 493-506. http://dx.doi.org/10.1109/TNET.2004.828953</mixed-citation></ref><ref id="scirp.68620-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Incel, O.D., Van Hoesel, L., Jansen, P. and Havinga, P. (2011) MC-LMAC: A Multi-Channel MAC Protocol for Wireless Sensor Network. Ad Hoc Networks, 9, 73-94. http://dx.doi.org/10.1016/j.adhoc.2010.05.003</mixed-citation></ref><ref id="scirp.68620-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Salajegheh, M., Soroush, H. and Kalis, A. (2007) HYMAC: Hybrid TDMA/FDMA Medium Access Control Protocol for Wireless Sensor Networks. Proceedings of 18th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Athens, 3-7 September 2007, 1-5. http://dx.doi.org/10.1109/pimrc.2007.4394374</mixed-citation></ref><ref id="scirp.68620-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Rhee, I., Warrier, A., Aia, M., Min, J. and Sichitiu, ML. (2008) Z-MAC: A Hybrid MAC for Wireless Sensor Networks. IEEE/ACM Transactions on Networking, 16, 511-524. http://dx.doi.org/10.1109/TNET.2007.900704</mixed-citation></ref><ref id="scirp.68620-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Vidhya, J., Kalpana, G, and Dananjayan, P. (2009) Energy Efficient Hybrid MAC Protocol for Cluster–Based Wireless Sensor Network. International Journal of Computer and Electrical Engineering, 1, 1793-8198. http://dx.doi.org/10.7763/ijcee.2009.v1.41</mixed-citation></ref><ref id="scirp.68620-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Raja, P. and Dananjayan, P. (2014) Game Theory Based Energy Efficient Hybrid MAC Protocol for Lifetime Enhancement of Wireless Sensor Network. Iranian Journal of Electrical &amp; Electronic Engineering, 10, 10-17.</mixed-citation></ref><ref id="scirp.68620-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Kang, H., Zhao, Y.N. and Mei, F. (2013) A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks. Wireless Personal Communications, 72, 1005-1022. http://dx.doi.org/10.1007/s11277-013-1052-9</mixed-citation></ref><ref id="scirp.68620-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Heinzelman, W. (2000) Application-Specific Protocol Architectures for Wireless Networks. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA.</mixed-citation></ref></ref-list></back></article>