Abstract.A MANET is an interconnection of mobile devices by wireless links forming a dynamic topology without much physical network infrastructure such as routers, servers, access points or centralized administration. The multipath routing protocols establish efficient communication within the network by discovering multiple routes between a pair of source and destination in order to have load balancing to satisfy Quality of Service (QoS) requirements. The aim of this work is to modify the existing MANET reactive Multipath routing protocol Ad hoc On-demand Distance Vector (AOMDV) using drop minimization under MAC error control technique like collision minimization, dynamic queue scheme etc. In AOMDV routing we apply multipath base data sending scheme but that protocol not fulfill QoS so here we apply drop analysis base and find out pitfall of the AOMDV and after that we apply various drop minimization technique like rate base data sending scheme, queue base congestion control etc. and improve the performance of the network. A narrative Multipath QoS Aware Routing Protocol based on AOMDV is proposed to support packet delivery ratio, routing overhead minimization and UDP analysis constraints.
In this paper, we are concerned with algorithms for deployed sensor nodes over a long period of time (e.g., monischeduling the sensing activity of sensor nodes that are deployed toring the radiation level or temperature of a source at a given to sense/measure point-targets in wireless sensor networks using location in a remote/inaccessible area). The intensity of such a information coverage. Defining a set of sensors which collectively physical quantity to monitor typically decays with distance. A can sense a target accurately as an information cover, we propose target is said to be 'covered' if a sensor individually (or a set of an algorithm to obtain Disjoint Set of Information Covers (DSIC), sensors collectively) can measure (i.e., sense) the target with which achieves longer network life compared to the set of certain acceptable accuracy. A set of nodes which collectively covers obtained using an Exhaustive-Greedy-Equalized Heuristic can sense a target in the network with acceptable accuracy is (EGEH) algorithm proposed recently in the literature. We also referred to as a cover for that target. In the case of multiple present a detailed complexity comparison between the DSIC and targets in the network, a set of nodes which together can EGEH algorithms.sense all the targets in the network with acceptable accuracy Keywords -Sensor activity scheduling, physical coverage, is referred to as a coverfor the network. There can be several information coverage, network lifetime. such network covers feasible for a given number of targets and sensor nodes in the network (referred to as set offeasible
In this paper, we are concerned with enarea [1], [2]. Energy is consumed in the sensor nodes ergy efficient area monitoring using information cov-for the purpose of sensing as well as communication. erage in wireless sensor networks, where collaboration Several studies in the literature have addressed the isamong multiple sensors can enable accurate sensing sue of minimizing the energy spent for the purpose of of a point in a given area-to-monitor even if that communication (e.g., energy efficient routing [3]). In point falls outside the physical coverage of all the sen-this paper, we address the energy spent for the pursors. We refer to any set of sensors that can collecpose of sensing, focusing on energy efficient algorithms tively sense all points in the entire area-to-monitor for scheduling the sensing activity of sensor nodes usas a full area information cover. We first propose a ing Information Coverage [4], instead of the often used low-complexity heuristic algorithm to obtain full area physical coverage. information covers. Using these covers, we then obSensor nodes in the network have the task of senstain the optimum schedule for activating the sensing ing/monitoring an area-to-sense/monitor and sending activity of various sensors that maximizes the sensing the sensed information to a sink. Not all nodes in the lifetime. The scheduling of sensor activity using the network may be needed to adequately cover (sense) optimum schedules obtained using the proposed algo-the entire area-to-monitor. By intelligently switchrithm is shown to achieve significantly longer sensing ing the redundant sensor nodes to low power operalifetimes compared to those achieved using physical tion, the energy spent in sensing can be reduced, and coverage. Relaxing the full area coverage requirement hence the overall lifetime of the network can be into a partial area coverage (e.g., 95% of area coverage creased. Redundant nodes can be deactivated as long as adequate instead of 100% area coverage) further as the area-to-monitor remains adequately covered by enhances the lifetime. the other nodes, and activated when needed for ade-
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.