Analysis on Energy Optimized Data Collection in Tree Based Ad-Hoc Sensor Network

Full Text (PDF, 191KB), PP.42-49

Views: 0 Downloads: 0


Sharad 1,* Shailendra Mishra 2 Ashok Kumar Sharma 3 Durg Singh Chauhan 4

1. Department of Computer Application, BIT College, Meerut, India

2. BCTKEC College, Dwarahat, Uttrakhand, India

3. YMCA College, Faridabad, India

4. UTU University, Dehradun, India

* Corresponding author.


Received: 5 Nov. 2011 / Revised: 26 Dec. 2011 / Accepted: 25 Jan. 2012 / Published: 8 Mar. 2012

Index Terms

Convergecast, Multi-channel, Topology, Energy, TDMA


Fast and energy efficient data collection in an energy constraint ad-hoc sensor network is always a challenging issue. The network topology and interferences causes significant effects on data collection and hence on sensors’ energy usage. Various approaches using single channel, multichannel and convergecasting had already been proposed. Here in this paper we have shown data collection performance using multi-frequency in channel assignment, and effect of network topology, for moderate size networks of about 50-100 nodes. For the study we have used some realistic simulation models under many-to-one communication paradigm called convergecast, a single frequency channel and TDMA technique to have minimum time slots for convergecasting.

Cite This Paper

Sharad, Shailendra Mishra, Ashok Kumar Sharma, Durg Singh Chauhan, "Analysis on Energy Optimized Data Collection in Tree Based Ad-Hoc Sensor Network", International Journal of Modern Education and Computer Science (IJMECS), vol.4, no.3, pp.42-49, 2012. DOI:10.5815/ijmecs.2012.03.06


[1]K. K. Chintalapudi and L. Venkatraman, “On the Design of MAC Protocols for Low-Latency Hard Real-Time Discrete Control Applications over 802.15.4 Hardware,” Proceeding of International Conference on Information Processing in Sensor Networks (IPSN ’08), pp. 356-367, 2008.
[2]S. Gandham, Y. Zhang, and Q. Huang, “Distributed Time-Optimal Scheduling for Convergecast in Wireless Sensor Networks,” Computer Networks, vol. 52, no. 3, pp. 610-629, 2008.
[3]X. Chen, X. Hu, and J. Zhu, “Minimum Data Aggregation Time Problem in Wireless Sensor Networks,” Proc. Int’l Conf. Mobile Ad- Hoc and Sensor Networks (MSN ’05), pp. 133-142, 2005.
[4]V. Annamalai, S.K.S. Gupta, and L. Schwiebert, “On Tree-Based Convergecasting in Wireless Sensor Networks,” Proceeding IEEE Wireless Communication and Networking Conf. (WCNC ’03), vol. 3, pp. 1942-1947, 2003.
[5]M. Pan and Y. Tseng, “Quick Convergecast in ZigBee Beacon-Enabled Tree-Based Wireless Sensor Networks,” Computer Comm., vol. 31, no. 5, pp. 999-1011, 2008.
[6]W. Song, F. Yuan and R. LaHusen, “Time-Optimum Packet Scheduling for Many-to-One Routing in Wireless Sensor Networks,” Proc. IEEE Int’l Conf. Mobile Ad-Hoc and Sensor Systems (MASS ’06), pp. 81-90, 2006.
[7]W. Song, H. Renjie, B. Shirazi, and R. LaHusen, “TreeMAC: Localized TDMA MAC Protocol for Real Time High Data Rate Sensor Networks,” Journal of Pervasive and Mobile Cosmputing, vol. 5, no. 6, pp. 750-765, 2009.
[8]H. Choi, J. Wang and E. Hughes, “Scheduling for Information Gathering on Sensor Network,” Wireless Networks, vol. 15, pp. 127-140, 2009.
[9]N. Lai, C. King, and C. Lin, “On Maximizing the Throughput of Convergecast in Wireless Sensor Networks,” Proc. Int’l Conf. Advances in Grid and Pervasive Computing (GPC ’08), pp. 396-408, 2008.
[10]Y. Wu, J.A. Stankovic, T. He, and S. Lin, “Realistic and Efficient Multi Channel Communication in Wireless Sensor Networks,” Proc. IEEE INFOCOM, pp. 1193-1201, 2008.
[11]Y. Kim, H. Shin, and H. Cha, “Y-MAC: An Energy-Efficient Multi Channel MAC Protocol for Dense Wireless Sensor Networks,” Proc. Int’l Conf. Information Processing in Sensor Networks (IPSN ’08), pp. 53-63, Apr. 2008.
[12]B. Krishnamachari, D. Estrin, and S.B. Wicker, “The Impact of Data Aggregation in Wireless Sensor Networks,” Proc. Int’l Conf. Distributed Computing Systems Workshops (ICDCSW ’02), pp. 575-578, 2002.
[13]P. Kyasanur and N.H. Vaidya, “Capacity of Multi-Channel Wireless Networks: Impact of Number of Channels and Interfaces,” Proc. ACM MobiCom, pp. 43-57, 2005.
[14]G. Sharma, R.R. Mazumdar and N.B. Shroff, “On the Complexity of Scheduling in Wireless Networks,” Proc. ACM MobiCom, pp. 227-238, 2006.
[15]C.H. Papadimitriou, “The Complexity of the Capacitated Tree Problem,” Networks, vol. 8, no. 3, pp. 217-230, 1978.
[16]H. Dai and R. Han, “A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks,” Proc. IEEE Conf. Global Telecomm. (GlobeCom ’03), pp. 548-552, 2003.