A Fault Node Recovery Algorithm to Reinforce the Lifetime and Routing in Wireless Sensor Network

A Fault Node Recovery Algorithm to Reinforce the Lifetime and Routing in Wireless Sensor Network

Chapter 5

SYSTEM DESIGN

5.1 Introduction

Design is that the creation of a concept or convention for the development of an object or a system (the same as in architectural blueprint, engineering drawing, business process, circuit diagram and sewing pattern). Design has completely different connotations in several fields. In a number of cases the direct creation of an object (the same as in engineering, management, and graphic plan) is additionally thought-about to be design.

Systems design is that the method of defining the structural design, components, modules, interface, and records for a system to satisfy individual requirements. System design is considered one of the most important phases of software development. The purpose of the design is to plan the solution of a problem specified by the requirement document. In other words, the primary step in the solution to the problem defined software requirement specification is the design of the project. The design of the system is maybe the foremost significant issue affecting the feature of the software system.

The objective of the design stage is to produce the overall design of the software. It aims to figure out the modules that ought to be within the system to fulfil all the system requirements in an efficient manner. The design will include some of the specification of all these modules, their interaction with other modules and the desired output from each module. The interactions among the modules described in high level architecture can be described individually using other methodologies like data flow diagrams, control flow diagrams etc. The output of the design process is a description of the software architecture. System design can be of divided and defined as the two types described in next sections.

5.2 Logical Design

The logical plan of an organization pertains to an abstract illustration of the data flow, input and output of the system. This is repeatedly conducted via modelling, using an over-abstract model of the actual system.

The main design goals – the following are the design goals that are a unit applicable to virtually every Web App regardless of application domain, size, or complexity.

1. Simplicity
2. Consistency
3. individuality
4. Visual application
5. Compatibility.

5.3 Physical design

The physical design relates to the particular input along with output processes of the system. This can be well-ordered down in terms of however information is input into an organization; however it is verify/authenticated, however it is processed and the way it is displayed as in physical design.

5.3.1 Algorithms

• Grade diffusion (GD) algorithm
• Fault Node Recovery Algorithm(Genetic algorithm)

5.3.1.1 Grade Diffusion Algorithm

The GD algorithmic rule not completely creates the routing for all sensor nodes on the other hand this also identifies a collection of neighbour nodes to decrease the transmission loading. Each sensor node can prefer a sensor node from the set of neighbour nodes after its grade table lacks a node capable to do the relay operation. The GD rule may additionally record some information about the information relay. Then, a sensor node will prefer a node with a lighter loading or extra offered energy than the opposite nodes to carry out the additional relay operation. That is, the routing path are updated within real time by the GD rule, and moreover the event data is therefore sent to the sink node rapidly and appropriately

5.3.1.2 Fault Node Recovery Algorithm

This project work recommend a fault node recovery (FNR) algorithmic rule for WSNs supported the grade diffusion algorithmic rule [4] combined with the genetic rule. The building block diagram of FNR and flow chart is shown in Figure 5.1 and Figure 5.2.

The FNR rule generates the routing table, grade value (rank), neighbour nodes, also payload value designed for every sensor node by means of the grade diffusion algorithm. Within the FNR rule, the number of non-functioning sensor nodes is calculated throughout the operations in wireless sensor network, and in addition to the parameter B^th is calculated in step with (1).

Fig. 5.1: Block Diagram of the FNR algorithm

In this Figure 5.2, the FNR algorithmic rule produces the grade value (rank), routing table, a collection of neighbour nodes, and payload value designed for every sensor node, discrimination the grade diffusion rule. The sensor nodes transmit the event information towards the sink node dependable with the GD rule once procedures give the impression. Then, B^th is calculated consistent with (1) at intervals the FNR rule. If B^th is greater than zero, the policies are a unit progressing to be invoked also alter non-functioning device nodes by working nodes elected by means of the genetic rule. After that the wireless sensor network can continuous work at the same time as long for the reason that the operators square measure willing to change sensors.

B^th =i

Ti (1)

In (1), Grade is that the sensor node’s position value. The variable is that the number of sensor nodes by means of the grade value i. The variable is that the number of sensor nodes still working at the present instant with grade value i. The constraint is regarding by the user and may have a value among 0 and 1. If the total number of sensor nodes so as to operate for every grade is a lesser quantity than β, when Ti becomes 1 and B^th are a unit progressing to be larger than zero. Then, the formula will calculate the sensor nodes to replace by means of the genetic algorithm. The parameters unit of measurement encoded in binary string and function of the chromosomes used for the GA. The components (or bits), i.e., the genes, bounded by the binary strings are a unit of measurement adjusted to decrease or maximize the fitness worth. The fitness operation generates its fitness value that consists of more than a few variables to be optimized by means of the GA rule.

Within every, iterations of the GA algorithmic rule is a pre-determined selection of individuals will generate fitness values related by means of the chromosomes. The genetic algorithm consists of 5 steps: Initialization of data arrangement, Evaluation of data, Selection of routing paths which is near to source to destination, Crossover, and Mutation of corresponding information.

5.4 System Working

5.4.1 Flow Charts

A flowchart is a kind of diagram that represents an algorithm, workflow or method, showing the steps as boxes of various types, and their order by connecting through arrows. This pictorial demonstration illustrates a solution to a specified problem. Flowcharts are a unit utilized in analyzing, creating, documenting or supervising a method or program in various fields Figure 5.2.

Fig 5.2: Fault node recovery algorithm flow chart.

5.4.2 Data Flow Diagram

The data flow diagram is one of the foremost upgrading tools used by means of the organizational analyst DeMacro (1978) and Gane Sarson (1979) popularized the utilization if the information flow diagram as modelling utensils throughout their structured system testing methodologies. Data flow diagram demonstrates however the data is processed by means of a scheme in terms of specified inputs and outputs for a given system. A data flow diagram ought to be the primary tool utilized by system analyst to model system parts. These elements are a unit of the system processes, the data utilized by these processes and external entities that work simultaneously with the system and also the information flow within the system. Data flow diagram can act as a graphical illustration of the system in conditions of interaction involving the system, external entities, and method and the way data stored in certain location.

Fig. 5.3: Data Flow Diagram.

There are 4 kinds of system mechanism.

External Entity: These are a part of the objects outside the system, with that the system communicates.

Data Store: These are unit repositories within the system. It consists of files.

Process: A procedure transforms incoming information flow into outgoing information flow. The name and number seem within the circle that represents the method during a data flow diagram.

Data Flow: These are a unit pipelines through that packets of information flow. Label the arrows by the name of the information that moves through it.

In this process user will request to transfer the data from source to destination and finds the entire possible paths and selects best path but if all the nodes in path are fit then it will goes to transfer the data in shortlisted nodes and display the confirmation message to user if the node paths are not fit goes to selection, cross over and mutation process. At last it will display confirmation message to user and shown in above figure 5.3.

5.4.3 Use case Diagram

Use case diagrams are behaviour diagrams won’t to describe a group of actions (use-cases) that a number of system or systems (subject) ought to or can perform together with one or additional external users of the system (actor). Each use case ought to offer some evident and valuable result to the actors or alternative stakeholders of the system. Use Case diagram above represents a slice of the functionality of the system.

Where the user finds the source and destination node address and he selects the file to upload. When path selection process started user will select’s the best path to select for evaluation process. And user will takes two best paths and made cross over operation on best selected paths. At last obtained offspring will rearranged by mutation process and end user will receive those files are shown in above figure 5.4.

Fig. 5.4: Use case Diagram

5.4.4 Sequence Diagram

A sequence diagram is a type of interaction diagram that shows however processes operate with each other and in what order a sequence diagram shows object communications arranged in a given time sequence. It depict the objects and classes involved within the situation and also the sequence of messages changed between the objects essentials .A sequence diagram shows, as parallel vertical lines (lifelines), completely different processes or objects that live at the same time, along with, a horizontal arrows, the messages exchanged between them, within the order within which they occur. This allows them to hold out the functionality of the situation. The use cases realizations in the Logical views of the system under improvement. Sequence diagrams are sometimes referred as event diagrams, event scenarios, and timing diagrams. Specification Figure 5.17 shows the sequence diagram. It shows the sequence of operation. So here the diagram is generally describing the method calls from one object to a different and this can be conjointly the particular situation of easy runtime scenarios during a graphical manner.

Fig. 5.5: Sequence Diagram

In sequence diagram 5.5 shows there are four steps route finder, selection process, crossover process and mutation. When user starts execution sends source and destination address to selection process and in select step finds best paths it will replays path details to route finder. Next step again route finder sends correct paths to crossover process such that it will find fitness of each paths and send fit node details to route finder. At last finder sends best fit nodes details to mutation process in this will finds best paths and send details to route finder user.

5.5 Summary

This chapter explains the system design, detailed design of proposed system using data flow diagram, sequence diagram and use case diagrams.

Dept. of CS&E, KIT, TIPTUR. 2014-2015 Page 1