Uttam Kumar Roy

Address Borrowing In Wireless Personal Area Network

IEEE 802.15.4-2003 is a standard for Low rate, Low powered, Low memory wireless personal area network (WPAN). The Physical layer (PHY) and Medium access control (MAC) specification has been given by IEEE [12, 11]and the Network layer by ZigBee Alliance[17]. They support two kind of net work Tree/Mess. In tree network no routing table is required for routing. After the great success in PAN this technique has also been tried to apply in business Network too. The main problem with this routing is that the maximum length of the net work is 16 hops and in some cases the network can not grow because of the exhaustion of address in some part while the other part is very poorly loaded. Here In this paper we have provided a unified address borrowing scheme which can be easily applied to grow the network beyond 16 hops and overcome the address exhaustion problem by borrowing address.

Enhanced ZigBee tree addressing for flexible network topologies

Since, IEEE 802.15.4 complaint devices are resource constrained, traditional heavyweight routing algorithms are not suitable. Although, ZigBee provided an addressing scheme and a table-free Tree routing algorithm for such devices, it has several limitations. In this paper, we have proposed an extended version of ZigBee addressing scheme. The proposed scheme has all the properties of original addressing scheme and hence the same table-free routing algorithm can be applied. In addition, it supports asymmetric tree networks which original scheme cannot cope up with. It does not also use the parameter, maximum network depth (Lm), which is often very difficult to choose before forming the network. Simulation shows that proposed addressing scheme works seamlessly with existing ZigBee tree routing.

Source-Initiated Routing to Support Large-Scale Pseudo-Linear ZigBee Networks

IEEE 802.15.4 compatible instruments are resource-limited; thereby cannot run conventional resource-hungry routing algorithms. Even though, ZigBee supplied a simple routing algorithm for tree networks, it cannot handle long linear networks typically set up in mines, roadside, agricultural field, mountains etc. his paper proposes a light-weight routing logic based on source routing that supports arbitrary long networks. The proposed algorithm is especially suitable for networks that look almost linear. The algorithm leverages the properties that a pseudo-linear network has limited branching. Experimental results show that this flexible mechanism exhibits excellent packet delivery performance.

Composing recorded Tabla sound to accompany musicians

The primary percussion instrument extensively used in the music of many Asian countries is Tabla. Although, this cheap instrument has high sense of pitch and can create variety of pleasant sounds, it hard to play. Consequently, there is a huge lack of percussionists. Most of the musicians like to perform with a few known players. Pitch tuning requires long time and its range is also limited. As a result, for quick switchover from one scale to another, players are to carry many sets of instruments tuned at different pitch. In this paper, we have proposed a scheme to synthesize prerecorded tabla sounds to assist soloists. The synthesized sound seems like real performed sound. The pitch, tempo and rhythm can be customized based on musicians requirement. In addition to the performance expression of the traditional tabla interaction, it can also provide non-standard sounds and alternative musical expressions.

Performance Analysis of Encrypted Data Files by Improved RC4 (IRC4) and Original RC4

In Cryptography, RC4 is one of the best known stream cipher from the last two decades in steam cipher family and it’s already achieved the trust of many organizations after its code become public. Many Eminent researchers like Roos and et al. established that RC4 contains weakness and biasness in its internal stages. Most of the researcher feels that in KSA part of RC4 components contain most bias values related to the keys. If the KSA part generates strong output as for input of PRGA then resultant stream become more random. Already we proved and published that Improved RC4 (IRC4) gives better result compare to original RC4 in the generation of stream keys for encryption of any plaintext file. In this paper we generate two types of output stream files from the algorithm of IRC4 and original RC4 and implemented the both types of stream files to make encrypted files using same plaintext files and generates corresponding cipher text files. The two set of encrypted type files are testing through NIST Statistical package and from where we find out that IRC4 returns better result related to randomness of the cipher texts files, from where we can conclude that IRC4 algorithm generates more random stream and indirectly increase the security.

Evolutionary Algorithms to Minimize Interaction Energy Between Drug Molecule and Target Protein in Streptococcus

Computer-aided drug design has become quite an important topic to study for modelling the drug for critical disease-causing proteins in reduced time and money. Nowadays, scientists are using bioinformatics in protein 3D structure prediction that is more convenient than conventional 2-D protein structure prediction. In this paper, new algorithms have been proposed on top of traditional GA and PSO that assumes a variable-length tree structure which represents a drug molecule and arranges essential functional groups in different positions of that drug. Once the geometry of the drug is obtained, its docking energy is minimized. We have also considered several inter-molecular forces for more accuracy. Results show that PSO performs better than the earlier GA methods. Nowadays, scientists are using bio-informatics in protein 3D structure prediction that is more convenient than conventional 2D protein structure prediction.

Introspecting Effect of Packet Size on End-to-End Network Delay

A message in computer networks is often divided into frames/packets for various reasons. For a store-and-forward network, a suitable packet-size can drastically reduce delay. In this paper, I have investigated the impact of packet size on delivery time. I have shown that delay is a non-linear function of (i) number of hops the packet traverses, (ii) message size and (ii) the number the message is divided into packets. Since, I can’t customize the former two; the last one can suitably be chosen to minimize delay. I found an optimal number of packets that minimizes the delay. Analytical and simulation results show the correctness of the proposed scheme.

Combined hybrid routing algorithm for WPAN

Wireless sensor/actuator networks (“sensornets”) represents a new computing class consisting of large number of nodes which are often embedded in their distributed operating environments. The emergence of this new computing class raises many system design challenges. One of the major challenges is to develop a very lightweight routing protocol which can run on this low powered, low memory equipped tiny devices. Traditional routing algorithm such as DV, AODV, Link-State, Dijkstra etc requires routing table along with other data structure which is not suitable in the case of sensornets. ZigBee alliance has proposed a routing protocol which works on mathematical formula and consumes less resources but it has limitation on network breadth depth etc. We addressed network depth problem in our paper “Address Borrowing in Wireless Personal Area Network” [1], addressed network breadth problem in our papers “Single Level Address Reorganization In Wireless Personal Area Network” [2] & “Multilevel Address Reorganization Type 2 I N Wireless Personal Area Network”[3]. Similarly we tried to tackle linear network problem in our paper “WPAN Routing Using Huffman Technique” [4]. We have addressed link failure problem of dynamic network in our paper “Multi Channel Personal Area Network (MCPAN) Formation and Routing” [5]. Now here in this paper we will discuss about a routing framework which can be applied in any operating space. It uses all the techniques discussed so far in above mentioned papers. In real world almost all the operating space is asymmetric in nature.

Enhancing ZigBee tree routing to support large pseudo-linear network topologies

IEEE 802.15.4 accordant devices are resource-restrained; thereby cannot execute conventional awkward routing algorithms. Even though, ZigBee provided a elementary routing algorithm for tree networks, it cannot manage long linear networks typically set up in roadside, mines, agricultural field, mountains etc. In this paper, we have nominated a source routing based light-weight routing algorithm that supports arbitrary long networks. The proposed algorithm especially suits for pseudo-linear networks. The algorithm takes the advantage that a pseudo-linear network has limited branching. Experimental results prove that this simple scheme exhibits excellent packet delivery performance.

Positioning WiFi access points using Particle Swarm Optimization

A good WiFi network should have minimum number of access points covering maximum area. In this paper, we have shown how such a network of access points may be set up using Particle Swarm Optimization (PSO). Access points are only placed on the walls in rooms for security reason. Loss of signal strength due to free space as well as walls has been taken into consideration. Simulation results also prove the correctness of the algorithm.