Professional Documents
Culture Documents
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 1, Ver. VI (Jan Feb. 2015), PP 44-48
www.iosrjournals.org
Abstract: Wireless sensor networks are mainly considered for atmosphere reconnaissance, wherein wireless
sensor nodes collaborate to get their work done. Generally, wireless sensors are battery powered; therefore, it
is crucial for them to efficiently use their battery resources. Most of the existing power-saving protocols
achieve power savings by periodically putting sensor nodes to sleep. Such a regular sleep/awake
mechanism f a i l s to adjust a s e n s o r node s snooze period based on its traffic congestion, thus causing
either inferior power efficacy or higher latency. Furthermore, sensors may be positioned in antagonistic
atmospheres and may thus surprisingly fail. Most power-saving protocols do not promptly react to such
link breakage, resulting in long transmission delays. This paper, proposes a quorum-based medium access
control (QMAC) protocol that enables sensor nodes to snooze longer under light loads. As the flow is towards
the sink node i.e., the next-hop group, is also proposed to reduce transmission latency. Results authenticate
that the planned QMAC hoards more energy and keeps the communication potential low.
Keywords: QMAC, Quorums, Latency
I.
Introduction
WIRELESS sensor networks have lately attracted plenty of attention. A lot of potential
applications for WSNs are b e i n g d i s c u s s e d . Such a grid normally consists of a huge number of
scattered nodes that unify themselves into a multi-hop wireless system. Each node has one or more sensors,
implanted processors and low- power receivers, and is normally battery functioned. Typically, it is the c o o r
d i n a t i o n to perform a common task. Efficacy of MAC protocol can be achieved in many ways. The first
is the energy efficiency. As stated above, feeler nodes are likely to be battery-operated, and it is often very
tough to modify or revive batteries for the l i n k a g e s. In fact, someday we expect some nodes to be
discarded rather than recharged. Protracting network lifetime for these nodes is a precarious concern. Another
vital characteristic is the scalability to the modification in network scope, node thickness and topology. These
nodes, which are normally installed in an ad hoc routine, function in a distributed way and coordinate with
each other to fulfill a common task. In wireless sensor applications where all sensor nodes constantly report
data to a single sink node sensor nodes that are nearer to the sink drain their power faster. This is referred
to as the energy-hole problem. To solve this, node deployment protocols try to distribute more nodes
around the sink. However, due to environment limits, sometimes, only uniform (random) node distribution is
possible. In such situations, node-deployment conventions are unable to elongate the network period. One way
of elongating the network period is by designing energy- efficient MAC protocols. Since idle listening has
been identified as a vital cause for energy depletion, numerous suggestions were made to reduce the time a
sensor node spends in idle listening. Some required time synchronization among sensor nodes. Since time
management is crucial for numerous sensor applications, it is natural for a synchronous MAC protocol to be
used
to
conserve
energy.
Generally, synchronous proprieties preserve a plan that specifies when a
sensor should be conscious to check communication bustle.
II.
Related Work
S-MAC is a cluster-based protocol, basically it works in as for the intermittently sending nodal devices
to snooze if They are not involved in any type of to and fro communication. In that scenario we can say that
the particular perception is quite similar to the methodology used in the IEEE 802.11 power -saving mode,
where each node awakens up at the commencement of each ideal interval to check if it needs to persist
vigorous state. In S-MAC, nodes exchange synchronization and schedule information with their nodes that
are in between to each other and thus with the corresponding trailing nodes that are connected. Nodes that
follow to the similar agenda form a virtual cluster. A node that receives two different schedules tails
together. Now such a case, this node belongs to two different virtual clusters. The authors also introduce
adaptive listening to reduce latency if a clear to send (CTS) is Overheard, sensor nodes can briefly wake up at
the demise of the communication signal to the next hop by keeping the duty cycle low, S-MAC reduces each
sensor nodes power consumption. DMAC is another run-through that practices an adaptive liability phase.
DOI: 10.9790/0661-17164448
www.iosrjournals.org
44 | Page
www.iosrjournals.org
45 | Page
III.
A sensor node that is in an inner corona has more traffic because, aside from its own traffic, it has to
relay traffic from nodes in outer coronas. Thus calculative approach to determine the traffic load outer curve s
thereby processed which contains an inner node in it. Thus QMAC using a four-corona network, as shown in
Fig. 1. In that he fraction value can thus be made as in for C1: C2: C3: C4 is 1: 3: 5: 7.1 this means that, on the
average, a node in C3 is responsible for relaying traffic for the particular time. 7/5 nodes in C4, a node in C2 is
responsible for 5/3 nodes in C3, and a node in C1 will take care of three nodes in C2. Assuming that each node
generates one unit of traffic for each reporting, the sensor nodes in C4 only have their own traffic to deliver;
thus, their traffic load is one Aside from their own traffic, sensor nodes in C3 have to forward traffic from C4.
Each node in C3 is responsible for 7/5 nodes in C4; thus, the traffic load in C3 is 1 + (7/5) 1 = 2.4. Similarly,
nodes in C2 and C1 have traffic loads of 1
+ (5/3) 2.4 = 5 and 1 + 3 5=16 respectively. On a sensor nodes traffic load. If sensor nodes in C1 use a 2
2 grid, then their ratio of wake-up time frames is 0.75. According to the ratio of traffic loads for different
coronas (C1: C2: C3: C4 = 16: 5: 2.4: 1), the ratio of wake-up time frames for the sensor nodes in C2,
C3, and C4 should be0.234, 0.112, and 0.047, respectively. This indicates that the quorum sizes used by C2,
C3, and C4 should be 8
8, 17 17, and 42 42, respectively. In general, in a network where
Sensor nodes generate the same amount of traffic, the traffic load for sensor nodes in Ci can be denoted by Tick
and calculated by:C1:C2:C3:C4 = 1:3:5:7 (1)
Tick = 1+|Ci+1| (2)
|Ci| TCi+1
(3)
1) Time is divided into a series of time frames.
2) All linkage units are time synchronized.
3) Each node has a unique ID.
4) Let us suppose that all the nodal devices are arranged in such a manner that the curve node is visible. It is
thus partitioned into same width coronas with reference to the jump count in to the sink node as shown in Fig. 1.
To create the coronas, a control packet .entwine with a field jump count = 1 is sent to the network
initialization
Phase through the sink node. At receivable of the packet each nodal edge increases the jump count
field by one and then rebroadcasts the packet. A node belongs to corona Ci if it receives a .net_INIT with
jumpcount = i.
If multiple net_INIT packets are received, only the one with the lowest jumpcount value is handled. Sensor
nodes in corona Ci are I jumps away from the region of interest. It is then communicated with the devices.
6) All sensor nodes have the same transmission range.
7) Nodes are stationary after deployment.
IV.
DOI: 10.9790/0661-17164448
www.iosrjournals.org
46 | Page
V.
Conclusion
Energy conservation is crucial in WSNs. Typically, sensor nodes closer to the sink run out of energy
faster. Most previous solutions have tried to deploy more nodes around the sink. This paper focused on an
environment where planned deployment is difficult and also proposed a new energy- conserving MAC protocol.
Realizing that sensor nodes have different loads due to their different distances to the sink, applied the concept of
quorum to enable sensor nodes to adjust their sleep durations based on their traffic loads. To reduce delays
induced by longer sleep durations, have increased each nodes transmission opportunity by enabling a group of
next-hop nodes to accomplish the packet-relaying job. The downside of this method is the additional hop
information transmissions. Another way is to allow the sink to estimate the total number of coronas and then
broadcast it to all sensor nodes (through the NET_INIT packet). This method reduces the number of control
packets, although at the expense of accuracy. However, if the network size is known and each nodes
transmission range is stable, we can consider the estimation to be quite accurate.
References
Journal Papers:
[1].
[2].
Geetha V, K.Chandrasekaran, A Distributed Trust Based Secure Communication Framework for Wireless Sensor Networks,
Scientific Research An Academic Publisher/Wireless Sensors Network.
Mekkaoui Kheireddine, Rahmoun Abdellatif, Analysis Of Hops Length in Wireless Sensor Networks, Scientific Research An
Academic Publisher/Wireless Sensors Network.
Books:
[3].
[4].
[5].
[6].
[7].
[8].
Waltenegus Dargie, Christian Poellabauer, Fundamentals of Wireless Sensor Networks (Wiley Publications ISBN-13 9780470997659, ISBN-10 04070997656
Robert Faludi, Building Wireless Sensors Networks (OReilly Media Print ISBN 978-0-596-80773-3)
Massimo Vecchio, Wireless Sensor Networks: Novel approaches to distributed data aggregation and compression (Vdm Verlag
Publishers ISBN 10 3639039998
Holger Karl, Andreas Willig, Protocols and Architectures for Wireless Sensor Networks (Wiley Publications ISBN 10:
0470095105 ISBN 13: 978-0470095102
Suraiya Tarannum, Wireless Sensors Networks (IN-TECH Publishers, ISBN-13 978-953-307-325-5)
I. Stojmenovic, "Location updates for efficient routing in wireless networks," in: Handbook on Wireless Networks and Mobile
Computing, Wiley, 2002, 451-47
Proceeding Papers:
[9].
[10].
[11].
[12].
[13].
[14].
[15].
Proceedings of the Distributed Sensor Nets Workshop, 1978:Dept. Computer. Science, Carnegie Mellon University. [8] R. F. Sproull
and D. Cohen,High-level protocols", Proc. IEEE, vol. 66, pp.1371 -1386 1978
Dai, S, Jing, X, and Li, L, "Research and analysis on routing protocols for wireless sensor networks", Proc. International Conference
on Communications, Circuits and Systems, Volume 1, 27-30 May, 2005, pp. 407-411
Jolly, G., Kuscu, M.C., Kokate, P., and Younis, M., "A Low-Energy Key Management Protocol for Wireless Sensor Networks",
Proc. Eighth IEEE International Symposium on Computers and Communication, 2003. (ISCC 2003). vol.1, pp. 335 - 340.
L. Doherty, K. S. Pister, and L. E. Ghaoui. Convex optimization methods for sensor node position estimation. In Proceedings of
INFOCOM'01, 2001.
J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Estrin and D. Ganesan "Building efficient wireless sensor networks
with low- level naming", Proceedings of the Symposium on Operating Systems Principles, Lake Louise, Banff, Canada, Oct. 2001
W.R. Heinzelman, A. Chandrakasan and H. BalakrishnanEnergy-efficient communication protocols for wireless microsensor
networks", Proceedings of the Hawaii International Conference on Systems Science, Jan. 2000
L. Hu and D. Evans. Secure aggregation for wireless networks. In Workshop on Security and Assurance in Ad Hoc Networks,
January 2003.
DOI: 10.9790/0661-17164448
www.iosrjournals.org
47 | Page
Y. Hu, A. Perrig, and D. Johnson. Packet leashes: A defense against wormhole attacks in wireless ad hoc networks. In Proceedings
of INFOCOM 2003, April 2003
C. Karlof and D. Wagner. Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of 1st IEEE
International Workshop on Sensor Network Protocols and Applications, May 2003.
D. Niculescu and B. Nath. Ad hoc positioning system (APS). In Proceedings of IEEE GLOBECOM '01, 2001.
I. Stojmenovic, M. Russell, and B. Vukojevic, "Depth first search and location based localized routing and QoS routing in wireless
networks," IEEE Int. Conf. Parallel Proc., Aug. 2000, 173-180.
J. B. Tchakarov and N.H. Vaidya, "Efficient content location in mobile ad hoc networks," IEEE Int. Conf. on Mobile Data
Management MDM, 2004.
S. Desilva and S.R. Das, "Experimental Evaluation of a Wireless Ad Hoc Network," Proc. Ninth Int', l Conf. Computer Comm. And
Networks (IC3N), Oct. 2000.
About Author
Manas Srivastava is currently pursuing his B.Tech degree in Computer Science and Engineering from SRM
University, Chennai Tamil Nadu, India, and completed the AISSCE Certification in
PCMCs group from Kendriya Vidyalaya R.D.S.O Lucknow in the year 2010.He is a
dignified member of IAEng (International Association of Engineers, Hong Kong). He is
a Life Time Member and one of the STUDENT AMBASSADORS of International
Association of Engineering and Technology for Skill Development (IAETSD) India, his
paper has already been published in IJMER 2014. His research interests includes Web
Security, Big Data, Cloud Virtualization, Networking, Data Mining, Ad-hoc Networks and
Applied Computing.
C.Jawahar Sandeep is currently pursuing his B.Tech degree in Computer Science and Engineering from SRM
University, Chennai Tamil Nadu, India, and completed the AISSCE Certification from
PSBB Senior Secondary School. His research interests includes Artificial Intelligence,
Database Management, Network Security, Information Systems, Wireless Networks and
Cloud Computing.
DOI: 10.9790/0661-17164448
www.iosrjournals.org
48 | Page