arXiv subjects

Deepali Virmani

Publications and source records attributed to Deepali Virmani.

25 records · Page 2Linked to original sources

arXiv2013

Centralized Lifetime Maximizing Tree For Wireless Sensor Networks

To enable data aggregation among the event sources in wireless sensor networks and to reduce the communication cost there is a need to establish a coveraged tree structure inside any given event region to allow data reports to be aggregated at a single processing point prior to transmission to the network. In this paper we propose a novel technique to create one such tree which maximizes the lifetime of the event sources while they are constantly transmitting for data aggregation. We use the term Centralized Lifetime Maximizing Tree (CLMT) to denote this tree. CLMT features with identification of bottleneck node among the given set of nodes. This node collects the data from every other node via routes with the highest branch energy subject to condition loop is not created. By constructing tree in such a way, protocol is able to reduce the frequency of tree reconstruction, minimize the delay and maximize the functional lifetime of source nodes by minimizing the additional energy involved in tree reconstruction.

cs.NI↗

arXiv2013

Performance Comparison of Proposed Lifetime Maximizing Trees for Data Aggregation in Wireless Sensor Networks

In this paper a packet level simulator is used to explore the performance of the proposed DLMT and CLMT algorithms under various traffic conditions. Performance of the proposed algorithms is compared with already existing E-Span tree structure. These proposed algorithms tend to extend the node lifetime in order to increase the amount of information gathered by the tree root. Decentralized lifetime maximizing tree (DLMT) features in nodes with higher energy to be chosen as data aggregating parents while Centralized Lifetime Maximizing Tree (CLMT) features with the identification of the bottleneck node to collect data in a central manner among given set of nodes. By choosing Forwarded Diffusion as our underlying routing platform the simulations are carried on J-Sim. Our simulation results have shown that the functional lifetime of event sources can be enhanced by a maximum of 147% when data is aggregated via DLMT and by 139% when data is aggregated via CLMT. Our proposed DLMT algorithm has shown maximum of 13% additional lifetime saving without increasing the delay. Packet delivery ratio has also shown a remarkable increase when the tree depth is considered in these proposed tree structures. Furthermore, the delay is also reduced by using DLMT & CLMT in comparison with E-Span.

cs.NI↗

arXiv2013

Stable Routing for achieving Quality of Service in wireless Sensor Networks

Networking in Wireless Sensor networks is a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Although lots of research has been done on supporting QoS in the Internet and other networks, but they are not suitable for wireless sensor networks and still QoS support for such networks remains an open problem. In this paper, a new scheme has been proposed for achieving QoS in terms of packet delivery, multiple connections, better power management and stable routes in case of failure. It offers quick adaptation to distributed processing, dynamic linking, low processing overhead and loop freedom at all times. The proposed scheme has been incorporated using QDPRA protocol and by extensive simulation the performance has been studied, and it is clearly shown that the proposed scheme performs very well for different network scenarios.

cs.NI↗

arXiv2013

Reliable Robust and Real-Time Communication Protocol for Data Delivery in Wireless sensor Networks

WSNs can be considered a distributed control system designed to react to sensor information with an effective and timely action. For this reason, in WSNs it is important to provide real-time coordination and communication to guarantee timely execution of the right actions. In this paper a new communication protocol RRRT to support robust real-time and reliable event data delivery with minimum energy consumption and with congestion avoidance in WSNs is proposed. The proposed protocol uses the fault tolerant optimal path for data delivery. The proposed solution dynamically adjust their protocol configurations to adapt to the heterogeneous characteristics of WSNs. Specifically, the interactions between contention resolution and congestion control mechanisms as well as the physical layer effects in WSNs are investigated.

cs.NI↗

arXiv2012

Application Independent Energy Efficient Data Aggregation in Wireless Sensor Networks

Wireless Sensor networks are dense networks of small, low-cost sensors, which collect and disseminate environmental data and thus facilitate monitoring and controlling of physical environment from remote locations with better accuracy. The major challenge is to achieve energy efficiency during the communication among the nodes. This paper aims at proposing a solution to schedule the node's activities to reduce the energy consumption. We propose the construction of a decentralized lifetime maximizing tree within clusters. We aim at minimizing the distance of transmission with minimization of energy consumption. The sensor network is distributed into clusters based on the close proximity of the nodes. Data transfer among the nodes is done with a hybrid technique of both TDMA/ FDMA which leads to efficient utilization of bandwidth and maximizing throughput.

cs.NI↗

arXiv2012

Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks

A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nodes under the control of a sub-sink which further communicate and transfer data to the sink node.

cs.NI↗

arXiv2012

Real Time Communication Capacity for Data Delivery in Wireless Sensor Networks

Real-time applications are performance critical applications that require bounded service latency. In multi-hop wireless ad-hoc and sensor networks, communication delays are dominant over processing delays. Therefore, to enable real-time applications in such networks, the communication latency must be bounded. In this paper, we derive expressions of real-time capacity that characterize the ability of a network to deliver data on time as well as develop network protocols that achieve this capacity. Real-time capacity expressions are obtained and analyzed for the earliest deadline first, deadline monotonic. This paper presents a treatment of the real-time capacity limits. The limits are derived for two extreme traffic topologies namely, the load balanced topology and the convergecast (i.e., many-to-one) topology. It considers DM and EDF scheduling algorithms, and discusses the implications of the capacity limit expressions.

cs.NI↗