Performance Evaluation Laboratory

Minyi Guo Professor	Kouhei Otsuyama Assistant Professor	Song Guo Assistant Professor	Guojun Wang Visiting Researcher

The laboratory mission in the broad sense is to contribute to: New Models of Grid and Ubiquitous Computing for Image Processing Power-Aware Instruction Scheduling for Embedded Systems Energy-efficient and Secure Computing in Distributed Wireless Sensor Networks New Models of Grid and Ubiquitous Computing for Image Processing The main purpose of this research is to explore new software models/toolkits, named Ubiquitous Multi-Processor (UMP) system, to support distributed application development over the emerging ubiquitous/pervasive computing environment, such as ubiquitous computing, Peer-to-Peer (P2P) computing, and mobile computing environments. In the proposed application scenario, there are many PCs equipped with some UMPs. These PCs are distributed over different domains (each PC belongs and only belongs to one domain). There also has a resource router in each domain taking charge of UMP management request processing. In the system, the behaviors of UMPs are controlled by corresponding resource router. Once it registers to the resource router successfully, a UMP will listen and accept for the task scheduled by the resource router. the UMP will also update it status information to the resource router when a task is finished. To support mobile computing environments, the resource router should be aware of the location of mobile users and be able to locate available UMPs from the nearest domain, so as to reduce the communication cost for the request. Power-Aware Instruction Scheduling for embedded systems In most of compilers, the goal of traditional instruction scheduling algorithms is to improve performance in terms of execution time. This can be done by some wellknown ways such as superblock scheduling, hyperblock scheduling, and treegion scheduling. These scheduling strategies focus mainly on increasing performance through increasing the amount of instruction-level parallelism in program code. However, in VLIW (very long instruction word) architectures, an instruction word consists of a variable number of individual instructions. Therefore the step power and peak power consumption vary significantly depending on the parallel schedule generated by compiler. Power variation reduction without losing execution speed is an important scheduling constraint for embedded VLIW architectures. In this research, we studied some power-aware scheduling strategies for VLIW processors. These scheduling methods include low power scheduling for basic blocks with integer programming Modulo and Software Pipelining for loops Register allocation and cache reuse for power reduction. Energy-efficient and Secure Computing in Distributed Wireless Sensor Net- works Recently, research on wireless sensor networks (WSNs) has intensied, and applications of WSNs have spread from the military domain into civilian domains to perform important functions such as security surveillance, re protection, and monitoring of environmental conditions, medical patients, forest resources, and wildlife habitats, etc. These potential applications of WSNs are at an early stage of development, and much research remains to be done to make the widespread deployment of WSNs commercially viable. This research is intended to advance the frontiers of WSN research by developing techniques that enhance the performance and usefulness of WSNs. These techniques address the problems of efficiently and reliably collecting, processing, transmitting, receiving and routing sensor data from a collection of sensor nodes to the intended data sinks. Low power consumption of sensor nodes is paramount to enable a long operating lifetime for distributed sensor networks. We develop practical and secure distributed localization techniques that leverage the precise positioning of a small subset of all sensor nodes to allow other sensor nodes to accurately determine their positions, and secure and energy-efficient efficient geographical routing techniques based on the accurate positioning information.

Refereed Journal Papers

[minyi-01:2007]	M. Mostafa A. Azim, Xiaohong Jiang, Pin-Han Ho, Susumu Horiguchi, and Minyi Guo. Restoration Probability Modelling for Active Restoration- Based Optical Networks with Correlation Among Backup Routes. IEEE Transactions on Parallel and Distributed Systems, 18(11):1592-1606, November 2007.
	Active restoration (AR) is a novel lightpath restoration scheme proposed recently to guarantee a certain degree of survivability in wavelength-division multiplexing (WDM) optical networks with a reasonable trade-off between capacity requirement and restoration time. In this paper, we conduct a comprehensive performance analysis for AR-based optical networks. In particular, we propose a novel analytical framework for modeling the restoration probability of a connection (the probability that the connection can be successfully restored in case of a failure) when the possible correlation among its multiple backup routes is incorporated. Although theoretically, we need to consider all the possible correlations between as many as N2 pairs of backup routes to analyze the restoration probability in a network with N nodes, and this high computation complexity may obscure the practicality of an approach, considering all the possible correlations among backup routes, our analysis in this paper indicates that by considering at most the possible correlations among any three successive backup routes of a connection, we can achieve a very good approximation to the simulated restoration probability of the connection, as veried by extensive simulation results upon two typical network topologies under various workloads. We nd that the proposed framework can deeply investigate into the inherent relationship among restoration probability, wavelength channel utilization ratio, number of wavelengths per ber, routes hop length, and wavelength conversion capability. As a result, the framework signicantly contributes to the related areas by providing network designers with a quantitative tool to evaluate the restoration probability and, thus, the survivability of AR-based optical networks.
[minyi-02:2007]	Guojun Wang, Jie Ouyang, Hsiao-Hwa Chen, and Minyi Guo. Efficient Group Key Management for Multi-Privileged Groups. Computer Commu- nication, 30(11-12):2497-2509, October 2007.
	Multi-privileged group communications containing multiple data streams have been studied in the traditional wired network environment and the Internet. With the rapid development of mobile and wireless networks and in particular mobile adhoc networks (MANETs), the traditional Internet has been integrated with mobile and wireless networks to form the mobile Internet. The multi-privileged group communications can be applied to the mobile Internet. Group users can subscribe to different data streams according to their interest and have multiple access privileges with the support of multi-privileged group communications. Security is relatively easy to be guaranteed in traditional groups where all group members have the same privilege. On the other hand, security has been a challenging issue and is very difficult to handle in multi-privileged groups. In this paper, we rst introduce some existing rekeying schemes for secure multi-privileged group communications and analyze their advantages and disadvantages. Then, we propose an efficient group key management scheme called ID-based Hierarchical Key Graph Scheme (IDHKGS) for secure multi-privileged group communications. The proposed scheme employs a key graph, on which each node is assigned a unique ID according to access relations between nodes. When a user joins/leaves the group or changes its access privileges, other users in the group can deduce the new keys using one-way function by themselves according to the ID of joining/leaving/changing node on the graph, and thus the proposed scheme can greatly reduce the rekeying overhead.
[minyi-03:2007]	Baoliu Ye, Minyi Guo, Daoxu Chen, and Sanglu Lu. A degreeconstrained QoS-aware routing algorithm for application layer multicast. Information Sciences, 107(8):3613-3636, August 2007.
	Application layer multicast (ALM) provides a low-cost solution for multicast over the Internet. It overcomes the deployment hurdle of IP multicast by moving all multicast related functions from network routers to end-hosts. However, since packet replication is performed on end-hosts, the system performance of an ALM is limited by the bandwidth of end-hosts. Therefore, degree-constrained QoS-aware multicast routing becomes one of the key concerns for implementing realtime multicast services, such as continuous streaming applications. In this paper, we claim that the QoS gained by most users will be better evaluated using the overall latency, and we explore the optimization of Degree-Constrained Minimum Overall Latency Spanning Tree (DCMOLST). The process for optimizing the overall latency is divided into two phases, i.e., the initialization phase and the dynamic adjustment phase. In the former phase, we present a heuristic DCMOLST algorithm which negotiates both transmission delay and node bandwidth simultaneously, so as to avoid QoS degradation caused by any single metrics. In the later phase, we dene a set of distributed iterative optimizing operations to swap the position between nearby end-hosts for further optimization. Experimental results show that the proposed degree-constrained QoS-aware routing algorithm could improve the overall performance of application layer multicast services.
[minyi-04:2007]	Mianxiong Dong, Kaoru Ota, Feilong Tang, Minyi Guo, and Zixue Cheng. Assist Your Study at Home: Design, Implementation and Evaluation of the ULS System. International Journal of Smart Home, 2(1):33-48, January 2008.
	With the great progress of technologies, computers are embedded into everywhere to make our daily life convenient, efficient and comfortable. Further more, most of them are small, powerful, intelligent and invisible. In a ubiquitous computing environment, support methods for learning are more effective than some traditional ways, such as WBT (Web-Based Training) and e-learning. In this paper, we proposed a support method which aims to encourage a learner to acquire his/her learning habit based on Behavior Analysis. The supports to the learner are provided through a scheduler system, a Ubiquitous Learning Scheduler (ULS). In our design, the learner's situations are collected by sensors and analyzed by comparing them to his/her learning histories. Based on this information, supports are provided to the learner in order to help him/her forming a good learning style. Our Research results revealed that ULS not only beneted learners to acquire their learning habits but also improved their self-directed learning styles.
[minyi-05:2007]	Feilong Tang, Minyi Guo Minlu Li, Cho li Wang, and Mianxiong Dong. Secure Routing for Wireless Mesh Sensor Networks in Pervasive Environment. International Journal of Intelligent Control and Systems, 12(4):293- 306, December 2007.
	Wireless mesh sensor network (WMSN) is a new architecture that merges advantages of wireless mesh networks and wireless sensor networks, especially on scalability, robustness and balanced energy dissipation. Secure routing in WMSNs faces with more challenges than that in traditional sensor networks by reason of multiple sink nodes and the mobility of nodes. In this paper, we propose a scalable architecture of WMSNs, discuss and analyze key research issues under the proposed architecture, and then design two routing protocols aiming at minimizing the number of hops between a source node and a destination node and maximizing the lifetime of sensor networks. Considering new challenges to security in WMSNs, this paper also presents a secure routing protocol SecMLR, which can resist most of attacks against routing in WMSNs and work in energy-efficient way.
[minyi-06:2007]	Minyi Guo and Jingling Xue. Advances in high performance computing. The Journal of Supercomputing, 43(2):105-106, February 2008.
	Forward of a special issue in the Journal of Supercomputing
[sguo-01:2007]	Song Guo, Oliver Yang, and Victor Leung. Tree-based Distributed Multicast Algorithms for Directional Communications and Lifetime Optimization in Wireless Ad Hoc Networks. EURASIP Journal on Wireless Communi- cations and Networking, 2007.
	We propose a group of distributed algorithms for multiple multicast in WANETs (Wireless Ad hoc Networks) using directional antennas. Our performance evaluation shows that they outperform other centralized multicast algorithms signicantly in terms of network lifetime.
[sguo-02:2007]	Song Guo and Oliver Yang. Localized Operations for Distributed Minimum Energy Multicast Algorithm in Mobile Ad Hoc Networks. IEEE Trans- actions on Parallel and Distributed Systems, 18(2):186 - 198, 2007.
	We consider mobile ad hoc networks (MANETs) that use omni-directional antennas and have limited energy resources. We propose the design and performance evaluation of the Distributed Minimum Energy Multicast (DMEM) algorithm for MANETs that attempts to reduce as much as possible the total RF energy required by the multicast communication. Several localized operations are presented for the DMEM algorithm, in which each node requires only the knowledge of and distances to all neighboring tree nodes. Through extensive simulation study, we show that these operations are very ecient both in terms of energy saving and operation overhead.
[sguo-03:2007]	Song Guo and Oliver Yang. A Framework for the Multicast Lifetime Maximization Problem in Energy-Constrained Wireless Ad-hoc Networks. ACM Wireless Networks Journal, 2007.
	We provide a globally optimal solution to the multicast lifetime maximization problem for a special case of using omni-directional antennas. This graph theoretic approach provides us insights into more general case of using directional antennas, and inspires us to produce a group of heuristic algorithms. Experimental results show that minimum total power consumption does not guarantee maximum lifetime for either broadcasting or multicasting, and our algorithms outperform other energy-aware multicast algorithms signicantly in terms of multicast lifetime.
[sguo-04:2007]	Song Guo and Oliver Yang. Energy-Aware Multicasting in Wireless Ad hoc Networks: A survey and Discussion. Elsevier Computer Communica- tions Journal, 30(9):2129 - 2148, 2007.
	There are mainly two fundamental classes of energy-aware broadcast/multicast problem in recent research: the MEB/MEM (Minimum Energy Broadcast/ Multicast) problem and the MLB/MLM (Maximum Lifetime Broadcast/ Multicast) problem in wireless ad hoc networks with omni-directional and directional antennas. In order to provide a better understanding of the research challenges of the energy-aware multicast routing, this article presents a systematical investigation of current state-of-the-art algorithms for these two classes of optimization problems. Taxonomy, comparison and open research issues for each problem are also discussed, with an objective to inspire new research interests in this eld.
[sguo-05:2007]	Song Guo and Oliver Yang. Maximizing Multicast Communication Lifetime in Wireless Mobile Ad Hoc Networks. IEEE Transactions on Vehicular Technology, 2008.
	Unlike most multicast algorithms that use centralized greedy algorithms to achieve maximum-lifetime in static ad hoc networks, we present two distributed multicast algorithms for the same optimization problem in mobile ad hoc networks. Our distributed algorithms also explore the localized operations to take the advantages of power saving offered by the wireless multicast advantage property in mobile networks. The extensive simulation results have shown that our algorithms outperform other proposals in terms of multicast lifetime under different node mobilities.

Refereed Proceeding Papers

[minyi-07:2007]	Elizabeth Olule, Guojun Wang, Minyi Guo, and Mianxiong Dong. RARE: An Energy-Efficient Target Tracking Protocol for Wireless Sensor Networks. In Proceedings of 36th International Conference on Parallel Pro- cessing Workshops (ICPP Workshops 2007), pages 76{82, Xi'an, China, September 2007. IEEE, IEEE Computer Press.
[minyi-08:2007]	Arata Shinozaki, Mitsunori Kubo, Takayuki Nakatomi, Baoliu Ye, and Minyi Guo. Hardware Implementation of Common Protocol Interface for a Network-Based Multiprocessor. In Proceedings of the 2007 International Symposium on Parallel and Distributed Processing and Applications (ISPA 2007), 4742, pages 303-313, Niagara Falls, Canada, August 2007. Springer.
	Lecture Notes in Computer Science
[minyi-09:2007]	Mianxiong Dong, Shinji Watanabe, and Minyi Guo. Performance Evaluation to Optimize the UMP System Focusing on Network Transmission Speed. In Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technoloty, pages 7-12, Wuhan, China, November 2007. IEEE, IEEE CS Press.
[minyi-10:2007]	Mitsunori Kubo, Baoliu Ye, Arata Shinozaki, and Minyi Guo:. A Ubiquitous Multiprocessor Network-Based Pipeline Processing Framework for Pervasive Computing Environments. In Proceedings of 21st International Conference on Advanced Information Networking and Applications (AINA 2007), pages 611-618, Niagara Falls, Canada, May 2007. IEEE, IEEE Computer Press.
[minyi-11:2007]	Arata Shinozaki, Masatoshi Shima, Minyi Guo, and Mitsunori Kubo. Multiprocessor Simulator System Based on Multi-way Cluster Using Double-buffered Model. In Proceedings of 21st International Conference on Advanced Information Networking and Applications (AINA 2007), pages 893{900, Niagara Falls, Canada, May 2007. IEEE, IEEE Computer Press.
[minyi-12:2007]	Guojun Wang, Qiong Wang, Jiannong Cao, and Minyi Guo. An Effective Trust Establishment Scheme for Authentication in Mobile Ad Hoc Networks. In Proceedings of the International Conference on Computer and Information Technology (CIT 2007), pages 749-754, Aizuwakamatsu, Japan, October 2007. IEEE, IEEE CS Press.
[minyi-13:2007]	Feilong Tang, Minglu Li, and Minyi Guo. ShanghaiGrid and intelligent urban traffic applications. In Proceedings of the Asian Technology Informa- tion Program's (ATIP's) Third Workshop on High-Performance Computing in China, pages 131-140, Reno, USA, November 2007. ACM Press.
[minyi-14:2007]	Mianxiong Dong, Kaoru Ota, Minyi Guo, and Zixue Cheng. Ubiquitous Laboratory: A Research Support Environment for Ubiquitous Learning Based on Sensor Networks. In Proceedings of the International Confer- ence on Embedded and Ubiquitous Computing, EUC 2007 Workshops, 4809, pages 377-388, Taipe, Taiwan, December 2007. Springer.
	Lecture Notes in Computer Science
[minyi-15:2007]	Feilong Tang, Minglu Li, Minyi Guo, Zhengwei Qi, Yi Wang, Yanqin Yang, and Daqiang Zhang. Transaction Management for Grid Work ow Applications. In Proceedings of Sixth International Conference on Grid and Cooperative Computing, pages 705-712, Urumchi, China, August 2007. IEEE Communications Society.
[minyi-16:2007]	Feilong Tang, Minyi Guo, Minglu Li, Yanqin Yang, Daqiang Zhang, and Yi Wang. Wireless Mesh Sensor Networks in Pervasive Environment: a Reliable Architecture and Routing Protocol. In Proceedings of 36th Inter- national Conference on Parallel Processing Workshops (ICPP Workshops 2007), pages 72-75, Xi'an, China, September 2007. IEEE, IEEE Computer Press.
[minyi-17:2007]	Guojun Wang, Qingjun Mo, Minyi Guo, and Weijia Jia. Designing Piecewise Qos Routing Protocol in Large-Scale MANETs. In Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technoloty, pages 1-6, Wuhan, China, November 2007. IEEE, IEEE CS Press.
[minyi-18:2007, sguo-06:2007]	Mianxiong Dong, Song Guo, Minyi Guo, and Shinji Watanabe. Design of the Ubiquitous Multi-Processor System Focusing on Transmission Data Size. In Proceedings of The International Workshop on High Performance and Highly Survivable Routers and Networks (HPSRN), pages 158-166, Sendai, Japan, March 2008. Tohoku University, Kitanihon Printing.
	We conducted a performance evalution on our previouly proposed ubiquitous multiprocessor-based pipeline processing architecture UMP. In this paper, we evaluated the network transmission speed of UMP system to reduce the network overhead. Our experiments revealed that the data size of transmission can highly in- uence the performance of the whole UMP system.
[minyi-19:2007, sguo-07:2007]	Song Guo, Minaxiong Dong, Minyi Guo, and Liang Chen. A Graph Theoretic Approach to Evaluate the Performance of Lifetime- Centric Multicast Algorithms in Ad Hoc Networking. In Proceedings of The International Workshop on High Performance and Highly Survivable Routers and Networks (HPSRN), pages 181-189, Sendai, Japan,March 2008. Tohoku University, Kitanihon Printing.
[minyi-20:2007, sguo-08:2007]	Song Guo, Mianxiong Dong, and Minyi Guo. Performance Analysis of Heurisitc Algorithms for Lifetime-Aware Directional Multicasting in Wireless Ad Hoc Networks. In Proceedings of 22nd International Conference on Advanced Information Networking and Applications (AINA 2008), IEEE Workshop on Performance Analysis and Enhancement of Wireless Networks (PAEWN), pages 1311-1316, Okinawa, Japan, March 2008, IEEE Computer Press.
	In order to provide a better understanding of the research challenges of the energyaware multicast routing, this paper presents simulation based analysis to assess the performance of a group of state-of-the-art algorithms under various network congurations.
[sguo-09:2007]	Song Guo, Oliver Yang, and Victor Leung. Improving Scalability for Longest-lived Multicast Using Localized Operations in WANETs. In IEEE Communications Society Conference on Sensor, Mesh, and Ad Hoc Com- munications and Networks (SECON), volume June, pages 243 - 252, 2007.
	We explore some important properties of min-max Steiner tree problem and obtain a min-max-tree max-min-cut theorem, which connects some important while separated results in recent literature together under the same philosophy. We also apply the theorem to derive our algorithms and localized operations that can construct a global optimal maximum lifetime multicast tree for a static resource-constrained (e.g. memory and computation capability) wireless multihop network. The distributed algorithms have low complexity for both memory and computation requirements at each node. Our localized operations allow our distributed algorithms with expected linear communication complexity. To our best knowledge, this is the rst contribution that possesses all the desirable properties of distributed, localized, and scalable for the maximum-lifetime multicast problem, and is especially benecial to the large-scale resource-limited wireless multihop networks, like sensor networks.
[sguo-10:2007]	Song Guo, Oliver Yang, Victor Leung, and Liang Chen. Two Performance Guaranteed Multicast Algorithms for Lifetime Optimization in WANETs. In International Network Optimization Conference (INOC), April 2007.
	We use mathemetical analysis to evaluate the lifetime performance of two centralized algorithms S-DPMT and D-DPMT that have been recently proposed. 52
[sguo-11:2007]	Song Guo, Oliver Yang, and Victor Leung. Analytical Performance Evaluation of Distributed Multicast Algorithms for Directional Communications in WANETs. In IFIP Networking, May 2007.
	We use analytical approach to evaluate two famous distributed algorithms DMMTOA and DMMT-DA in terms of multicast lifetime.
[sguo-12:2007]	Song Guo, Oliver Yang, and Victor Leung. pproximation Algorithms for Longest-lived Directional Multicast Communications in WANETs. In ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 190 - 198, September 2007.
	Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their performance has been studied by simulations; however, their theoretical performance in terms of approximation ratio is still unknown. In this paper, we use the graph theoretic approach, by the rst time, to derive the upper bound of the approximation ratio in an analytical expression for these algorithms. We have also discovered that these upper bounds are nite numbers. Based on this analysis and some key observations, we present a new distributed constant-factor approximation algorithm in order to achieve a higher performance. This effort is validated by our simulation studies.

Books

[minyi-21:2007]	Laurence Tianruo Yang Weijia Jia Minyi Guo Rodrigo Fernandes de Mello Ivan Stojmenovic, Ruppa K. Thulasiram. Parallel and Distributed Computing with Applications. Number 4742 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007.
[minyi-22:2007]	Minyi Guo Laurence Tianruo Yang Zili Shao Tei-Wei Kuo, Edwin Hsing- Mean Sha. Embedded and Ubiquitous Computing. Number 4808 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007.
[minyi-23:2007]	Hai jin and Minyi Guo. Frontier of Computer Science and Technology. IEEE Computer Society Press, USA, 2007.

Grants

[sguo-13:2007]

Song Guo. JSPS Grant-in-Aid for Scientic Research, 2008 - 2010.

Academic Activities

[minyi-24:2007]	Minyi Guo, August 2007. Steering Committee Chair, The 2007 International Symposium on Parallel and Distributed Computing with Applications (ISPA2006).
[minyi-25:2007]	Minyi Guo, December 2007. Steering Committee Chair, the 2007 International Conference on Embedded and Ubiquitous Computing
[minyi-26:2007]	Minyi Guo, 2002-. member, IEICE
[minyi-27:2007]	Minyi Guo, 2000-. member, ACM
[minyi-28:2007]	Minyi Guo, 2000-. Senior member, IEEE, IEEE Computer Society
[minyi-29:2007]	Minyi Guo, 1995-. member, IPSJ
[sguo-14:2007]	Song Guo, 2007 - 2008. Member of Technical Program Committee: ACIS Conference on Software Engineering, Articial Intelligence, Networking, and Parallel/Distributed Computing IEEE Global Telecommunications Conference IEEE Conference on Computer and Information Science International Conference on Communications and Networking in China IEEE Wireless Communications and Networking Conference IEEE Symposium on Personal, Indoor and Mobile Radio Communications International Workshop on Modelling and Design of Wireless Mesh Networks IFIP Conference on Embedded and Ubiquitous Computing
[sguo-15:2007]	Song Guo, February 2008. Invited speaker at Center for Strategy of International Programs (CSIP) Symposium, University of Aizu
[sguo-16:2007]	Song Guo, 2007 - 2008. Reviewing Activities for Archived Journals: IEEE Transactions on Mobile Computing IEEE Transactions on Computers IEEE Transactions on Vehicular Technologies IEEE Transactions on Parallel and Distributed Systems IEEE Communications Letters IEEE Communications Magazine ACM Wireless Networks Elsevier Ad Hoc Networks Journal Parallel Processing Letters
[sguo-17:2007]	Song Guo, 2007 - 2008. Reviewing Activities for International Conferences: IEEE Global Telecommunications Conference IEEE International Conference on Communications IEEE Wireless Communications and Networking Conference International Tele-trac Congress IEEE Conference on Computer and Information Science Conference on Communications and Networking in China IEEE Symposium on Personal, Indoor and Mobile Radio Communications
[sguo-18:2007]	Song Guo, 2004 -. Technical Committee, IEEE Ad Hoc and Sensor Networks Technical Committee
[sguo-19:2007]	Song Guo, 2006 -. Editorial Board Member, the Open Information Systems Journal
[sguo-20:2007]	Song Guo, 2001 -. Members of ACM, IEEE, IEEE ComSoc
[sguo-21:2007]	Song Guo, 2008. General Chair: International Workshop on Modeling, Analysis and Simulation of Sensor Networks (MASSN) International Workshop on Ubiquitous Wireless Mesh Networking (UWMN)

Ph.D. and Other Theses

[minyi-30:2007]	Ryo Takamizawa. Graduation Thesis: A 3-D Sound System using High Mounted Speakers, University of Aizu, 2007. Thesis Advisor: Minyi Guo.
[minyi-31:2007]	Yuuichi Mori. Graduation Thesis: Advanced Optimization for ARM, University of Aizu, 2007. Thesis Advisor: Minyi Guo.
[minyi-32:2007]	Hironori Hashiba. Graduation Thesis: Performance Evaluation of Ubiquitous Multiprocessor for Movie Processing, University of Aizu, 2007. Thesis Advisor: Minyi Guo.
[sguo-22:2007]	Sekiguchi Riyuusuke. Graduation Thesis: Localization Algorithms for Wireless Sensor Networks, University of Aizu, 2007. Thesis Advisor: Song Guo
[sguo-23:2007]	Sakuma Tatsuya. Graduation Thesis: Dependability Issues with Ubiquitous Wireless Access, University of Aizu, 2007. Thesis Advisor: Song Guo
[sguo-24:2007]	Ootomo Yuuma. Graduation Thesis: Routing Protocols in Mobile Ad Hoc Networks, University of Aizu, 2007. Thesis Advisor: Song Guo
[sguo-25:2007]	Jaco Kruger. Master Thesis: An open simulator for heterogeneous selforganizing networks, University of Northern British Columbia, Canada, 2007 - 2008. Supervisory committee member: Song Guo
[sguo-26:2007]	Robert Pringle. Master Thesis: A scalable framework for light-weight network simulation, University of Northern British Columbia, Canada, 2007 - 2008. Supervisory committee member: Song Guo

Others

[minyi-33:2007]	Minyi Guo. Editor in Chief, International Journal of Embedded Systems
[minyi-34:2007]	Minyi Guo. Editor, Journal of Embedded Computing
[minyi-35:2007]	Minyi Guo. Editor, International Journal of Web and Grid Services
[minyi-36:2007]	Minyi Guo. Editor, International Journal of High Performance Computing and Networking
[minyi-37:2007]	Minyi Guo. Editor, International Journal of Computer and Applications
[minyi-38:2007]	Minyi Guo. Editor, Journal of Pervasive Computing and Communications
[sguo-27:2007]	Song Guo. Information Technology Award, Funai Foundation for Information Technology, 2008.

2009 THE UNIVERSITY OF AIZU ALL RIGHTS RESERVED