Node Degree Improved Localization Algorithms for Ad-Hoc Networks

2011 ◽  
pp. 290-293 ◽  
Author(s):  
Rico Radeke ◽  
Jorge Juan Robles
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Node Degree ◽  
Localization Algorithms ◽  
Hoc Networks

scholarly journals Autonomous Clustering Scheme for Removing the Effects of Heterogeneous Node Degrees in Ad Hoc Networks

2016 ◽  
Vol 21 (2) ◽  
pp. 43-54
Author(s):  
Ryosuke Morita ◽  
Chisa Takano ◽  
Masaki Aida
Keyword(s):  
Ad Hoc Networks ◽  
Large Scale ◽  
Ad Hoc ◽  
Cluster Head ◽  
Node Degree ◽  
Hierarchical Routing ◽  
Mobile Ad Hoc ◽  
The Difference ◽  
Hoc Networks ◽  
Heterogeneous Node

Abstract In large scale mobile ad hoc networks (MANETs), it is effective to reduce the load of routing by introducing hierarchical routing, and it is conducted by clustering of nodes. A clustering mechanism based on the diffusion equation is a typical autonomous clustering in MANETs, and gives appropriate clustering if all the node degrees are uniform. However, node degrees in MANETs are heterogeneous in general, the fact causes the difference in the strength of diffusion effect. This difference causes that the position of cluster head tends to be around the boundary of networks and degrade battery efficiency of nodes. In this paper, by introducing an asymmetric diffusion depending on node degree, we propose a new clustering method independent of heterogeneity of node degrees. We show that the proposed method has efficient characteristics for battery consumption. In addition, we show the comparison of the proposed method with the conventional method with respect to the efficiency of routing.

scholarly journals Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios

2016 ◽  
Vol 2016 (1) ◽  
Author(s):  
Wei Xiong ◽  
Jingjing Xu ◽  
Yan Li ◽  
Nan Zhao ◽  
Xiangkui Wan ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Node Degree ◽  
Hoc Networks

scholarly journals A novel routing protocol considering the boundary effects for ad hoc networks

2020 ◽  
Vol 16 (1) ◽  
pp. 155014772090363
Author(s):  
Qingwen Wang ◽  
Haitao Yu
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Boundary Effects ◽  
Node Degree ◽  
Route Discovery ◽  
Discovery Process ◽  
On Demand ◽  
Distance Vector ◽  
Hoc Networks

To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.

Sign in / Sign up

Export Citation Format

Share Document