International Journal of Advanced Networking and Applications

2141-2150

Authors: J K M Sadique Uz Zaman, Sangeet Saha, Ranjan Ghosh

Randomness studies of bit sequences, created either by a ciphering algorithm or by a pseudorandom bit generator are a subject of prolonged research interest. During the recent past the 15 statistical tests of NIST turn out to be the most important as well as dependable tool for the same. For searching a right pseudorandom bit generator from among many such algorithms, large time is required to run the complete NIST statistical test suite. In this paper three test modules are considered in succession to reduce the searching time. The module-1 has one program and is executed almost instantly. The module-2 has four programs and takes about half an hour. The module-3 has fifteen programs and takes about four to five hours depending on the machine configuration. To choose the right pseudorandom bits generator, the algorithms rejected by the first module are not considered by the second module while the third module does consider only those passed by the second module.

2158-2167

Authors: G Vijaya Kumar, C Shoba Bindu

In IEEE 802.11 based wireless mesh network (WMN), a mesh client often finds multiple access points (AP) to associate with. How to select the best AP is the open research problem. The traditional AP selection method defined by IEEE 802.11 standard is based on received signal strength. This method is proven inefficient as it does not consider many important factors such as channel conditions, AP load, etc. Many alternate solutions have been proposed so far in the literature, but they are all focused on wireless local area network (WLAN) environment. As there are significant differences between WLAN and WMN, all these proposed association mechanisms must be redesigned to fit into WMN environment. This paper studies the AP selection problem in the context of WMN. We critically analyze the existing work and identify technical challenges involved in AP selection problem. This paper also provides directions to design the metrics of AP selection method in WMN.

2176-2183

Authors: A.P.Shanmugasundaram.,M.C.A., M.Phil, C.Chandrasekar.M.C.A., M.Phil.,Ph.D.,

Wireless network has come out as one of the key enablers for reliable data delivery for different types of applications.Ad-hoc network consists of self-actuated node that collaborates in order to transfer the information.Trajectory-based Statistical Forwarding (TSF) method used optimal target point selection algorithm to forward packets in order to satisfy probability of packet delivery over multi-hopbut failed provide higher throughputon the multipath data delivery. TheVoid Aware Pressure Routing (VAPR) method used hop count and intensity information to build a directional data delivery system but performance of specialized geographic routing based multipath data delivery was not attained. To maintain the higher throughput level on ad-hoc network data delivery, Median Multicast Throughput Data Delivery (MMTDD) mechanism is proposed in thispaper.The basic idea of MMTDD mechanism is to divide a message into multiple shares and deliver them via multiple independent source paths to the destination. MMTDD mechanism with the average time standard takes the best threshold value for every data (i.e.,) packet partitioning by avoiding packet loss. By this means, MMTDD mechanism uses the Average Time Standard (ATS) to guarantee the required packet allocation with higher throughput level. With the application of ATS, the MMTDD mechanism derives the theoretical model by attainingapproximately 4% higher throughput level on the multipath data delivery in ad-hoc network.MMTDD mechanism makes use of time scheduling schemes to discover and maintain data delivery paths with minimal time consumption.Median Multicast in MMTDD mechanism used the balanced state flow model to deliver data on multiple paths and experiment is conducted on factors such as time consumption, data delivery rate,average delivery delay and throughput level.

2191-2194

Authors: Vijay Pal Dhaka, Pooja Nahar

Customer Relationship Management (CRM) is a technical jargon which is a blend of methodologies, software and internet, which are used by a company to achieve its goal through the identification and satisfaction of customer’s stated and unstated needs and wants. This software addresses customer life cycle management. This system manages company interactions with current and future customers. It involves technology to organize, automate and synchronize business processes. CRM application is an essential tool for a company to grow and help to increase the satisfaction of customers. There are many benefits of CRM; those make the market environment customer centric. In this paper, we reviewed previous studies and identify those benefits which affect customers and company both. But CRM has many problems also because of them CRM gets failure. Its failure rate is more than its success rate. We also elaborated its failure factors and along with them its critical success factors which help in making CRM a successful project for a company, however implementation of CRM is a complex task.