A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Abstract--As society's dependence on network technology increases, the need for resilience and survivability in these services becomes increasingly apparent. Since the user ex...
Justin P. Rohrer, Ramya Naidu, James P. G. Sterben...
In peer-to-peer networks, it is very difficult to route query successfully, since nodes in the routing path do not always behave according to pre-established routing protocols. To...
In this paper, we consider filtering false reports in braided multipath routing sensor networks. While multipath routing provides better resilience to various faults in sensor net...
This paper presents a novel approach for individual agent’s motion simulation in real-time virtual environments. In our model, we focus on addressing two problems: 1) the control...