24 research outputs found

    File sharing between mobile devices

    Get PDF
    File sharing is the process of distributing or providing access to any form of digital information to one or more users. The proposed model is a form of communication that allows exchange of data within a Wi-Fi network. Similar systems are already in existence for wired networks. The aim of this paper is to provide design and implementation details of such a system for mobile phones. The user is first required to connect to a wireless LAN, discover other users and can then share files with one or more among them

    An Analysis of Node/Peer Discovery Approach and Routing Algorithms in Mobile & Traditional Peer-to-Peer Networks

    Get PDF
    Mobile devices are becoming an increasingly indispensable part of people’s everyday life, in the form of mobile phones, PDAs and laptop computers to communicate or share data between them. Centralized client-server networks are being transformed to distributed peer-to-peer networks. Lessons learned from fixed networks have been applied in cellular network. So, there are many challenges faced by traditional and mobile peer-to-peer networks therefore, in this study we examine a comparative analysis of node/peer discovery approach and routing algorithms employed in both traditional and mobile peer-to-peer networks. A qualitative methodology approach was used for data sources. Documents related to node/peer discovery approach and routing algorithms were studied. A comparative method and content analysis were used to analyze the data collected. Findings of the study indicated that there are two clear differences in the aspects of neighboring node/peer discovery approach beside the similarities. The study also showed another differences and similarities in the aspect of routing algorithms. This thesis hopes to offer all necessary useful tips of the divergence on these two aspects and thus to make a contribution allowing researchers to know such divergence

    Novel bandwidth strategy for wireless P2P file sharing

    Get PDF
    With the rapid development of the mobile device technology and wireless network technology, the need of an efficient file sharing method on wireless network becomes more and more significant. Peer-to-Peer(P2P) file distribution, as a quite popular method being used now, is a promising choice. However, the limitation of bandwidth of wireless networks greatly restricts the performance of wireless P2P. In this paper, we propose a new idea of better utilizing the limited bandwidth to improve the file distribution performance. The criteria of an optimal splitting of the half-duplex bandwidth is deduced with mathematical analysis. To achieve a further improvement on the average distribution time, we also propose a grouping strategy which works with the bandwidth strategy. Simulation results show that our mechanism can efficiently reduce the file distribution time among wireless peers. © 2011 IEEE.published_or_final_versionThe 2011 IEEE Wireless Communications and Networking Conference (WCNC), Cancun, Mexico, 28-31 March 2011. In IEEE Wireless Communications and Networking Conference Proceedings, 2011, p. 2161-216

    Toward software updates in IoT environments: Why Existing P2P Systems are not Enough

    Get PDF
    International audienceThe number of connected devices around us is growing, and their embedded software is increasing in complexity. Applications need to be managed and updated throughout their life-cycle. Modern software orchestrators and management systems are mostly cen-tralised and expensive to scale to very large systems. We propose a decentralised approach to distribute software updates to Internet of Things (IoT) devices using Peer-to-Peer (P2P) transfers. We seek to improve the efficiency of software update propagation by adapting system behaviour to IoT constraints, such as device heterogeneity, unreliable network connectivity and applications specifics

    Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

    Full text link
    This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.Comment: 8 pages, 4 figures, 1 tabl

    Improving the Performance of Mobile Ad Hoc Network Using a Combined Credit Risk and Collaborative Watchdog Method

    Get PDF
    In mobile ad hoc networks nodes can move freely and link node failures occur frequently This leads to frequent network partitions which may significantly degrade the performance of data access in ad hoc networks When the network partition occurs mobile nodes in one network are not able to access data hosted by nodes in other networks In mobile ad hoc network some nodes may selfishly decide only to cooperate partially or not at all with other nodes These selfish nodes could then reduce the overall data accessibility in the network In this work the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation is examined We term this selfish replica allocation A combined credit risk method collaborative watchdog is proposed to detect the selfish node and also apply the SCF tree based replica allocation method to handle the selfish replica allocation appropriately The proposed method improves the data accessibility reduces communication cost and average query delay and also to reduce the detection time and to improve the accuracy of watchdogs in the collaborative metho
    corecore