Ripple effect : an improved geographic routing with local connectivity information

One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity status at each node before making routing decision. We present a protocol, Density Ripple Exchange (DRE), that maintains local density information at each node, and a new geographic routing algorithm, Geographic Ripple Routing (GRR), that achieves better routing performance in both hop stretch and transmission stretch than existing geographic routing algorithms by exploiting available connectivity information. Our simulations demonstrate that we increased the performance for GRR over Greedy Perimeter Stateless Routing (GPSR) by about 15%. The cost of this improved performance is a small amount of additional local connectivity information required for our algorithm.

Geographic routing with cooperative relaying and leapfrogging in wireless sensor networks

A novel geographic routing protocol for multi-hop wireless sensor networks is presented. It exploits the broadcast nature of the wireless channel to enable on-demand cooperative relaying and leapfrogging for circumventing weak radio links. In order to achieve energy efficiency, a metric is introduced for next-hop selection that takes into account information on the residual battery energy, the geographical position of the sensor nodes, and the channel quality of the involved radio links when available. Performance results show that the completely decentralized protocol offers significant benefits by reducing the number of (re)transmissions required to reach the destination. This translates into network-wide energy savings that extend the network lifetime.

Determination of drawbead contacts with variable bead penetration

In stamping operations, the sliding of the sheet metal over the drawbeads is of great importance. The geometry of the drawbead and the degree of penetration both influence material flow and alter the frictional effects between the work and the tool. The effect of drawbead penetration over drawbeads has been studied using the Drawbead Simulator (DBS) test. The contact phenomenon between the sheet and drawbeads was analysed by examining deformed samples with an image fitting technique. The results were compared with an FE simulation and with an approximate geometric analysis. The results give a useful relationship between the rates of change of the contact angle with increasing bead penetration.

Automotive can network response time analysis with variable jitter

Many methods to calculate message latencies for Controller Area Network (CAN) have previously been presented based upon the static worst-case behaviour of the system. With the use of modern simulation tools however, the behaviour of CAN networks can be simulated dynamically in order to find the likely worst-case response times for CAN messages. This paper shows the development of an automotive body control network model to be used as the basis for further simulations. A method to simulate the Worst-Case Response Time of this model is then presented, taking into account random queuing jitter.

Multi-level virtual ring : cross-level name routing with embedded identifier in sensor network

This paper presents the Multi-level Virtual Ring (MVR), a new name routing scheme for sensor networks. MVR uses selection algorithm to identify sensor nodes' virtual level and uses Distribution Hash Table (DHT) to map them to the MVR, The address routing performs well in wired network, but it's not true in sensor network. Because when nodes are moving, the address of the nodes must be changed Further, the address routing needs servers to allocate addresses to nodes. To solve this problem, the name routing is being introduced, such as Virtual Ring Routing (VRR). MVR is a new name routing scheme, which improves the routing performance significantly by introducing the multi-level virtual ring and cross-level routing. Experiments show this embedded name routing is workable and achieves better routing performance.

Labour productivity measurement with variable returns to scale in Australia's construction industry

As an important productivity indicator, the change of labour productivity is one indispensable marker in determining the rise or fall of overall industrial performance. This study aims to address whether the labour productivity level of the Australian construction industry has, in fact, shown a huge improvement during the last few decades. This article constructs a measuring method estimating labour productivity changes based on the data envelopment analysis technique with variable returns to scale. By adopting a production frontier approach, the labour productivity index can be broken down into components attributable to efficiency change, technological progress and capital accumulation. The numerical results exemplified by a single-input and single-output system indicate that the average annual labour productivity levels of the construction industry are slowly growing in all the Australian states and territories. However, the year-on-year change in the overall labour productivity performance does not maintain a long-term increase over the period 1990–2008. The study forms the basis for further industrial productivity research. Proposals and recommendations are expected to be beneficial for making policy and strategic decisions to improve the performance of the construction industry.