Optimum Configuration and Measurement Scheme for Dynamic Autonomous Distributed Cooperative Networks

本发明的目的在于将其应用于移动的ad hoc/mesh网络、包含家庭网络的传感器网络、P2P自治网络。(1)移动的ad hoc/mesh网络：在组播通信中，相同的信息被发送到多个目的地，提出了一种新的算法，该算法通过控制中继节点的位置和数量，在静态节点环境和移动的环境下实现了高可靠性和高性能的通信。针对多媒体通信，提出了一种新的算法，该算法采用前向纠错（FEC）机制，通过动态地改变恢复频率和冗余度来提高传输率。(2)传感器网络：针对ZigBee无线传感器网络，提出了一种新的算法，该算法在给定传感器位置的情况下，使汇聚节点（协调器）、中继节点（路由器）和传感器（终端设备）的总功耗最小。当传感器网络用作家庭网络时，还提出了传感器网络和家用电器网络之间的网关的节能软件架构。(3)P2P自治网络：研究了有效的网络广播或洪泛方案以及通信节点间通信流量交换的估计方案。关于有效的网络广播或洪泛，提出了在发送之前将双向链路分解为单向链路的方案，以及每个网络内节点计算以相邻节点为根的最短路径树并将树信息预先存储为路由表的方案。在通信业务交换的估计方案中，作者将估计问题形式化为确定性或概率性优化问题，并给出了每种问题的估计解。

The following research results were obtained aiming at being applied to mobile ad hoc/mesh networks, sensor networks including home networks, and P2P autonomous networks. (1) Mobile ad hoc/mesh networks: In multicast communication in which the same information is transmitted to multiple destinations, a novel algorithm, which enables highly reliable and high performance communication by controlling the placement and the number of relaying nodes, was proposed in both static node environment and mobile environment. Regarding multimedia communication, a new algorithm, which employs Forward Error Correction (FEC) mechanism and highly improves the delivery ratio by dynamically changing the recovery frequency and redundancy, was developed. (2) Sensor networks: Concerning ZigBee which is expected to be deployed as sensor network, a novel algorithm, which minimizes the total power consumption of a sink node (coordinator), relaying nodes (routers) and sensors (end devices) when placement of sensors are given. Energy-efficient software architecture of a gateway between a sensor network and a home appliances network is also proposed when the sensor network is used as a home network. (3) P2P autonomous networks: Research was conducted on efficient network broadcast or flooding scheme and estimation scheme of communication traffic exchange between communication nodes. Regarding the efficient network broadcast or flooding, a scheme in which bidirectional links are decomposed into unidirectional links before sending, and a scheme in which each in-network node calculates the shortest path tree rooted by neighboring nodes and stores the tree information in advance as routing tables were proposed. In the estimation scheme of communication traffic exchange, the authors formalize the estimation problem as a deterministic or probabilistic optimization problem, and give the estimation solution for each problem.