Upload
manjusha-gaikwad
View
67
Download
4
Tags:
Embed Size (px)
Citation preview
Prepared by
Gaikwad Manjusha R.(M.tech )
Introduction
Literature survey
SINR Definition & its constraints
Comparision model
CDMA/CA
Backoff Algorithm
TDMA
Tree formation protocol
Merits & Demerits of TDMA
Presentation Outline
WSN
SINR
SNIR
SNR
SIR
Introduction
Titel of paper Author Publication Year of publication
Findings
On the
construction of
efficient data
gathering tree
in wireless
sensor
Networks
N.Thepvilojana
pong, Y. Tobe
and K. Sezaki
IEEE ISCAS,
pp. 648-651.
May 2005. Constructed a data gatheringtree that maximizenetwork lifetime
An energy-
efficient data
collection
framework for
wireless sensor
networks by
exploiting
spatiotemporal
correlattion
C. Liu, K. Wu
and J
IEEE Trans.
Parallel and
Distributed
Systems,
pp. 1010-1023
Jul. 2007 An efficient data gatheringappoarch is implemented by combining the dual prediction &Clustering algorithm
Analyzing the transitional region inlow power wireless links
M. Zuniga and B. Krishnamachari
IEEE SECON, pp. 517-526
Oct 2004 a systematic medium-scalemeasurement of packet delivery in threedifferent
Titel of paper Author Publication Year of publication
Findings
Topology control meets SINR: thescheduling complexity of arbitrary Topologies
T. Moscibroda, R. Wattenhoferand A. Zollinger
ACM MobiHoc, pp. 310-321
May 2006. Analysis ontopology control in the context ofthe physical Signal-to-Interference-plus-Noise-Ratio (SINR)model, focusing on the question of how and how fast thelinks of a resulting topology can actually be realized overtime.
Joint power control and link scheduling in wireless
L. Fu, C. Liewand J. Huang
IEEE ICC, pp. 3066-3072
May 2008. theminimum-length TDMA frame of a power-
Title of paper Author publication Year of publication
Findings
Optimum integrated linkscheduling an power control for multihopwireless networks
A. Behzad and I. Rubin
IEEE Trans.vehicular Technology, pp. 194-205
Jan.2007 The joint routing,link scheduling and power control to support high data ratesfor broadband wireless multi-hop networks.
Mathematical definition=
SINR(x)= P
SINR Constraints
I+N
Protocol Model
Physical Model
-Interference model(SINR)
Comparision Model
CSMA/CA -
D-MAC
B-MAC
B-MAC+
X-MAC
TDMA
MAC Protocols
Gives waiting time for the station
Waiting time=K*51.2 micro sec
n
k= 0 to 2 - 1
Backoff Algorithm for CSMA/CD
D-MAC
Fig-Active and sleep period of D-MAC
B-MAC
Fig-Preamble in B-MAC, B-MAC+, X-MAC
LEACH(low energy adaptive clustering hierarchy)
PEGASIS(power-efficient gathering in sensor information system)
Hierarchical-PEGASIS
Hierarchical routing approaches for sensor networks
Tree formation using CSMA/CA protocol
Fig: Average Message Success Rate observed from nodes at the same level of the collection tree when using B-MAC
Fig: Average Latency of Messages Received at CP from nodes at differentlevels of the collection tree when using B-MAC.
Fig: Message Success Rate decreases as the number of transmissions
increase This is because the number of collisions increase.
Efficient Transmission
Data & Voice Communication
Carry Data Rates
Cost effective Technology
Extended Battery life
Efficient Utilization of hierarchical cell structure
Advantages of TDMA
Predefined Time Slots
Multipath Distortion
Synchronization
Disadvantages Of TDMA
The proposed algorithm is energy efficient In this paper, we studied fast convergecast in WSN where nodes communicate using a TDMA protocol to minimize the schedule length. We addressed the fundamental limitations due to interference and half-duplex transceivers on the nodes and explored techniques t overcome the same.
CONCLUSION
[1] N. Thepvilojanapong, Y. Tobe and K. Sezaki, “On the construction of
efficient data gathering tree in wireless sensor networks,” IEEE ISCAS,
pp. 648-651, May 2005.
[2] C. Liu, K. Wu and J. Pei, “An energy-efficient data collection framework
for wireless sensor networks by exploiting spatiotemporal
correlation,”IEEE Trans. Parallel and Distributed Systems, pp. 1010-1023,
Jul. 2007.
[3] M. Zuniga and B. Krishnamachari, “Analyzing the transitional region in
low power wireless links,” IEEE SECON, pp. 517-526, Oct. 2004.
[4] H. Choi, J. Wang and E. A. Hughes, “Scheduling for information
gathering on sensor network,” Wireless Networks, vol. 15, pp. 127-140,
Jan. 2009
References
[5] O. Durmaz Incel, A. Ghosh, B. Krishnamachari and K. Chintalapudi,
“Fast data collection in tree-based wireless sensor networks,”
IEEE Trans. Mobile Computing, vol. 11, no. 1, pp. 86-99, Jan. 2012.
[6] O. Goussevskaia, Y.A. Oswald and R. Wattenhofer, “Complexity in
geometric SINR,” ACM MobiHoc, pp. 100-109, September 2007.
[7] S. Kompella, J. E. Wieselthier and A. Ephremides, “A cross-layer
approach to optimal wireless link scheduling with SINR constraints,”
IEEE Military Communications Conference, pp. 1-7, Oct. 2007.
[8] T. Moscibroda, R. Wattenhofer and A. Zollinger,
“Topology control meets SINR: the scheduling complexity of arbitrary
Topologies,”ACM MobiHoc, pp. 310-321, May 2006.
References
[9] A. Behzad and I. Rubin, “Optimum integrated link scheduling and
power control for multihop wireless networks,” IEEE Trans.
vehicular Technology, pp. 194-205, Jan. 2007.
[10] L. Fu, C. Liew and J. Huang, “Joint power control and link
scheduling in wireless networks for throughput optimization,”
IEEE ICC, pp. 3066-3072, May 2008.
Thank You