Journal Title : International Journal of Modern Trends in Engineering and Science 

Author’s Name : R. Puviyarasu, V. Suvetha, K. Nandhagopal

Volume 01 Issue o5  Year 2014  

ISSN no:  2348-3121  

Page no: 197-202

Abstract—Fundamental function of wireless sensor networks is to provide an efficient data collection. Collecting the data from all the sensor nodes is critical in wireless sensor network. The performance of data collection in sensor networks can be characterized by the rate of data collected and transmitted to the sink node. The limitations of data collection processing are delay and minimum capacity for the many to one data collection in arbitrary wireless sensor networks. Routing protocols used in network to achieves reliability, energy efficiency and scalability in message delivery. The Efficient and Reliable Routing protocol routes messages to one or more hubs for data aggregation applications. The design of Efficient and Reliable Routing protocol is based on path length, distance traversed, energy levels and success of link transmission, to dynamically determine and maintain the best routes in the routing table. Data collection using efficient and reliable routing protocol based on path scheduling algorithm. In a disk graph model a Breadth First Search tree based method is used to achieve maximum capacity of data in any arbitrary wireless sensor networks.

Keywords—Arbitrary networks; capacity; data collection; efficient; routing protocols.


[1] Siyuan Chen, Minisu Huang, Shaojie Tang, “Capacity of Data Collection in Arbitrary Wireless Sensor Networks”, IEEE Transactions on parallel and distributed systems, Vol.23, Jan. (2012).
[2] Peter Kok keong Loh, Hsu Wen Jing, “Performance Evalution of Efficient and Reliable Routing Protocols for Fixed-Power Sensor Networks”, IEEE Transactions on Wireless Communications, Vol.8 No.5 May (2009).
[3] E.J. Duarte-Melo and M. Liu, “Data-Gathering Wireless Sensor Networks: Organization and Capacity”, Computer Networks, Vol. 43, pp. 519-537, (2003).
[4] D. Marco, E.J. Duarte-Melo, M. Liu, and D.L. Neuhoff, “On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data”, Proc. Int’l Workshop Information Processing in Sensor Networks, (2003).
[5] B. Liu, D. Towsley, and A. Swami, “Data Gathering Capacity of Large Scale Multi-hop Wireless Networks”, Proc. IEEE Fifth Int’l Mobile Ad Hoc and Sensor Systems (MASS), (2008).
[6] S. Chen, Y. Wang, X.-Y. Li, and X. Shi, “Capacity of Data Collection in Randomly-Deployed Wireless Sensor Networks”, Wireless Networks, Vol. 17, No. 2, pp. 305-318, Feb. (2011).
[7] S. Chen, S. Tang, M. Huang, and Y. Wang, “Capacity of Data Collection in Arbitrary Wireless Sensor Networks”, Proc. IEEE INFOCOM, (2010).
[8] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks”, IEEE Trans. Information Theory, Vol. 46, No. 2, pp. 388-404, Mar. (2000).
[9] M. Franceschetti, O. Dousse, D.N.C. Tse, and P. Thiran, “Closing the Gap in the Capacity of Wireless Networks via Percolation”, IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1009-1018, Mar. (2007).
[10] A. Keshavarz-Haddad and R.H. Riedi, “Bounds for the Capacity of Wireless Multi-hop Networks Imposed by Topology and Demand”, Proc. ACM MobiHoc, (2007).
[11] A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “Broadcast Capacity in Multi-hop Wireless Networks”, Proc. MobiCom, (2006).
[12] B. Tavli, “Broadcast Capacity of Wireless Networks”, IEEE Comm. Letters, Vol. 10, pp. 68-69, Feb. (2006).
[13] R.J. Barton and R. Zheng, “Order-Optimal Data Aggregation in Wireless Sensor Networks Using Cooperative Time-Reversal Communication”, Proc. Ann. Conf. Information Sciences and Systems, (2006).
[14] T. Moscibroda, “The Worst-Case Capacity of Wireless Sensor Networks”, Proc. Sixth Int’l Symp. ACM Information Processing in Sensor Networks (IPSN), (2007).
[15] X.-Y. Li, Y. Wang, and Y. Wang, “Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks”, IEEE Trans. Computers, Vol. 60, No. 3, pp. 386-399, Mar. (2011).

Full Pdf Paper-Click Here