Volume 3 Issue 11- November 2013


S.No Title Page
1. Modeling and Analysis of General Internet Signaling Transport Protocol (GIST) using Coloured Petri Nets
Atul Kumar , Kanwalvir Singh Dhindsa,

The NSIS (Next Steps in Signaling) working group has standardized a General Internet Signaling Transport (GIST) as the base protocol component of NSIS protocol stack to support a variety of signaling applications. The GIST basically provides the Routing and Transport service to the Upper Layer. GIST is not designed to set up or modify paths itself; therefore it is complementary to protocols like RSVP (Resource Reservation Protocol) rather than an alternative. The main aim of this paper is to use Coloured Petri Nets to model the basic working of the GIST protocol i.e a simple GIST example. Initial analysis refers that a basic model is constructed using Coloured Petri Nets and its proper working is verified.
Key-Words: - Quality of Service, NSIS, RSVP, GIST, NTLP, Formal Verification, Coloured Petri Nets (CPN)

Full Text PDF
2. Secure Messaging System using ZKP
Mahmood Khalel Ibrahem, Tamara Alaa M. Ali

In this paper, a web-based messaging system is presented with implementing a new version of Diffie-Hellman protocol, to insure mutual authentication between client and server along with exchanging key securely without sending it through the channel.
The proposed messaging system provides the major security services which are Authenticity, Integrity and Confidentiality, by implementing Zero Knowledge Proof (ZKP) and password authentication for authenticity, Hmac for integrity and AES for Confidentiality.
KeywordsSecurity services (Authenticity, Integrity and Confidentiality), Zero Knowledge Protocol, Diffie-Hellman, AES, Hmac .

Full Text PDF
3. A Critical Review for Developing Affinity Set Method for Multi Classification and Prediction
Hamdan O. Alanazi, Abdul Hanan Abdullah , Moussa Larbani

Machine learning, a branch of artificial Intelligence targets to make predictions more accurate. Machine Learning methods have been widely used. The notion of affinity set which is one of the machine learning methods can be defined as the distance or closeness between two objects. Unlike the fuzzy Set and Rough Set, the affinity can deal with third objects and deals with time dimension. In addition, it could deal with entities or abstract side by side with real objects. Indeed, the existing models of affinity are developed for binary classification or prediction. This review highlighted that the existing models of affinity set should be developed in order to provide a multi classification or multi prediction.
Keywords- Affinity Set, Multi classification and Multi prediction.

Full Text PDF
4. A Review of Ant Colony based Routing Algorithm in Wireless Ad-hoc Networks
Sai Priya Thottempudi , Dr Syed Umar

Mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kinds of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence and especially on the ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the overhead for routing. We refer to the protocol as the Ant-Colony-Based Routing Algorithm (ARA).

Keywords—Power, Ad hoc networks, Routing Protocols,

Full Text PDF
5. Classification of Routing Protocols in Wireless Ad hoc Networks
M D S Sai Prasad, Dr Syed Umar,Koyalamudi Jyothi Padmaja

Mobile Ad-Hoc Network (MANET) is a wireless network without infrastructure. Self configurability and easy deployment feature of the MANET resulted in numerous applications in this modern era. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. Routing protocols used in wired network cannot be used for mobile adhoc networks because of node mobility. Efficient routing protocols will make MANETs reliable .Routing is a core issue in networks for delivering data from one node to another in ad hoc network. This Paper deals with number of ways of categorization of protocol and also present some specified protocols according to that classification.
The emphasis of this paper is not to present protocol in detail but present main feature of wide variety of different protocols and discuss their suitability.

Keywords—Routing protocols, Mobile Ad hoc network, routing schemes Classification of protocols, Comparison of protocols.

Full Text PDF
6. A Study on Data Security in MANETS
Tummala Sasanth , Dr Syed Umar ,Divya Bellam

A mobile ad hoc network (MANET) is a self-configuring infrastructure-less network of mobile devices connected by wireless. Ad hoc is Latin and means "for this purpose". Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. Such networks may operate by themselves or may be connected to the larger Internet. MANETs are a kind of Wireless ad hoc network that usually has a routable networking environment on top of a Link Layer ad hoc network. Due to their applications in situations such as emergencies, crisis management, military and healthcare, message security is of paramount importance in mobile ad-hoc networks. However, because of the absence of a fixed infrastructure with designated centralized access points, implementation of hard-cryptographic. Security is a challenging prospect. In an adverse environment, both route discovery and data transmission are vulnerable to a variety of attacks. The trust based multi-path routing ensures secure discovery of multiple path between source and destination. Self-encrypted parts of a message are transmitted through these paths. Therefore it is difficult for malicious nodes to gain access to the minimum information required to break through the encryption strategy. Results show that our method is much more secure than other existing trust based multipath routing protocols.

Keywords—Wireless sensor networks, adaptive topology, topology control, manets, security

Full Text PDF
7. A Review of One-Pass Key Establishment Model and Protocols for Wireless Roaming.
Umakanth Vellanki, Dr Syed Umar, Venkat Purnesh Gaddam

Two novel mutual authentication and key exchangeprotocols with anonymity are proposed for different roamingscenarios in the global mobility network. The new features inthe proposed protocols include identity anonymity and one-timesession key renewal. Identity anonymity protects mobile usersprivacy in the roaming network environment. One-time sessionkey progression frequently renews the session key for mobileuser’s and reduces the risk of using a compromised session keyto communicate with visited networks. It has demonstrated thatthe computation complexity of the proposed protocols is similarto the existing ones, while the security has been significantlyimproved.

Keywords—Authentication, key exchange, roaming service,
Anonymity, secret-splitting, self-certified.

Full Text PDF
8. A Review of Low Cost Object Tracking System
Sindhuja Bharthepudi, Dr Syed Umar, Sanjana Sanakkayala, Susmitha Nidamanuri

This paper proposes and implements a low cost object tracking system using GPS and GPRS and GIS. The system allows a user to view the present and the past positions recorded of a target object on Google Map through the internet. The key features of the system are an open-source GIS platform, HTTP protocol, A web application is developed using PHP, JavaScript, Ajax and My SQL with the Google Map embedded and a communications server, a web-server, a database server, and a map server. The Monitoring Centre displays the above information on Google Map by means of Internet and sends commands to all the subsystems. The real time availability of all exact locations and speeds of the vehicles enables the system to encompass very clear traffic information.


Full Text PDF
9. An Efficient Local Hierarchical Load Balancing Algorithm (ELHLBA) in Distributed Computing
Rafiqul Zaman Khan, Md Firoj Ali

Load balancing algorithm can efficiently improve the performance of a distributed computing system than the system without load balancing algorithm. Dynamic load balancing algorithm is accountable for balancing load among the nodes depending upon the system state at any instant of moment. In centralized approach the information is collected by a specially designated central node and in distributed approach each node has the autonomy to collect the information about the load of the system. For a large global distributed system centralized approach of the load balancing algorithm is not efficient due to the contention problem. In distributed approach either a sender or a receiver may poll all the nodes in a network for load balancing causing huge overheads. Hierarchical load balancing approach imbibes the merits of both centralized and decentralized approaches by removing the disadvantages of centralized and decentralized approaches. In this paper we have proposed a hierarchical load balancing algorithm ELHLBA  in which we considered the parents of leaf nodes as a front end nodes. We compared our algorithm with other existing algorithm ILHLBA and LHLBA. The simulation results show that our algorithm produces better result than the existing  algorithms ELHLBA and LHLBA in respect of response time and throughput against system utilization.

Keywords— Distributed System, Hierarchical, Load Balancing, Under loaded, Overloaded

Full Text PDF
10. Important Aspects of Parallel Computing
Rafiqul Zaman Khan, Javed Ali

Parallel computing is a form of computation in which many calculations are carried out simultaneously. It operates on the principle that large problems can often be divided into smaller ones, which can be solved concurrently. In a distributed system, all processing elements are connected by a network. Parallel computing becomes the dominant paradigm in computer architecture, mainly in the form of multi-core processors. Data parallel programming is one which each process executes the same action concurrently, but on different parts of shared data. While in task parallel approach, every process performs a different step of computation on the same data.

Keywords: Directed Acyclic Graph, Parallel Computing, Throughput, Scheduling etc.

Full Text PDF