1,566 research outputs found
Structured Peer-to-Peer Overlay Deployment on MANET: A Survey
There are many common characteristics between Peer-to-Peer (P2P) overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, dynamicity and changing topology are the most shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality, and their routing information can complement that of MANET. MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. The aim of this paper is to survey current P2P over MANET systems. Specifically, this paper focuses on and investigates structured P2P over MANET. Overall, more than thirty distinct approaches have been classified into groups and introduced in tables providing a structured overview of the area. The survey addresses the identified approaches in terms of P2P systems, MANET underlay systems and the performance of the reviewed systems
Recommended from our members
Multimedia delivery in the future internet
The term “Networked Media” implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizens’ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications “on the move”, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
A lightweight distributed super peer election algorithm for unstructured dynamic P2P systems
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de ComputadoresNowadays with the current growth of information exchange, and the increasing mobility of devices, it becomes essential to use technology to monitor this development. For that P2P networks are used, the exchange of information between agencies is facilitated, these now being applied in mobile networks, including MANETs, where they have special features such as the fact that they are semi-centralized, where it takes peers more ability to make a greater role in the network. But those peer with more capacity, which are used in the optimization of various parameters of these systems, such as optimization\to research, are difficult to identify due to the fact that the network does not have a fixed topology, be constantly changing, (we like to go online and offline, to change position, etc.) and not to allow the exchange of large messages. To this end, this thesis proposes a distributed election algorithm of us greater capacity among several possible goals, enhance research in the network. This includes distinguishing characteristics, such as election without global knowledge network, minimal exchange of messages, distributed decision made without dependence on us and the possibility of influencing the election outcome as the special needs of the network
Efficient packet delivery in modern communication networks
Modern communication networks are often designed for diverse applications, such as voice, data and video. Packet-switching is often adapted in today’s networks to transmit multiple types of traffic. In packet-switching networks, network performance is directly affected by how the networks handle their packets. This work addresses the packet-handling issues from the following two aspects: Quality of Service (QoS) and network coding.
QoS has been a well-addressed issue in the study of IP-based networks. Generally, nodes in a network need to be informed of the state of each communication link in order to make intelligent decisions to route packets according to their QoS demands. The link state can, however, change rapidly in a network; therefore, nodes would have to receive frequent link state updates in order to maintain the latest link state information at all times. Frequent link state updating is resource-consuming and hence impractical in network design. Therefore, there is a trade-off between the link state updating frequency and the QoS routing performance. It is necessary to design a link state update algorithm that utilizes less frequent link state updates to achieve a high degree of satisfaction in QoS performance. The first part of this work addresses this link state update problem and provides two solutions: ROSE and Smart Packet Marking. ROSE is a class-based link state update algorithm, in which the class boundaries are designed based on the statistical data of users’ QoS requests. By doing so, link state update is triggered only when certain necessary conditions are met. For example, if the available bandwidth of a link is fluctuating within a range that is higher than the highest possible bandwidth request, there is no need to update the state of this link. Smart Packet Marking utilizes a similar concept like ROSE, except that the link state information is carried in the probing packet sent in conjunction with each connection request instead of through link state updates.
The second part of this work addresses the packet-handling issue by means of network coding. Instead of the traditional store-and-forward approach, network coding allows intermediate nodes in a multi-hop path to code multiple packets into one in order to reduce bandwidth consumption. The coded packet can later be decoded by its recipients to retrieve the original plain packet. Network coding is found to be beneficial in many network applications. This dissertation makes contributions in network coding in two areas: peer-to-peer file sharing and wireless ad-hoc networks. The benefit of network coding in peer-to-peer file sharing networks is analyzed, and a network coding algorithm – Downloader-Initiated Random Linear Network Coding (DRLNC) – is proposed. DLRNC shifts the coding decision from the seeders to the leechers; by doing so it solves the “collision” problem without increasing the field size. In wireless network coding, this work addresses the implementation difficulty pertaining to MAC layer scheduling. To achieve the ideal network coding gain in wireless networks, it requires perfect MAC layer scheduling. This dissertation first provides an algorithm to solve the ideal-case MAC layer scheduling problem. Since the ideal MAC layer schedule is often difficult to realize, a practical approach is then proposed to increase the network coding performance by modifying the ACK packets in the 802.11 MAC
- …