Log in

Relevant bibliographies by topics / Peer-to-peer architecture (Computer networks) Wireless communication systems

Contents

Journal articles
Dissertations / Theses
Books
Book chapters

Academic literature on the topic 'Peer-to-peer architecture (Computer networks) Wireless communication systems'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Peer-to-peer architecture (Computer networks) Wireless communication systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Peer-to-peer architecture (Computer networks) Wireless communication systems"

1

Yan, Lu, and Xinrong Zhou. "On designing peer-to-peer systems over wireless networks." International Journal of Ad Hoc and Ubiquitous Computing 3, no. 4 (2008): 245. http://dx.doi.org/10.1504/ijahuc.2008.018910.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Han, Jinsong, Jizhong Zhao, Min Xi, and Xingming Sun. "Removing dubious feedback from mobile wireless ad hoc peer-to-peer systems." International Journal of Ad Hoc and Ubiquitous Computing 8, no. 1/2 (2011): 106. http://dx.doi.org/10.1504/ijahuc.2011.041626.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rifi, Nabil, Nazim Agoulmine, Nada Chendeb Taher, and Elie Rachkidi. "Blockchain Technology: Is It a Good Candidate for Securing IoT Sensitive Medical Data?" Wireless Communications and Mobile Computing 2018 (December 5, 2018): 1–11. http://dx.doi.org/10.1155/2018/9763937.

Full text

Abstract:

In the past few years, the number of wireless devices connected to the Internet has increased to a number that could reach billions in the next few years. While cloud computing is being seen as the solution to process this data, security challenges could not be addressed solely with this technology. Security problems will continue to increase with such a model, especially for private and sensitive data such as personal data and medical data collected with more and more smarter connected devices constituting the so called Internet of Things. As a consequence, there is an urgent need for a fully decentralized peer-to-peer and secure technology solution to overcome these problems. The blockchain technology is a promising just-in-time solution that brings the required properties to the field. However, there are still challenges to address before using it in the context of IoT. This paper discusses these challenges and proposes a secure IoT architecture for medical data based on blockchain technology. The solution introduces a protocol for data access, smart contracts and a publisher-subscriber mechanism for notification. A simple analytical model is also presented to highlight the performance of the system. An implementation of the solution as a proof of concept is also presented.

APA, Harvard, Vancouver, ISO, and other styles

4

Raji, Fatemeh, Ali Miri, and Mohammad Davarpanah Jazi. "PESCA: a peer-to-peer social network architecture with privacy-enabled social communication and data availability." IET Information Security 9, no. 1 (January 1, 2015): 73–80. http://dx.doi.org/10.1049/iet-ifs.2013.0256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Forte, Andrea G., Wei Wang, Luca Veltri, and Gianluigi Ferrari. "A Next-Generation Core Network Architecture for Mobile Networks." Future Internet 11, no. 7 (July 9, 2019): 152. http://dx.doi.org/10.3390/fi11070152.

Full text

Abstract:

Over the years, the cellular mobile network has evolved from a wireless plain telephone system to a very complex system providing telephone service, Internet connectivity and many interworking capabilities with other networks. Its air interface performance has increased drastically over time, leading to high throughput and low latency. Changes to the core network, however, have been slow and incremental, with increased complexity worsened by the necessity of backwards-compatibility with older-generation systems such as the Global System for Mobile communication (GSM). In this paper, a new virtualized Peer-to-Peer (P2P) core network architecture is presented. The key idea of our approach is that each user is assigned a private virtualized copy of the whole core network. This enables a higher degree of security and novel services that are not possible in today’s architecture. We describe the new architecture, focusing on its main elements, IP addressing, message flows, mobility management, and scalability. Furthermore, we will show some significant advantages this new architecture introduces. Finally, we investigate the performance of our architecture by analyzing voice-call traffic available in a database of a large U.S. cellular network provider.

APA, Harvard, Vancouver, ISO, and other styles

6

Lavanya, N., and M. Balakrishna. "A New Technique for File Sharing Mechanism Ad hoc Networks." International Journal of Advanced Research in Computer Science and Software Engineering 8, no. 3 (March 30, 2018): 1. http://dx.doi.org/10.23956/ijarcsse.v8i3.585.

Full text

Abstract:

Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throughput compared to the traditional forwarding transmission. It has potentially broad applications in many areas, including traditional computer networks, wireless ad-hoc networks, and peer to peer systems. This paper process a new technique for file sharing in P2P.

APA, Harvard, Vancouver, ISO, and other styles

7

Huang, Junjie, Liang Tan, Sun Mao, and Keping Yu. "Blockchain Network Propagation Mechanism Based on P4P Architecture." Security and Communication Networks 2021 (August 4, 2021): 1–12. http://dx.doi.org/10.1155/2021/8363131.

Full text

Abstract:

Blockchain is a mainstream technology in which many untrustworthy nodes work together to maintain a distributed ledger with advantages such as decentralization, traceability, and tamper-proof. The network layer communication mechanism in its architecture is the core of the networking method, message propagation, and data verification among blockchain nodes, which is the basis to ensure blockchain’s performance and key features. When blocks are propagated in peer-to-peer (P2P) networks with gossip protocol, the high propagation delay of the protocol itself reduces the propagation speed of the blocks, which is prone to the chain forking phenomenon and causes double payment attacks. To accelerate the propagation speed and reduce the fork probability, this paper proposes a blockchain network propagation mechanism based on proactive network provider participation for P2P (P4P) architecture. This mechanism first obtains the information of network topology and link status in a region based on the internet service provider (ISP), then it calculates the shortest path and link overhead of peer nodes using P4P technology, prioritizes the nodes with good local bandwidth conditions for transmission, realizes the optimization of node connections, improves the quality of service (QoS) and quality of experience (QoE) of blockchain networks, and enables blockchain nodes to exchange blocks and transactions through the secure propagation path. Simulation experiments show that the proposed propagation mechanism outperforms the original propagation mechanism of the blockchain network in terms of system overhead, rate of data success transmission, routing hops, and propagation delay.

APA, Harvard, Vancouver, ISO, and other styles

8

Kumar, Amit, and Hari Om. "Lightweight, ECC based RFID Authentication Scheme for WLAN." International Journal of Business Data Communications and Networking 12, no. 2 (July 2016): 89–103. http://dx.doi.org/10.4018/ijbdcn.2016070106.

Full text

Abstract:

Wireless local area networks (WLANs), like IEEE 802.11, are right now very common in numerous outdoor or indoor environments for providing wireless communication among WiFi-enabled devices by accessing an Access Point (infrastructure mode) or through peer to peer connections (ad hoc mode). Authentication is one among the most primary research challenges for the realization of the envisioned mobile and wireless Internet. This is mainly due to the latency delay introduced during the authentication process, which are of major concern for real-time applications and media streaming application. In the same way, it is also crucial for WLANs to authenticate clients and build secure channels with them. In the historical researches, the traditional authentication mechanisms frequently adopted the names and passwords of clients as login authentication. However, these Single Factor Authentication mechanisms are proved to be defective. In virtue of enhancing security, recent researches on authentication are built on Two-Factor authentication schemes. In this paper, the authors proposed a two factor, lightweight RFID authentication scheme based on elliptic curve cryptography (ECC) for WLAN. The analytic comparison demonstrates the research not just reduces the expense of proposed authentication schemes, yet gives security similarly as smart card technology. In addition, the performance of the proposed authentication scheme will analyze in terms of computational cost, communications cost, and storage cost.

APA, Harvard, Vancouver, ISO, and other styles

9

Zhang, Junsong, Qikun Zhang, Xianling Lu, and Yong Gan. "A Novel Privacy-Preserving Authentication Protocol Using Bilinear Pairings for the VANET Environment." Wireless Communications and Mobile Computing 2021 (June 26, 2021): 1–13. http://dx.doi.org/10.1155/2021/6692568.

Full text

Abstract:

With the rapid development of communication and microelectronic technology, the vehicular ad hoc network (VANET) has received extensive attention. However, due to the open nature of wireless communication links, it will cause VANET to generate many network security issues such as data leakage, network hijacking, and eavesdropping. To solve the above problem, this paper proposes a new authentication protocol which uses bilinear pairings and temporary pseudonyms. The proposed authentication protocol can realize functions such as the identity authentication of the vehicle and the verification of the message sent by the vehicle. Moreover, the proposed authentication protocol is capable of preventing any party (peer vehicles, service providers, etc.) from tracking the vehicle. To improve the efficiency of message verification, this paper also presents a batch authentication method for the vehicle to verify all messages received within a certain period of time. Finally, through security and performance analysis, it is actually easy to find that the proposed authentication protocol can not only resist various security threats but also have good computing and communication performance in the VANET environment.

APA, Harvard, Vancouver, ISO, and other styles

10

Guru, Divya, Supraja Perumal, and Vijayakumar Varadarajan. "Approaches towards Blockchain Innovation: A Survey and Future Directions." Electronics 10, no. 10 (May 20, 2021): 1219. http://dx.doi.org/10.3390/electronics10101219.

Full text

Abstract:

A blockchain is a decentralized peer to peer platform which provides security services based on some key concepts, namely authentication, confidentiality, integrity and authorization. It is the process of recording and keeping track of the resources without the intervention of a centralized authority. This paper provides an overview of blockchains, the structure of blockchains, consensus algorithms, etc., It compares the algorithms based on their utility and limitations. Though blockchains provide secure communication, there are some minimal data leaks which are discussed. Various security issues in blockchains are discussed such as denial of service attacks, etc., In addition to security, some other blockchain challenges are presented like scalability, reliability, interoperability, privacy and consensus mechanisms for integration with AI, IoT and edge computing. This paper also explains about the importance of blockchains in the fields of smart healthcare, smart grid, and smart financial systems. Overall, this paper gives the glimpse of various protocols, algorithms, applications, challenges and opportunities that are found in the blockchain domain.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Peer-to-peer architecture (Computer networks) Wireless communication systems"

1

Leung, Ka-ho Andrew. "Localized topology control in wireless peer-to peer file sharing networks." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B32048208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Leung, Ka-ho Andrew, and 梁嘉浩. "Localized topology control in wireless peer-to peer file sharing networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B32048208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Velayutham, Aravind Murugesan. "Transport Protocols for Next Generation Wireless Data Networks." Thesis, Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/6957.

Full text

Abstract:

Emerging wireless networks are characterized by increased heterogeneity in wireless access technologies as well as increased peer-to-peer communication among wireless hosts. The heterogeneity among wireless access interfaces mainly exists because of the fact that different wireless technologies deliver different performance trade-offs. Further, more and more infrastructure-less wireless networks such as ad-hoc networks are emerging to address several application scenarios including military and disaster recovery. These infrastructure-less wireless networks are characterized by the peer-to-peer communication model. In this thesis, we propose transport protocols that tackle the challenges that arise due to the above-mentioned properties of state-of-the-art wireless data networks. The main contributions of this work are as follows: 1. We determine the ideal nature and granularity of transport adaptation for efficient operation in heterogeneous wireless data networks by performing comprehensive experimental analysis. We then design and implement a runtime adaptive transport framework, *TP, which accommodates the capabilities of the ideal transport adaptation solution. 2. We prove that conversational transport protocols are not efficient under peer-to-peer wireless data networks. We then design and implement NCTP which is a non-conversational transport protocol.

APA, Harvard, Vancouver, ISO, and other styles

4

Louis, Lee Winnie. "Flexible-schedule-based TDMA protocols for supporting fault-tolerance, on-demand TDMA slot transfer, and peer-to-peer communication in wireless sensor networks." University of Western Australia. School of Computer Science and Software Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0028.

Full text

Abstract:

[Truncated abstract] This thesis develops a scheduled protocol (time division multiple access, TDMA) called flexible-schedule-based TDMA Protocol (FlexiTP), to address the problem of providing end-to-end guarantees on data delivery, whilst also respecting severe resource constraints of wireless sensor networks. FlexiTP achieves this balance through a distributed, synchronised, and loose slot structure in which sensor nodes can build, modify, or extend their schedules based on their local information. In FlexiTP, it is not necessary to predetermine the number of slots required for a network. FlexiTP's local repair scheme allows nodes to adjust their schedules dynamically and autonomously to recover from node and communication faults. Hence, it maintains a reliable and selforganising multihop network. Most sensor network protocols designed for data gathering applications implicitly assume a periodic rate of data collection from all nodes in the network to the base station. However, nodes may want to report their data more rapidly or slowly depending on the significance and importance of their data to the end-user. The problem is that traditional TDMA-based protocols are not flexible to changes in traffic patterns because of their rigid slot structure schemes. This thesis aims to solve this problem by developing an ondemand TDMA slot transfer method that leverages the flexible-slot structure algorithm of FlexiTP to transfer time slots from one part of the network to another part. ... While these communication patterns are sufficient for monitoring applications, individual sensor nodes may need to send their data to multiple destination nodes across the network in order to execute a distributed cooperative-function based on their local environment. This peer-to-peer communication pattern makes sensor networks more reactive to triggers from the environment. This thesis attempts to solve the problem of lack of peer-to-peer communication in the design of a TDMA-driven protocol by extending the idea of on-demand TDMA slot transfer method to allow each sensor node in the network to claim extra time slots to communicate with any other nodes (peers) in the network, without going through the base station. Nodes in the network may have different priorities of data because of event-triggering sensor readings or various types of sensor readings (e.g., light, temperature, and humidity) they provide. When nodes with high priority packets increase the frequency of their data collections, the network bandwidth may be dominated by these nodes. It is desirable to allow nodes with low priority packets to aggregate their packets and so enabling these nodes to send their data to the base station under the current available network bandwidth. This thesis proposes an on-demand data aggregation algorithm that enables sensor nodes to perform an in-network-aggregation based on their current sensing requirements and network capacity constraints. In summary, this thesis describes the design, implementation, and evaluation of protocols for wireless sensor networks that focus on achieving energy-efficiency, provisioning performance assurances, and supporting reactivity and adaptability in constantly changing environment.

APA, Harvard, Vancouver, ISO, and other styles

5

Merugu, Shashidhar. "Network Design and Routing in Peer-to-Peer and Mobile Ad Hoc Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7219.

Full text

Abstract:

Peer-to-peer networks and mobile ad hoc networks are emerging distributed networks that share several similarities. Fundamental among these similarities is the decentralized role of each participating node to route messages on behalf of other nodes, and thereby, collectively realizing communication between any pair of nodes. Messages are routed on a topology graph that is determined by the peer relationship between nodes. Although routing is fairly straightforward when the topology graph is static, dynamic variations in the peer relationship that often occur in peer-to-peer and mobile ad hoc networks present challenges to routing. In this thesis, we examine the interplay between routing messages and network topology design in two classes of these networks -- unstructured peer-to-peer networks and sparsely-connected mobile ad hoc networks. In unstructured peer-to-peer networks, we add structure to overlay topologies to support file sharing. Specifically, we investigate the advantages of designing overlay topologies with small-world properties to improve (a) search protocol performance and (b) network utilization. We show, using simulation, that "small-world-like" overlay topologies where every node has many close neighbors and few random neighbors exhibit high chances of locating files close to the source of file search query. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. In the context of sparsely-connected mobile ad hoc networks where nodes provide connectivity via mobility, we present a protocol for routing in space and time where the message forwarding decision involves not only where to forward (space), but also when to forward (time). We introduce space-time routing tables and develop methods to compute these routing tables for those instances of ad hoc networks where node mobility is predictable over either a finite horizon or indefinitely due to periodicity in node motion. Furthermore, when the node mobility is unpredictable, we investigate several forwarding heuristics to address the scarcity in transmission opportunities in these sparsely-connected ad hoc networks. In particular, we present the advantages of fragmenting messages and augmenting them with erasure codes to improve the end-to-end message delivery performance.

APA, Harvard, Vancouver, ISO, and other styles

6

Santos, Luiz Marcus Monteiro de Almeida. "My-Direct: um Middleware para desenvolvimento de redes sociais móveis P2P." Pós-Graduação em Ciência da Computação, 2014. https://ri.ufs.br/handle/riufs/3347.

Full text

Abstract:

In recent years, middleware for mobile social network has attracted the attention of academia, causing the design and development of various approaches by researchers. This type of middleware facilitates and makes more efficient the development process of mobile social networking applications. Furthermore, middleware solutions also abstract the communication process with others applications, allowing the acquisition, persistence and reuse of social context information and location of users, besides providing API so that developers can access this information quickly and build new social applications. With a view to supporting this new trend of research, this thesis proposes a middleware for mobile social networking, called My-Direct, which makes use of Wi-Fi Direct technology together with the Bluetooth, aiming to provide flexible communication between the nodes of the mobile social network. Along with My-Direct also was be created a mechanism for user privacy based on information available on mobile device, so that the execution of social activities occurs just between partners with some degree of affinity.
Nos últimos anos, o tema middleware para redes sociais móveis têm atraído a atenção do meio acadêmico, causando o projeto e desenvolvimento de diversas soluções por parte dos pesquisadores. Esse tipo de middleware facilita e torna mais eficiente o processo de desenvolvimento de aplicações de redes sociais para o ambiente móvel. Além disso, essas soluções de middleware também abstraem o processo de comunicação entre parceiros e permitem a aquisição, persistência e reuso de informações de contexto social e de localização do usuário, além de disponibilizarem API para que os desenvolvedores possam acessar essas informações rapidamente e construir novas aplicações sociais Tendo em vista colaborar para esta nova tendência de pesquisa, esta dissertação propõe uma arquitetura de middleware para redes sociais móveis chamada de My-Direct que faz uso da tecnologia Wi-Fi Direct em conjunto com o Bluetooth, visando proporcionar comunicação flexível entre os nós da rede social móvel. Junto ao My-Direct, também foi criado um mecanismo de privacidade para o usuário baseado em informações disponíveis no dispositivo móvel, de forma que a execução de atividades sociais ocorra apenas entre parceiros com algum grau de afinidade.

APA, Harvard, Vancouver, ISO, and other styles

7

Chowdhury, Farida. "Structured peer-to-peer overlays for NATed churn intensive networks." Thesis, University of Stirling, 2015. http://hdl.handle.net/1893/23038.

Full text

Abstract:

The wide-spread coverage and ubiquitous presence of mobile networks has propelled the usage and adoption of mobile phones to an unprecedented level around the globe. The computing capabilities of these mobile phones have improved considerably, supporting a vast range of third party applications. Simultaneously, Peer-to-Peer (P2P) overlay networks have experienced a tremendous growth in terms of usage as well as popularity in recent years particularly in fixed wired networks. In particular, Distributed Hash Table (DHT) based Structured P2P overlay networks offer major advantages to users of mobile devices and networks such as scalable, fault tolerant and self-managing infrastructure which does not exhibit single points of failure. Integrating P2P overlays on the mobile network seems a logical progression; considering the popularities of both technologies. However, it imposes several challenges that need to be handled, such as the limited hardware capabilities of mobile phones and churn (i.e. the frequent join and leave of nodes within a network) intensive mobile networks offering limited yet expensive bandwidth availability. This thesis investigates the feasibility of extending P2P to mobile networks so that users can take advantage of both these technologies: P2P and mobile networks. This thesis utilises OverSim, a P2P simulator, to experiment with the performance of various P2P overlays, considering high churn and bandwidth consumption which are the two most crucial constraints of mobile networks. The experiment results show that Kademlia and EpiChord are the two most appropriate P2P overlays that could be implemented in mobile networks. Furthermore, Network Address Translation (NAT) is a major barrier to the adoption of P2P overlays in mobile networks. Integrating NAT traversal approaches with P2P overlays is a crucial step for P2P overlays to operate successfully on mobile networks. This thesis presents a general approach of NAT traversal for ring based overlays without the use of a single dedicated server which is then implemented in OverSim. Several experiments have been performed under NATs to determine the suitability of the chosen P2P overlays under NATed environments. The results show that the performance of these overlays is comparable in terms of successful lookups in both NATed and non-NATed environments; with Kademlia and EpiChord exhibiting the best performance. The presence of NATs and also the level of churn in a network influence the routing techniques used in P2P overlays. Recursive routing is more resilient to IP connectivity restrictions posed by NATs but not very robust in high churn environments, whereas iterative routing is more suitable to high churn networks, but difficult to use in NATed environments. Kademlia supports both these routing schemes whereas EpiChord only supports the iterating routing. This undermines the usefulness of EpiChord in NATed environments. In order to harness the advantages of both routing schemes, this thesis presents an adaptive routing scheme, called Churn Aware Routing Protocol (ChARP), combining recursive and iterative lookups where nodes can switch between recursive and iterative routing depending on their lifetimes. The proposed approach has been implemented in OverSim and several experiments have been carried out. The experiment results indicate an improved performance which in turn validates the applicability and suitability of ChARP in NATed environments.

APA, Harvard, Vancouver, ISO, and other styles

8

Alwadani, Dhaifallah. "Hybrid multicasting using Automatic Multicast Tunnels (AMT)." Thesis, University of Stirling, 2017. http://hdl.handle.net/1893/26026.

Full text

Abstract:

Native Multicast plays an important role in distributing and managing delivery of some of the most popular Internet applications, such as IPTV and media delivery. However, due to patchy support and the existence of multiple approaches for Native Multicast, the support for Native Multicast is fragmented into isolated areas termed Multicast Islands. This renders Native Multicast unfit to be used as an Internet wide application. Instead, Application Layer Multicast, which does not have such network requirements but is more expensive in terms of bandwidth and overhead, can be used to connect the native multicast islands. This thesis proposes Opportunistic Native Multicast (ONM) which employs Application LayerMulticast (ALM), on top of a DHT-based P2P overlay network, and Automatic Multicast Tunnelling (AMT) to connect these islands. ALM will be used for discovery and initiating the AMT tunnels. The tunnels will encapsulate the traffic going between islands' Primary Nodes (PNs). AMT was used for its added benefits such as security and being better at traffic shaping and Quality Of Service (QoS). While different approaches for connecting multicast islands exists, the system proposed in the thesis was designed with the following characteristics in mind: scalability, availability, interoperability, self-adaptation and efficiency. Importantly, by utilising AMT tunnels, this approach has unique properties that improve network security and management.

APA, Harvard, Vancouver, ISO, and other styles

9

Xie, Wanxia. "Supporting Distributed Transaction Processing Over Mobile and Heterogeneous Platforms." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/14073.

Full text

Abstract:

Recent advances in pervasive computing and peer-to-peer computing have opened up vast opportunities for developing collaborative applications. To benefit from these emerging technologies, there is a need for investigating techniques and tools that will allow development and deployment of these applications on mobile and heterogeneous platforms. To meet these challenging tasks, we need to address the typical characteristics of mobile peer-to-peer systems such as frequent disconnections, frequent network partitions, and peer heterogeneity. This research focuses on developing the necessary models, techniques and algorithms that will enable us to build and deploy collaborative applications in the Internet enabled, mobile peer-to-peer environments. This dissertation proposes a multi-state transaction model and develops a quality aware transaction processing framework to incorporate quality of service with transaction processing. It proposes adaptive ACID properties and develops a quality specification language to associate a quality level with transactions. In addition, this research develops a probabilistic concurrency control mechanism and a group based transaction commit protocol for mobile peer-to-peer systems that greatly reduces blockings in transactions and improves the transaction commit ratio. To the best of our knowledge, this is the first attempt to systematically support disconnection-tolerant and partition-tolerant transaction processing. This dissertation also develops a scalable directory service called PeerDS to support the above framework. It addresses the scalability and dynamism of the directory service from two aspects: peer-to-peer and push-pull hybrid interfaces. It also addresses peer heterogeneity and develops a new technique for load balancing in the peer-to-peer system. This technique comprises an improved routing algorithm for virtualized P2P overlay networks and a generalized Top-K server selection algorithm for load balancing, which could be optimized based on multiple factors such as proximity and cost. The proposed push-pull hybrid interfaces greatly reduce the overhead of directory servers caused by frequent queries from directory clients. In order to further improve the scalability of the push interface, this dissertation also studies and evaluates different filter indexing schemes through which the interests of each update could be calculated very efficiently. This dissertation was developed in conjunction with the middleware called System on Mobile Devices (SyD).

APA, Harvard, Vancouver, ISO, and other styles

10

"Large deviation analysis of wireless P2P systems." 2012. http://library.cuhk.edu.hk/record=b5549136.

Full text

Abstract:

Abstract In this thesis, we consider the performance evaluation of peer-to-peer (P2P)streaming over wireless networks. Traditionally, P2P streaming has been implemented and analyzed extensively in wire line networks. As more and more devices are connected to the internet through wireless, however, it is critical to understand how wireless channel variability affects the performance of P2P systems. Weformulate the P2P streaming system as a queuing network, and analyze its performance based onthe large deviation principle. We are interested in characterizing the buffer underow probability, where users run of out content and cannot receive smooth video playback. As explicit analysis is very dicult with a nite number of users, we focus on characterizing the performance bounds when the number of users goes to innity, assuming that playback rate and buffer size both grow linearly with the number of users N. We show that the upper bound of buffer underow probability decays exponentially in N. We also compare the decay rate of bound in different channel models, and show that the Markov modulated channel leads to a faster decay rate than the I.I.D. model with the same expected channel capacities.
Leung, Kam Wong.
Thesis (M.Phil.)--Chinese University of Hong Kong, 2012.
Includes bibliographical references (leaves 50-52).
Abstract --- p.i
Acknowledgement --- p.iv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Background --- p.2
Chapter 1.1.1 --- Video Streaming --- p.2
Chapter 1.1.2 --- Large Deviations Theory --- p.4
Chapter 1.2 --- Related Works --- p.6
Chapter 2 --- System Model and Assumptions --- p.9
Chapter 2.1 --- System Model --- p.9
Chapter 2.2 --- Assumptions --- p.11
Chapter 2.3 --- Queuing Model --- p.12
Chapter 3 --- Performance of Large Network --- p.16
Chapter 3.1 --- Large Deviation Principle --- p.16
Chapter 3.2 --- Time I.I.D. Channel Model --- p.23
Chapter 3.3 --- Markov Modulated Channel --- p.29
Chapter 3.4 --- Performance Comparison of Channel Model: Time I.I.D. Model vs Markov Modulated Model --- p.31
Chapter 4 --- Simulation Result and Analysis. --- p.35
Chapter 4.1 --- Simulation Settings --- p.35
Chapter 4.2 --- The Performance Bounds of Different Playback Rates --- p.36
Chapter 4.3 --- The Performance Bounds for Different Channel Transition Matrix --- p.37
Chapter 5 --- Conclusion --- p.40
Chapter A --- Appendix --- p.42
Chapter A.1 --- Convexity of decay rate function for time I.I.D Model --- p.42
Chapter A.2 --- Condition for the Chernoff Bound hold --- p.44
Chapter A.3 --- Convergence of the Decay Rate Function --- p.44
Chapter A.4 --- Moment Generating Function of Markov Modulated Sources --- p.46
Chapter A.5 --- Limiting Probability Distribution of Capacity of Markov Channel --- p.47
Chapter A.6 --- Computation: Capacity p.d.f of Two States Markov Modulated Channel --- p.48
Bibliography --- p.50

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Peer-to-peer architecture (Computer networks) Wireless communication systems"

1

Peer-to-Peer Computing for Mobile Networks: Information Discovery and Dissemination. Springer, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

P, Fitzek Frank H., and Charaf Hassan, eds. Mobile peer to peer: A tutorial guide. Hoboken, NJ: John Wiley & Sons, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

1973-, Seet Boon-Chong, ed. Mobile peer-to-peer computing for next generation distributed environments: Advancing conceptual and algorithmic applications. Hershey, PA: Information Science Reference, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Peer-to-peer architecture (Computer networks) Wireless communication systems"

1

Zhang, Rongmei, Ali R. Butt, and Y. Charlie Hu. "Topology-Aware Peer-to-Peer On-demand Streaming." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 1–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Yan, Li Lao, and Jun-Hong Cui. "SDC: A Distributed Clustering Protocol for Peer-to-Peer Networks." In NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 1234–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11753810_114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stutzbach, Daniel, Daniel Zappala, and Reza Rejaie. "The Scalability of Swarming Peer-to-Peer Content Delivery." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 15–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Liao, Wei-Cherng, Fragkiskos Papadopoulos, and Konstantinos Psounis. "An Efficient Algorithm for Resource Sharing in Peer-to-Peer Networks." In NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 592–605. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11753810_50.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hausheer, David, and Burkhard Stiller. "PeerMint: Decentralized and Secure Accounting for Peer-to-Peer Applications." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 40–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tewari, Saurabh, and Leonard Kleinrock. "On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 709–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_57.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yu, Yinzhe, Sanghwan Lee, and Zhi-Li Zhang. "Leopard: A Locality Aware Peer-to-Peer System with No Hot Spot." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 27–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Luo, Jian-Guang, Yun Tang, and Shi-Qiang Yang. "Chasing: An Efficient Streaming Mechanism for Scalable and Resilient Video-on-Demand Service over Peer-to-Peer Networks." In NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 642–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11753810_54.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gaver, Donald P., and Patricia A. Jacobs. "Stochastic Properties of Peer-to-Peer Communication Architecture in a Military Setting." In Communication Networks and Computer Systems, 223–33. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO., 2006. http://dx.doi.org/10.1142/9781860948947_0013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!