Search

Abandoned luggage is seen as a major threat as they may carry explosives and smuggled goods and it affects the lives of normal people. It is necessary to have an automated surveillance system that provides alerts about potential threats in the environment. Abandoned luggage detection suggested in this paper automatically detects abandoned luggage items using camera installed in a particular scene and produces a real time alarm. Image processing techniques are applied on multiple video frames to detect objects, which are recognized as luggage using convolutional neural networks (CNN). If a luggage is detected as unattended for a huge amount of time an alarm sound will be raised.

Mobile Ad hoc Network (MANET) is having a wide variety of applications, thanks to the flexibility in the architecture and current state of technology. MANET is a network of wireless nodes with no predefined fixed infrastructure or centralized administration. Nodes in the network are highly mobile and the topology change is dynamic. On account of the frequent movement of the nodes the topology is unpredictable, thereby disturbing the stable routing in MANET. In order to make the routing process efficient, this paper proposes to enhance the utilization of Domination nodes. The proposed method, Reliable Dominating set Based Routing (RDBR), selects the best Dominating set based on the packet delivery ratio (PDR) and the residual energy of the nodes, thereby ensuring the stability in routing. Simulation study demonstrates the efficiency of the RDBR algorithm in terms of PDR, packet drop, throughput, overhead and delay compared to other on demand routing algorithms AODV and DSR.

Mobile ad hoc networks (MANET) are well suited, when the application demands quick network configuration and faces difficulty to set up the infrastructure for communication. Node mobility is not predictable in MANET, so that the topology keeps changing dynamically, thereby making the decision of routes also dynamic. In this paper, an attempt is made to predict the longevity of the links by utilizing fuzzy decision process and belief propagation. Initially, the link is selected based on the signal strength while the final choice accommodates the node energy also. Two methods are introduced (i) link prediction routing (LPR) and (ii) reliable link prediction routing (RLPR) to discover most reliable link in the context of arbitrarily node and link failure. At each node, the decision to propagate the belief is the consequence of the fuzzy decision taken on the signal strength and node energy. Two methods are compared with other on-demand algorithms AODV and DSR in respect of various performance parameters for different simulation timings, based on the average values generated out of 1000 independent runs.

Mobile Ad hoc network is a self organized, self maintained network. Node movement is the important factor of increasing the control overhead in the network. The main objective of the paper is to reduce the control overhead by using the domination set based routing. The nodes which use to connect all the other nodes in the network are called dominating nodes, and the set of dominating nodes forms domination set. This paper proposes a new approach for finding the route and reducing the reroute establishment delay and increasing the packet delivery ratio. The efficiency of the method is demonstrated through simulation study.

Routing decisions are often susceptible to failure in Mobile Ad hoc network (MANET) because of the special characteristics like dynamic topology and lack of central coordinator. Network topology changes very frequently due to the random movements of nodes and it is not predictable. The lack of central coordinator for controlling and managing the operations, often leads to very serious problems like balanced selection of route and security issues. The process of routing decision is distributed among nodes. Since there is no way to judge the node movement when a node is selected for data transfer, the entire selection process of ideal node for data forwarding is a daunting task in MANET. In order to alleviate this problem of node selection for data transfer, in this paper an attempt is made to predict link availability for routing based on signal strength using Belief Propagation. Predicted value is propagated and can be used to select the neighboring nodes as data forwarders. Overall performance of the proposed method, Link Prediction Routing (LPR) is demonstrated using simulation results.

It is well-known that dynamic topology, mobility of nodes, infrastructure less property and absence of central coordinator; make the behaviour of mobile ad hoc network (MANET) uncertain. Routing is the major step in the operation of MANET and the establishment of route from source to destination thus becomes crucial. Routing decision is distributed among the nodes in the network and the reliable and effective routing predominantly depends on proper establishment of route from source to destination. Route establishment depends largely on control packets and those packets induce more overhead in the network, which in turn degrades the performance of the network. The present work proposes a novel method to reduce the control overhead by predicting the quality of the neighbouring nodes that sustain more, using a fuzzy set decision approach. The flooding of control packets is based on a fuzzy decision taken on success rate of each link in the previous trials and residual energy of the neighbouring nodes. Simulation study reveals that this approach significantly reduces the control overhead in the network and improves the overall performance.

Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central coordination. In MANET, node mobility and dynamic topology play an important role in the performance. MANET provide a solution for network connection at anywhere and at any time. The major features of MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET due to it's dynamic topology and high mobility. Several routing algorithms have been developed for routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in the network. Several issues have been identified. The bandwidth is recognized as the prominent factor reducing the performance of the network. This paper gives an improvement of normal AODV for simultaneous multiple connections under the consideration of bandwidth of node., Comment: 9 Pages, 4 figures

Mobile Ad hoc Network is a collection of self-organizing mobile nodes that can communicate either directly or indirectly. The open medium and wide distribution of nodes make MANET highly vulnerable to different kinds of attacks. Most of the common routing protocols assume that all participating nodes are well behaving. The presence of malicious nodes cannot be neglected as it affects the network resources like bandwidth, throughput, transmission delay, etc. and packet transmission adversely. This paper presents an acknowledgement based routing scheme that detects selfish nodes. The observations shows that the system behaves well when compared with the most commonly used routing protocol AODV in terms of packet drops, throughput, PDR and normalized routing overhead.

In Wireless Sensor Network, the communication generally takes higher energy than other operations like sensing and data processing. So the traffic reduction in communication is one of the most important concern for prolong the life of sensors. This paper presents three traffic reduction techniques based on dominating set. In the first approach base station is dynamically relocate to the sensing area in which heavy packet traffic. The selection of base station depends on various performance metrics such as energy, signal strength and the location of the selected node. The second approach intelligently distributes the burden of broadcasting process by applying the concept of localized domination set based multicast. In the third approach i.e., Dominant Set Pruning (DSP) is used to avoid unnecessary control packet flooding in sensor network The efficiency of dominant-set-based broadcasting or routing mainly depends on the overhead in constructing the Connected Dominating Set (CDS) and the size of the dominating set. The paper proposes a novel algorithm for determine the CDS with less computation complexity. The performance of the algorithm is evaluated by using simulation. The modified algorithm has a tremendous reduction in traffic than the existing AODV algorithm.

Various Ideas on leader election process has evolved and most of them rely on techniques such as extrema finding or centrality finding methods. These methods are very reliable and highly efficient in a static network, but when discussion reaches ad-hoc networks robustness is questioned and current system doesn't answer to this dilemma. So taking in to account this highly dynamic nature of mobile ad-hoc networks current scenarios of leader election must be modified. This paper describes a novel method to cope up the dynamic nature of ad- hoc networks by proposing some changes to the current leader election process. The main idea is to cluster the networks and to use an `avoidance strategy' for the clusters up to a particular threshold, and thus neglecting the dynamicity of the sub networks during the leader election process without affecting the performance.

Vehicular adhoc network (VANET) is formed by vehicles that move in well-defined paths and it is highly dynamic. The routing in VANET by relying beacons suffers from significant drawbacks such as temporal loops in forwarding path, consumes available bandwidth, backward progress due to stale information etc. So here proposes an enhanced secured routing mechanism. It route the data by considering the traffic density in the streets with the help of RSU. Here the routing decision is taken by each vehicle dynamically without using beacons. The protocol also suggests the secure mechanisms that can be adopted to the proposed scheme by detection of selfish nodes in the network.

Mobile Ad-hoc Network (MANET) is an emerging research area as it utilizes a diversity of applications. MANET is a self configuring network with dynamic topology. The network does not have any permanent infrastructure and the network can be formed on the fly. The mobile nodes in the network move frequently and the topology changes dynamically. So there is a chance of frequent network partitions. The node in one partition cannot access data items from a node in another partition. To improve data availability the data in the nodes should be replicated at various nodes. There are various data replication techniques available in MANETs. This paper focuses on the data replication by reserving storage space for the most demanded data item. This also includes the selection of a node and selection of a data item for replication. Thus the data availability can be improved since there are multiple replicas in the network and the possibility of finding one copy of data item is higher.

Wireless communication encapsulates the earth into a global village with its reach to every nook and corner of the globe. The fourth generation (4G systems) of wireless communication was expected to be up for grabs from 2010s. However, due to the complicated hardware required the evolution of technology into 4G has been sluggish. Since 4G services require the integration of all the existing communication services into a global standard, new advancements are required in technology to solve the issues in the path to progress. The main purpose of this paper is to find an effective solution for the network selection issue, which is one of the the primary obstacles in 4G communication systems. This paper discusses the Quality of Service (QoS) based network selection technique, which utilizes multiple performance parameters, with the proposal for introducing a preplanner module for emergency services. And also the paper tries to find out the effectiveness of the proposal from the results obtained through the simulation executed.

This paper proposes a new framework for assessing the performance of Engineering students, viz., Revolution in Engineering Assessment (REA). REA is an innovative framework designed and developed exclusively for evaluating the comprehensive, problem solving, designing models, programming and application developing skills for all disciplines of engineering. REA evolves in different modes like general questionnaire, questionnaires with tip-off mode, enhanced graphical mode and crossword mode to evaluate all aspects of engineering skills. Experiments are done on batches/groups of engineering students to evaluate their comparative performance in terms of traditional mode of writing exams and the proposed framework. REA shows an over all improved performance of about 78% in engineering students. The result also pictures the enhanced performance of weaker students when evaluated through REA by a reasonable margin of 9%.

4G communication systems provide a global communication standard for each and every communication facilities and internet and telecommunication service providers of the globe. The major attraction of 4G is the network selection policy which enables users to select services offered by the best of the various service providers. The main purpose of this paper is to discuss network selection in 4G systems. This paper discusses the method of network selection, need for special schemes and its benefits and shortcomings. In addition to that a proposal is made for a new collaborative method to select networks based on their Quality of Service (QoS) parameters and their Quality of Experience (QoE) in functioning in a heterogeneous environment of networks

Mobile Ad-hoc Networks (MANETS) are infrastructure less self-organizing and self-configuring network. The nodes in MANETS are highly mobile and the routing mechanisms of these may vary depending on various applications. This poses serious challenges to routing and reliability. Reliability and reachability are the two important terms related to dissemination of data in MANETs. This paper studies the AODV protocol in MANET. And also try to understand the multiple connections in MANET under various situations. Several issues have been identified in the creation of multiple connections. The prominent issue recognized is the bandwidth of a node in creation of multiple connections. This poses major concern in connection establishment and connection maintenance. This paper also proposes a new idea of improving the simultaneous multiple connections with the consideration of bandwidth of each node.

Mobile ad hoc network is a self organized network with a collection of wireless nodes without a fixed topology and centralized administration among the nodes. There is an urgent need for trustworthiness in MANET, as the survival of the spontaneous network depends upon the trust and cooperation among different nodes. The nodes have unmitigated control over the data packets passed through them and so the malicious nodes may accomplish the control over the data packets, thus they may threat the normal nodes in the network. Here the need for establishing a trusted environment in MANET arises. Trusted environment increases the probability of a successful transaction and reducing the opportunities of being defrauded. Trust is used to determine the reliability and inter opinionative between nodes and their neighbors. Difference between actual and expected value of the node behavior determines the degree of trust of that node. In this paper first discuss the need for trusted environment, then the basic issues while designing trusted environment. Then survey some existing trusted models for MANET and point out some issues regarding with them. Based on these studies a solution suggested, dynamic fuzzy based trust model through a drop less route using AODV in MANET. Also advantages of the proposed model are discussed.

Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any infrastructure support. The nodes in MANET can act as either router or source and the control of the network is distributed among nodes. The nodes in MANETS are highly mobile and it maintains dynamic interconnection between those mobile nodes. MANTEs have been considered as isolated stand-alone network. This can turn the dream of networking "at any time and at any where" into reality. The main purpose of this paper is to study the issues in route discovery process in AODV protocol for MANET. Flooding of route request message imposes major concern in route establishment. This paper suggests a new approach to reduce the routing overhead during the route discovery phase. By considering the previous behaviour of the network, the new protocol reduces the unwanted searches during route establishment process, Comment: International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.2, March 2012

Green computing is the term used for eco-friendly computing. It utilizes the computing resources in the most efficient way without raising issues to the environment. The goals of green computing are to reduce the use of hazardous materials, maximize energy efficiency during the product’s lifetime, and promote recyclability or biodegradability of defunct products and factory waste. The main purpose of this paper is to use the pervasive computing techniques, the advanced wireless communication strategies and smart hardware for the implementation of green computing. This paper discusses the role of pervasive computing towards achieving green computing by introducing pervasiveness in utilizing computing systems much efficiently in support with environmental well being. And also the paper tries to explore the concept of power aware computing and its implementation using event driven pervasive computing with the support of a handheld device such as a smart phone.

Pervasive Computing integrates communication and computing into real life to enable advanced and uninterrupted services to simplify information manipulation. Location aware computing is a renowned sector of pervasive computing where the systems involved can provide specific services based on the location information of users. The advancements in this area has led to major revolutions in various application areas, especially advertisements. This paper explores the Location Privacy issue in location aware computing. Vertical fragmentation of the stored location information of users has been proposed as a solution for this issue.