Fragmented Opportunistic Routing Algorithm In WSN

• Ayoubi, Kamran ^[1] ; Mohammadi Zanjireh, Morteza ^[2] ; Sadeghi, Hamid ^[3]
  1. [1] Amirkabir University of Technology

     Amirkabir University of Technology

     Irán

     
  2. [2] Imam Khomeini International University

     Imam Khomeini International University

     Irán

     
  3. [3] National Cheng Kung University

     National Cheng Kung University

     Taiwán

     

  Mostrar afiliaciones +
• Localización: Revista Publicando, ISSN-e 1390-9304, Vol. 5, Nº. 15, 1 (Abril-Mayo-Junio), 2018, págs. 1-17
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • In wireless networks, using traditional unicast routing algorithm is inappropriate due to broadcast nature and spatial diversity of wireless links. Selecting a set of N nodes as next hop in wireless networks instead of one node, increases delivery probability relative to N. This fact led to emerging a new routing schema in wireless network in recent years naming Opportunistic Routing. Opportunistic routing takes advantages of wireless networks to get higher performance metrics by selecting multiple nodes as next hop for each node instead of selecting one node as in traditional routing algorithms, Our proposed Opportunistic routing algorithm (named Fragmented Opportunistic Routing) uses local information and easy to be applicable. It tolerates nodes' failure and changes in network and upon a change in a part of network; there is no needs that all the nodes in network reconfigure their Opportunistic Routing Tables.