Abstract

Mobile ad hoc networks (MANETs) present similarities with Peer to Peer (P2P) systems in terms of decentralization, equality and autonomy. This results in the rise of new collaborative and spontaneous P2P applications over MANETs such as P2P auctions. The deployment of auctions over MANETS should provide new opportunities to the important marketplace created by mobile communities and may be a game changer in local markets when the mobile infrastructures are very pervasive. This business scenario implies multiple advantages such as ubiquity, availability, affordability, opportunity and spontaneity. Nevertheless, it faces various challenges such as fairness and security. In this paper we present a fully distributed architecture and a process designed to support P2P auctions over MANETs. The major goal of this paper is three-fold: i) to propose an estimation model of a fair round duration called Tfair (the bids collection duration) to fulfill fairness, ii) to propose a new scheme for access control and no replay that takes into consideration the unique constraints imposed by the crossing of MANETs, P2P and auctions, and iii) to validate the proposals by simulations. We prove the effectiveness of the proposed Tfair estimation model. We also show that the overhead of the proposed security solution is acceptable for the studied scenarios.

Highlights

  • A Mobile ad hoc network (MANET) is a system of wireless mobile nodes that can freely and dynamically get organized into arbitrary and temporary ad-hoc network topologies [6]

  • This scheme takes into consideration the special constraints imposed by the crossing of MANETs as underlying networks, P2P as architecture and auctions as an application, and iii) we use simulations to show the effectiveness of the proposed model and to evaluate the overhead of the proposed security solution

  • In this paper we explore the deployment of P2P auctions over mobile ad hoc networks

Read more

Summary

Introduction

A Mobile ad hoc network (MANET) is a system of wireless mobile nodes that can freely and dynamically get organized into arbitrary and temporary ad-hoc network topologies [6]. We present an architecture and an auction process over MANETs. The goal of this paper is three-fold: i) we propose a theoretical model to estimate the fair round duration allowing the bidders to collect all received bids during each round, ii) we propose a new scheme for access control and no replay. The goal of this paper is three-fold: i) we propose a theoretical model to estimate the fair round duration allowing the bidders to collect all received bids during each round, ii) we propose a new scheme for access control and no replay This scheme takes into consideration the special constraints imposed by the crossing of MANETs as underlying networks, P2P as architecture and auctions as an application, and iii) we use simulations to show the effectiveness of the proposed model and to evaluate the overhead of the proposed security solution.

Literature Review
Operation View
Fairness
The Requirements
The Mechanism
Access Control and No-replay
The System Vulnerabilities
The Proposed Mechanisms
The Design of the Security Solution
The Performance Evaluation
Validation of the Tfair Estimation Model
Performances Evaluation of the Security Solution
Overhead on the Initialization
Overhead on the Bidding
Conclusion and Future Work

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.