The orphan problem in ZigBee-based wireless sensor networks

MSWiM'07: Proceedings of the Tenth ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems

Volumn , Issue , 2007, Pages 95-98

  Pan, Meng Shiuan ^a   Tseng, Yu Chee ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Graph theory; IEEE 802.15.4; Orphan problem; Wireless sensor network; ZigBee

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

ENDDEVICE MAXIMUM MATCHING (EDMM); ORPHAN PROBLEM; ZIGBEE;

WIRELESS SENSOR NETWORKS;

EID: 42149097174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1298126.1298144     Document Type: Conference Paper

References (4)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 2001.
2. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Company, 1979.
3. IEEE standard for information technology -telecommunications and information exchange between systems - local and metropolitan area networks specific requirements part 15.4: wireless medium access control (MAC) and physical layer (PHY) specifications for low-rate wireless personal area networks (LR-WPANs), 2003.
4. ZigBee-2006 specification, ZigBee document 064112, 2006.