Performance Evaluation Laboratory

Kouhei Otsuyama Assistant Professor	Song Guo Assistant Professor	Gu Qing Visiting Researcher

The laboratory mission in the broad sense is to contribute to: Energy-efficient Computing in Distributed Wireless Sensor Networks Adaptive Security Architectures, Algorithms, and Protocols for Wireless Sensor Networks Power-Aware and High Performance Instruction Scheduling for Embedded Systems New Models of Grid and Ubiquitous Computing for Image Processing Energy-efficient Computing in Distributed Wireless Sensor Networks Recently, research on wireless sensor networks (WSNs) has intensified, and applications of WSNs have spread from the military domain into civilian domains to perform important functions such as security surveillance, fire 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 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 energy-efficient geographical routing techniques based on the accurate positioning information. Adaptive Security Architectures, Algorithms, and Protocols for Wireless Sensor Networks Wireless sensor networks meet several operational challenges, such as energy efficiency in terms of maximizing the lifetime of sensor networks; scalability to a large number (thousands to millions) of nodes; survivability in certain environments where sensors are subject to compromise, capture, and manipulation by adversaries; support for dynamic addition/removal of sensors; and robustness to spontaneous interferences, collisions, and packet losses. Moreover, they are vulnerable to serious security attacks. Different from the wired counterparts, sensor networks do not require any physical contact for communication, and hence, an adversary with a simple radio receiver/transmitter can easily eavesdrop conversation, inject/modify packets, and mount denial-of-service (DoS) attack. Considering the network scale, the highly constrained system resource, and the fact that sensor networks are often deployed in unattended and hostile environments, we set the research objective as to develop efficient and scalable rekeying protocols with autonomous and adaptive capabilities for defending against node compromises in unattended sensor networks. This research will provide fundamental security services covering key management, authentication, compromise detection, and revocation. These services are essential for the successful deployment of sensor networks. Finally, the proposed protocols shall be evaluated in terms of security level, resource efficiency and scalability by theoretical analysis and simulations. Power-Aware and High Performance 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 well-known 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. 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.

Refereed Journal Papers

[sguo-01:2009]	Song Guo and Oliver Yang. A Framework for the Multicast Lifetime Maximization Problem in Energy-Constrained Wireless Ad-hoc Networks. ACM Wireless Networks Journal, 15(3):313 E29, April 2009.
	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 significantly in terms of multicast lifetime.
[sguo-02:2009]	An-Ni Shen, Song Guo, Hung Yu Chien, and Minyi Guo. A Scalable Key Pre-distribution Mechanism for Large-scale Wireless Sensor Networks. Wiley Journal of Concurrency and Computation: Practice and Experience, 21(10):1373 E387, July 2009.
	Many applications of wireless sensor network (WSN) require secure data communications, especially in a hostile environment. In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. Traditional asymmetric key cryptosystems are infeasible in WSNs due to the extremely low capacity and constrained resources at each senor node. Recently proposed protocols are either vulnerable to the largescale node capture attacks or lack of performance scalability in terms of storage, communication and computation costs. To address these limitations, we study the key pre-distribution schemes in this paper and propose a new one with all of the following properties which are particularly beneficial to the large-scale resourceconstrained WSNs: (1) it completely defends against the node capture attacks, (2) it provides full connectivity of the network, and (3) it reduces the storage and communication overhead significantly compared to the other proposals.
[sguo-03:2009]	Mianxiong Dong, Long Zheng, Song Guo, and Minyi Guo. Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment. Journal of Computers, 4(9):873 E80, September 2009.
	As a case study of the ubiquitous computing system, we have implemented a prototype for the JPEG encoding application. In order to achieve this eventual development in the real world, we studied resource allocation policies that can improve the overall performance of the system. In this paper, we consider those static and dynamic allocation approaches and then propose four different allocation algorithms. In particular, we extensively studied the dynamic allocation algorithms by exploring various cache policies which include disabled cache, unrestricted cache and restricted cache. Performance of these algorithms in large scale application scenario is also evaluated based on both the improved prototype and a simulation environment. The experimental results show a significant performance improvement achieved by the new proposed algorithms in terms of load balance, execution time, waiting time and execution efficiency.
[sguo-04:2009]	Feilong Tang, Song Guo, and Mingyi Guo. Tier-Based Scalable and Secure Routing for Wireless Sensor Networks with Mobile Sinks. IEICE Transaction on Information and Systems, E93-D(3):458 E65, March 2010.
	In this paper, we propose a heterogeneous network model where multiple mesh nodes are deployed in a sensor network, and sensed data is collected through two tiers: firstly from a source sensor node to the closest mesh node in multiple-hop fashion (called sensor routing), and then from the mesh node to the base station through long-distance mesh routing (called mesh routing). Based on this network model, we propose an energy-efficient and secure protocol for the sensor routing part that can work well in large-scale sensor networks and resist most of attacks. Experiments demonstrate that our routing protocol significantly reduces average hops for data transmission. Lightweight security mechanism enables the routing protocol to survive from most attacks against sensor networks.
[sguo-05:2009]	Song Guo, An-Ni Shen, and Minyi Guo. A Secure and Scalable Rekeying Mechanism for Hierarchical Wireless Sensor Networks. IEICE Transaction on Information and Systems, E93-D(3):421 E29, March 2010.
	In this paper, we propose a new group rekeying protocol for hierarchical WSNs with renewable network devices. Compared with existing schemes, our rekeying method possesses the following features that are particularly beneficial to the resource constrained large-scale WSNs: (1) robustness to the node capture attack, (2) reactive rekeying capability to malicious nodes, and (3) low communication and storage overhead.
[sguo-06:2009]	Feilong Tang, Mingyi Guo, Song Guo, and Zhihang Yu. Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks. International Journal of Mobile Information Systems, 6(1):65 E3, March 2010.
	We investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in Intel¨s network processor IXPs. The paper presents a graph uniform 2-way partition algorithm FPT (fixed-parameter tractable algorithm), which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.
[sguo-07:2009]	Song Guo and Victor Leung. Exact and Performance-Guaranteed Multicast Algorithms for Lifetime Optimization in WANETs. Wiley Networks, DOI: 10.1002/net.20372, Dec. 2009.
	We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We provide a globally optimal solution to this problem by developing a general MILP formulation that can apply to many directional antenna models, some of which are not supported by the existing formulations. We also investigate the theoretical performance of a well-known heuristic algorithm for this optimization problem in terms of its approximation ratio. We use a graph theoretic approach, for the first time, to derive an upper bound on its approximation ratio in an analytical expression and discover that it is a constant-factor approximation algorithm.
[sguo-08:2009]	Song Guo, Minyi Guo, and Victor Leung. A Message Complexity Oriented Design of Distributed Algorithm for Long-lived Multicasting in Wireless Sensor Networks. International Journal on Sensor Networks, 6(3/4):180  E190, November 2009.
	We consider an optimization problem in wireless sensor networks (WSNs) that is to find a multicast tree rooted at the source node and including all the destination nodes such that the lifetime of the tree is maximized. While a recently proposed distributed algorithm for this problem guarantees to obtain optimal solutions, we show that its high message complexity may prevent such contribution from being practically used in resource-constrained WSNs. In this paper, we proposed a new distributed suboptimal algorithm that achieves a good balance on the algorithmoptimality and message complexity. In particular, we prove that it has a linearmessage complexity. The tradeoff between algorithm sub-optimality and message complexity is also studied by simulations.
[sguo-09:2009]	Minyi Guo, Elizabeth Olule, Guojun Wang, and Song Guo. Designing Energy Efficient Target Tracking Protocol with Quality Monitoring in Wireless Sensor Networks. Journal of Supercomputing, 51(2):131 E48, February 2010.
	Target tracking is one application of wireless sensor networks and energy efficient target tracking algorithms that can be used for accurate tracking are highly desired. In order to achieve energy savings, we focus on reducing energy usage by limiting the number of sensors used to track a target through monitoring their data quality and by limiting the amount of data being sent to the cluster head. We propose an energy efficient target tracking protocol that uses two algorithms to accomplish this goal. Simulation studies show that the network lifetime is extended up to 35effect on target tracking accuracy is not too negative.
[sguo-10:2009]	An-Ni Shen, Song Guo, and Victor Leung. A Flexible and Efficient Key Distribution Scheme for Renewable Wireless Sensor Networks. EURASIP Journal on Wireless Communications and Networking, Volume 2009 (2009), Article ID 240610, 9 pages, doi:10.1155/2009/240610 2009.
	In this paper, we propose a new key distribution scheme for hierarchical WSNs with renewable network devices. Compared to some of the existing schemes, our key establishment methods possess the following features that are particularly beneficial to the resource-constrained large-scale WSNs: (1) robustness to the node capture attack, (2) flexibility for adding new network devices, (3) scalability in terms of storage cost, and (4) low communication overhead.
[sguo-11:2009]	Feilong Tang, Ilsun You, Minyi Guo, and Song Guo. Context-awareWorkflow Management for Intelligent Navigation Applications in Pervasive Environments. Intelligent Automation and Soft Computing, 16(4):605 E19, 2010.
	Pervasive computing is a user-centric distributed computing paradigm, allowing users to access their preferred services even while moving around. To make this vision a reality, context-aware workflow management is one of key issues because the context of pervasive applications is changing instantly. In this paper, we propose a context model for intelligent navigation applications and then present a context-aware workflow management algorithm (CAWM) which can dynamically adjust workflow execution behaviours based on current context information. The correctness of the CAWM algorithm has been also verified theoretically by formulating it as a Petri-net model. Furthermore, the proposed context model and workflow management algorithm can apply to other applications by simply revising the corresponding context structures only.

Refereed Proceeding Papers

[sguo-12:2009]	An-Ni Shen, Song Guo, and Hung-Yu Chien. An Efficient and Scalable Key Distribution Mechanism for Hierarchical Wireless Sensor Networks. In IEEE Sarnoff Symposium (Sarnoff), pages 1-5,DOI: 10.1109/SARNOF.2009.4850313, April 2009.
	In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. In this paper, we propose a new key pre-distribution scheme for hierarchical WSNs with proved peroperties that are particularly beneficial to the resource-constrained largescale WSNs.
[sguo-13:2009]	Yao Shen, Feilong Tang, Minyi Guo, and Song Guo. A Realistic Interference Model in Ad Hoc Networks. In International Conference on Frontier of Computer Science and Technology, pages 292-297, DOI: 10.1109/FCST.2009.78, December 2009.
	Interference has a significant impact on the network communications; hence efforts have been made to reduce it. Although interference has an unambiguous definition, researchers have different opinions about the interference model. There are mainly two kinds of models. One is based on the number of nodes, and the other is based on the signal strength. However, as discussed in this paper, the former kind of models cannot factually reflect the real-world interference, and for the latter, it is difficult to assume the distribution of interfering nodes and the corresponding parameters. Aiming at this issue, we propose a new interference model which is based on the extraneous interfering energy and adopts the probability of interferer transmission. Simulation results illustrate that our model reflects the reality well.
[sguo-14:2009]	Chih-Hao Hsu, Song Guo, Rung-Chin Chen, and Shou-Kuo Dai. Using Domain Ontology to Implement a Frequently Asked Questions System. In World Congress on Computer Science and Information Engineering,csie, vol. 4, pp.714-718, April 2009.
	In recent years, the application of ontology has been already toward the diversification under the development of the semantic web technology. As the communicated bridge of the users and the machines, ontology should be upgraded while the information changes. Thus it is an important subject to expand ontology with the changing information. So we propose an automation on-line FAQ (Frequently Asked Questions) system that has the learning ability. We except that the system can reply answers and extend ontology.
[sguo-15:2009]	Mianxiong Dong, Long Zheng, Kaoru Ota, Song Guo, and Minyi Guo. A Trade-off Approach to Optimal Resource Allocation Algorithm with Cache Technology in Ubiquitous Computing Environment. In IEEE International Conference on Computational Science and Engineering, pages 9-15, DOI: 10.1109/CSE.2009.472, August 2009.
	We have worked on a project to meet these challenges with a goal to construct a framework for the coming ubiquitous society. In our previous works, we have proposed UMP-PerComp, a Ubiquitous Multiprocessor-based pipeline Processing architecture, to support development of powerful and pervasive applications. In this paper, we proposed a new resource allocation policy that can improve the overall performance of the system. In particular, we extensively studied the dynamic allocation algorithms by exploring various cache policies which include disabled cache, unrestricted cache and restricted cache. Performance of these algorithms in large scale application scenario is also evaluated based on both the improved prototype and a simulation environment. The experimental results show a significant performance improvement achieved by the proposed algorithm in terms of load balance, execution time, waiting time and execution efficiency.
[sguo-16:2009]	An-Ni Shen and Song Guo. Key Re-establishment Protocols in Hierarchical Wireless Sensor Networks. In European Wireless, pages 184-188, DOI: 10.1109/EW.2009.5357989, April 2009.
	Traditional asymmetric key cryptosystems are infeasible in WSN due to its low capacity at each senor node. In this paper, we propose a new key distribution scheme for hierarchical WSNs with renewable network devices.
[sguo-17:2009]	Peng Li and Song Guo. Minimizing the Energy Consumption of Behavior- Oriented Parallelization. In International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 821-827, July 2009.
	In this paper, we first establish an energy model for Behavior-Oriented Parallelization (BOP). Then, we present a voltage-gradient assignment algorithm called VGA to minimize the energy consumption of BOP. It offers a good tradeoff between the energy consumption and speedup. The experiments show that energy consumption can be 21.6% lower while the execution time is only 8% times longer than the original BOP system.
[sguo-18:2009]	An-Ni Shen and Song Guo. A Robust Pair-wise Rekeying Protocol in Hierarchical Wireless Sensor Networks. In ACM International Conference on emerging Networking EXperiments and Technologies, pp. 25-26, doi: 10.1145/1658997.1659011, December 2009.
	To support secure communications for many applications in wireless sensor networks (WSNs), some strategies have been proposed to develop the pair-wise rekeying protocol. However, most existing schemes suffer the node capture attack. In this paper, we present a perturbation-based pairwise rekeying scheme for a hierarchical WSN. Our scheme is robust to the node capture attack and also achieves both forward and backward secrecy.
[sguo-19:2009]	Zhuzhong Qian, Song Guo, Minyi Guo, and Sanglu Lu. Contextaware Multimedia Processing System in a Pervasive Environment. In IEEE Global Telecommunications Conference, pages 1-6, DOI: 10.1109/GLOCOM. 2009.5425934, December 2009.
	This paper studies the context-aware multimedia processing problem under the consideration of the QoS from two aspects: delay and media quality. We propose a new measurement, the media quality change ratio, to quantitively describe the adaptability of source media to meet quality requirement of different devices. We further investigate the important issue on how to find an optimal service path according to the users¨requirements which are formulated as functional paths. Our experimental results also validate the proposed algorithm.
[sguo-20:2009]	Song Guo, Zhuzhong Qian, and Sanglu Lu. A General Energy Optimization Model for Wireless Networks Using Configurable Antennas. In ACM Symposium on Applied Computing, pp. 246-250, doi: 10.1145/1774088.1774140, March 2010.
	We consider two fundamental problems of minimizing energy consumption and maximizing the lifetime of a given communication request in multi-hop wireless networks that use configurable antennas and have limited energy resources.We provide a globally optimal solution to this problem by developing a general optimization model that can apply to many antenna models including highly and moderately directional antenna types. Our numerical experiments validate our formulations and the obtained results reveal the performance behavior as a function of antenna and multicast configurations for some network examples.
[sguo-21:2009]	Feilong Tang and Song Guo. A Context-Aware Model for Transaction Management in Mobile and Pervasive Computing Systems. In International Conference on Mobile Computing, Application, and Services, October 2009.
	Transaction management for mobile and pervasive computing (MPC) aims at providing mobile users with reliable and transparent services anytime and anywhere. Traditional mobile transaction models built on client-proxyserver architecture cannot make this vision a reality because little of such models consider context-based transaction management. In this paper, we propose a context-aware transaction model that can adaptively adjust transaction management policies in dynamic transaction contexts.
[sguo-22:2009]	Deze Zeng, Minyi Guo, Song Guo, Mianxiong Dong, and Hai Jin. The Design and Evaluation of a SelectiveWay based Trace Cache. In International Conference on Advanced Parallel Processing Technologies, pages 95-109, doi: 10.1007/978-3-642-03644-6 8, August 2009.
	Conventional trace cache (CTC) usually adopts set associate structure which requires probing all the data ways in parallel, but the output of only the matched way is used, the energy spent for accessing the other ways is wasted. To eliminate or reduce the wasted energy and make trace cache more energy efficient while maintaining high performance, in this paper, we propose an energy efficient trace cache, selective way based trace cache (SWTC), which probes only the selected way(s) instead of probing all the data ways. Simulation results show that it can save 40% energy on average and achieves almost the same performance compared to CTC.
[sguo-23:2009]	Song Guo, Minyi Guo, and Victor Leung. Exploring the Multicast Lifetime Capacity of WANETs with Directional Multibeam Antennas. In IEEE International Conference on Computer Communications (INFOCOM), pages 2686-2690, DOI: 10.1109/INFCOM.2009.5062212, April 2009.
	We explore the multicast lifetime capacity of energy-limited wireless ad hoc networks using directional multibeam antennas by formulating and solving the corresponding optimization problem. In such networks, each node is equipped with a practical smart antenna array that can be configured to support multiple beams with adjustable orientation and beamwidth. The special case of this optimization problem in networks with single beams have been extensively studied and shown to be NP-hard. In this paper, we provide a globally optimal solution to this problem by developing a general MILP formulation that can apply to various configurable antenna models, many of which are not supported by the existing formulations. The multicast lifetime capacity is then quantitively studied by simulations. The experimental results show that using two-beam antennas can exploit most lifetime capacity of the networks for multicast communications.
[sguo-24:2009]	Tao Hu, Song Guo, Minyi Guo, Feilong Tang, and Mianxiong Dong. Analysis of the Availability of Composite Web Services. In International Conference on Frontier of Computer Science and Technology, pages 231-237, DOI: 10.1109/FCST.2009.115, December 2009.
	This paper presents an exploratory study on the availability in composite web service based system. First, we discuss the availability in web services based system, then, a novel approach is introduced to composite web service analysis and design for various composite patterns both from system¨s and client¨s perspective. It is also demonstrated that the presented approach can be used efficiently to analyze the availability of non-redundant service, part-redundant service and all-redundant service, as well as the total system.
[sguo-25:2009]	Deze Zeng, Minyi Guo, Xin Liu, Song Guo, and Hai Jin. An Accurate and Energy Efficient Fetch Direction Orientation Mechanism for Trace Cache. In International Symposium on Embedded Multicore Systems-on-Chip,pages 566-573, DOI: 10.1109/ICPPW.2009.71, September 2009.
	Energy and performance efficiency of fetch unit is critical to processor design. Much research has focused on improving the energy efficiency of trace cache, such as dynamic direction prediction based trace cache (DPTC). A more efficient mechanism called advance direction directed trace cache (ADDTC) is proposed in this paper. By extending branch target buffer (BTB) with trace control information, whether trace cache hits or not can be predicted before access to trace cache. As a result, the fetch direction can be predicted that the simultaneous access can be avoided. We evaluated the energy consumption and performance of ADDTC. ADDTC achieves great energy saving with only little performance degradation.
[sguo-26:2009]	Long Zheng, Mianxiong Dong, Song Guo, and Minyi Guo. I-Cache Tag Reduction for Low Power Chip Multiprocessor. In IEEE International Symposium on Parallel and Distributed Processing with Applications, pp. 196-202, DOI: 10.1109/ISPA.2009.85, August 2009.
	Energy consumption is a major consideration in microprocessor optimization. This paper presents a tag-reduction based approach for energy saving in L1 I-Cache (instruction cache) of Chip Multiprocessors (CMP). To our best knowledge, this is the first work that extends the tag reduction technique to the CMP. We formulate our approach to an equivalent problem which is to find an assignment of the whole instruction pages in the physical memory to a set of cores such that the tag-reduction conflicts for each core can be mostly avoided or reduced. We then propose three algorithms using different heuristics for this assignment problem. The experimental results show that our proposed algorithms can save the total power up to 45.33% in average compared to the one that the tag-reduction is not used. They outperform significantly the tag-reduction based algorithm on single-core processor as well.
[sguo-27:2009]	Feilong Tang and Song Guo. A Context-Aware Model for Transaction Management in Mobile and Pervasive Computing Systems. In International Conference on Mobile Computing, Application, and Services, October 2009.
	Transaction management for mobile and pervasive computing (MPC) aims at providing mobile users with reliable and transparent services anytime and anywhere. Traditional mobile transaction models built on client-proxyserver architecture cannot make this vision a reality because little of such models consider context-based transaction management. In this paper, we propose a context-aware transaction model that can adaptively adjust transaction management policies in dynamic transaction contexts.

Grants

[kohei-o-01:2009]	K. Otsuyama H. tarasaka. Fukushima Pref. Transdisciplinarity Research Organization Fund, 2009.
[sguo-28:2009]	Song Guo. JSPS Grant-in-Aid for Scientific Research, 2008 - 2010.

Academic Activities

[sguo-29:2009]	Song Guo, 2009. Vice Program Co-Chair, International Conference on Frontier of Computer Science and Technology
[sguo-30:2009]	Song Guo, 2001 -. Member, ACM, IEEE, IEEE ComSoc
[sguo-31:2009]	Song Guo, 2010 -. Editor, Ad Hoc & Sensor Wireless Networks
[sguo-32:2009]	Song Guo, 2010 -. Editor, Ad Hoc & Sensor Wireless Networks
[sguo-33:2009]	Song Guo, 2010. Publicity Co-Chair, International Conference on Embedded Software and Systems
[sguo-34:2009]	Song Guo, 2010 -. Editor, International Journal of Digital Content Technology and its Applications
[sguo-35:2009]	Song Guo, 2006 -. Editorial Board Member, the Open Information Systems Journal
[sguo-36:2009]	Song Guo, 2009. Reviewing Activities for Archived Journals: IEEE Transactions on Computers IEEE Transactions on Wireless Communications EURASIP Journal on Wireless Communications and Networking Wireless Communications and Mobile Computing Cluster Computing Computer Communications IEICE Transactions on Information and Systems Security and Communication Networks Journal of Supercomputing International Journal of Communication Systems
[sguo-37:2009]	Song Guo, 2009. Guest Associate Editor, IEICE Transactions on Information and Systems
[sguo-38:2008]	Song Guo, 2009 - 2010. Member of Program Committee: ACMWorkshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, 2009 IEEE Workshop on Performance Analysis and Enhancement of Wireless Networks, 2009 International Workshop on Performance Evaluation of Wireless Networks, 2009 IEEE International Conference on Scalable Computing and Communications, 2009 IEEE International Conference on Computational Science and Engineering, 2009 ACIS Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2009 IEEE Conference on Computer and Information Science, 2009 & 2010 IEEE/IFIP Symposium on Trust, Security and Privacy for Pervasive Applications, 2009 & 2010 Conference on Information Systems, Technology and Management, 2009 & 2010 IEEE Conference on Embedded Software and Systems, 2009 & 2010 IEEE Conference on Ubiquitous Intelligence and Computing, 2009 & 2010 International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks, 2009 & 2010 IEEE International Workshop on Wireless Network Algorithm and Theory, 2009 & 2010 International Symposium on Embedded Multicore Systems-on-chip, 2009 & 2010 IEEE Wireless Communications and Networking Conference, 2010 International Conference on Ubiquitous Information Technologies & Applications, 2010 International Workshop on Advances in Emerging Wireless Networks and Systems, 2010 IEEE Symposium on Personal, Indoor and Mobile Radio Communications, 2010 IEEE International Conference on Embedded Software and Systems, 2010 International Conference on Network-Based Information Systems, 2010 International Symposium on Aware Computing, 2010 IFIP Conference on Embedded and Ubiquitous Computing, 2010
[sguo-39:2008]	Song Guo, 2004 -. Technical Committee, IEEE Ad Hoc and Sensor Networks Technical Committee

Ph.D, Master and Graduation Theses

[kohei-o-02:2009]	Ryouma Nishimoto. Graduation Thesis: A study of the mixi community, University of Aizu, 2009. Thesis Advisor: K. Otsuyama
[kohei-o-03:2009]	Takuya Yokoyama. Graduation Thesis: Development of the Techniques for OpenSocial Rich Contents Application, University of Aizu, 2009. Thesis Advisor: K. Otsuyama
[kohei-o-04:2009]	Manabu Hozumi. Graduation Thesis: Development of the WEB-Based Japan design system, University of Aizu, 2009. Thesis Advisor: K. Otsuyama
[kohei-o-05:2009]	Tomomi Otani. Graduation Thesis: Performance Evaluation of OpenMP and MPI, University of Aizu, 2009. Thesis Advisor: K. Otsuyama
[sguo-40:2009]	Masayuki Moriguchi. Master Thesis: Parallel-stream Architecture Enhancement of Network-based Data Flow Processing System, University of Aizu, 2009. Master Supervisor: Song Guo
[sguo-41:2009]	Hiroyuki Sasajima. Graduation Thesis: Development and Performance Evaluation of Dynamic Processing Library Server in Ubiquitous Multi- Processor Systems, University of Aizu, 2009. Master Supervisor: Song Guo Guo
[sguo-42:2009]	Tetsuya Watanabe. Graduation Thesis: The Learning Effect of 3-D Sound Perception with a Horizontally Arranged Speaker System, University of Aizu, 2009. Thesis Co-Advisor: Song Guo

Others

[kohei-o-06:2009]	K. Otsuyama, K. Okudaira, H. Terasaka and others. K. Otsuyama, K. Okudaira, H. Terasaka and others.
[kohei-o-07:2009]	K.Otsuyama. Talk at Fukushima Pref. Transdisciplinarity Research Organization

2011 THE UNIVERSITY OF AIZU ALL RIGHTS RESERVED