Routing proposals in MANETs have been implemented and tested considering homogeneous environment where nodes have equal capabilities and responsibilities to perform. These assumptions are not helpful to realise the actual performance of the routing protocols. Therefore, existing routing protocols should be tested and benchmarked for heterogeneous MANETs (H-MANETs). In this paper, an analysis of AODV, DSR, AOMDV and CBRP protocols is done. The efficacy of these protocols has been judged for varying network size and varying traffic for H-MANETs. Heterogeneity has been introduced in terms of different random initial energy values given to each node. The performance analysis has been done using network simulator (NS-2) for various important performance parameters. Results show that CBRP as compare to other protocols performs better and as a second choice, especially for large traffic, AOMDV is the best protocol. This work is useful for the judicious and sensible selection of the base routing protocol.Keywords: H-MANETs; routing; heterogeneity; energy; scalability.Reference to this paper should be made as follows: Rishiwal, V., Yadav, M. and Kumar, S. (2017) 'Energy consumption pattern and scalability of routing protocols for heterogeneous MANETs', Int.

No abstract

No abstract

Routing proposals in MANETs have been implemented and tested considering homogeneous environment where nodes have equal capabilities and responsibilities to perform. These assumptions are not helpful to realise the actual performance of the routing protocols. Therefore, existing routing protocols should be tested and benchmarked for heterogeneous MANETs (H-MANETs). In this paper, an analysis of AODV, DSR, AOMDV and CBRP protocols is done. The efficacy of these protocols has been judged for varying network size and varying traffic for H-MANETs. Heterogeneity has been introduced in terms of different random initial energy values given to each node. The performance analysis has been done using network simulator (NS-2) for various important performance parameters. Results show that CBRP as compare to other protocols performs better and as a second choice, especially for large traffic, AOMDV is the best protocol. This work is useful for the judicious and sensible selection of the base routing protocol.Keywords: H-MANETs; routing; heterogeneity; energy; scalability.Reference to this paper should be made as follows: Rishiwal, V., Yadav, M. and Kumar, S. (2017) 'Energy consumption pattern and scalability of routing protocols for heterogeneous MANETs', Int.

Social networking sites facilitate and develops a virtual community for people to share their thoughts, interest activities or to increase their horizon of camaraderie. With the advancement in Social networking sites or we can refer as online social networks the user can connect to each other. They can share pictures, videos and view to each other. With all these options available on SNS it creates a virtual world for the users. Because of all these reasons growth of SNS in recent years indicates that they are now mainstream communication technology for many people. Social networking sites come under few of the most frequently browsed categories websites in the world. However SNS are also vulnerable to various problems, threats and attacks such as disclosure of information, identity thefts etc. Privacy practices in social networking sites often appear convoluted as information sharing stands in discord with the need to reduce disclosure-related abuses. Facebook is one such most popular and widely used SNS which has its own strong set of Privacy policies. Yet they are also prone to various privacy issues and attacks. In this work we examine the currently existing privacy policies of Facebook since 2013 and then provide with certain new policies that enhance and strengthen the existing ones. We conclude with a discussion of how these findings may be integrated into the design of Facebook like SNS systems to facilitate interaction while enhancing individual privacy.

Graphical user interfaces are the key components of any software. Nowadays, the popularity of the software depends upon how easily the user can interact with the system. However, as the system becomes complex, this interaction is also complicated with many states. The testing of graphical user interfaces is an important phase of modern software. The testing of GUI is possible only by interacting with the system, which may be a time-consuming process and is generally automated based on the test suite. The test suite generation proposed in this paper is based on the genetic algorithm in which various test cases are generated heuristically. For performance validation of the proposed approach, the same has been compared with a variant of PSO, and it found that GA is slightly better in comparison to the PSO.

In this paper, we have proposed testing the graphical user interface (GUI) applications using the idea of finite state machines and then comparing the results with the model generated using Matlab: which represents the machine that tested the actual GUI. This environment can help write efficient test cases to test the actual graphical interfaces of the application under the test. For the testing of our system, a small GUI for the calculator is developed. Then the finite state diagram for the same design will be used as a machine for the simulation. The results from the Matlab model are compared with the actual application. The defects are also identified and demonstrated.

No abstract