Research On Heterogeneity In Mobile Scene Graph

In this paper, we present a high level distributed scene graph library. This library extended notification mechanism from stand-alone environments to networked environments. By constructing a Master-Slave structure, Library allow programmer to program in an almost transparent manner. Our distributed scene graph includes both locally stored nodes for static scene data as well as nodes across multiple sites. We also demonstrate the functionality of our toolkit with one simple prototype application.As development of distributed virtual environment and wireless network, it is possible to construct mobile virtual environment. Based on large scale virtual environment, such as VRTP, ISTP and DWTP, we present problems and solutions when developing mobile virtual environment communication protocol, such as protocol architecture, reliable transfer, data flow, scene database construction and maintenance. At last, we also show a way to adjust energy consumption through buffering message, and the experiments demonstrated this strategy works very well.Lots of technique has been proposed to solve the consistency of scene graph. We analyzed and compared the application flow and network capability of mobile virtual environments, then represented a new dead reckoning algorithm. This algorithm computes the dead reckoning threshold according to network latency and packet lost rate. The experiments showed that this dead reckoning algorithm matched the network capability and fulfilled the user demand.We present a simplification architecture that allows the exploration of such navigation tradeoffs. This is achieved by a formulating the problem in a generic way and developing software components that allow the dynamic selection of algorithms and constraints. The experimental results show that the architecture is flexible and supports dynamic reconfiguration.