gateway based stable election multi hop routing protocol for wireless sensor … · 2015-10-06 ·...

International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.5,October 2014

DOI : 10.5121/ijmnct.2014.4502

GATEWAY BASED STABLE ELECTION

MULTI HOP ROUTING PROTOCOL FOR

WIRELESS SENSOR NETWORKS

Pallavi Jain1, Harminder kaur2

M.Tech Research Scholar1, Assistant Professor2

1,2 Guru Nanak Dev Engineering College Ludhaiana, Punjab India

ABSTRACT

A gateway based energy efficient multi hop routing protocol for wireless sensor networks (WSNs) is

introduced. The main aim of our paper is to design a protocol which minimizes energy consumption.

Gateway nodes are deployed in sensing field. These gateway

also reduce distance for reliable transmission of data.

based protocol is better in terms of network lifetime

protocol like SEP which is single hop

KEYWORDS

Wireless Sensor Networks, SEP, Clustering

1. INTRODUCTION

A wireless sensor network consists of hundreds and thousands of micro sensors nodes. These are

designed to sense data, transmit it to user

processor, Base Station (BS). Sensor nodes are basic component of WSNs. These are small in

size, portable and light weight; the sensor nodes required sending data to BS. Ano

BS is another main component that collects all the data from different nodes.

Classical approaches like direct Transmission used to send data from sensor nodes directly to BS

and in Minimum Transmission Energy (MTE) nodes near BS has higher probability to send data

than nodes which are located far away from BS. Therefore, need to

clustering. In clustering, number of sensor nodes select a Cluster Head (CH) on the basis of





Pallavi Jain1, Harminder kaur2

M.Tech Research Scholar1, Assistant Professor2




Gateway nodes are deployed in sensing field. These gateway nodes are rechargeable, reduce traffic and

distance for reliable transmission of data. Simulation results show that our proposed gateway

based protocol is better in terms of network lifetime, stability period, throughput etc; than

which is single hop.

Clustering, Gateway Nodes, Lifetime, Throughput, Energy.


to sense data, transmit it to user. The main components of WSN are: Sensor nodes,


size, portable and light weight; the sensor nodes required sending data to BS. Another component

BS is another main component that collects all the data from different nodes.

Figure 1: A Typical Wireless Sensor Network



than nodes which are located far away from BS. Therefore, need to introduce concept of

lustering. In clustering, number of sensor nodes select a Cluster Head (CH) on the basis of


19







nodes are rechargeable, reduce traffic and

that our proposed gateway

than traditional


The main components of WSN are: Sensor nodes,


ther component



introduce concept of

lustering. In clustering, number of sensor nodes select a Cluster Head (CH) on the basis of initial


20

or residual energy, and then cluster the remaining nodes with these heads. Sensor nodes transmit

data to CH; the main function of CH is to aggregate data of sensor nodes and transmits it to BS

[10]. Sensor networks can be classified as Homogeneous protocols and heterogeneous protocols.

Example of Homogeneous protocol is LEACH (Low Energy Adaptive Clustering Hierarchy. It is

very basic protocol in which concept of clustering is used. In LEACH, nodes are distributed

randomly having same energy. Therefore, need to introduce concept of heterogeneity which

increases lifetime of the network by dividing energy on some parameters, here SEP (Stable

Election Protocol) is introduced. In SEP, nodes are divided as normal node and advanced node

having different energy levels. Now, it becomes easy to choose CH, mainly advanced nodes

become CH according to random number when compared with threshold values.

We propose a new gateway based SEP protocol, G-SEP, which increases network lifetime i.e.

stability period, throughput and data transmission from nodes to CH as well as to BS. The

proposed protocol senses that election probabilities are weighted on initial energy of node relative

to that of other nodes in the network. In our proposed protocol, rechargeable gateway nodes are

used which are placed at the edge of sensing field and BS is located far away from sensing field.

2. RELATED WORK

In [1], homogeneous clustering based LEACH routing protocol for WSNs is introduced. In

LEACH, it uses same energy level for all sensor nodes which are randomly distributed over the

sensing field; then CH is chosen and finally transmits data to BS. This technique shows

improvement over DT, MTE, but need to be more improved.

In [8], heterogeneous clustering based SEP routing protocol is presented. Here, heterogeneity

means different energy levels i.e. normal nodes and advance nodes are considered. The energy of

advance nodes is higher than that of normal nodes. Advance nodes have more probability to

become CH per iteration. Therefore, increases lifetime as compared to LEACH. However,

transmission rate do not show much improvement.

In [10], an extension to SEP is introduced known as Enhanced SEP. In this, three levels of

energies are used: normal nodes, intermediate nodes, advance nodes. Energy of advance nodes is

highest then intermediate nodes then normal nodes. This protocol reduces distance among CHs

and BS which prolongs lifetime of the network and also increases stability period.

In [11], heterogeneity aware hierarchical SEP for WSNs is designed. In HSEP, two energy levels

of nodes are used i.e. normal and advanced nodes and even two types of CH are being elected;

primary CH and secondary CH. Primary CH is being elected from sensor nodes while secondary

is elected from primary CHs i.e. only primary CHs can take part in electing Secondary CH and

transmits data to BS. This protocol outperforms DEEC, ESEP, SEP and LEACH.

In [12], a mobile sink based SEP is introduced. BS is kept mobile at the center trajectory so that

nodes can easily transfer data directly to BS or via CH being elected from weighted election

probabilities. It out performs SEP and LEACH, but mobility of BS is risky in dropping data and

even cost is introduced to manage it.

In [13], gateway nodes are introduced, a gateway node is deployed at the place of BS and BS is

moved out of the sensing field. In this research, energy consumption is reduced by dividing field

into four regions. Region 1 sends data directly to BS, region 2 communicated directly to gateway

node and region 3, 4 uses clustering technique i.e. CHs to transmit data to BS. M-GEAR

outperforms well in terms of stability period, throughput and remaining energy than LEACH.


21

In [17], author proposed a modified energy efficient protocol named as EM-SEP. In the research,

author modified CH selection criteria by balancing energy consumption to increase lifetime of the

network and also to increase stability period of WSN. Even authors worked on the concept if

there is more than one SN available to become CH then it would pick the node having highest

energy. Simulation results showed that EM- SEP performs 5% in terms of stability period and 5%

in lifetime of network than SEP.

In [19] Zonal-Stable Election Protocol (ZSEP) uses the concept of both direct transmission and

clustering. ZSEP divides network field into three zones, zone0, head zone 1, head zone 2, where

in zone 0 which is defined around sink that is close to sink are equipped with only normal nodes,

and zone 1 and zone 2 are at corners or zone which are at distance from sink are equipped with

advanced nodes, as they have more initial energy. Zone 0 nodes uses direct transmission of data

to BS but head zone 1 and head zone 2 uses clustering approach (advance nodes) for data

transmission to sink. Simulation results showed that there is 1.4 times improvement in stability

period as compared to SEP.

In [20] author proposed Energy Consumption Rate based Stable Election Protocol (ECRSEP), in

which CHs are elected on the basis of weighted election probabilities of each node according to

the energy consumption rate (ECR) of each node. In ECRSEP energy consumption is calculated

mathematically as shown in equation 2.1:

ECR = �� (2.1)

Where, e� � is initial energy, e is residual energy of each node and r is current round. In next

round CH is selected on the basis of ECR in previous round so, a CH selected in present round

have less chances to be selected as CH in next round because of more ECR as compared to other

nodes, so a node having high ECR have more chances of becoming cluster head node. Simulation

results showed that ECRSEP performs well in terms of stable region, overall lifetime 3 times and

3.3 times respectively as compared to SEP.

IN [25] fixed zone clustering protocol (FZCP) in which CH is elected on the basis of ratio of

residual energy to its average energy as in DEEC and EDFM. Now, network area is divided into

sub regions. As in other protocols like DEEC, SEP random number is generated and compared

with threshold value, but in FZCP author introduced concept of cost function which is defined as

product of ratio of residual energy to average energy and expected energy consumption to average

energy consumption. Simulation settings and results showed 38% improvement in first dead node

than SEP and 61% in terms of lifetime of the network than SEP.

3. NETWORK MODEL OF PROPOSED PROTOCOL

3.1 Basic Assumptions:

• We deploy the BS far away from the sensing field. Sensor nodes and the BS are stationary

after deployment.

• A gateway node is deployed in the same network field at the edge of the network.

• Gateway nodes are stationary after deployment and rechargeable.

• Each sensor node has distinctive identifier (ID).

• Nodes are uniformly distributed in the network.


22

3.2 First Order Radio Model:

According to the radio energy dissipation model as illustrated in Figure 2, in order to achieve an

acceptable Signal-to-Noise Ratio (SNR) in transmitting an L−bit message over a distance d, the

energy expended by the radio is given by:

Figure 2: Radio Energy Dissipation Model

��, �� . �� . �!, "#� $ �%�. �� &'. �(, "#� ) �% * (1)

Where, �� is the energy dissipated per bit to run the transmitter or the receiver circuit, �� and �&' depends on the transmitter amplifier model, and d is the distance between the sender

and the receiver.

At d=do �% � + �,-�./ (2)

We assume S1 sensors which are deployed randomly in a field to monitor environment. We

represent ith sensor by S1i and consequent sensor node set S1= S11, S12 ….. S1n.

Number of gateway nodes is deployed at the edge of the sensing field. The number of gateway

nodes is chosen approximately according to sensor field area and formation of CHs. Its value is

approx. 16. The major advantage of gateway nodes is they are rechargeable and it also reduces

distance for transmission.

Transmitter

Electronics

Transmitter

Amplifier

L-bit

E�1�2. L �. Ld5

E67�l, dd

Receiver

Electronics

E�1�2. L

E9:�L�

L-bit


23

Figure 3: Network Model of G- SEP

◊ Advanced nodes

○ Normal nodes

× Base Station

* Gateway nodes

3.3 SEP (Stable Election Protocol)

In SEP protocol a percentage of population of sensor nodes is equipped with additional energy

resources, this is a source of heterogeneity. The nodes are randomly distributed over the field and

BS is located far away from sensing field. The advance nodes have higher probability to become

CH than that of normal nodes. CH is being elected on the weighted probabilities of initial energy.

Fractions of nodes ‘m’ are equipped with additional energy factor ‘α’. Now, suppose �; is initial

energy of system, energy of advance node is �; (1+α), then total initial energy is

< = �1 ?@� = �; � < =@ = �; = �1 � A� � < = �;�1 � A@� (3)

Total energy is increased by �1 � A@� times. Now, to optimize stable region, new epoch

is BC/D . �1 � A@� because system has increased by A@.

Probability for normal nodes to become cluster heads once every BC/D . �1 � A@� round

per epoch.

Probability for advance nodes to become cluster heads exactly 1+A times every BC/D . �1 �A@� round per epoch.

To prolong the stable region there is need the constraint of maintaining well balanced

energy consumption, which can be done by defining weighted election probability which

is given in equation 4


24

W = EFGHGI� JF�KLM %� �I�N O%P�EFGHGI� JF�KLM %� O%K&I� O%P� (4)

For normal nodes weighted probability is-

p R � 'C/DS&=T (5)

For advanced nodes weighted probability is-

pUV5 � 'C/DS&=I = �1 � W� (6)

As advanced nodes have α time more initial energy they must have to be cluster head α times

more than normal nodes, which are ensured by these equations. There are different threshold

values for normal and advanced nodes which are given below:

Threshold function for normal nodes-

X�<FK&� � Y 'Z[.�\��]^ =R_V ` ab��]cd , if n � g′ 0 otherwise p (7)

Where r is current round, g’ is set of normal nodes that have not been cluster head in last BZ[.

rounds.

Threshold function for advanced nodes-

X�<IPq� � Y 'rst�\uvwx =R_V y abuvwz{ , if n � g′′ 0 otherwise p (8)

Where r is current round, g’’ is set of advance nodes that have not been cluster head in last Brst rounds.

4. OUR PROPOSED PROTOCOL

In this section, we present detail of our gateway based protocol. The function of CHs is to

aggregate data of sensor nodes and sends it to the base station. In order to improve network

lifetime, we make use of gateway nodes which are deployed at the edge of the sensor field. The

numbers of gateway nodes are selected on the approximation basis of formation of number of

CHs so that each CH can send data to nearest located gateway node. It reduces time consumption.

The main function of gateway nodes is to collect data from CHs, aggregate it and sends to the BS.

The gateway nodes are rechargeable so cost is minimized. Another advantage is in case if one of

gateway node is damaged then it can be overcome by another nearest located gateway node.

Gateway nodes reduces traffic problems as having multiple numbers of gateway nodes so,

distance is also reduced. Sensor nodes which are very closer to gateway nodes can transmit data

directly to gateway node if it is free i.e. not receiving data from CH. The whole process is divided

into three phases: one is to sense data according to requirements; second is election of CH on the

basis of weighted election probabilities of initial energies and comparing threshold values with

random generated number, usually advance nodes take part in this; third is to transmit data from


25

CH to nearest located gateway node by calculating minimum distance to increase stability period

of the network. These gateway nodes aggregates data and transmit it to BS. Equations for

gateway based SEP are:

For gateway based, normal nodes weighted probability is-

p R � 'C/DS&=T (9)

For gateway based, advanced nodes weighted probability is-

pUV5 � 'C/DS&=I = �1 � W1� (10)

5. SIMULATION RESULTS

5.1 Simulation Settings

We simulated our proposed protocol using MATLAB. Consider a WSN with nodes randomly

distributed in 100*100 fields. We compare our proposed protocol with existing SEP protocol.

Table 1: Radio Parameters

Number Of Nodes n 100

Initial Energy �| 0.5 [J]

Packets Sent Message Size 4000 [bits]

Transmitter and Receiver Energy �� 50 [nJ/bit]

Dissipation Energy �~� 5 [nJ /bit/signal]

Free Space Energy �� 10 [pJ /bit/m2]

Multipath Propagation Energy �&' 0.0013 [pJ /bit/m4]

Number of Rounds No. of Iterations 2000

Fraction of Advance Nodes for SEP m 0.3

Fraction of Extra Energy for SEP α 3.5

Fraction of Advance Nodes for

Proposed SEP

m1 0.4

Fraction of Extra Energy for

Proposed Gateway SEP

α1 3


26

5.2 Stability period (FND)

It is the time interval from the start of the network operation until the death of the first node. This

is also referred as “stable region” as shown in Figure 4. This figure depicts that First dead node of

proposed protocol is at 1381 round and for SEP is 1318 i.e. stability period is increased of our

proposed protocol.

Figure 4: First Dead Node

5.3 Number of Half dead nodes per iteration

It is measure the total number of nodes and that of each type that has expended half of their

energy as shown in figure 5. This figure shows that in our gateway based protocol at round 700,

57 nodes are half dead, than they remain constant till round 1700 and at 2000 they are fully dead;

and in SEP there are 70, half dead nodes at round 700. Therefore, number of dead nodes

decreases in our proposed protocol.

Figure 5: Number of Half Dead Node


27

5.4 Number of dead (total, Normal and advanced) nodes per iteration:

This instantaneous measure the total number of nodes and that of each type that has expended all

of their energy as shown in figure 6, 7, 8.

Figure 6 depicts total number of dead nodes it is 57 in case of proposed protocol and 70 in SEP.

Figure 7 depicts those Number of Normal dead nodes: all the normal nodes are dead in both the

cases.

Figure 8 depicts those Number of Advance dead nodes: there is no advance node dies.

Figure 6: Number of Dead Nodes


28

Figure 7: Number of Normal Dead Nodes Figure 8: Number of Advanced Dead Nodes

5.5 Number of alive (total, Normal and advanced) nodes per iteration:

The total number of nodes and that of each type that has not yet expended all of their energy as

showed below in figure 9, 10, 11.

Figure 9 depicts number of alive nodes it is 43 in our proposed protocol and 30 in case of SEP.

Figure 10 shows number of Normal alive nodes at round 2000 no normal node is alive, all are

dead.

Figure 11 shows number of advance alive nodes; at round 2000 all advance nodes are alive it is

40 in our proposed protocol and 30 in SEP.


29

Figure 9: Number of Alive Nodes

Figure 10: Number of Normal Alive Nodes Figure 11: Number of Advanced Alive Nodes

5.6 Data Packets to Cluster Heads:

The result for amount of data transmitted by nodes to their respective cluster heads is shown in

figure 12. Figure depicts rate of data transmitted to CH in our Gateway based protocol is much

higher as compared to SEP as shown in figure at round 2000, 35% of data is transmitted while

traditionally only 20% is sent.


30

Figure 12: Number of packets sent to CH

5.7 Data Packets to Base Station:

The result for amount of data transmitted by cluster heads to base station is shown in figure 13.

Figure depicts rate of data transmitted to BS in our Gateway based protocol is much higher as

compared to SEP as shown in figure at round 2000, 22% of data is transmitted while traditionally

only 12% is sent.

Figure 13: Number of packets sent to BS


31

5.8 SEP Throughput:

It is defined as total rate of data sent over the network i.e. it is rate of data sent from sensor nodes

to their CHs and CHs to BS. Throughput of G-SEP and Sep is shown in figure 14 which depicts

that throughput of Proposed protocol is much higher than that of SEP.

Figure 14: Throughput of SEP

Table 2: Simulation Results

Operation SEP Proposed Protocol

First Node Dies 1318 1381

Number of Dead Nodes 70 57

Number of Normal dead nodes 70 57

Number of Advanced dead nodes 0 0

Number of Alive Nodes 30 43

Number of Normal alive nodes 0 0

Number of Advanced alive nodes 30 40


32

6. CONCLUSION AND FUTURE SCOPE

A gateway based network model in order to minimize energy consumption of sensor network is

designed. In this research, numbers of gateway nodes are located at the edge of sensing field area.

The base station is located away from the sensing field. This technique encourages better

transmission of data which further increases lifetime of the network. Simulation results are

computed in MATLAB and check for the efficiency of our proposed protocol. Simulation results

show that our proposed protocol performs well in term of stability period, network lifetime,

packets sent to BS and CHs, throughput than existing Stable election Protocol. This proposed

protocol can be extended by considering residual energy in formation of CHs or can also be

extended by considering intermediate nodes having energy less than advance nodes but more than

normal nodes.

ACKNOWLEDGEMENT

I would like to thank Er. Harminder Kaur to provide me the important material &

guidance to stimulate this protocol.

REFRENCES

[1] W.R. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication

protocol for wireless microsensor networks,” Proceedings of the Hawaii International Conference on

System Sciences, Maui, Hawaii, 2000, pp. 4-7.

[2] M.B. Yassein, A.A. Zoubi, Y. Khamayseh, and W. Mardini, “Improvement on LEACH Protocol of

Wireless Sensor Network (VLEACH),” International Journal of Digital Content Technology and its

Applications, vol. 3, no 2, June 2009.

[3] A.N. Pantazis, A. Nikolidakis, and D.D. Vergados, “Energy-efficient routing protocols in wireless

sensor networks: A survey,” IEEE Communication Survey, vol. 15, no. 2, pp. 551-591, Nov. 2013.

[4] P. Kumar, M.P. Singh, and U.S. Triar, “A review of routing protocols in wireless sensor network,”

International Journal of Engineering Research & Technology, vol. 1, no. 4, pp. 247-641, June 2012.

[5] A. Manjeshwar, A.Q. Zeng, and D.P. Agrawal, “An Analytical Model for Information Retrieval in

Wireless Sensor Networks Using Enhanced APTEEN Protocol,” IEEE Transactions on Parallel and

Distributed Systems, vol. 13, no. 12, Dec. 2002.

[6] D. Kumar, A.C. Trilok, and R.B. Patel, “EEHC: Energy efficient heterogeneous clustered scheme for

wireless sensor networks,” Computer Communications, vol. 32, pp. 662–667, 2009.

[7] O. Younis, and S. Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for

Ad Hoc Sensor Networks,” IEEE Transaction Mobile Computing, vol.3, no. 4, pp. 366-379, 2002.

[8] G. Smaragdakis, I. Matta, and A. Bestavros, “SEP: A stable election protocol for clustered

heterogeneous wireless sensor networks,” in Proceding of the International Workshop on SANPA,

Boston, USA, 2004, pp. 1–11.

[9] S. Tyagi, and N. Kumar, “A systematic review on clustering and routing Techniques based upon

LEACH Protocol for wireless sensor networks,” Journal of Network and Computer Applications, vol.

36, pp. 623-645, May 2013.

[10] F.A. Aderohunmu, D. D. Jeremiah, “An Enhanced Stable Election Protocol (SEP) for Clustered

Heterogeneous WSN,” 2010. [11] A. Khan, N. Javaid, U. Qasim, Z. Lu, and Z. A. Khan, “HSEP: Heterogeneity aware Hierarchical

Stable Election Protocol for WSNs,” Seventh International Conference on Broadband, Wireless

Computing, Communication and Application, Victoria, Canada, 2012, pp. 373-3.

[12] J. Wang, Z. Zhang, J. Shen, F. Xia, and S. Lee, “An Improved Stable Election based Routing Protocol

with Mobile Sink for Wireless Sensor Networks,” IEEE International Conference on Green Computing

and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing,

Beijing, China, 2013, pp. 945-950.


33

[13] Q. Nadeem, M. B. Rasheed, N. Javaid, Z. A. Khan, Y. Maqsood, and A. Din, “M-GEAR: Gateway-

Based Energy-Aware Multi-Hop Routing Protocol for WSNs,” Eighth International Conference on

Broadband, Wireless Computing, Communication and Applications, Compiegne, 2013, pp. 164-169.

[14] A.L. Jamal, and K.E. Ahmed, “Routing techniques in wireless sensor networks: A survey,” IEEE

Wireless Communications, vol. 4, pp. 1536-1284, Dec. 2004.

[15] W.R. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan, “An application-specific protocol

architecture for wireless microsensor networks,” IEEE Transaction on Wireless Communication, vol.

1, no. 4, pp. 660–670, Feb. 2002.

[16] L. Mahajan, and N. Sharma, “Improving the Stable Period of WSN Using Dynamic Stable LEACH

Election Protocol”, Proceedings of IEEE International Conference on Issues and Challenges in

Intelligent Computing Techniques (ICICT), Ghaziabad, India, 2014, pp. 393-400.

[17] A.A. Malluh, M.K. Elleith, Z. Qawaqney, and J.R. Mstafa, “EM-SEP: An Efficient Modified Stable

Election Protocol”, Proceedings of IEEE American Society for Engineering Education (ASEE),

Bridgeport, Connecticut, USA, 2014, pp. 1-7.

[18] S.P. Yamunadevi, T.Vairam, C.Kalaiarasan, and G.Yidya, “Efficient Comparison of Multipath Routing

Protocols in WSN,” International Conference on Computing, Electronics and Electrical Technologies,

Kumaracoil, India, 2012, pp. 807-811.

[19] S. Faisal, N. Javaid, A. Javaid, M.A. Khan, S.H. Bouk, and Z.A. Khan, “Z-SEP: Zonal-Stable Election

Protocol for Wireless Sensor Networks”, Journal of Basic and Applied Scientific Research, vol. 3, 5,

pp. 132-139, 2013.

[20] O. Rehman, N. Javaid, B. Manzoor, A. Iqbal, M. Ishfaq, and A. Hafeez, “Energy Consumption Rate

Based Stable Election Protocol for WSNs”, Journal of Computer Science, vol. 19, 4, pp. 932–937,

2013.

[21] Q. Wang, and I. Balasingham, “Wireless sensor networks: Application centric design”, Journal of

Communications, vol. 2, 5, pp. 134-149, 2010. 5.

[22] A. Kashaf, N. Javaid, Z.A. Khan, and I.A. Khan, I. A., “TSEP– Threshold Sensitive Stable Election

Protocol for WSNs”, Proceedings of IEEE International Conference on Frontiers of Information

Technology (FIT), Islamabad, Pakistan, 2012, pp. 164-168.

[23] A. Khan, N. Javaid, U. Qasim, Z. Lu, and Z.A. Khan, “HSEP: Heterogeneity-Aware Hierarchical

Stable Election Protocol for WSNs”, Proceedings of IEEE International Conference on Broadband and

Wireless Computing, Communication and Applications (BWCCA), Victoria, Canada, 2012, pp. 373-

378.

[24] Y. Lu, D. Zhang, Y. Chen, X. Liu, and P. Zong, “Improvement of LEACH on Wireless Sensor

Networks Based on Balanced Energy Strategy”, Proceedings of IEEE International Conference on

Information and Automation (ICIA), Shenyang, China, 2012, pp. 111-115.

[25] W. Jiojiu, W. Yuanming, and H. yanqi, “FZCP: A Fixed Zone Clustering Protocol Based on Residual

Energy and Nodes Distribution in Heterogeneous Wireless Sensor Networks”, Proceedings of IEEE

International Conference of Wireless Communications, Networking and Mobile Computing (WiCOM),

Wuhan, China, 2011, pp. 1-5.

[26] J. Yick, B. Mukherjee, and D. Ghosal, “Wireless Sensor Network Survey”, Journal of Computer

Networks, vol. 52, no. 12, pp. 2292-2330, 2008.

[27] L. Qing, Q, Zhu, and M. Wang, “Design of Distributed Energy-Efficient Clustering Algorithm for

Heterogeneous Wireless Sensor Networks”, Journal of Computer Communications, vol. 29, no. 4, pp.

2230–2237, 2006.

AUTHORS BIOGRAPHY

Pallavi Jain completed her Bachelors of Technology in Electronics and communication

engineering from GVIET, Banur affiliated to Punjab Technical University, Jalandhar,

Punjab, India in 2012, and completed her Masters of Technology in Electronics and

Communication Engineering from Guru Nanak Dev Engineering College, Ludhiana

affiliated to Punjab Technical University, Jalandhar, Punjab, India in 2014. She yet has

published two papers on wireless sensor networks and one on automization of mobile

communication.

Harminder Kaur is working as an Assistant Professor in India's one of most reputed

Institute Guru Nanak Dev Engineering College Ludhiana, located in Punjab. She had

completed her M.Tech. in communication systems in 2010 and having 3.5 years of

teaching experience. She has published around 10 research papers in international and

national conferences.

gateway based stable election multi hop routing protocol for wireless sensor … · 2015-10-06 ·...

Documents