Behavior Of Schemes Research Articles

Enhanced studies on a composite time integration scheme in linear and non-linear dynamics

In Bathe and Baig (Comput Struct 83:2513---2524, 2005), Bathe (Comput Struct 85:437---445, 2007), Bathe and Noh (Comput Struct 98---99:1---6, 2012) Bathe et al. have proposed a composite implicit time integration scheme for non-linear dynamic problems. This paper is aimed at the further investigation of the scheme's behaviour for use in case of linear and non-linear problems. Therefore, the examination of the amplification matrix of the scheme will be extended in order to get in addition the properties for linear calculations. Besides, it will be demonstrated that the integration scheme also has an impact on some of these properties when used for non-linear calculations. In conclusion, a recommendation for the only selectable parameter of the scheme will be given for application in case of geometrically non-linear calculations.

Scalability study of the ad hoc on‐demand distance vector routing protocol

AbstractAs mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc routing have certain characteristics that may limit their scalability to large networks. This paper examines five different combinations of modifications that may be incorporated into virtually any on‐demand protocol in order to improve its scalability. The scalability of current on‐demand routing protocols is evaluated through the selection of a representative from this class of protocols. The performance of the un‐modified on‐demand protocol is compared against that of it combined with each of the scalability modifications. Each scheme's behavior is analyzed in networks as large as 10,000 nodes through detailed simulation. Based on the observations, conclusions are drawn as to the expected scalability improvement that can be achieved by each modification. Copyright © 2003 John Wiley & Sons, Ltd.

Ad hoc on-demand distance-vector routing scalability

As mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc routing have certain characteristics which may limit their scalability to large networks. This paper examines five different combinations of modifications which may be incorporated into virtually any on-demand protocol in order to improve its scalability. The scalability of current on-demand routing protocols is evaluated through the selection of a representative from this class of protocols. The performance of the un-modified on-demand protocol is compared against that of it combined with each of the scalability modifications. Each scheme's behavior is analyzed in networks as large as 10,000 nodes through detailed simulation. Based on the observations, conclusions are drawn as to the expected scalability improvement which can be achieved by each modification.