Data Aggregation

21
DATA AGGREGATION USING CONTIGUOUS LINK SCHEDULING FOR WIRELESS SENSOR NETWORKS PRESENTED BY J.JEEVITHA ME-APPLIED ELECTRONICS(II YEAR) GUIDED BY MR. P.THIRUMARAISELVAN AP/ECE

description

data

Transcript of Data Aggregation

Page 1: Data Aggregation

DATA AGGREGATION USING CONTIGUOUS LINK SCHEDULING

FOR WIRELESS SENSOR NETWORKS

PRESENTED BYJ.JEEVITHA

ME-APPLIED ELECTRONICS(II YEAR)

GUIDED BYMR. P.THIRUMARAISELVAN

AP/ECE

Page 2: Data Aggregation

CONTENT

Introduction

Literature survey

Problem formulation

Objective

Proposed work

Tools required

References

Page 3: Data Aggregation

INTRODUCTION

Page 4: Data Aggregation

LITERATURE SURVEY• K. Kalpakis, K. Dasgupta, and P. Namjoshi, ‘‘Efficient Algorithms for Maximum Lifetime

Data Gathering and Aggregation in Wireless Sensor Networks,’’ Comput. Netw., vol. 42, no.

6, pp. 697-716, Aug. 2003.

Page 5: Data Aggregation

• W. Ye, J. Heidemann, and D. Estrin, ‘‘An Energy-Efficient MAC Protocol for Wireless

Sensor Networks,’’ in Proc. IEEE INFOCOM, 2002, pp. 1567-1576.

Page 6: Data Aggregation

• Y. Sun, S. Du,O.Gurewitz, and D.B. Johnson, ‘‘DW-MAC:A low Latency, Energy Efficient

Demand-Wakeup MAC Protocol for Wireless Sensor Networks,’’ in Proc. ACM Int’l Symp.

MobiHoc Netw. Comput., 2008, pp. 53-62.

Page 7: Data Aggregation

• S. Ramanathan and E.L. Lloyd, ‘‘Scheduling Algorithms for Multihop Radio Networks,’’

IEEE/ACM Trans. Netw., vol. 1, no. 2, pp. 166-177, Apr. 1993.

Page 8: Data Aggregation

• S. Gandham, M. Dawande, and R. Prakash, ‘‘Link Scheduling in Sensor Networks:

Distributed Edge Coloring Revisited,’’ in Proc.IEEE INFOCOM, 2005, pp. 2492-2501.

Page 9: Data Aggregation

• W. Wang, Y.Wang, X.Y. Li,W.Z. Song, andO. Frieder, ‘‘Efficient Interference-Aware TDMA

Link Scheduling for Static Wireless Networks,’’ in Proc. ACM Annu. Int’l Conf. MobiCom

Netw., 2006, pp. 262-273.

Page 10: Data Aggregation

• P. Djukic and S. Valaee, ‘‘Link Scheduling for Minimum Delay in Spatial Re-Use TDMA,’’

in Proc. IEEE INFOCOM, 2007, pp. 28-36.

Page 11: Data Aggregation

• P.J. Wan, C. Ma, Z. Wang, B. Xu, M. Li, and X. Jia, ‘‘Weighted Wireless Link Scheduling

without Information of Positions and Interference/Communication Radii,’’ in Proc. IEEE

INFOCOM, 2011, pp. 2327-2335.

Page 12: Data Aggregation

• Y. Zhou, X.Y. Li, M. Liu, Z. Li, S. Tang, X. Mao, and Q. Huang, ‘‘Distributed Link

Scheduling for Throughput Maximization under Physical Interference Model,’’ in Proc. IEEE

INFOCOM,2012, pp. 2691-2695.

Page 13: Data Aggregation

• X. Xu, X.Y. Li, P.J. Wan, and M. Song, ‘‘Efficient Aggregation Scheduling in Multihop

Wireless Sensor Networks with SINR Constraints,’’ IEEE Trans. Mobile Comput., vol. 12, no.

12, pp. 2518-2528, Dec. 2013.

Page 14: Data Aggregation

• T. Alsulaiman, S.K. Prasad, and A. Zelikovsky, ‘‘Distributed Algorithms for TDMA Link

Scheduling in Sensor Networks,’’ Int’l J. Netw. Comput., vol. 3, no. 1, pp. 55-74, 2013.

Page 15: Data Aggregation

• J. Ma, W. Lou, Y. Wu, X.Y. Li, and G. Chen, ‘‘Energy Efficient TDMA Sleep Scheduling in

Wireless Sensor Networks,’’ in Proc.IEEE INFOCOM, 2009, pp. 630-638.

Page 16: Data Aggregation

PROBLEM FORMULATION

Page 17: Data Aggregation

SOFTWARE USED

• Matlab R2010a

Page 18: Data Aggregation

REFERENCES1. Junchao Ma, Wei Lou and Xiang-Yang Li “Contiguous Link Scheduling for Data Aggregation

in Wireless Sensor Networks” IEEE transactions on parallel and distributed systems, vol. 25,

no. 7, july 2014.

2. K. Kalpakis, K. Dasgupta, and P. Namjoshi, ‘‘Efficient Algorithms for Maximum Lifetime

Data Gathering and Aggregation in Wireless Sensor Networks,’’ Comput. Netw., vol. 42, no.

6, pp. 697-716, Aug. 2003.

3. W. Ye, J. Heidemann, and D. Estrin, ‘‘An Energy-Efficient MAC Protocol for Wireless

Sensor Networks,’’ in Proc. IEEE INFOCOM 2002, pp. 1567-1576.

4. Y. Sun, S. Du,O.Gurewitz, and D.B. Johnson, ‘‘DW-MAC:A low Latency, Energy Efficient

Demand-Wakeup MAC Protocol for Wireless Sensor Networks,’’ in Proc. ACM Int’l Symp.

MobiHoc Netw. Comput., 2008, pp. 53-62.

5. E. Arikan, ‘‘Some Complexity Results about Packet Radio Networks,’’ IEEE Trans. Inf.

Theory, vol. IT-30, no. 4, pp. 681-685, July 1984

Page 19: Data Aggregation

6. S. Ramanathan and E.L. Lloyd, ‘‘Scheduling Algorithms for Multihop Radio Networks,’’

IEEE/ACM Trans. Netw., vol. 1, no. 2, pp. 166-177, Apr. 1993.

7. S. Gandham, M. Dawande, and R. Prakash, ‘‘Link Scheduling in Sensor Networks:

Distributed Edge Coloring Revisited,’’ in Proc. IEEE INFOCOM, 2005, pp. 2492-2501.

8. W. Wang, Y.Wang, X.Y. Li,W.Z. Song, andO. Frieder, ‘‘Efficient Interference-Aware TDMA

Link Scheduling for Static Wireless Networks,’’ in Proc. ACM Annu. Int’l Conf. MobiCom

Netw., 2006, pp. 262-273.

9. P. Djukic and S. Valaee, ‘‘Link Scheduling for Minimum Delay in Spatial Re-Use TDMA,’’

in Proc. IEEE INFOCOM, 2007, pp. 28-36.

10. P.J. Wan, C. Ma, Z. Wang, B. Xu, M. Li, and X. Jia, ‘‘Weighted Wireless Link Scheduling

without Information of Positions and Interference/Communication Radii,’’ in Proc. IEEE

INFOCOM, 2011, pp. 2327-2335.

11. Y. Zhou, X.Y. Li, M. Liu, Z. Li, S. Tang, X. Mao, and Q. Huang, ‘‘Distributed Link

Scheduling for Throughput Maximization under Physical Interference Model,’’ in Proc. IEEE

INFOCOM, 2012, pp. 2691-2695.

Page 20: Data Aggregation

12. X. Xu, X.Y. Li, P.J. Wan, and M. Song, ‘‘Efficient Aggregation Scheduling in Multihop

Wireless Sensor Networks with SINR Constraints,’’ IEEE Trans. Mobile Comput., vol. 12,

no. 12, pp. 2518-2528, Dec. 2013.

13. T. Alsulaiman, S.K. Prasad, and A. Zelikovsky, ‘‘Distributed Algorithms for TDMA Link

Scheduling in Sensor Networks,’’ Int’l J. Netw. Comput., vol. 3, no. 1, pp. 55-74, 2013.

14. J. Ma, W. Lou, Y. Wu, X.Y. Li, and G. Chen, ‘‘Energy Efficient TDMA Sleep Scheduling in

Wireless Sensor Networks,’’ in Proc. IEEE INFOCOM, 2009, pp. 630-638.

15. N. Thepvilojanapong, Y. Tobe, and K. Sezaki, ‘‘On the Construction of Efficient Data

Gathering Tree in Wireless Sensor Networks,’’ in Proc. IEEE ISCAS, 2005, pp. 648-651.

16. Q. Lampin, D. Barthel, and F. Valois, ‘‘Efficient Route Redundancy in DAG-Based Wireless

Sensor Networks,’’ in Proc. IEEE WCNC, 2010, pp. 1-6.

17. P. Gupta and P.R. Kumar, ‘‘The Capacity of Wireless Networks,’’ IEEE Trans. Inf. Theory,

vol. 46, no. 2, pp. 388-404, Mar. 2000.

Page 21: Data Aggregation

18. K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, ‘‘Impact of Interference on Multi-

Hop Wireless Network Performance,’’ in Proc. ACM MobiCom, 2003, pp. 66-80.

19. S. Cui, A.J. Goldsmith, and A. Bahai, ‘‘Energy-Constrained Modulation Optimization,’’

IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2349-2360, Sept. 2005.

20. Y.Wu, X.Y. Li, Y. Liu, and W. Lou, ‘‘Energy-Efficient Wake-Up Scheduling for Data

Collection and Aggregation,’’ IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 2, pp.

275-287, Feb. 2010.

21. J. Polastre, J. Hill, and D. Culler, ‘‘Versatile Low Power Media Access for Wireless

Sensor Networks,’’ in Proc. ACM Conf. Embedded Netw. SenSys, 2004, pp. 95-107.

22. S. Croce, F. Marcelloni, and M. Vecchio, ‘‘Reducing Power Consumption in Wireless

Sensor Networks Using a Novel Approach to Data Aggregation,’’ Comput. J., vol. 51,

no. 2, pp. 227-239, Mar. 2008.