23-01-2015, 06:30 AM
i want to source code for greedy routing for wirless sensor network
|
greedy routing for wireless sensor networks code in asp net
|
i want to source code for greedy routing for wirless sensor network
27-03-2017, 10:12 AM
The problem of inaccessibility (ie, the so-called gap problem) that exists in greedy routing algorithms for wireless sensor networks. Some of the current research works can not completely solve the vacuum problem, while others exist
Schemes that can guarantee the delivery of packages with excessive consumption of overhead control. In addition, the Hop Count Reduction (HCR) scheme is used as a short cut technique to reduce routing jumps by listening to neighbor traffic, while the intersection navigation mechanism (IN) is proposed to obtain the best Balancing direction for the border path with Adopting the shortest trajectory criterion. In order to maintain the network requirement of the RUT scheme proposed under the non-UDG networks, the partial construction mechanism UDG (PUC) is proposed to transform the non-UDG into UDG for a portion of nodes that facilitate the border path. These three schemes are incorporated into the GAR protocol to further improve routing performance with reduced communication overhead. Correction tests for the GAR scheme are also given in this article.
|
« Next Oldest | Next Newest »
|
