Fixed collision rate back-off scheme for collision resolution in wireless networks

This investigation proposes a fixed collision rate (FCR) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. It is shown that, when maximum throughput is achieved, collision rate is almost a constant for any traffic load. In the operation of the FCR, the CU dynamically adjusts the back-off window size to keep the collision rate at a constant level for maximum throughput. Simulation results demonstrate that the unfairness of bandwidth utilization in the BEB is significantly lessened and the throughput can be maintained at e^-1≈0.368 when the number of users approaches infinity. The capture effect even further improves system performance.     

关于松辽盆地内部地体碰撞的探讨

通过对地震资料中特殊现象的解释提出了松辽盆地内部东西地体碰撞的看法,合理地解释了松辽盆地滨北地区地质现象的形成机制,并且认为地体碰撞带可能是无机生油的有利场所。     

A visual tool for computer supported learning: The robot motion planning example

We introduce an effective computer aided learning visual tool (CALVT) to teach graph-based applications. We present the robot motion planning problem as an example of such applications. The proposed tool can be used to simulate and/or further to implement practical systems in different areas of computer science such as graphics, computational geometry, robotics and networking. In the robot motion planning example, CALVT enables users to setup the working environment by creating obstacles and a robot of different shapes, specifying starting and goal positions, and setting other path or environment parameters from a user-friendly interface. The path planning system involves several phases. Each of these modules is complex and therefore we provide the possibility of visualizing graphically the output of each phase. Based on our experience, this tool has been an effective one in classroom teaching. It not only cuts down, significantly, on the instructor’s time and effort but also motivates senior/graduate students to pursue work in this specific area of research.     

A physically based method for triangulated surface flattening

This paper introduces a new method of generating 2D flat patterns from a 3D triangulated surface by opening the bending configuration of each winged triangle pair. The flattening can be divided into four steps. First, a 3D triangulated surface is modeled with a mass-spring system that simulates the surface deformation during the flattening. Second, an unwrapping force field is built to drive the mass-spring system to a developable configuration through the numerical integration. Third, a velocity redistribution procedure is initiated to average velocity variances among the particles. Finally, the mass-spring system is forced to collide with a plane, and the final 2D pattern is generated after all the winged triangle pairs are spread onto the colliding plane. To retain the size and area of the original 3D surface, a strain control mechanism is introduced to keep the springs from over-elongation or over-shrinkage at each time step.     

A Class of Algorithms for Collision Resolution with Multiplicity Estimation

The wireless connectivity in pervasive computing has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID (Radio Frequency Identification) tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of RFID tags that have a certain property, estimating the mean value contained in a group of sensors etc. Such an inquiry solicits replies from possibly large number of terminals n. This necessitates the usage of algorithms for resolving batch collisions (conflicts) with unknown conflict multiplicity n. In this paper we present a novel approach to the problem of collision resolution for batch conflicts. We show how the conventional tree algorithms for collision resolution can be used to obtain progressively accurate estimation of the multiplicity. We use the estimation to propose a more efficient binary tree algorithm, termed Estimating Binary Tree (EBT) algorithm. The EBT algorithm is suited for implementation when the conflicting nodes are passive, such as e.g. RFID tags. We extend the approach to design the Interval Estimation Conflict Resolution (IECR) algorithm. For n→∞ we prove that the efficiency achieved by IECR for batch arrivals is identical with the efficiency that Gallager’s FCFS algorithm achieves for Poisson packet arrivals. For finite n, the simulation results show that IECR is, to the best of our knowledge, the most efficient batch resolution algorithm reported to date.     

Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

The problem of path planning for an automaton moving in a two-dimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's tactile sensor. This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worst-case upper bounds on the length of generated paths are produced.Supported in part by the National Science Foundation Grant DMC-8519542.     

MD simulations of the collision between a copper ion and a polyethylene surface: an application to the plasma-insulating material interaction

To allow a better understanding of the physical phenomena occurred between a plasma and an insulating material, we have developed a specific MD code to study this type of interaction. We report results of MD simulations of the interaction of an incoming copper ion with a polyethylene crystal surface. Three initial incoming velocities and four impact angle values are used to check the influence of both the incident energy and impact direction to the resulting surface damage. When the incoming ion velocity is sufficiently high, MD results show that the impact can cause bond breaking leading to uncoordinated carbon atoms and free hydrogen atoms. The values of local temperatures associated with the structural changes show a possible ablation of the polyethylene surface.     

Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

This paper investigates the design of fault-tolerant TDMA-based data aggregation scheduling (DAS) protocols for wireless sensor networks (WSNs). DAS is a fundamental pattern of communication in wireless sensor networks where sensor nodes aggregate and relay data to a sink node. However, any such DAS protocol needs to be cognisant of the fact that crash failures can occur. We make the following contributions: (i) we identify a necessary condition to solve the DAS problem, (ii) we introduce a strong and weak version of the DAS problem, (iii) we show several impossibility results due to the crash failures, (iv) we develop a modular local algorithm that solves stabilising weak DAS and (v) we show, through simulations and an actual deployment on a small testbed, how specific instantiations of parameters can lead to the algorithm achieving very efficient stabilisation.     

基于 Android 系统的飞行射击游戏框架设计与实现

在飞行射击游戏框架设计与实现过程中,分析游戏的场景设计、物体之间碰撞的处理、游戏角色和整个游戏类的框架并对程序流程进行描述。实现游戏UI的设计、背景的载人、角色的设计和实例化。在Android系统中对该游戏进行反复测试,实现飞行射击游戏。     

无线移动网络节点发包概率的演化博弈模型

针对大规模无线移动网络中节点对信道资源的群体性随机博弈问题,在载波侦听多路访问/冲突避免(CSMA/CA)的机制下,建立一种节点发包概率的演化博弈模型。考虑节点成功发送数据包的收益、监听、退避和冲突等成本因素,给出并证明该模型的演化稳定策略(ESS),推导节点发包概率演化的复制动态方程。数值仿真结果表明,该模型能提供更强的ESS,保证在多个移动节点干扰时演化稳定点的鲁棒性。