In the past different engineers and researcher developed robots capable of climbing for various purposes. In this paper we have developed a robot capable of rope climbing in both horizontal and vertical direction. Furthermore, the robot has the ability to perform surveillance using a camera mounted on top of the robot. The quality of the transmitted video from the camera to the computer is clear and stable. Hence the developed robot is a good choice for surveillance purposes. In addition, it can be used to traverse floors of a building. It uses an IR sensor to sense strips attached at each floor. Once the strips are sensed, a dropping mechanism is activated in which a specific object is dropped to the targeted floor or location. The robot can work in automatic mode or manual through RF signals from an RF transmitter. Finally the robot is cost effective compared to many other developed robots for rope climbing.

The selection of an appropriate routing protocol is a key issue when designing a scalable and efficient wireless networks. In this paper, we investigate different routing protocols and evaluate their performances on 802.16 WiMAX networks. Further, we present a comparison between 802.16 and 802.11 ad hoc networks based on the performances of various rerouting protocols. The simulation results show that the table driven DSDV protocol has the best performance in terms of the delivery fraction which outperforms the rest of the protocols. In addition, we also assert from the experiments that packet delay experienced by DSDV protocol is very high. Hence, there should be a tradeoff between various performance parameters when using the DSDV protocol in 802.16 networks.

In this paper, we propose two algorithms based on the popular Bit Plane Splicing Least Significant Bit (LSB) Technique for secret data hiding inside images. One major disadvantage of Bit Plane Splicing LSB technique is its low hiding capacity which results in severe degradation of the cover image upon hiding large amount of data. The proposed algorithms overcome this issue by imposing hiding rules based on the intensity level of pixels. In addition the method for data hiding is done in a non sequential manner using linear congruent random number generators. Experiment results show that the proposed techniques called Optimum Intensity Based Distributed Hiding (OIBDH) technique and Linear Congruent Optimum Intensity Based Distributed Hiding with Key (LC-OIBDH-k) outperforms Bit Plane Splicing LSB technique as they have better hiding capacity with less degradation in the cover image. Furthermore, the proposed algorithms are tested using absolute entropy curves and results show that our proposed techniques have lower absolute entropy difference compared to Bit Plane Splicing LSB technique in all the tested images and for different secret data sizes.