Lower bounds on data collection time in sensory networks

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 6, 2004, Pages 1110-1120

  Florens, Cédric ^a   Franceschetti, Massimo ^b   McEliece, Robert J ^a  

^a California Institute of Technology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data collection; Delay; Sensory networks

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATA TRANSFER; DELAY CIRCUITS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ROUTERS; SENSORS; TOPOLOGY; VLSI CIRCUITS;

DATA COLLECTION SYSTEMS; DELAYS; LOWER BOUNDS; SENSORY NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 4344583571     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.830927     Document Type: Article

References (14)

1. J. R. Agre, L. P. Clare, G. J. Potty, and N. P. Romanov, "Development platform for self-organizing wireless sensor networks," in Proc. SPIE Unattended Ground Sensor Technologies Applications, vol. 3713, 1999, pp. 257-268.
2. E. Royer and C.-K. Toh, "A review of current routing protocols for ad hoc wireless networks," IEEE Pers. Commun. Mag., pp. 46-55, Apr. 1999.
3. V. Bharghavan, A. Demers, S. Shenkar, and L. Zhang, "MACAW: A media access protocol for wireless LAN," in Proc. SIGCOMM Conf. Communications Architectures, Protocols, Applications, Aug. 1994, pp. 212-225.
4. J. H. Ju and V. O. K. Li, "TDMA scheduling design of multihop packet radio networks based on latin squares," IEEE J. Select. Areas Commun., vol. 17, pp. 1345-1352, Aug. 1999.
5. M. Pursley, "The role of spread spectrum in packet radio networks," Proc. IEEE, pp. 116-134, Jan. 1987.
6. K. Sohrabi, J. Gao, V. Ailawadhi, and G. Pottie, "Protocols for self-organization of a wireless sensor network," IEEE Pers. Commun., vol. 7, pp. 16-27, Oct. 2000.
7. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in Proc. 6th Ann. Int. Conf. Mobile Computing and Networking, Boston, MA, Aug. 2000, pp. 56-67.
8. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, vol. 46, pp. 388-404, Mar. 2000.
9. F. T. Leighton, B. M. Maggs, and S. B. Rao, "Packet routing and jobshop scheduling in 0(Congestiou + Dilation) Steps," Combinatorica, vol. 14, pp. 167-186, 1994.
10. P. Fraigniaud, "Minimum-time broadcast under edge-disjoint paths modes," in Proc. Int. Conf. Fun with Algorithm, Italy, 2001, pp. 133-148.
11. _, "Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths modes," in Proc. Eur. Symp. Algorithms, Denmark, 2001, pp. 440-451.
12. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter, "Deterministic broadcasting in ad hoc radio networks," Distrib. Comput., pp. 27-38, 2002.
13. C. Florens and R. McEliece, "Scheduling algorithms for wireless ad hoc sensor networks," in Proc. IEEE Global Telecommunications Conf. 2002, Nov. 2002, pp. 6-10.
14. _, "Packets distribution algorithms for sensor networks." in Proc. IEEE INFOCOM 2003, Apr. 2003, pp. 1063-1072.