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.
In the area of network performance and discovery, network tomography focuses on reconstructing network properties using only end-to-end measurements at the application layer. One challenging problem in network tomography is reconstructing available bandwidth along all links during multiple source / multiple destination transmissions. The traditional measurement procedures used for bandwidth tomography...
Trust is the foundation of interpersonal relationship and interaction as in social networks as in real world. Previous researches about the trust between users mainly focus on nonadjacent users in social networks, where the trust between adjacent users is assumed to be known. However, in most social networks, the trust between adjacent users is unknown, that limits the applications of those nonadjacent...
Success rate, query hit rate and speed of search are some common metrics for evaluating p2p search algorithms. Yet, these metrics do not consider properties of discovered sources and their impact on download performance. A requesting peer is interested in stable serving peers with high upload bandwidth to minimize its download time and therefore, this is the superiority of a search algorithm to find...
IEEE 802.11s is an emerging standard for wireless mesh networks. Networks based on IEEE 802.11s directly benefit from existing security mechanisms in IEEE 802.11. This limits the attack surface of IEEE 802.11s significantly for adversaries that cannot authenticate with the network. Mesh networks are, however, often conceived for community network scenarios, which are inherently more open than managed...
As tactical military networks deploy new IP-capable radios (e.g., JTRS), it is expected that network connectivity will increase both within and among Service and Coalition networking domains (e.g., Army, Navy, NATO). Joint commanders will likely desire control of this increased connectivity to complete their mission goals. One mechanism known to (coarsely) manage multiple disparate IP networks is...
This paper provides an overview of reputation-based approaches aiming to enhance trusted functionality in ad hoc distributed resource-sharing networks. More specifically, it focuses on three essential functions, namely, secure routing, secure resource management and trusted service composition. We first note the necessity to use reputation and trust to establish safe and efficient collaboration in...
Collaborative filtering(CF) recommender systems are among the most popular approaches to solving the information overload problem in social networks by generating accurate predictions based on the ratings of similar users. Traditional CF recommenders suffer from lack of scalability while decentralized CF recommenders (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in...
In the standard AODV protocol, the shortest path is always selected. But this shortest path is the easiest broken one. In this paper, we propose an improvement of AODV protocol called AMAODV(Adaptative Mobility aware AODV). This protocol is based on considering the distance and relative velocity between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it...
Decentralized and self-organizing mechanisms present promising approaches to deal with the massive amount of data generated by different components in the smart grid. In this work we present a self-organized approach that is able to take decisions locally and in a distributed way. Our approach distinguishes between an infrastructure level and a decision level. The middleware processes running on the...
JXTA is a peer-to-peer (P2P) middleware which has undergone successive iterations through its 10 years of history, slowly incorporating a security baseline that may cater to different applications and services. However, in order to appeal to a broader set of secure scenarios, it would be interesting to take into consideration more advanced capabilities, such as anonymity. There are several proposals...
Delay tolerant networks (DTNs) attempt to minimize the possible adverse impacts due to limitations and anomalies in intermittently connected networks. Routing in such sparse and dynamic networks is difficult as the source has little information about the destination, rendering a key challenge to find one simple and effective message delivery mechanism. In this paper, we propose PriCost, a protocol...
Understanding of the Internet evolution is important for many research topics, such as network planning, optimal routing design, etc. In this paper, we try to analyze CAIDA AS-level topology dataset from 2004 to 2010 to validate two conjectures on the Internet evolution, i.e., the Internet flattening trend and the preferential attachment rule. Our analysis shows that the evolvement of the Internet...
Following the continuous evolution of the Internet and related technologies, distributed and collaborative networked computing systems have become one of the increasingly considered fields of research. In order to realize the cooperation of nodes in distributed systems, trustworthy group formation is required to support cooperative activities of nodes like sharing of their computing power, storage...
Opportunistic networking differs from more conventional architectures by the lack of existing network infrastructure, which can cause intermittent connectivity or increased communication delay between nodes. From a message routing perspective, solving these problems require a different set of techniques than those used in more traditional network schemes. Forwarding algorithms in these scenarios aim...
Wireless mesh networks (WMN) enables the expansion of communication networks and broadband services. This expansion allows the use of applications like streaming multimedia in P2P (Peer-to-Peer). P2P-TV and WMNs share similar features like self-organization and decentralization in dynamic network environments and multi-hop transmission. In this context quality measurement has become essential due...
Recommender systems have been strongly researched within the last decade. With the arising and popularization of digital social networks a new field has been opened for social recommendations. Considering the network topology, users interactions, or estimating trust between users are some of the new strategies that recommender systems can take into account in order to adapt their techniques to these...
Cloud computing has been more and more popular and widely used as a new model of information technology. In order to achieve a reliable and efficient operation of the cloud environment, it is important for cloud providers to detect and deal with system anomalies in time. In this paper, we present a method for anomaly detection in MapReduce environment. This method is based on peer-similarity and uses...
Today, the main usage of the Internet has become increasingly about content generation, sharing, retrieval and massive distribution. Widely used P2P applications, UserGenerated Content (UGC) (e.g., Youtube, Flickr) and increasingly popular Social Networks make the Internet service model become more content-oriented than host-oriented as it has been this far. To match the Internet infrastructure to...
We consider the problem of content distribution to a group of cooperative wireless peer devices that desire the same block of information. The QoS metric is that peers are all required to receive the block by a fixed deadline, with a certain target probability. The block is divided into chunks, which are received via two methods that can be used simultaneously — (i) the B2P (base-station-to-peer)...
The nodes over mobile peer-to-peer networks often show selfish behavior for their limited resource and different interest. So detecting and stimulating selfish nodes to cooperate is a new important research topic. Through allowing nodes to freely express their subjective forwarding willing, the detection mechanism is implemented. Through punishing nodes which have a higher selfish degree than given...
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.