Abstract
A network of many sensors and a base station that are deployed over a region is considered. Each sensor has a transmission range, a interference range, and a carrier sensing range, which is r, αr, and βr, respectively. In this paper, we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem: Given locations of sensors along with a base station, a subset of sensors, and parameters r,α, and β, find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts, such that the latency is minimized. We designed an nearly a constant ratio approximation algorithm and a heuristic algorithm for the problem. Extensive simulations have been done to show the performances of the two algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cristescu, R., Beferull-Lozano, B., Vetterli, M.: On network correlated data gathering. In: IEEE INFOCOM, pp. 2571–2582. IEEE Press, Los Alamitos (2004)
Mahjourian, R., Chen, F., Tiwari, R., Thai, M., Zhai, H., Fang, Y.: An approximation algorithm for conflict-Aware broadcast scheduling in wireless ad hoc networks. In: MOBIHOC 2008, Hong Kong, pp. 331–340 (2008)
Chen, X., Hu, X., Zhu, J.: Minimum data aggregation time problem in wireless sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 133–142. Springer, Heidelberg (2005)
Huang, H., Wan, J., Jia, X., Du, H., Shang, W.: Minimum-latency broadcast scheduling in wireless ad hoc networks. In: INFOCOM 2007, Alaska, pp. 733–739 (2007)
Chen, Z., Qiao, C., Xu, J., Lee, T.: A constant approximation algorithm for interference aware broadcast in wireless networks. In: INFOCOM 2007, Alaska, pp. 740–748 (2007)
Deng, J., Liang, B., Varshney, P.: Tuning the carrier sensing range of ieee 802.11 mac. In: GLOBECOM 2004, pp. 2987–2991 (2004)
Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: MOBIHOC 2003, pp. 222–232 (2003)
Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: PODC 2005, pp. 129–137 (2005)
Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-latency tradeoffs for data gathering in wireless sensor etworks. In: IEEE INFOCOM 2004 (2004)
Huang, H., Wan, P., Vu, T., Li, Y., Yao, F.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: IEEE INFOCOM 2007 (2007)
Wegner, G.: Über endliche kreispackungen in der ebene. Studia Scientiarium Mathematicarium Hungarica 21, 1–28 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, Q., Li, D. (2009). An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)