ENROUTE: An Entropy Aware Routing Scheme for Information-Centric Networks (ICN)

Author(s):  
Bitan Banerjee ◽  
Sibendu Paul ◽  
Omar Alfandi ◽  
Arnab Raha ◽  
Amitava Mukherjee
Keyword(s):  
2012 ◽  
Vol 35 (5) ◽  
pp. 910-917
Author(s):  
Gui-Ming ZHU ◽  
De-Ke GUO ◽  
Shi-Yao JIN

Author(s):  
Mehak Mehak ◽  
◽  
G. Poonam ◽  
C. K. Nagpal ◽  
Shailender Gupta ◽  
...  

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.


Author(s):  
Yiftach Richter ◽  
Itsik Bergel

AbstractIn this paper we consider opportunistic routing in multiple-input–multiple-output (MIMO) random wireless ad-hoc networks (WANETs). Our analysis uses a proper model of the physical layer together with an abstraction of the higher communication layers. We assume that the nodes are distributed according to a Poisson point process and consider a routing scheme that opportunistically selects the next relay and the number of spatially multiplexed data streams. The routing decisions are based on geographic locations, the channel gains of the neighbor nodes, and the statistical characterization of all other nodes. Unlike the single antenna case, the optimal routing scheme cannot be explicitly expressed. Hence, we propose a smart-routing scheme for MIMO that adapts the number of data streams per user to the channel conditions. The numerical results demonstrate that this scheme outperforms all previously published schemes for this scenario. The findings highlight the importance of channel state information for efficient routing, and the need for an adaptive selection of the number of data streams at each transmitter.


Sign in / Sign up

Export Citation Format

Share Document