Use of context-awareness in mobile peer-to-peer networks

Mobile ad-hoc network are an emerging research field due to the potential range of applications that they support and for the problems they present due to their dynamic nature. Peer-to-peer is an example of a class of applications that have recently been deployed on top of ad-hoc networks. In this paper we propose an approach based on context-awareness to allow peer-to-peer applications to exploit information on the underlying network context to achieve better performance and better group organization. Information such as availability of resources, battery power, services in reach and relative distances can be used to improve the routing structures of the peer-to-peer network, thus reducing the routing overhead

Cross-layer Peer-to-Peer Computing in Mobile Ad Hoc Networks

The future information society is expected to rely heavily on wireless technology. Mobile access to the Internet is steadily gaining ground, and could easily end up exceeding the number of connections from the fixed infrastructure. Picking just one example, ad hoc networking is a new paradigm of wireless communication for mobile devices. Initially, ad hoc networking targeted at military applications as well as stretching the access to the Internet beyond one wireless hop. As a matter of fact, it is now expected to be employed in a variety of civilian applications. For this reason, the issue of how to make these systems working efficiently keeps the ad hoc research community active on topics ranging from wireless technologies to networking and application systems. In contrast to traditional wire-line and wireless networks, ad hoc networks are expected to operate in an environment in which some or all the nodes are mobile, and might suddenly disappear from, or show up in, the network. The lack of any centralized point, leads to the necessity of distributing application services and responsibilities to all available nodes in the network, making the task of developing and deploying application a hard task, and highlighting the necessity of suitable middleware platforms. This thesis studies the properties and performance of peer-to-peer overlay management algorithms, employing them as communication layers in data sharing oriented middleware platforms. The work primarily develops from the observation that efficient overlays have to be aware of the physical network topology, in order to reduce (or avoid) negative impacts of application layer traffic on the network functioning. We argue that cross-layer cooperation between overlay management algorithms and the underlying layer-3 status and protocols, represents a viable alternative to engineer effective decentralized communication layers, or eventually re-engineer existing ones to foster the interconnection of ad hoc networks with Internet infrastructures. The presented approach is twofold. Firstly, we present an innovative network stack component that supports, at an OS level, the realization of cross-layer protocol interactions. Secondly, we exploit cross-layering to optimize overlay management algorithms in unstructured, structured, and publish/subscribe platforms

CodeTorrent: Content Distribution using Network Coding in VANETs

Mobile peer-to-peer systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we propose a network coding based file swarming protocol targeting vehicular ad hoc networks (VANET). We argue that file swarming protocols in VANET should deal with typical mobile network issues such as dynamic topology and intermittent connectivity as well as various other issues that have been disregarded in previous mobile peer-to-peer researches such as addressing, node/user density, non-cooperativeness, and unreliable channel. Through simulation, we show that the efficiency and effectiveness of our protocol allows shorter file downloading time compared to an existing VANET file swarming protocol

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

Willage: A Two-Tiered Peer-to-Peer Resource Sharing Platform for Wireless Mesh Community Networks

The success of experiences such as Seattle and Houston Wireless has attracted the attention on the so called wireless mesh community networks. These are wireless multihop networks spontaneously deployed by users willing to share communication resources. Due to the community spirit characterizing such networks, it is likely that users will be willing to share other resources besides communication resources, such as data, images, music, movies, disk quotas for distributed backup, and so on. In other words, it is expected that peer-to-peer applications will be deployed in such type of networks. In this paper we propose Willage, a platform for resource localization in wireless mesh community networks with mobile users. The platform is based on a two-tiered architecture: resources are made available at the lower tier, which is composed of mobile terminals, whereas information on their localization is managed at the upper layer, which is composed of wireless mesh routers. We also introduce Georoy, an algorithm for the efficient retrieval of the information on resource localization based on the Viceroy algorithm. Simulation results show that Willage achieves its goal of enabling efficient and scalable peer-to-peer resource sharing in wireless mesh community networks

Effects of Data Replication on Data Exfiltration in Mobile Ad hoc Networks Utilizing Reactive Protocols

A swarm of autonomous UAVs can provide a significant amount of ISR data where current UAV assets may not be feasible or practical. As such, the availability of the data the resides in the swarm is a topic that will benefit from further investigation. This thesis examines the impact of le replication and swarm characteristics such as node mobility, swarm size, and churn rate on data availability utilizing reactive protocols. This document examines the most prominent factors affecting the networking of nodes in a MANET. Factors include network routing protocols and peer-to-peer le protocols. It compares and contrasts several open source network simulator environments. Experiment implementation is documented, covering design considerations, assumptions, and software implementation, as well as detailing constant, response and variable factors. Collected data is presented and the results show that in swarms of sizes of 30, 45, and 60 nodes, le replication improves data availability until network saturation is reached, with the most significant benefit gained after only one copy is made. Mobility, churn rate, and swarm density all influence the replication impact

A Tutorial on Cross-layer Optimization Wireless Network System Using TOPSIS Method

Each other, leading to issues such as interference, limited bandwidth, and varying channel conditions. These challenges require specialized optimization techniques tailored to the wireless environment. In wireless communication networks is to maximize the overall system throughput while ensuring fairness among users and maintaining quality of service requirements. This objective can be achieved through resource allocation optimization, where the available network resources such as bandwidth, power, and time slots are allocated to users in an optimal manner. Optimization-based approaches in wireless resource allocation typically involve formulating the resource allocation problem as an optimization problem with certain constraints.. These techniques provide practical solutions with reduced computational complexity, although they may not guarantee optimality. In summary, optimization-based approaches have been instrumental in studying resource allocation problems in communication networks, including the wireless domain. While techniques from the Internet setting have influenced the understanding of congestion control and protocol design, specific challenges in wireless networks necessitate tailored optimization techniques that account for interference, limited bandwidth, and varying channel conditions. power allocation problem in wireless ad hoc networks Cross-layer optimization refers to the process of jointly optimizing the allocation of resources across different layers of wireless networks, the interactions between different layers become more complex due to the shared medium and time-varying channel conditions.  Nash equilibrium, where no user can unilaterally improve its own performance by changing its strategy. Game theory can capture the distributed nature of wireless networks and provide insights into the behavior of users in resource allocation scenarios Additionally, heuristics and approximation algorithms are often employed in wireless resource allocation due to the complexity of the optimization problems involved. In traditional cellular systems, each user is allocated a fixed time slot for transmission, regardless of their channel conditions. However, in opportunistic scheduling. Alternative parameters for “Data rate Ž kbps, Geographic coverage ,  Service requirements , cost ” Evaluation parameter for “Circuit-switched cell, CDPD, WLAN, Paging, Satellite.” “the first ranking training is obtained with the lowest quality of compensation.

Decisive analysis of current state of the art in congestion aware and control routing models in ad hoc networks

An important aspect that portrays a crucial position in the ad hoc network routing is congestion. Almost every research analysis is en-route in adapting this key factor in addressing congestion. This problem cannot be totally addressed by the regular TCP protocol based networks, keeping in view the special assets which include multi hop sharing etc, which is difficult to ascertain in ad hoc networks. Many attempts have been made and are in progress by researchers to provide unique solutions to the above mentioned problems. This paper projects a vital study on jamming aware and different routing standards that have been dealt with in recent times