The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Cooperation in social dilemma games has been shown to be favored through evolution by various means such as topological heterogeneities or high benefit to cost ratio. As an extension to the previous studies with pure strategies, we incorporate the mixed strategies in the evolutionary dynamics and provide a higher resolution for the quantitative comparison of different scenarios with varying network...
Anomaly detection is important to monitor and keep the health of large scale IP networks. principal component analysis (PCA) based methods have been proposed with major limitation on the scalability. In this paper, we apply higher-order singular value decomposition (HOSVD) and higher-order orthogonal iteration (HOOI) algorithms on network traffic anomaly detection by rearranging the data in tensor...
Geographical routing is powerful for its ability to discover a path to the destination without the help of global states. However, stateless geographical routing usually involves a large number of hops when detouring around voids of the network. In this paper, we propose an efficient path pruning (PP) strategy to reduce the excessive number of hops caused by the detouring mode of geographical routing...
Geographical routing protocols are promising in wireless sensor networks because of their ability to discover a sub-optimal route without the help of a global state. Existing geographical routing protocols can guarantee packet delivery if the network topology after planarization remains connected. However, face routing used in non-flooding geographical routing algorithms usually results in a large...
Geographical routing is powerful for its ability to discover route to the destination without the help of global state. However, detours usually occur when the packet reaches a local minimum. In this case, the network topology has to be reduced to a planar graph and recovery schemes such as face routing are needed. However, face routing may create a large number of hops on a planar graph. When multiple...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.