Wei-Chieh Ke

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2011
j5		Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai: The critical-square-grid coverage problem in wireless sensor networks is NP-Complete. Computer Networks 55(9): 2209-2220 (2011)
j4		Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai: Efficient Algorithm for Constructing Minimum Size Wireless Sensor Networks to Fully Cover Critical Square Grids. IEEE Transactions on Wireless Communications 10(4): 1154-1164 (2011)
	2008
j3		Bing-Hong Liu, Wei-Chieh Ke, Chin-Hsien Tsai, Ming-Jer Tsai: Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure. IEEE Trans. Computers 57(6): 849-863 (2008)
	2007
j2		Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai: Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete. IEEE Trans. Computers 56(5): 710-715 (2007)
	2006
j1		Bing-Hong Liu, Wei-Chieh Ke, Ming-Jer Tsai: Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks. Telecommunication Systems 32(4): 263-281 (2006)

Coauthor Index

Last update Fri May 24 12:42:27 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page