Abstract
We study the time complexity of data collection in sensor networks. A simple mathematical model for sensor networks regarded as lines, multi-lines and trees is defined and corresponding optimal schedules are provided. A lower bound of data collection time on general graph networks is also derived.
Furthermore, we discuss the data collection problem where each node can transmit arbitrary hops per time slot. An optimal schedule is derived where each node can transmit 2 hops. We also prove the schedule is nearly optimal if each node can transmit k (kâ>â2) hops (with constant error).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bharghavan, V., Demers, A., Shenker, S., Zhang, L.: MACAW: a media access protocol for wireless LANâs. In: Proceedings of the Conference on Communications Architectures, Protocols and Applications, pp. 212â225. ACM (1994)
Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1), 27â38 (2002)
Florens, C., Franceschetti, M., McEliece, R.J.: Lower bounds on data collection time in sensory networks. IEEE Journal on selected Areas in Communications, 22(6) (2004)
Florens, C., McEliece, R.: Scheduling algorithms for wireless ad-hoc sensor networks. In: GLOBECOM, NewYork, vol. 1, pp. 6â10 (2002)
Fraigniaud, P.: Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 440â451. Springer, Heidelberg (2001)
Fraigniaud, P.: Minimum-time broadcast under edge-disjoint paths modes. In: International Conference on Fun with Algorithm, Citeseer (2001)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388â404 (2000)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 56â67. ACM (2000)
Ju, J.H., Li, V.O.K.: TDMA scheduling design of multihop packet radio networks based on latin squares. IEEE Journal on Selected Areas in Communications 17(8), 1345 (1999)
Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling inO (congestion+ dilation) steps. Combinatorica 14(2), 167â186 (1994)
Pursley, M.B.: The role of spread spectrum in packet radio networks. NASA STI/Recon Technical Report N, 88, 11929 (1987)
Royer, E.M., Toh, C.K.: A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications 6(2), 46â55 (1999)
Sohrabi, K., Gao, J., Ailawadhi, V., Pottie, G.J.: Protocols for self-organization of a wireless sensor network. IEEE (see also IEEE Wireless Communications) Personal Communications 7(5), 16â27 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Âİ 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, X., Huang, S.C.H., Li, M. (2012). Lower Bounds on Data Collection Time in Sensor Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)