arXiv subjects

Deepali Virmani

Publications and source records attributed to Deepali Virmani.

At least 19 recordsLinked to original sources

arXiv2015

Dynamic Cluster Head Selection Using Fuzzy Logic on Cloud in Wireless Sensor Networks

One of the most vital activities to reduce energy consumption in wireless sensor networks is clustering. In clustering, one node from a group of nodes is selected to be a cluster head, which handles majority of the computation and processing for the nodes in the cluster. This paper proposes an algorithm for fuzzy based dynamic cluster head selection on cloud in wireless sensor networks. The proposed algorithm calculates a Potential value for each node and selects cluster heads with high potential. The proposed algorithm minimizes cluster overlapping by spatial distribution of cluster heads and discards malicious nodes i.e. never allows malicious nodes to be cluster heads.

cs.NI↗

arXiv2015

Normalization based K means Clustering Algorithm

K-means is an effective clustering technique used to separate similar data into groups based on initial centroids of clusters. In this paper, Normalization based K-means clustering algorithm(N-K means) is proposed. Proposed N-K means clustering algorithm applies normalization prior to clustering on the available data as well as the proposed approach calculates initial centroids based on weights. Experimental results prove the betterment of proposed N-K means clustering algorithm over existing K-means clustering algorithm in terms of complexity and overall performance.

cs.LG↗

arXiv2015

A Novel Framework for Intelligent Information Retrieval in Wireless Sensor Networks

Recent advances in the development of the low-cost, power-efficient embedded devices, coupled with the rising need for support of new information processing paradigms such as smart spaces and military surveillance systems, have led to active research in large-scale, highly distributed sensor networks of small, wireless, low-power, unattended sensors and actuators. While applications keep diversifying, one common property they share is the need for an efficient network architecture tailored towards information retrieval in sensor networks. Previous solutions designed for traditional networks serve as good references; however, due to the vast differences between previous paradigms and needs of sensor networks, a framework is required to gather and impart only the required information .To achieve this goal in this paper we have proposed a framework for intelligent information retrieval and dissemination to desired destination node. The proposed frame work combines three major concern areas in WSNs i.e. data aggregation, information retrieval and data dissemination in a single scenario. In the proposed framework data aggregation is responsible for combining information from all nodes and removing the redundant data. Information retrieval filters the processed data to obtain final information termed as intelligent data to be disseminated to the required destination node.

cs.IR↗

arXiv2014

Aspect Based Sentiment Analysis to Extract Meticulous Opinion Value

Opinion Mining and Sentiment Analysis is a process of identifying opinions in large unstructured/structured data and then analysing polarity of those opinions. Opinion mining and sentiment analysis have found vast application in analysing online ratings, analysing product based reviews, e-governance, and managing hostile content over the internet. This paper proposes an algorithm to implement aspect level sentiment analysis. The algorithm takes input from the remarks submitted by various teachers of a student. An aspect tree is formed which has various levels and weights are assigned to each branch to identify level of aspect. Aspect value is calculated by the algorithm by means of the proposed aspect tree. Dictionary based method is implemented to evaluate the polarity of the remark. The algorithm returns the aspect value clubbed with opinion value and sentiment value which helps in concluding the summarized value of remark.

cs.IR↗

arXiv2014

Routing Attacks in Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSN) is an emerging technology now-a-days and has a wide range of applications such as battlefield surveillance, traffic surveillance, forest fire detection, flood detection etc. But wireless sensor networks are susceptible to a variety of potential attacks which obstructs the normal operation of the network. The security of a wireless sensor network is compromised because of the random deployment of sensor nodes in open environment, memory limitations, power limitations and unattended nature. This paper focuses on various attacks that manifest in the network and provides a tabular representation of the attacks, their effects and severity. The paper depicts a comparison of attacks basis packet loss and packet corruption. Also, the paper discusses the known defence mechanisms and countermeasures against the attacks.

cs.CR↗

arXiv2014

Sentiment Analysis Using Collaborated Opinion Mining

Opinion mining and Sentiment analysis have emerged as a field of study since the widespread of World Wide Web and internet. Opinion refers to extraction of those lines or phrase in the raw and huge data which express an opinion. Sentiment analysis on the other hand identifies the polarity of the opinion being extracted. In this paper we propose the sentiment analysis in collaboration with opinion extraction, summarization, and tracking the records of the students. The paper modifies the existing algorithm in order to obtain the collaborated opinion about the students. The resultant opinion is represented as very high, high, moderate, low and very low. The paper is based on a case study where teachers give their remarks about the students and by applying the proposed sentiment analysis algorithm the opinion is extracted and represented.

cs.IR↗

arXiv2014

Reliability Analysis to overcome Black Hole Attack in Wireless Sensor Network

Wireless sensor networks are vulnerable to several attacks, one of them being the black hole attack. A black hole is a malicious node that attracts all the traffic in the network by advertising that it has the shortest path in the network. Once it receives the packet from other nodes, it drops all the packets causing loss of critical information. In this paper we propose a reliability analysis mechanism. The proposed reliability analysis scheme overcomes the shortcomings of existing cooperative black hole attack using AODV routing protocol. As soon as there is a path available for routing, its reliability is checked using the proposed scheme. The proposed reliability analysis scheme helps in achieving maximum reliability by minimizing the complexity of the system. The final path available after the reliability analysis using the proposed scheme will make the path secure enough to minimize the packet loss, end-to-end delay and the energy utilization of the network as well as maximize the network lifetime in return.

cs.NI↗

arXiv2013

Dynamic Clustering Protocol for Data Forwarding in Wireless Sensor Networks

Energy being the very key concern area with sensor networks, so the main focus lies in developing a mechanism to increase the lifetime of a sensor network by energy balancing. To achieve energy balancing and maximizing network lifetime we use an idea of clustering and dividing the whole network into different clusters. In this paper we propose a dynamic cluster formation method where clusters are refreshed periodically based on residual energy, distance and cost. Refreshing clustering minimizes workload of any single node and in turn enhances the energy conservation. Sleep and wait methodology is applied to the proposed protocol to enhance the network lifetime by turning the nodes on and off according to their duties. The node that has some data to be transmitted is in on state and after forwarding its data to the cluster head it changes its state to off which saves the energy of entire network. Simulations have been done using MAT lab. Simulation results prove the betterment of our proposed method over the existing Leach protocol.

cs.NI↗

arXiv2013

Enhanced Tiny Encryption Algorithm with Embedding (ETEA)

As computer systems become more pervasive and complex, security is increasingly important. Secure Transmission refers to the transfer of data such as confidential or proprietary information over a secure channel. Many secure transmission methods require a type of encryption. Secure transmissions are put in place to prevent attacks such as ARP spoofing and general data loss. Hence, in order to provide a better security mechanism, in this paper we propose Enhanced Tiny Encryption Algorithm with Embedding (ETEA), a data hiding technique called steganography along with the technique of encryption (Cryptography). The advantage of ETEA is that it incorporates cryptography and steganography. The advantage proposed algorithm is that it hides the messages.

cs.MM↗

arXiv2013

Priority Based Energy-Efficient Data Forwarding Algorithm in Wireless Sensor Networks

A Wireless Sensor Network(WSN) can be described as a collection of untethered sensor nodes. An important application of WSNs is in the field of real-time communication. Real-time communication is a critical service which requires a qualitative routing protocol for energy-efficient network communication. The judicious use of energy of the network nodes is essential and important for sustainability and longevity of a WSN. This paper proposes an algorithm namely Priority-Energy Based Data Forwarding Algorithm(PEDF) which empowers the node to choose the most suitable packet forwarding path, based on the priority of the packet and the current energy status of the forwarding node. The algorithm hence dynamically adapts to the prevailing energy-scenario of the network and takes routing decisions accordingly, based on packet priority. Minimizing delay, minimizing energy utilization, maximizing throughput and maximizing network lifetime are the key elements of the proposed algorithm.

cs.NI↗

arXiv2013

Scalable, Robust and Real Time Communication Architecture For Wireless Sensor Networks

In this paper we propose wireless sensor network architecture with layered protocols, targeting different aspects of the awareness requirements in wireless sensor networks. Under such a unified framework, we pay special attention to the most important awareness issues in wireless sensor networks: namely dynamic awareness, energy awareness and spatiotemporal awareness. First, we propose the spatiotemporal aware routing protocol for wireless sensor networks, which maintains a constant delivery speed for soft real-time communication. Second, we introduce the time-energy aware aggregation scheme, which increases the degree of aggregation and reduces energy consumption without jeopardizing the end-to-end delay. It is the data aggregation scheme to take the timely delivery of messages as well as protocol overhead into account to adjust aggregation strategies adaptively in accordance with assessed traffic conditions and expected wireless sensor network requirements. Third, we also deal with dynamic awareness by proposing a new communication category based on a lazy-binding concept. The evaluation of this integrated architecture demonstrates its performance composability and its capability to be tailored for applications with different awareness requirements. We believe that the integrated architecture, supporting various kinds of awareness requirements, lays a foundation for overall wireless sensor network.

cs.NI↗

arXiv2013

Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Networks

Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption, minimizing the distance traversed and minimizing the cost in terms of energy consumption. In CLMAT the node having maximum available energy is used as parent node/ aggregator node. We concluded with the best possible aggregation tree minimizing energy utilization, minimizing cost and hence maximizing network lifetime.

cs.NI↗

arXiv2013

An Efficient Hybrid Localization Technique in Wireless Sensor Networks

Sensor nodes are low cost, low power devices that are used to collect physical data and monitor environmental conditions from remote locations. Wireless Sensor Networks(WSN) are collection of sensor nodes, coordinating among themselves to perform a particular task. Localization is defined as the deployment of the sensor nodes at known locations in the network. Localization techniques are classified as Centralized and Distributed. MDS-Map and SDP are some of the centralized algorithms while Diffusion, Gradient,APIT, Bounding Box, Relaxation-Based and Coordinate System Stitching come under Distributed algorithms. In this paper, we propose a new hybrid localization technique, which combines the advantages of the centralized and distributed algorithms and overcomes some of the drawbacks of the existing techniques. Simulations done with J-Sim prove advantage of the proposed scheme in terms of localization error calculated by varying the sink nodes, increasing node density and increasing communication range.

cs.NI↗

arXiv2013

Comparison of Proposed Data Dissemination Protocols for Sensor Networks Using J-Sim

A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This paper reports on the results of a simulation comparison of proposed data dissemination protocols using the J-Sim simulator for the WSN protocols: Forwarding Diffusion Data Dissemination(FDDDP), Decentralized Data Dissemination(DDDP), Credit Broadcast Data Dissemination (CBDDP), Energy Aware & Geographical Data Dissemination (EAGDDP) .Our performance provides useful insights for the network designer such as which protocols (and design choices) scale control traffic well, improve data delivery or reduce overall energy consumption,improves routing overhead and maximizes the bandwidth utilization. The static pre configuration of the cell size in DDDP, is one of the reasons why DDDP exhibits larger routing overhead than FDDDP by 74.2% on average. Although CBDDP produces approximately 94.6% smaller overhead than DDDP and 90.7% smaller than FDDDP, because of statically configured amount credit CBDDP delivers on average 7.5 times more of the redundant data packets than DDDP and FDDDP.EAGDDP improves the delivery by 80% on average and makes a balance of energy consumption .We suggest that making these protocols truly self-learning can significantly improve their performance.

cs.NI↗

arXiv2013

Adaptive Energy Aware Data Aggregation Tree for Wireless Sensor Networks

To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside to aggregate data. In this paper, an adaptive energy aware data aggregation tree (AEDT) is proposed. The proposed tree uses the maximum energy available node as the data aggregator node. The tree incorporates sleep and awake technology where the communicating node and the parent node are only in awake state rest all the nodes go to sleep state saving the network energy and enhancing the network lifetime. When the traffic load crosses the threshold value, then the packets are accepted adaptively according to the communication capacity of the parent node. The proposed tree maintains a memory table which stores the value of each selected path. Path selection is based on shortest path algorithm where the node with highest available energy is always selected as forwarding node. By simulation results, we show that our proposed tree enhances network lifetime minimizes energy consumption and achieves good delivery ratio with reduced delay.

cs.NI↗

arXiv2013

Clustering Based Topology Control Protocol for Data Delivery in Wireless Sensor Networks

The issue of optimizing the limited and often non-renewable energy of sensor nodes due to its direct impact on network lifetime dominates every aspect of wireless sensor networks. Existing techniques for optimizing energy consumption are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we classify sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Clustering based topology control protocol (CTCP) which extends network lifetime while guarantying the minimum connectivity. Extensive simulations in Java-Simulator (J-Sim) show that our proposed protocol outperforms the existing protocols in terms of various performance metrics life network lifetime, average delay and minimizes energy utilization.

cs.NI↗

arXiv2013

Real Time scheduling with Virtual Nodes for Self Stabilization in Wireless Sensor Networks

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS) which uses virtual nodes for self stabilization. This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network and with virtual nodes algorithm achieves QoS in terms of packet delivery, multiple connections, better power management and stable routes in case of failure. RTS delays packets at intermediate hops (not just prioritizes them) for a duration that is a function of their deadline. Delaying packets allows the network to avoid hot spotting while maintaining deadline-faithfulness. We compare RTS with another prioritizing and scheduling algorithm for real-time data dissemination in sensor networks, velocity monotonic scheduling. This paper simulates RTS based on two typical routing protocols, shortest path routing and greedy forwarding with J-Sim.

cs.NI↗

arXiv2013

Decentralized Lifetime Minimizing Tree for Data Aggregation in Wireless Sensor Networks

To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper, we propose a novel technique to create one such tree, which preserves the energy and minimizes the lifetime of event sources while they are constantly transmitting for data aggregation in future WSNs. We use the term Decentralized Lifetime-Minimizing Tree (DLMT) to denote this tree. DLMT features in nodes with higher energy tend to be chosen as data aggregating parents so that the time to detect the first broken tree link can be extended and less energy is involved in tree maintenance. In addition, by constructing the tree in such a way, the protocol is also able to reduce the frequency of tree reconstruction, minimizes the amount of data loss, minimizes the delay during data collection and preserves the energy. Forwarded directed Diffusion protocol is chosen as the routing platform.

cs.NI↗