Simulation Input Parameters for WSNs

For any problem, the two steps always be common called input and output. The input decides the parameters that you want to apply and the resulting output that you are expecting. In between these two parameters, the logic resides that solve the problem and give the desire result. To simulate a WSNs, we have to first understand the few Input parameters as given below:


  • The Number of Sensors:-  This parameters ask you how many sensors you wants to deploy for sensing purpose.
  • Communication Range:- The another parameters the define the maximum or minimum communication range of a sensor node.
  • Size of Deployment Area:- What will be the size of the sensing area.
  • Types of sensors:- There are basically two types of the sensors normally we deploy in a WSNs. Once called unknown sensor node (without GPS) and another called anchor nodes (with GPS).
  • Deployment Ratio:-This parameter decides the ratio of sensor node and anchor node. Usually, the anchor nodes are lesser than the sensor nodes.
  • Deployment Scenarios:- There are four categories of deployment scenarios:
    • Static Sensor Static Anchor
    • Static Sensors Mobile Anchor
    • Mobile Sensors Mobile Anchor
    • Mobile Sensors Static Anchor
  •  Mobility Models:- Either the sensor is mobile or anchor is mobile, the mobility model is the important parameter, that decides the trajectory of a sensor or anchor.
  • Initial Energy of Sensors:- What will be the energy of a sensors.

These are few input parameters that we will use to design a simple scenario of  WSNs. In this post, we have only include the fewer input parameters that is essential to begin simulation of WSNs.
Later, we will study the advance topics such as radio propagation irregularity, antenna prospect, real experimentation of WSNs, and various research domain of WSNs.  In the next post, we will create a simple simulation environment of WSNs using a MATLAB Tool. 

Comments

Post a Comment

Popular posts from this blog

Types of Algorithm and Its Complexity Analysis

Image
In this post, we will learn types of Algorithm and its time complexity analysis with examples  An algorithm is divided into two forms called iterative and recursive, as shown above. Firstly, we analyze the time complexity of the iterative algorithm and then recursive. Example 1:                           A()                           {                            int i;                            for(i=1 to n)   % loop run n times                            pf("deepa");                           } First, the above function is fall into the independent category. Hence, the running time of the loop will be n and it print the particular name n times. Therefore, the worst case time complexity of this algorithm will be O(n). Example 2:                          A()                         {                         int i;                         for(i=1, i^2<=n, i++)                         printf("deepa");                         } Similarly
Read more

First Step of Problem Solving Using Data Structure and Algorithm

Image
What is problem ? A state of difficulty that need to be resolve A problem exist and its solution needs to be  attain either correct or incorrect A problem gives an opportunity to improve the current state A problem is a difference between the  current state and goal state Problem Faced in daily life        Like making the decisions what should i wear today to look good? what career? what job? what shoes? what course? What happens when bad decisions are made ? Wastage of time and resource   Six steps to ensure  a Best decision in PROBLEM SOLVING Identify the problem first understand the problem Identify the different way to solve the problem (efficient) Select the best one solution among the various alternative solutions Identify the list of steps to solve a problem (instructions) Evaluate the solution of given problem (different set of inputs) Take the problem of and apply the six step of problem solving     A   Water Jug Pro
Read more

Asymptotic Notations

Image
 In computer science, any problem can be solved using the programming language. And a particular problem can have multiple solutions in terms of Algorithm. To find out which one is the best algorithm for a problem, we analyse it in terms of time and space.  To define the time and space complexity of an algorithm, we use the Asymptotic notation. Mostly three types of Asymptotic notation is widely preferred to represent the complexity of the algorithm. Big-O mathematically represented as O The X-axis of the above graph showing the size of the input (n) and Y axis showing the increase in  time (t) . In the graph,   f(n) function showing the increase of time as input   size   n is increasing for a particular algorithm. Beside, the another function called cg(n) showing the worst case of f(n) . Hence, in the above graph cg(n)  is above the f(n). If we bound the time complexity or f(n) of a given algorithm in terms of input n with another function called cg(n) for all
Read more