Lower Bounds on Data Collection Time in Sensor Networks
暂无分享,去创建一个
[1] Victor O. K. Li,et al. TDMA scheduling design of multihop packet radio networks based on latin squares , 1999, IEEE J. Sel. Areas Commun..
[2] M.B. Pursley. The role of spread spectrum in packet radio networks , 1987, Proceedings of the IEEE.
[3] Robert J. McEliece,et al. Scheduling algorithms for wireless ad-hoc sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.
[4] Vaduvur Bharghavan,et al. MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.
[5] Massimo Franceschetti,et al. Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.
[6] Deborah Estrin,et al. Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.
[7] Bruce M. Maggs,et al. Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..
[8] Friedhelm Meyer auf der Heide,et al. Algorithms — ESA 2001 , 2001, Lecture Notes in Computer Science.
[9] Elizabeth M. Belding-Royer,et al. A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..
[10] Pierre Fraigniaud. Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode , 2001, ESA.
[11] Wojciech Rytter,et al. Deterministic broadcasting in ad hoc radio networks , 2002, Distributed Computing.
[12] Pierre Fraigniaud,et al. Minimum-Time Broadcast under Edge-Disjoint Paths Modes , 2008 .
[13] Gregory J. Pottie,et al. Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..
[14] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .