Trajectories of a Mobile Anchor

In the previous post, we have seen various deployment scenarios of a WSNs. In this post, we will see the different trajectories of a mobile beacon and their related parameters. The trajectories of a mobile beacon has a grater importance in WSNs. In a sensor networks, we deploy sensors along with a mobile anchor. This mobile anchor traverse the sensing area and assist the sensors to create a better network. 
Simple scenario of  mobile anchor and static sensor

In a wireless sensor network, we normally see different types of nodes with different responsibility. Sensor node primarily sense the environmental events, anchor node assist the sensors to find there location as well as become as a coordinator node or cluster head, and lastly a gateway node that transfer the data to a network or a base station. All these responsibility a mobile anchor can perform very efficiently. Hence, an efficient mobility or path planning is necessary to increase the network lifetime and communicate with maximum number of sensors. The efficient path panning is necessary to reduce the energy consumption of a mobile beacon. 

We will discuss and design the following trajectories in out next post:
  1. Circle Trajectory
  2. Spiral Trajectory
  3. Hilbert Trajectory
  4. S-Curve Trajectory
  5. Saw-tooth Trajectory
  6. Random Way-point Trajectory

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