Organizing an optimal cluster-based ad hoc network architecture by the modified Quine-McCluskey algorithm

IEEE Communications Letters

Volumn 11, Issue 1, 2007, Pages 43-45

  Tseng, Chih Cheng ^a,b   Chen, Kwang Cheng ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b JINWEN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Ad hoc networks; Cluster; Maintenance overhead; Quine McCluskey algorithm

Indexed keywords

ALGORITHMS; BANDWIDTH; CLUSTER ANALYSIS; NUMERICAL ANALYSIS; OPTIMIZATION;

AD HOC NETWORK ARCHITECTURE; OPTIMAL CLUSTER ARCHITECTURE; QUINE-MCCLUSKEY ALGORITHM;

AD HOC NETWORKS;

EID: 33947686000     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2007.061376     Document Type: Article

References (7)

1. M. Frodigh, P. Johansson and P. Larsson, "Wireless ad hoc networking: the art of networking without a network," Ericsson Review, no. 4, pp. 248-263, 2000.
2. B. Das and V. Bhargavan, "Routing in ad-hoc networks using minimum connected dominating sets," in Proc. IEEE International Conference on Communications 1997, vol. 1, pp. 376-380.
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to The Theory of NP-Completeness. San Francisco: Freeman, 1978.
4. J. Y. Yu and H. J. P. Chong, "A survey of clustering schemes for mobile ad hoc networks," IEEE Commun. Surveys and Tutorials, vol. 7, no. 1, pp. 32-48, first quarter 2005.
5. E. J. McCluskey and H. Schorr, "Minimization of Boolean functions," Bell Syst. Tech. J., vol. 35, no. 5, pp. 1417-1444, Nov. 1956.
6. R. Sivakumar, P. Sinha, and V. Bharghavan, "CEDAR: A core-extraction distributed ad hoc routing algorithm," IEEE J. Sel. Areas Commun., vol. 17, no 8, pp. 1-12, Aug. 1999.
7. M. Gerla and J. T. C. Tsai, "Multicluster, mobile, multimedia radio network," ACM/Baltzer J. Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995.