2 research outputs found
Bearing-Based Network Localization Under Gossip Protocol
This paper proposes a bearing-based network localization algorithm with a
randomized gossip protocol. Each sensor node is assumed to be able to obtain
the bearing vectors and communicate its position estimates with several
neighboring agents. Each update involves two agents, and the update sequence
follows a stochastic process. Under the assumption that the network is
infinitesimally bearing rigid and contains at least two beacon nodes, we show
that the proposed algorithm could successfully estimate the actual positions of
the network in probability. The randomized update protocol provides a simple,
distributed, and reduces the communication cost of the network. The theoretical
result is then supported by a simulation of a 1089-node sensor network.Comment: preprint, 7 pages, 2 figure
Recommended from our members
Robust and efficient membership management in large-scale dynamic networks
Epidemic protocols are a bio-inspired communication and computation paradigm for large-scale networked systems based on randomised communication. These protocols rely on a membership service to build decentralised and random overlay topologies. In large-scale, dynamic network environments, node churn and failures may have a detrimental effect on the structure of the overlay topologies with negative impact on the efficiency and the accuracy of applications. Most importantly, there exists the risk of a permanent loss of global connectivity that would prevent the correct convergence of applications. This work investigates to what extent a dynamic network environment may negatively affect the performance of Epidemic membership protocols. A novel Enhanced Expander Membership Protocol (EMP+) based on the expansion properties of graphs is presented. The proposed protocol is evaluated against other membership protocols and the comparative analysis shows that EMP+ can support faster application convergence and is the first membership protocol to provide robustness against global network connectivity problems