Employing Energy-Aware Multipath Geographical Routing to Bypass Routing Gaps in Wireless Sensor Networks

Geo-Routing also called Geographic Routing or Position-based Routing is a routing principle that relies on geographic position information. With this information, a message can be routed to the destination without knowledge of the network topology or a prior route discovery. Energy conservation and load balance are two important goals in designing routing protocols for Wireless Sensor Networks (WSNs) due to two challenges. First, the sensor nodes are usually powered only by batteries but expected to operate for a long period; Second, it is infeasible and costly to replace or recharge batteries once sensor nodes have been deployed. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this report, we focus on addressing these issues and propose an Energy-aware Multipath Geo-Routing (EMGR) protocol for better route recovery from routing holes. EMGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift the routing path for load balance. The proposed EMGR is applicable to resource-constrained WSNs with routing holes.


INTRODUCTION 1.1 OVERVIEW
ENERGY conservation and load balance are two important goals in designing routing protocols for Wireless Sensor Networks (WSNs) due to two challenges.First, the sensor nodes are usually powered only by batteries but are expected to operate for a long period.Second, it is infeasible and costly to replace or recharge batteries once sensor nodes have been deployed.Notice that the routing holes, referring to an area free of nodes closer to destination, are hardly avoided in WSNs in various actual geographical environments such as puddles, obstacles, and buildings, and this incurs additional energy expenditure used for data delivery.In this paper, therefore, we focus on designing energy-aware geographic routing protocols regarding how to bypass routing holes for resourceconstrained WSNs, which can achieve both energy efficiency by selecting the energy-optimal forwarders and load balance by employing two node-disjoint anchor lists passing through two sides of the routing holes to shift routing path.Geographic routing, also referred to as position-based [2] or localized routing [16], has been regarded as an attractive approach for resource-constrained WSNs, since it exploits local location information instead of global topology information for data delivery.It is based on the prerequisite that the nodes know their actual or virtual locations, which can be made available either through a Global Position System (GPS) receiver or through some other ways [2], and exchange such information with neighbors periodically or actively.Being almost stateless and distributed, geographic routing does not require dissemination of route establishment information and maintenance of routing tables at each node, thus making it efficient, scalable and promising for WSNs.A recent detailed performance evaluation and comparison on geographic routing is given.Energy conservation and load balance are two important goals in designing routing protocols for Wireless Sensor Networks (WSNs) due to two challenges [1], [2].First, the sensor nodes are usually powered only by batteries but expected to operate for a long period; Second, it is infeasible and costly to replace or recharge batteries once sensor nodes have been deployed.Notice that the routing holes, referring to an area free of nodes closer to destination [2], [3], [4], are hardly avoided in WSNs in various actual geographical environments such as puddles, obstacles, and buildings, and this incurs additional energy expenditure used for data delivery.In this paper, therefore, we focus on designing energy-aware geographic routing protocols regarding how to bypass routing holes for resource-constrained WSNs, which can achieve both energy efficiency by selecting the energy-optimal forwarders and load balance by employing two node-disjoint anchor lists passing through two sides of the routing holes to shift routing path., respectively.There are at least two paths along the two sides of the routing hole, i.e., u-w1-w2-w3 -v in Fig. 1(a) and u-v1-v2-v3 -v in Fig. 1(b), provided for route recovery for data delivery.However, the right-hand rule only allows for counterclockwise bypass traversal and the left-hand rule only allows for clockwise bypass traversal, meaning that both of them only walk along one side of the routing holes for route recovery.Beyond face routing over planar networks, there are also other bypass approaches to recover route from routing holes [7].A comprehensive survey on various bypass approaches is given in [5].These proposed protocols are simple to implement but have a common shortcoming that they walk along only one side of the routing holes to recover the Such approaches will make the traffic load converged on the boundary of the routing holes, and consequently achieve suboptimal network performance such as longer delivery delay and lower delivery ratio during routing packets.Furthermore, all of them cannot guarantee that all packets are delivered in an energy-efficient manner [18], [20], [24], [25], since these protocols are more inclined to route data along the boundary of the routing holes or tend to generate long path once encountering the routing holes during routing data, thereby consuming additional energy.In this paper, we propose an energy-aware multipath geographic routing protocol called EMGR for better route recovery from routing holes.The above-mentioned three issues are taken into account in our routing design, thus both energy conservation and load balance can be achieved.

OBJECTIVES
The main objective of this project is: 1.2.1 To establish multipath i.e., dual-path routing following two node-disjoint anchor lists which pass through two sides of the routing holes to route data, preventing data from being forwarded along the boundary of the routing holes.In this way, each data packet is routed to the destination along two different paths in greedy mode only instead of bypass mode, if possible, thereby shortening the routing length and balancing load.

1.2.2
To find an efficient forwarder in the presence of node failure in the relay area, by introducing a random shift to the location of sub-destination.Such an approach is feasible, reasonable, and energy-efficient without additional communication overhead.

1.2.3
To prove that EMGR is anchor list node-disjoint and routing loop-free, and draw out its essential characteristics in terms of time complexity for anchor list building and successful routing probability.

1.2.4
We extend EMGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour.

1.2.5
To evaluate the performance of EMGR and its extension in a variety of communication scenarios, including varied communication sessions, network densities, and routing hole sizes.
The results show that EMGR outperforms the existing energy-aware geographic routing protocols.

PROJECT SCOPE
The scope of the system is help to analyze the comments as well analyze the sentiments provided by different users from different locations.Here we review the feedback of users which provided by web video while we uploading.here we decide the rating of the web video which means the popularity of video.

WIRELESS SENSOR NETWORK (WSN)
A large number of these disposable sensors can be networked in many applications that require unattended operations.A Wireless Sensor Network (WSN) contains hundreds or thousands of these sensor nodes.These sensors can communicate either among each other or directly to an external basestation (BS).A greater number of sensors allows for sensing over larger geographical regions with greater accuracy.Figure 1.2 shows the schematic diagram of sensor node components.Basically, each sensor node comprises sensing, processing, transmission, mobilizer, position-finding system, and power units (some of these components are optional like the mobilizer).The same figure shows the communication architecture of a WSN.Sensor nodes are usually scattered in a sensor field, which is an • Email: editor@ijfmr.com

IJFMR23068762
Volume 5, Issue 6, November-December 2023 4 area where the sensor nodes are deployed.Sensor nodes coordinate among themselves to produce highly quality information about the physical environment.Each sensor node bases its decisions on its mission, the information it currently has, and its knowledge of its computing, communication, and energy resources.Each of these scattered sensor nodes has the capability to collect and route data either to other sensors or back to an external base station(s)1.A base-station may be a fixed node or a mo-bile node capable of connecting the sensor network to an existing communications infrastructure or to the Internet where a user can have access to the reported data.Networking unattended sensor nodes may have a profound effect on the efficiency of many military and civil applications such as target field imaging, intrusion detection, weather monitoring, security and tactical surveillance, distributed computing, detecting ambient conditions such as temperature, movement, sound, light, or the presence of certain objects, inventory control, and disaster management.Deployment of a sensor network in these applications can be in a random fashion (e.g., dropped from an airplane) or can be planted manually (e.g., fire alarm sensors in a facility).For example, in a disaster management application, a large number of sensors can be dropped from a helicopter.Networking these sensors can assist rescue operations by locating survivors, identifying risky areas, and making the rescue team more aware of the overall situation in the disaster area.In the past few years, intensive research that addresses the potential of collaboration among sensors in data gathering and processing and, in the coordination, and management of the sensing activity were conducted.However, sensor nodes are constrained in energy supply and bandwidth.Thus, innovative techniques that eliminate energy inefficiencies that would shorten the lifetime of the network are highly required.Such constraints combined with a typical deployment of large number of sensor nodes pose many challenges to the design and management of WSNs and necessitate energy-awareness at all layers of the networking protocol stack.For example, at the network layer, it is highly desirable to find methods for energy-efficient route discovery and relaying of data from the sensor nodes to the BS so that the lifetime of the network is maximized.

CHALLENGES
Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networks or cellular networks.Due to the relatively large number of sensor nodes, it is not possible to build a global addressing scheme for the deployment of a large number of sensor nodes as the overhead of ID maintenance is high.Thus, traditional IP-based protocols may not be applied to WSNs.Sensor nodes that are deployed in an ad hoc manner need to be self-organizing as the ad hoc deployment of these nodes requires the system to form connections and scope with the resultant nodal distribution especially since the operation of the sensor networks is unattended.In WSNs, sometimes getting the data is more important than knowing the IDs of which nodes sent the data.1.5.5 In contrast to typical communication networks, almost all applications of sensor networks require the throw of sensed data from multiple sources to a particular BS.1.5.6 Sensor nodes are tightly constrained in terms of energy, processing, and storage capacities.Thus, they require careful resource management.1.5.7In most application scenarios, nodes in WSNs are generally stationary after deployment except for, may be, a few mobile nodes.Nodes in other traditional wireless networks are free to move, which results in unpredictable and frequent topological changes.However, in some applications, some sensor nodes may be allowed to move and change their location (although with very low mobility).1.5.8Sensor networks are application specific, i.e., design requirements of a sensor network change with application.For example, the challenging problem of low-latency precision tactical surveillance is different from that required for a periodic weather-monitoring task.1.5.9Position awareness of sensor nodes is important since data collection is normally based on the location.Currently, it is not feasible to use Global Positioning System (GPS) hardware for this purpose.1.5.10Data collected by many sensors in WSNs is typically based on common phenomena, hence there is a high probability that this data has some redundancy.Such redundancy needs to be exploited by the routing protocols to improve energy and bandwidth utilization.

EXISTING SYSTEM AND DISADVANTAGES 2.1 GEOGRAPHIC ROUTING PROTOCOLS
Most geographic routing protocols, such as GFG and GPSR, tend to route data along the boundary of the routing holes for route recovery by employing face routing scheme [4], [6], [12].Once the bypass mode is involved in the routing, these combinatorial protocols cannot guarantee that all packets are delivered in an energy-efficient manner since they tend to generate long path and hence consume additional energy during routing packets.Beyond face routing, there are also other approaches [5], [7], [11] used to recover the route.The basic idea of these approaches is to localize routing holes before data delivery and then to derive a detour path with anchor nodes, such that the data is routed to desired destination in an energy-aware manner.However, all of the above-mentioned approaches only walk along one side of the routing holes to recover the route, thus making the load converge on the boundary of the routing holes.• Email: editor@ijfmr.com

DISADVANTAGES
The main Disadvantages of Existing System are: • A large number of energy-aware geographic routing protocols • A limited number of energy-aware geographic routing protocols have taken into consideration the load balance for route recovery from routing holes.• Several power-aware techniques that attempt to balance the traffic among the nodes to extend the network lifetime.• Balancing the traffic to conserve energy, by randomly shifting the location of each anchor node.
• Sensor nodes are energy-constrained and battery recharging is often infeasible.

LITERATURE SURVEY
In the past decade, a variety of geographic routing protocols have been proposed, such as [3], [4], [6], [7].Below several researches on them are shown.

Reference [2] [5]
to address the routing hole issues occurring in WSNs.A comprehensive survey of geographic routing protocols regarding how to bypass the routing holes can be found in [2], [5].
Commonly, these proposed protocols utilize greedy mode to route data packets as far as possible and switch to bypass mode for route recovery once encountering a routing hole.

Reference [10]
These approaches [10], [11], will make the traffic load con-verged on the boundary of the routing holes, and consequently achieve suboptimal network performance such as longer delivery delay and lower delivery ratio during routing packets.4. Reference [8] All these approaches guarantee that all packets are delivered in an energy efficient manner, since these protocols are more inclined to route data along the boundary of the routing holes or tend to generate long path once encountering the routing holes during routing data, thereby consuming additional energy.5. Reference [12] Specifically, Wu et al. [12] proposed several power-aware techniques that attempt to balance the traffic among the nodes to extend the network lifetime.6. Reference [13] In [13], each forwarder first establishes a sub-destination among its one-hop neighbors, and then routes the data to it through an intermediary node or alters the sub destination if this will preserve power.7. Reference [14] Zhao et al. [14] suggested balancing the traffic to conserve energy, by randomly shifting the location of each anchor node.The work in [28] proposed an energy-aware multipath geographic routing to balance load, by exploiting a dynamic anchor list passing through one side of the routing holes to shift routing path.8. Routing Algorithms Based on the Cluster: The routing algorithms based on the cluster include LEACH-L [31], the Clustering Vector-Based Forwarding (CVBF) algorithm, and a popular clustering algorithm for time series data transformed by a multi-resolution dimensionality reduction method called as I-Kmeans.The drawback of those algorithms based on the cluster is that the energy balance is hard to solve.In this paper, He proposes a shortest path routing protocol based on the vertical angle (SPRVA), which exhibits short delay and high energy efficiency.SPRVA is based on DBR.In the network structure, many sink nodes are uniformly distributed on the surface.Because UANs use acoustic communication, the end-to-end delay is mainly composed of propagation delay.
To reduce propagation delay, SPRVA first selects the next-hop node based on the angle between the propagation direction and the vertical direction.A smaller angle leads to a shorter propagation distance, which results in less propagation loss.The main priority is calculated by combining the residual energy and the angle.

PROBLEM DEFINITION
Generally, geographic routing utilizes greedy mode to route data packets when it can find a neighbor closer to the destination than the current forwarder and switches to bypass mode once the data packets encounter a routing hole, where there is no such node closer to the destination than the current forwarder.To achieve our design goal, there are at least three issues to be addressed for the current geographic routing.How to detect routing holes before data delivery, since the routing holes occurring in routing will generate long paths and hence consume additional resources.How to bypass routing holes for load balance.How to select the energy-aware forwarders and therefore guarantee that all packets are delivered in an energy-efficient manner for resource-constrained WSNs.
1. How to detect routing holes before data delivery, since the routing holes occurring in routing will generate long paths and hence consume additional resources.2. How to bypass routing holes for load balance.3. How to select the energy-aware forwarders and therefore guarantee that all packets are delivered in an energy-efficient manner for resource-constrained WSNs.

PROPOSED SYSTEM
The proposed EMGR protocol for bypassing routing holes in WSNs.First, the EMGR architecture is presented, and then how to obtain an anchor list is introduced.Finally, we formulate how to deliver messages in an energy-efficient manner.

ENERGY-AWARE MULTIPATH GEOGRAPHIC ROUTING
The following are the function entity that plays a very important role in this project which is shown in the system architecture Figure 5.1: EMGR architecture The main mechanism of EMGR is to employ multiple esp.two-node disjoint anchor lists to guide packet delivery and select the nodes with more residual energy from energy-aware relay regions as forwarders for energy conservation.Thus, the data packets are likely routed to the anchor nodes and their destinations along two paths at an energy-efficient cost.Figure 5.1 above illustrates the network architecture of EMGR.The operation of EMGR is mainly divided into two phases: anchor list obtaining and data dissemination.In the first phase, the proposed EMGR scheme uses an adaptive approach to obtain two anchor lists based on the projected distance of nodes being involved in bypass mode.In the latter phase, the proposed EMGR utilizes geographic-information, the residual energy and the characteristics of energy consumption to make routing decisions, and then unicasts the packet to the established nexthop forwarder.If there is no node in the relay region, the current forwarder then introduces a random shift to the location of the sub-destination to continue data delivery.There are three kinds of packets: beacon packet, burst packet, and data packet in our scheme.The beacon packet is used to exchange location information and residual energy among neighbors, while burst packet is used for finding the anchor lists.The above figure presents the format of the burst packet.Specifically, it includes anchor lists, the locations of source node and destination.The anchor list contains a series of anchor nodes, and a flag field which indicates whether this packet bypasses the routing holes by employing the right-hand rule or left-hand rule.In addition, it includes a temporary void node in each bypass mode but is deleted finally if it violates the determined rules of anchor nodes.Here, the void node is defined as the node that switches to bypass mode from greedy mode, i.e., the node (e.g., node u in Fig. 5.1) that cannot find a neighbor closer to the destination than itself, even though there is a path from the source node to destination in the network.

ANCHOR LIST OBTAINING
Given source node u, it starts preparing for data dissemination by building two anchor lists.First, it adaptively broadcasts a beacon packet to its neighbors at the maximum transmission power for announcing its location information and residual energy.Once a neighbor receives this packet, then stores such information and broadcasts a new beacon packet to its neighbors at the maximum transmission power.This process will repeat periodically among all nodes in the network, such that each node can obtain the location information and residual energy of its neighbors within their maximum transmission range.Once receiving location information and residual energy of all neighbors, source node u initiates and sends a burst packet to destination v.For any forwarder w, it uses greedy mode to forward this burst packet whenever possible and switches to bypass mode when encountering a routing hole.The bypass mode begins from the void node.For any void node w in the jth bypass mode, it first adds itself into the burst packet header (i.e., anchor list) for its downstream forwarders to decide whether to return to greedy mode.Then, it takes into consideration the following two cases to make routing decisions on how to bypass this routing hole.

Case I.
If the flag is void, it copies this burst packet and then simultaneously uses the right-hand rule and left-hand rule to bypass this hole, and sets the flag of two burst packets r and l, respectively, for their continued delivery relayed by the subsequent nodes in accordance with it.
Case II.If the flag is not void, this node and its subsequent relay nodes use the right-hand rule indicated by r or the left-hand rule indicated by l to detour this routing hole.

DATA DISSEMINATION
In our scheme, source node u and each forwarder regard anchor nodes as sub-destinations.Before data delivery, node u randomly selects an anchor list and then embeds the anchor nodes into the data packet header.

SYSTEM ANALYSIS 5.4.1 Node-disjoint Anchor List
In EMGR, two anchor lists built by employing right-hand rule and left-hand rule are node-disjoint if such two anchor lists can be found.

Time Complexity
The time complexity for EMGR to build two anchor lists is θ (n).The approaches, most similar to EMGR to build anchor lists, mainly include Projection Distance-based Anchor (PDA+) and Energy-aware Multipath Geographic Routing (EMGR).However, both of them all only build an anchor list, with the time complexity θ (n1) (or θ (n2)), and θ (n1) (or θ (n2)), respectively, to recover the route from routing holes.The results reveal that, similar to PDA+ and EMGR, EMGR achieves the linear time complexity to build anchor lists.

Guaranteed Delivery
EMGR is routing loop-free.EMGR combines bypass mode and greedy mode to forward the data packets, by building the anchor list to avoid the routing holes.In this way, EMGR prevents data packet from being forwarded along the boundary of holes, thus each data packet is routed to destination node only in greedy mode instead of bypass mode if possible, as shown in fig 5 .2

METHODOLOGY 6.1 TECHNOLOGY USED
It is considered that no two nodes are located at the same location, as in and so on.All sensor nodes are distributed in the network following Poisson distribution.Each sensor node knows its own location through an internal GPS device or a separate calibration process, and knows the location of neighbors and their residual energy within its maximum transmission power by exchanging beacon messages.The source node can obtain the location information of packet destinations by some destination location services.The location of a node acts as its ID and its network address.Therefore, there is no need for a separate ID establishment protocol.We only consider bidirectional links, and assume that each sensor node can adjust its transmission power from 0 to its maximum transmission power.
EMGR, for instance, EDGR (Energy-aware Dual-path Geo-Routing) establishes dual-path routing following two node-disjoint anchor lists that pass through two sides of the routing holes to route data, preventing data from being forwarded along the boundary of the routing holes.In this way, each data packet is routed to the destination along two different paths in greedy mode only instead of bypass mode, if possible, thereby shortening the routing length and balancing load.
EMGR proposes a novel alternative approach to find efficient forwarder in the presence of node failure in the relay area, by introducing a random shift to the location of sub destination.Such an approach is feasible, reasonable, and energy-efficient without additional communication overhead.
We prove that EMGR is anchor list node-disjoint and routing loop-free, and draw out its essential characteristics in terms of time complexity for anchor list building and successful routing probability.
We extend EMGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour.

BUILDING ANCHOR LIST 6.2.1 Algorithm
In order to avoid route failure in data delivery between source node and its sub destination, the last sub-destination and destination, and two adjacent sub-destinations, node u will send a new burst packet to the established sub-destinations and then to destination v, according to the right-hand rule or the left-hand rule indicated by the flag in the anchor list, to check whether a routing hole exists.If this is true, a new anchor node determined.The action for routing hole acknowledges from source node u to destination v going through the established sub destinations will be done even more than once, depending on the network density.By employing right-hand rule and left-hand rule simultaneously to walk along two sides of the all-routing holes, our proposed approach can obtain two node disjoint anchor lists to guide packet delivery.With such two anchor lists, the data packets are likely routed to destinations along two different paths, thus achieving load balance.

The pseudo-code of building the anchor list is shown in Algorithm-1.
This algorithm is initialized with the required location information and residual energy of neighbors.Then the algorithm sends a burst packet to destination v and employs both right-hand rule and left-hand rule, r and l, to bypass the all-routing holes simultaneously shown in Lines 2-6 and Lines 18-30, and will update anchor list, as illustrated in Lines 7-30, if a routing hole exists between source node and its sub destination, or the last sub destination and its destination, or two adjacent sub destinations.In bypass mode, each candidate anchor node is determined.Finally, two anchor lists are obtained and fed back to source node u from destination v.The blue dash lines represent removed links to avoid the crossing edges existing according to the right-hand rule, nodes w01, w02, w03 and w04 are the projected nodes of nodes w1, w2, w3 and w4 on the line u v from source node u to destination v.Among all the forwarders, node w1 is the first node, i.e., void node, which enters bypass mode to forward the burst packet due to no neighbor being closer to destination v, and node w4 is the last node involved in such a mode to forward this packet since it can find a neighbor closer to destination v than node w1.There are four nodes, i.e., nodes w1, w2, w3 and w4, involved in bypass mode to build an anchor list, while the other intermediate nodes only forward it.In bypass mode, nodes w1, w2, w3 and w4 first calculate their projected nodes on the line uv and projected distances, indicated by green dash lines in Fig. 6.1 and then calculate the candidate anchors according to given Equation Finally, node w4 is selected as the anchor node.In this way, an anchor list is obtained.

MODULES
The Following Modules are used for implementation:

Form Network
There are three kinds of packets: beacon packet, burst packet, and data packet in our scheme.The beacon packet is used to exchange location information and residual energy among neighbors, while the burst packet is used for finding the anchor lists.Fig. 6.1 presents the format of the burst packet.Specifically, it includes anchor lists, the locations of source node and destination.The anchor list contains a series of anchor nodes, and a flag field which indicates whether this packet bypasses the routing holes by employing the right-hand rule or lefthand rule.In addition, it includes a temporary void node in each bypass mode but is deleted finally if it violates the determined rules of anchor nodes.Here, the void node is defined as the node that switches to bypass mode from greedy mode, i.e., the node (e.g., node u in Fig. 6.1) that cannot find a neighbour being closer to the destination than itself, even though there is a path from the source node to destination in the network.

Anchor List
Given source node u, it starts preparing for data dissemination by building two anchor lists.First, it adaptively broadcasts a beacon packet to its neighbors at the maximum transmission power for announcing its location information and residual energy.Once a neighbor receives this packet, then stores such information and broadcasts a new beacon packet to its neighbors at the maximum transmission power.This process will repeat periodically among all nodes in the network, such that each node can obtain the location information and residual energy of its neighbors within their maximum transmission range Once receiving location information and residual energy of all neighbors, source node u initiates and sends a burst packet to destination v.For any forwarder w, it uses greedy mode to forward this burst packet whenever possible and switches to bypass mode when encountering a routing hole.The bypass mode begins from the void node.For any void node w in the jth bypass mode, it first adds itself into the burst packet header (i.e., anchor list) for its downstream forwarders to decide whether to return to greedy mode.

Data Dissemination
In our scheme, source node u and each forwarder regard anchor nodes as sub-destinations.Before data delivery, node u randomly selects an anchor list and then embeds the anchor nodes into the data packet header.

Performance
We evaluate the performance of our proposed approach EMGR and its extension via simulation experiments.We first describe our simulation environments and performance metrics, and then evaluate the performance results.Finally, we show the analysis among our proposed approach

GEOGRAPHICAL AND ENERGY-AWARE ROUTING (GEAR)
The protocol, called Geographic and Energy Aware Routing (GEAR), uses energy-aware and geographically-informed neighbour selection heuristics to route a packet towards the destination region.
The key idea is to restrict the number of interests in directed diffusion by only considering a certain region rather than sending the interests to the whole network.By doing this, GEAR can conserve more energy than directed diffusion.The basic concept comprises of two main parts-a) Route packets towards a target region through geographical and Energy-aware neighbour selection.b) Disseminate the packet within the region.

PARAMETERS OF QOS NETWORKS
Different services require different QoS parameters Multimedia Bandwidth, delay jitter & delay, Emergency services.,Network availability, Group communications, Battery Generally, the important parameters are: Bandwidth, Delay jitter, Battery charge, Processing power, Buffer space, delay jitter: packet delay variation.

SYSTEM DESIGN 7.1 ACTIVITY DIAGRAM
An activity diagram is a behavioral diagram i.e. it depicts the behavior of a system.An activity diagram portrays the control flow from a start point to a finish point showing the various decision paths that exist while the activity is being executed.

USE CASE
In this Design use case is a list of actions or event steps typically defining the interactions between a role (known in the Unified Modeling Language (UML) as an actor) and a system to achieve a goal.The actor can be a human or another external system.

SEQUENCE DIAGRAM
A sequence diagram simply depicts interaction between objects in a sequential order i.e. the order in which these interactions take place.We can also use the terms event diagrams or event scenarios to refer to a sequence diagram.Sequence diagrams describe how and in what order the objects in a system function.

PROJECT SCOPE
1. To instantiate two different data services, and extensively evaluate their performances on two realworld data sets.2. Under a specific data service, this system provides privacy preservation and verifiability.The installation directory must be empty and the user profile you are using to run the installer must have read/ write permissions for this directory.7. Accept the default JDK installation to use with the NetBeans IDE or select a different installation from the drop-down list.If the installation wizard did not find a compatible JDK installation to use with the Net-Beans IDE, your JDK is not installed in the default location.In this case, specify the path to an installed JDK and click Next, or cancel the current installation.After installing the required JDK version you can restart the installation.8.If you are installing Apache Tomcat, on its installation page, accept the default installation directory or specify another installation location.Click Next.9.At the Summary page, verify that the list of components to be installed is correct and that you have adequate space on your system for the installation.10.Click Install to begin the installation.11.At the Setup Complete page, provide anonymous usage data if desired, and click Finish.

FUNCTIONAL REQUIREMENT
The functional requirements of the system are: • It may take more time for peak loads at main node.
• The system will be available 100% of the time.Once there is a fatal error, the system will provide understandable feedback to the user.

Safety Requirements
• The system is designed in modules where errors can be detected and fixed easily.

Software Quality Attributes
• Reliability: The Client machine will change the status of data indicating successful data transmission.
• Usability: The application should be easy to use through an interactive interface.
• Maintainability: The system will be developed using the standard software development conventions to help in easy review and redesigning of the system.• Supportability: The system will be able to support to transfer different types of SQL queries.
• Portability: This software is portable to any system with the requirements specified.There must also be a server where the database can be set-up.

SIMULATION SETUP
The popular network simulation platform, JAVA, is used to evaluate the performance of EMGR.We select anchor list algorithm as the MAC protocol.Unless specially noted, the number of sensor nodes randomly distributed in a 2D area of 1000m.1000m is set to 100, and varies from 200 to 600 only as the network density increases.Each source node randomly generates TCP flows at a varied speed from the range [0:5Mbps; 1Mbps] with the different packet sizes, commonly set as 128 bytes, 256 bytes, or 512 bytes [2], [38].Each sensor node has an initial energy of 1J, and source-destination pairs are randomly selected in the network.The average performance results are collected from 40 simulation runs, which can make bypass mode more likely to happen in our simulation scenarios.One or two routing holes are set in the center of the network.In each simulation scenario, the size of the routing holes can be varied to ensure that many more communication sessions can pass through them as far as possible.The communication sessions without bypass mode are not considered as our efficient results.Three basic simulation scenarios are designed to evaluate the performance of EMGR.

HOME
The above screenshot of the project shows the main screen of this project it consist of Four model form network, Anchor list, Data Dissemination and Performance.when we click on form Network that display the Network Formation which the output was shown now.
In the above screenshot we have created the nodes in different location and in between we have shown the different holes.the blank space shows the holes in between the network.
after formation of nodes the next step is to select the source node and destination node. in the drop down we have created some source node and some destination node.
after selecting the source and destination node the system has calculate the path using the algorithm and bypassing the holes in routing and shows the correct path.
Here the screen shows the bypass routing the holes the correct path consists of different nodes with source and destination and each node has consume some energy which shown in graphically.instance, you must be able to provide input to the input fields.2. Overall functionality related to the performance of the user graphical interface is checked.3. Check error messages are displayed correctly.4. Check the all-result display is accurate or not.

Integration Testing
Integration testing is the software testing process where individual units are combined and tested as a group.The purpose of this testing is to expose faults in the interaction between integrated units.Each individual component after unit testing is integrated and tested.Each time a new component is added to the system an integration test is performed.The entire system is tested as characterized by the extent of the advancement project or product.It may incorporate tests based on risks and/or requirement specifications, business procedure, use cases and other abnormal states of system behavior, connections with the working frameworks, and system resources.The final test is used to verify that the system to be delivered meets the specification and its purpose.

Acceptance Testing
It is performed with realistic and various image data for training to demonstrate that the software is working satisfactorily in testing phase.User acceptance is a critical phase of any project and requires significant participation by the end user.It ensures that system meets the functional requirements.Acceptance of end users is done by proper images output.

Validation Testing
Validation testing will be done to ensure validation of the client's requirements given to the software team for the system compared to the performance and results from the software system.Given that the system has passed all the previous unit and integration testing, validating the system will measure an aspect of an implementation's behavior against an expectation and check whether the software complies with that expectation.

Performance Testing
Performance testing is the testing, which is performed, to ascertain how the components of a system are performing, given a particular situation.In proposed system it is mainly focused on increasing the performance of system to increase the accuracy of the output and analysis of result is done by using accuracy and time parameters.

PURPOSE AND SCOPE OF DOCUMENT
The purpose of this document is to present a detailed description of semantic trademark retrial system.It will explain the purpose and features of the system, the interfaces of the system, what the system will do, the constraints under which it must operate and how the system will react to external stimuli.This document is intended for providing privacy and security to the users.

OVERVIEW OF RESPONSIBILITIES OF DEVELOPER
1. Perform project design and development activities according to customer specifications.

APPLICATION
Although originally developed as a routing scheme that uses the physical positions of each node, geographic routing algorithms have also been applied to networks in which each node is associated with a point in a virtual space, unrelated to its physical position.The process of finding a set of virtual positions for the nodes of a network such that geographic routing using these positions is guaranteed to succeed is called greedy embedding.The following are some important areas which used in WSN are as follows: 1. Environment Monitoring 2. Industrial and Business Uses 3. In the Livestock 4. Habitat Monitoring 5. Forest Monitoring 6. Underwater Sensor Network

CONCLUSION
We propose EMGR, a novel energy-aware multipath geographic routing protocol, to better recover the route from routing holes for WSNs.In EMGR, two node-disjoint anchor lists are provided to shift routing path for load balance, and the location in-formation, residual energy and energy characteristics of nodes are employed to make routing decisions, thereby enabling an energy-aware multipath routing strategy.

Figure 1 . 1 :
Figure 1.1: Face routing bypassing the routing holes indicated by red arrows: (a) employing the right-hand rule, and (b) employing the left-hand rule.Fig. 1.1 elaborates an example of face routing by employing such two rules, which detours a routing hole by forwarding the data to the node that is first traversed by the arriving edge of the packet counterclockwise or clockwise, shown in Fig. 1.1(a) and Fig. 1.1(b), respectively.There are at least two paths along the two sides of the routing hole, i.e., u-w1-w2-w3 -v in Fig.1(a) and u-v1-v2-v3 -v in Fig.1(b), provided for route recovery for data delivery.However, the right-hand rule only allows for counterclockwise bypass traversal and the left-hand rule only allows for clockwise bypass traversal, meaning that both of them only walk along one side of the routing holes for route recovery.Beyond face routing over planar networks, there are also other bypass approaches to recover route from routing holes[7].A comprehensive survey on various bypass approaches is given in[5].These proposed protocols are simple to implement but have a common shortcoming that they walk along only one side of the routing holes to recover the Such approaches will make the traffic load converged on the boundary of the routing holes, and consequently achieve suboptimal network performance such as

Figure 5 . 2 :
Figure 5.2: The advance region for the current forwarder u to destination v.

Figure 7 . 3 :
Figure 7.3: Sequence Diagram for system • Email: editor@ijfmr.comIJFMR23068762 Volume 5, Issue 6, November-December 2023 21 Here we have shown the simulation of path which bypass the routing holes.the source node and destination node indicate the starting and ending of network communication path Overall energy Consumption and network density graphically represented • Email: editor@ijfmr.comIJFMR23068762 Volume 5, Issue 6, November-December 2023 22Another window of bypassing the routing holes in mobile WSN Individual energy consumption by node after data dissemination.

8.3.2 Hardware RequirementTable 8 . 1
Double click jdk-8-ea-bin-b32-windows-i586 to run the installation program.JDK License dialog displayed.Accept the license in order to install JDK. 2. The JRE Custom setup dialog enables you to choose a custom directory for JRE Files.3. The complete dialog indicates a successful installation.After the download completes, run the installer.For Windows, the installer executable file has the .exeextension.Double-click the installer file to run it.2. If you downloaded the All bundle, you can customize your installation.Perform the following steps at the Welcome page of the installation wizard: 3. Click Customize.4. In the Customize Installation dialog box, make your selections. 5.At the Welcome page of the installation wizard, click Next.At the License agreement page, review the license agreement, click the acceptance check box, and click Next.At the JUnit License Agreement page, decide if you want to install JUnit and click the appropriate option, click Next.At the NetBeans IDE installation page, do the following: 6. Accept the default installation directory for the NetBeans IDE or specify another directory.Note:

.1 Overview of Responsibilities of Developer
• Perform project design and development activities according to customer specifications.• Work with Manager in developing project plan, budget and schedule.• Coordinate with management in preparing project proposals and contractual documents.• Track project progress regularly and develop status reports to management.• Ensure that project is completed within allotted budget and time lines.• Follow company policies and safety regulations for operational efficiency.• Research and recommend new technologies to carry out project developmental tasks.• Provide assistance to other Developers, perform peer reviews and provide feedback for improvements.• Develop cost reduction initiatives while maintaining quality and productivity

8.5 NON-FUNCTIONAL REQUIREMENT 8.5.1 Performance Requirements
• System can produce results faster on 4GB of RAM.
• Email: editor@ijfmr.comIJFMR23068762 Volume 5, Issue 6, November-December 2023 25 2. Work with Manager in developing project plan, budget and schedule.3. Coordinate with management in preparing project proposals and contractual documents.4. Track project progress regularly and develop status reports to management. 5. Ensure that the project is completed within allotted budget and timelines.6. Follow company policies and safety regulations for operational efficiency.7. Research and recommend new technologies to carry out project development tasks.8. Provide assistance to other Developers, perform peer reviews and provide feedback for improvements.9. Develop cost initiatives while maintaining quality and productivity