Link probability, node degree and coverage in three-dimensional networks

Vieira, Luiz F. M.; Almiron, Marcelo G.; Loureiro, Antônio A. F.

doi:10.1016/j.adhoc.2015.08.011

Cited by 16 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To overcome the weakness of broadcasting Hello messages to obtain the node degree, scientific researchers proposed node degree acquirement methods without relying on Hello messages. [16][17][18] The link probability and the number of nodes in the networks are used to obtain node degree information. 16 However, the effects of the network boundary are not taken into account.…”

Section: Related Workmentioning

confidence: 99%

“…[16][17][18] The link probability and the number of nodes in the networks are used to obtain node degree information. 16 However, the effects of the network boundary are not taken into account. The average number of neighbors is calculated by considering the effect of network boundary, 17,18 while the deficiency of such method lies in the following: (1) nodes located in any areas have the same node degree.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Wang

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

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

Wang

2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…The nodes select the cluster head node. [32][33][34][35] An enhancement of the energy-conserving optimal path schedule (ECOPS) algorithm is the A-ECOPS algorithm. The ECOPS algorithm selects the relay node using the relative angle.…”

Section: Requirement Of Energy Balancing By Distance For Routingmentioning

confidence: 99%

Energy-efficient and reliable routing protocol for dynamic-property-based clustering mobile ad hoc networks

Lee

2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Mobile ad hoc networks comprise mobile nodes. The nodes both send and receive messages and can communicate with each other. Thus, the network builds its own network structure that is not dependent on the infrastructure. Owing to the characteristics of mobile ad hoc networks, they have been used in environments of poor communication, such as those in which the infrastructure cannot be built; for example, disaster areas and war zones. In this article, we propose an advanced energy-conserving optimal path schedule algorithm. The proposed algorithm sets the routing path using the relative angle, which is the distance between the source node and the base station. Using simulation results, we compared the proposed algorithm to existing algorithms. The protocol used by the proposed algorithm provides a higher packet delivery ratio and lower energy consumption than the lowest ID clustering algorithm and the mobility-based metric for clustering in the mobile ad hoc network algorithm.

show abstract

“…It is meaningless not to know the monitoring data of node location and if the area coverage is low, its application value will be affected. In addition, a good coverage method can also play a role in reducing the total cost [10]. Because the coverage of a single node is much smaller than that of target monitoring, many nodes must cooperate to achieve full target coverage [11].…”

Section: Introductionmentioning

confidence: 99%

A Cluster Sleep-Wake Scheduling Algorithm Based on 3D Topology Control in Underwater Sensor Networks

Zhang

Wang

Han

et al. 2019

Sensors

View full text Add to dashboard Cite

3D topology control in underwater sensor networks is of great significance to ensuring reliable and efficient operation of the network. In this paper, by analyzing the characteristics of an underwater sensor network, we take the cube as the basic unit to perform 3D partition of the monitoring area, define the 3D partition unit and basic cluster structure of the underwater sensor network, and arrange rotating temporary control nodes in the cluster. Then, a cluster sleep-wake scheduling algorithm is proposed that compares the remaining node energy. It selects the node with the largest remaining energy as the working node, and the remaining nodes complete the transition of dormancy and waiting states as long as they reach the preset dormancy time. The node state settings of this phase are completed by the temporary control node. Temporary control nodes selecting and sleep-wake scheduling are used in the algorithm through 3D topology control, which reduces energy consumption and guarantees maximum sensing coverage of the entire network and the connection rate of active nodes. Simulation results further verify the effectiveness of the proposed algorithm.

show abstract

Link probability, node degree and coverage in three-dimensional networks

Cited by 16 publications

References 5 publications

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

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

Energy-efficient and reliable routing protocol for dynamic-property-based clustering mobile ad hoc networks

A Cluster Sleep-Wake Scheduling Algorithm Based on 3D Topology Control in Underwater Sensor Networks

Contact Info

Product

Resources

About