This dissertation contain five works. In the first three works, we discuss communication pro-tocols in ZigBee network layer. In the last two works, we introduce two applications, which can operate based on the designed network layer protocols. In the following, we summarize this dissertation.
In Chapter 3, we have identified a new orphan problem in ZigBee-based wireless sensor networks. We show that the problem is non-trivial because a device is not guaranteed to join a network even if there are remaining address spaces. We model this orphan problem in two subproblems, namely the BDDTF problem and the EDMM problem. We prove the BDDTF problem is NP-complete and propose a two-stage network formation policy, which can greatly relieve the orphan problem. Compared to the network formation scheme defined in ZigBee, our algorithms can effectively reduce the number of orphan devices.
In Chapter 4, we have proposed hierarchical address assignment and routing schemes for ZigBee-based LT WSNs. The proposed address assignment scheme divides nodes into several clusters and then assigns each node a cluster ID and a node ID as its network address. With such a hierarchical structure, routing can be easily done based on addresses of nodes and the spaces required for the network addresses can be significantly reduced. We also show how to allow nodes to utilize shortcuts. With our design, not only network addresses can be efficiently utilized, but also the network scale can be enlarged to cover wider areas without suffering from address shortage. We verify our schemes by simulation programs.
In Chapter 5, we have defined a new minimum delay beacon scheduling (MDBS) problem for convergecast with the restrictions that the beacon scheduling must be compliant to the ZigBee standard. We prove the MDBS problem is NP-complete and propose optimal solutions for special cases and two heuristic algorithms for general cases. Simulation results indicate the performance of our heuristic algorithms decrease only when the number of interference neighbors is increased. Compared to the random slot assignment and greedy slot assignment scheme, our heuristic algorithms can effectively schedule the ZigBee routers’ beacon times to achieve quick convergecast.
In Chapter 6, we have proposed an emergency guiding and an emergency monitoring ser-vices for indoor environments. The proposed emergency guidance scheme can quickly con-verge and find safe guidance paths to exits when emergencies occur. The tree reconstruction protocol reduces the occurrence of temporary cycles and further shortens the convergence time. We verify both our schemes by real implementation and simulation programs.
In Chapter 7, we have presented an intelligent light control system considering user activ-ities. In this system, there are two types of lighting devices. We use wireless sensors to collect light intensities in the environment. Considering users’ activities, we model the illumination requirements of users. An illumination decision algorithm and a device control algorithm are presented to meet user requirements and to conserve energy. The proposed schemes are verified by real implementation in an indoor environment.
Based on the results presented above, several issues worth further investigation are sum-marized as follows.
• According to the result of our first work, we can know that the orphan problem is hard to solve. In the future, we can further discuss how to set Cm, Rm, and Lm, which can induce less than p% of orphan devices if some parameters (ex. node density, network size, node’s transmission range, and so on) are provided.
• It deserves to further discuss address assignment and routing schemes for more compli-cated topologies such as meshes that are connected by “long-thin” links.
• According to ZigBee standard, regular beacons are not allow in mesh networks. It de-serves to consider an asynchronous sleep scheduling method to support energy-efficient convergecast in ZigBee mesh networks.
• In our current guiding system, the hazardous region is defined by the numbers of hops in Gg and the altitudes of nodes in hazardous regions are adjusted by a static function.
In fact, the definition of hazardous regions and altitude adjustments can be application-or scenario-dependent. Fapplication-or example, if the temperature is larger than100◦C, sensors will trigger a fire emergency. In this case, sensors detecting a temperature larger than 70◦C can consider themselves as in a hazardous region. The altitude adjustment func-tion can be designed according to the sensed temperature. No matter how sensors in hazardous regions adjust their altitudes, the proposed local minimum adjustment rules can be applied.
• In the light control application, the current user requirement is defined as a binary model, i.e., a user who is satisfied returns a satisfaction value of one. We can further model users’ satisfaction values as a function, which return value is decided by users’ sur-rounding light intensities. Moreover, we can also enhance the user interfaces at the portable sensor nodes.
Bibliography
[1] Chipcon corporation. http://www.chipcon.com/.
[2] Chipcon CC2420DBK. http://www.chipcon.com/.
[3] Dust network Inc. http://dust-inc.com/flash-index.shtml.
[4] Edx-f04. http://www.liteputer.com.cn/china/liteputer-tw/product.asp.
[5] Ember - wireless semiconductor. http://www.ember.com/.
[6] Design and construction of a wildfire instrumentation system using networked sensors.
http://firebug.sourceforge.net/.
[7] Freescale semiconductor. http://www.freescale.com/.
[8] Habitat monitoring on great duck island. http://www.greatduckisland.net/technology.php.
[9] Jennic JN5121. http://www.jennic.com/.
[10] Matlab Builder for Java. http://www.mathworks.com/products/ javabuilder/.
[11] Motes, smart dust sensors, wireless sensor networks. http://www.xbow.com/.
[12] Si photodiode s1133. http://jp.hamamatsu.com/en/index.html.
[13] SmartHome Inc. http://www.smarthome.com.
[14] UPnP forum. http://www.upnp.org.
[15] Zigbee Alliance. http://www.zigbee.org/.
[16] A. A. Ahmed, H. Shi, and Y. Shang. SHARP: A new approach to relative localization in wireless sensor networks. In Proc. of Int’l Conference on Distributed Computing Systems Workshops (ICDCSW), 2005.
[17] M. Ali and Z. A. Uzmi. An energy-efficient node address naming scheme for wireless sensor networks. In Proc. of IEEE Int’l Networking and Communications Conference (INCC), 2004.
[18] J. Bachrach, R. Nagpal, M. Salib, and H. Shrobe. Experimental results and theoreti-cal analysis of a self-organizing global coordinate system for ad hoc sensor networks.
Telecommunications Systems Journal, 26(2-4):213–234, 2004.
[19] S.-J. Baek, G. de Veciana, and X. Su. Minimizing energy consumption in large-scale sen-sor networks through distributed data compression and hierarchical aggregation. IEEE Journal on Selected Areas in Communications, 22(6):1130–1140, 2004.
[20] P. Bahl and V. N. Padmanabhan. RADAR: An in-building RF-based user location and tracking system. In Proc. of IEEE INFOCOM, 2000.
[21] M. A. Batalin, G. S. Sukhatme, and M. Hattig. Mobile robot navigation using a sensor network. In Proc. of IEEE Int’l Conference on Robotics and Automation (ICRA), 2004.
[22] P. T. Boggs and J. W. Tolle. Sequential quadratic programming. Acta Numerica, 45(1):1–
51, 1995.
[23] A. Boukerche, R. W. N. Pazzi, and R. B. Araujo. A fast and reliable protocol for wireless sensor networks in critical conditions monitoring applications. In Proc. of ACM/IEEE Int’l Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), 2004.
[24] D. Braginsky and D. Estrin. Rumor routing algorithm for sensor networks. In Proc. of ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA), 2002.
[25] S. Capkun, M. Hamdi, and J.-P. Hubaux. GPS-free positioning in mobile ad-hoc net-works. In Proc. of Hawaii Int’l Conference on Systems Science (HICSS), 2001.
[26] H. Choi, J. Wang, and E. A. Hughes. Scheduling for information gathering on sensor network. ACM/Kluwer Wireless Networks, 2007 (Published online).
[27] T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 2001.
[28] A. Czumaj and W.-B. Strothmann. Bounded degree spanning trees. In Proc. of European Symposium on Algorithms (ESA), 1997.
[29] T. Dam and K. Langendoen. An adaptive energy-efficient MAC protocol for wireless sensor networks. In Proc. of ACM Int’l Conference on Embedded Networked Sensor Systems (SenSys), 2003.
[30] S. Gandham, Y. Zhang, and Q. Huang. Distributed minimal time convergecast scheduling in wireless sensor networks. In Proc. of IEEE Int’l Conference on Distributed Computing Systems (ICDCS), 2006.
[31] D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin, and J. Heidemann. An evaluation of multiresolution storage for sensor networks. In Proc. of ACM Int’l Conference on Embedded Networked Sensor Systems (SenSys), 2003.
[32] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[33] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient communi-cation protocols for wireless microsensor networks. In Proc. of Hawaii Int’l Conference on Systems Science (HICSS), 2000.
[34] B. Hohlt, L. Doherty, and E. Brewer. Flexible power scheduling for sensor networks.
In Proc. of ACM/IEEE Int’l Conference on Information Processing in Sensor Networks (IPSN), 2004.
[35] C.-F. Huang, Y.-C. Tseng, and L.-C. Lo. The coverage problem in three-dimensional wireless sensor networks. Journal of Interconnection Networks, 8(3):209–227, 2007.
[36] Y.-K. Huang, A.-C. Pang, and T.-W. Kuo. AGA: Adaptive GTS allocation with low latency and fairness considerations for IEEE 802.15.4. In Proc. of IEEE Int’l Conference on Communications (ICC), 2006.
[37] IEEE standard for information technology - telecommunications and information ex-change between systems - local and metropolitan area networks specific requirements part 15.4: wireless medium access control (MAC) and physical layer (PHY) specifica-tions for low-rate wireless personal area networks (LR-WPANs), 2003.
[38] IEEE standard for information technology - telecommunications and information ex-change between systems - local and metropolitan area networks specific requirements part 15.4: wireless medium access control (MAC) and physical layer (PHY) specifica-tions for low-rate wireless personal area networks (LR-WPANs)(revision of IEEE Std 802.15.4-2003), 2006.
[39] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva. Directed diffu-sion for wireless sensor networking. IEEE/ACM Trans. Networking, 11(1):2–16, 2003.
[40] G. Kantor, S. Singh, R. Peterson, D. Rus, A. Das, V. Kumar, G. Pereira, and J. Spletzer.
Distributed search and rescue with robot and sensor teams. In Proc. of Int’l Conference on Field and Service Robotics (FSR), 2003.
[41] M. Kochhal, L. Schwiebert, and S. Gupta. Role-based hierarchical self organization for wireless ad hoc sensor networks. In Proc. of ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA), 2003.
[42] J. Konemann, A. Levin, and A. Sinha. Approximating the degree-bounded minimum diameter spanning tree problem. Algorithmica, 41(2):117–129, 2004.
[43] J. Konemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. In Proc. of ACM Symposium on Theory of Computing (STOC), 2000.
[44] Q. Li, M. DeRosa, and D. Rus. Distributed algorithm for guiding navigation across a sensor network. In Proc. of ACM Int’l Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2003.
[45] C.-Y. Lin, W.-C. Peng, and Y.-C. Tseng. Efficient in-network moving object tracking in wireless sensor networks. IEEE Trans. Mobile Computing, 5(8):1044–1056, 2006.
[46] Z. Lotker, M. M. de Albeniz, and S. Perennes. Range-free ranking in sensors networks and its application to localization. In Proc. of Int’l Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW), 2004.
[47] G. Lu, B. Krishnamachari, and C. S. Raghavendra. An adaptive energy-efficient and low-latency MAC for data gathering in wireless sensor networks. In Proc. of IEEE Int’l Parallel and Distributed Processing Symposium (IPDPS), 2004.
[48] J. B. MacQueen. Some methods for classification and analysis of multivariate obser-vations. In Proc. of Berkeley Symposium on Mathematical Statistics and Probability, 1967.
[49] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage prob-lems in wireless ad-hoc sensor networks. In Proc. of IEEE INFOCOM, 2001.
[50] D. Niculescu and B. Nath. DV based positioning in ad hoc networks. Telecommunica-tions Systems Journal, 22(1-4):267–280, 2003.
[51] F. O’Reilly and J. Buckley. Use of wireless sensor networks for fluorescent lighting control with daylight substitution. In Proc. of Workshop on Real-World Wireless Sensor Networks (REANWSN), 2005.
[52] E. Ould-Ahmed-Vall, D. M. Blough, B. S. Heck, and G. F. Riley. Distributed unique global ID assignment for sensor networks. In Proc. of IEEE Mobile Adhoc and Sensor Systems Conference (MASS), 2005.
[53] H. Park, M. B. Srivastava, and J. Burke. Design and implementation of a wireless sensor network for intelligent light control. In Proc. of ACM/IEEE Int’l Conference on Infor-mation Processing in Sensor Networks (IPSN), 2007.
[54] V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. of IEEE INFOCOM, 1997.
[55] N. Patwari, I. Alfred O. Hero, M. Perkins, N. S. Correal, and R. J. OEDea. Rela-tive location estimation in wireless sensor networks. IEEE Trans. Signal Processing, 51(8):2137–2148, 2003.
[56] C. Perkins, E. Belding-Royer, and S. Das. Ad hoc on-demand distance vector (AODV) routing protocol. In IETF RFC (3561), 2003.
[57] R. Peterson and D. Rus. Interacting with a sensor network. In Proc. of Australasian Conference on Robotics and Automation (ICRA), 2002.
[58] J. Sankaran. A note on resolving infeasibility in linear programs by constraint relaxation.
Operations Research Letters, 13(1):19–20, 1993.
[59] C. Schurgers, G. Kulkarni, and M. B. Srivastava. Distributed on-demand address as-signment in wireless sensor networks. IEEE Trans. Parallel and Distributed System, 13(10):1056–1065, 2002.
[60] C. Schurgers and M. B. Srivastava. Energy efficient routing in wireless sensor networks.
In Proc. of Military Communications Conference(MILCOM), pages 357–361, 2001.
[61] V. Singhvi, A. Krause, C. Guestrin, J. H. Garrett, and H. S. Matthews. Intelligent light control using sensor networks. In Proc. of ACM Int’l Conference on Embedded Net-worked Sensor Systems (SenSys), 2005.
[62] K. Sohrabi, J. Gao, V. Ailawadhi, and G. J. Pottie. Protocols for self-organization of a wireless sensor network. IEEE Personal Communications, 7(5):16–27, October 2000.
[63] Y.-C. Tseng, S.-P. Kuo, H.-W. Lee, and C.-F. Huang. Location tracking in a wireless sensor network by mobile agents and its data fusion strategies. The Computer Journal, 47(4):448–460, 2004.
[64] Y.-C. Tseng, S.-Y. Ni, and E.-Y. Shih. Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network. IEEE Trans. Computer, 52(5):545–557, 2003.
[65] Y.-C. Tseng, M.-S. Pan, and Y.-Y. Tsai. Wireless sensor networks for emergency navi-gation. IEEE Computer, 39(7):55–62, 2006.
[66] S. Upadhyayula, V. Annamalai, and S. K. S. Gupta. A low-latency and energy-efficient algorithm for convergecast in wireless sensor networks. In Proc. of IEEE Global Telecommunications Conference (Globecom), 2003.
[67] X. Wang, F. Silva, and J. Heidemann. Infrastructureless location aware configuration for sensor networks. In Proc. of IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), 2004.
[68] Y.-J. Wen, J. Granderson, and A. M. Agogino. Towards embedded wireless-networked intelligent daylighting systems for commercial buildings. In Proc. of IEEE Int’l Confer-ence on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC), 2006.
[69] D. B. West. Introduction to Graph Theory. Prentice Hall, 2001.
[70] M. Yarvis, N. Kushalnagar, H. Singh, A. Rangarajan, Y. Liu, and S. Singh. Exploiting heterogeneity in sensor networks. In Proc. of IEEE INFOCOM, 2005.
[71] W. Ye, J. Heidemann, and D. Estrin. An energy-efficient MAC protocol for wireless sensor networks. In Proc. of IEEE INFOCOM, 2002.
[72] Y. Yu, B. Krishnamachari, and V. K. Prasanna. Energy-latency tradeoffs for data gather-ing in wireless sensor networks. In Proc. of IEEE INFOCOM, 2004.
[73] H. Zhou, M. W. Mutka, and L. M. Ni. Reactive ID assignment for sensor networks. In Proc. of IEEE Mobile Adhoc and Sensor Systems Conference (MASS), 2005.
[74] ZigBee specification version 2006, ZigBee document 064112, 2006.