2. BY PAYEL BANDYOPADYAY

3. WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers) for setting up a wireless connection WHAT I AM GOING TO DEAL ABOUT? The challenges that cognitive radio network faces in communicating with each other in an ad-hoc manner WHY IS IT A CHALLENGE FOR CR NETWORKS? CR networks have multi-hop architecture and dynamic spectrum access which increases the complexity of designing the communication protocols at different layers

4. WHAT IS THE MAIN ROUTING PROBLEM IN CRAHNS ? THE CREATION AND THE MAINTENANCE OF WIRELESS MULTI-HOP PATHS AMONG SECONDARY USERS ( SU S ) BY DECIDING BOTH THE RELAY NODES AND THE SPECTRUM TO BE USED ON EACH LINK OF THE PATH

5. Routing in multi-hop CRNs

6. WHAT ARE THE CHALLENGES OF ROUTING IN CRAHNS?  SPECTRUM AWARENESS: Should always be aware of the available spectrum  SET UP OF QUALITY ROUTES: Quality of end to end routes is measured not only by throughput, delay, energy efficiency and fairness but also by path stability and PU presence  ROUTE MAINTENANCE: Sudden appearance of PU may lead to sudden route failure so how to restore the “broken” paths without affecting the quality of routes

7. CLASSIFICATION OF COGNITIVE ROUTING SCHEME  FULL SPECTRUM KNOWLEDGE: NODES IN CRNS HAVE FULL KNOWLEDGE ABOUT THE AVAILABILITY OF SPECTRUM FROM THE CENTRAL SPECTRUM DATABASE RECENTLY PROMOTED BY FCC TO SHOW THE AVAILABILITY OF SPECTRUM BELOW 900 MHZ AND AROUND 3GHZ  LOCAL SPECTRUM KNOWLEDGE: NODES DO NOT HAVE A FULL KNOWLEDGE OF THE SPECTRUM AVAILABILITY. EACH SU HAS ITS OWN SPECTRUM AVAILABILITY KNOWLEDGE GATHERED THROUGH DISTRIBUTED PROTOCOLS

8. CLASSIFICATION OF COGNITIVE ROUTING SCHEMES

9. GRAPH BASED ROUTING APPROACH  Hey! I am based on full spectrum knowledge  I consist of 2 phases  Graph abstraction: G =(N, V, f(V)), where N = number of nodes, V = number of edges and f(V) = function which allows to assign a weight to each edge of the graph  Route calculation: Designing a path in the graph connecting source–destination pairs  I also take care of Channel assignment

10. Doesn’t this sounds interesting? Let’s check it out then……………….

11. Layered-graph creation

12. Layered graph architecture of 4 nodes of CRNs

13. WHAT ARE THESE EDGES?  Access edges connects each node with it’s suitable sub nodes  Horizontal edges connects sub nodes of same logical layers  Vertical edges connects sub nodes of various layers of same secondary device to portray the switching ability of secondary device from one channel to another channel to forward incoming traffic.

14. HOW ARE COSTS ASSIGNED TO THESE EDGES?  The cost of vertical edge depends on channel switching overhead and is fixed in routing path computation period  The cost of horizontal edge is dependent on link usage  The cost of access edge can be set arbitrarily because only access edge of source and destination participate in the path computation

15. Figure showing how costs are assigned to each edge

16. HOW IS PATH DESIGNED BETWEEN THESE 4 NODES?  Suppose, we want to design path from A to D  First we choose node A and B  Path we choose is A, A1, B1, B  As, both sub nodes A1 and B1 are in channel 1, so radios of both A and B is assigned to channel 1  As, sub nodes A1 and B1 are taken in the path, they are referred as active node while the sub nodes A2 and B2 are referred as inactive nodes  Update the vertical and horizontal edges of the sub nodes

17. HOW ARE EDGES UPDATED?  We remove the horizontal edge between A2 and B2  We change the vertical edge between A1 and A2 to unidirectional from A1 to A2. Similarly, vertical edge between B1 and B2 becomes unidirectional from B1 to B2  The horizontal edge of B2 and C2 is changed to out going from B2  Then we increase the cost of all horizontal edges that are related to the path- cost of horizontal edges between A1, B1 and between B1, C1 is increased

18. Updated layered graph after path A -> B is computed

19. Updated edge costs

20. THEN HOW IS TOTAL PATH CONSTRUCTED?  Similarly, we compute the path between C and D in the  We assign C and D nodes in channel 2 as both of their active sub nodes (C2;D2) lies in channel 2

21. BUT HOW IS PATH FROM A TO D CONSTRUCTED?  While computing the total path from A to D, B and C are in different primary channels  So, when large number of packets of this path arrives at node B, it switches its channel from channel 1 to channel 2  In most link centric channel assignment cases, nodes often fluctuate between channels to maintain the link level connectivity to neighbours

22. OK FRIENDS I WAS GRAPH BASED ROUTING APPROACH! HOPE YOU ALL ENJOYED MY APPROACH OF DESIGNING ROUTING PATHS. BYE BYE!

23. WELCOME TO LOCAL SPECTRUM KNOWLEDGE SCHEME! I DO NOT HAVE A FULL KNOWLEDGE OF THE SPECTRUM AVAILABILITY. IN MY SCHEME EACH SU HAS ITS OWN SPECTRUM AVAILABILITY KNOWLEDGE GATHERED THROUGH SPECTRUM SENSING. BUT I CAN ASSURE YOU OF PROVIDING THE BEST ROUTING PATHS! LET’S SEE HOW……………………..

24. INTERFERENCE AND POWER BASED SOLUTIONS  Mainly based on power consumption for transmission and the interference that is generated along a multi hop path through secondary users  It solves the problem of neighbour discovery and routing

25. WIRELESS AD HOC VERSUS COGNITIVE WIRELESS AD HOC (A) Wireless ad hoc network (B) Cognitive wireless ad hoc network

26. WHY IS NEIGHBOUR DISCOVERY A PROBLEM?  To discover neighbouring terminals, it is necessary for the both terminals of a transmitter and a receiver to be the same wireless system  If the primarily active wireless systems of the both terminals are different, the neighbour discovery does not success at all  Additionally, even though the active wireless systems of the terminals are the same, the neighbour discover will fail if the radio coverage ranges of them do not reach in each other

27. DIDN’T UNDERSTAND? WAIT DON’T BE DEPRESSED!

28. Neighbour discovery problems

29. Limitation of routing in cognitive wireless ad hoc

30. HOW CAN THESE PROBLEM BE SOLVED? Don’t worry my protocol is designed in such a manner that it solves these issues! Don’t believe me? Come, let’s check it out then…….

31. COMMON LINK CONTROL RADIO (CLCR)  Common link control radio (CLCR) is an active wireless system in each cognitive terminal, which is necessary to be the same wireless system and is required to be as a more energy efficient wireless system and a wider coverage area  CLCR enables us to effectively solve the neighbour discovery problem by which every terminal performs neighbour discovery over a common active wireless system

32. Neighbour discovery and routing over CLCR

33. BUT HOW IS ROUTING PATH CONSTRUCTED? 1. At first, source node (called the transmitter) broadcasts a neighbour discovery request over CLCR 2. When receiving the request, the receivers feed back the information of all available wireless systems to the transmitter over CLCR 3. The transmitter selects a receiver that is reachable by the minimum weight wireless system into the neighbours 4. This steps goes on repeating until destination node is reached.

34. An example of routing parameters

35. Hey! Didn’t I solve all the problems that I specified? Ok, I am done! Hope you all enjoyed my approach of designing routing paths. Bye bye!

36. DELAY BASED SOLUTIONS  Hey! I take care of delays that occur in establishing, maintaining and sending traffic in multi-hop routes in CRAHNs.  The delay metrics that I considered is queuing delay

37. WHAT IS QUEUING DELAY? Queuing delay refers to output transmission capacity of a single node

38. SO HOW DO I TAKE CARE OF DELAYS WHILE DESIGNING ROUTING PATHS?  My protocol is based on local coordination of neighbours  A node which is common among the neighbour nodes decides whether to keep the incoming flow or to change its direction to its neighbours based on the local work load

39. Route establishment

40. Hey didn’t I solve the delay problem? Ok, I am done! Hope you all enjoyed my approach of designing routing paths. Bye bye!

41. LINK QUALITY/STABILITY BASED SOLUTIONS  My main aim is to maintain a stable route between secondary source destination pairs with low maintenance costs  When PUs become active, one or more links should be altered with a link that is not interfered by PUs  SUs coordinate with each other in terms of signalling, which measures cost in terms of power and service interruption time during switching routes

42. WHAT ARE EPOCHS? Epochs means time interval in which the network topology is stable

43. PU becoming active

44. Rerouting due to PU activation

45. Hey didn’t I maintained stable path between SU nodes in spite of PU interference? Ok, I am done! Hope you all enjoyed my approach of designing routing paths. Bye bye!

46. Hey wasn’t my approaches interesting? Did I solve the routing issues? Do you have any questions?