Vahid Haghighatdoost
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Vahid Haghighatdoost has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Siavash Khorsandi
Department of Computer Engineering, Amirkabir University of Technology, Tehran, Iran
3 shared publications Mohammad H. Ahmadi
2 shared publicationsSiavash Khorsandi
Computer Engineering and IT Department, Amirkabir University of Technology, Tehran, Iran
2 shared publications- Hamed Ahmadi
University of York
1 shared publication - Maryam Espandar
Computer and Electrical Engineering Department, Shahed University, opposite Holy shrine of Imam Khomeini, Khalij Fars Expressway, Tehran, Iran
1 shared publication
Latest Publications
- 14 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (7) , 5710-5721
Fair Pricing in Heterogeneous Internet-of-Things Wireless Access Networks Using Crowdsourcing
Price and the quality of service are two key factors taken into account by wireless network users when they choose their network provider. The recent advances in wireless technology and massive infrastructure deployments have led to better coverage, and currently at each given wirelessly covered area there are a few network providers and each have different pricing strategies. These providers can potentially set unfair expensive prices for their services. In this article, we propose a novel crowdsourcing-based approach for fair wireless service pricing in the Internet of Things (IoT). In our considered oligopoly, the regulatory sets a dynamic maximum allowed price of service to prevent anti-trust behavior and unfair service pricing. We propose a three-tire pricing model, where the regulator, wireless network providers, and clients are the players of our game. Our method takes client preferences into account in pricing and discovers the fair service pricing just above the marginal costs of each network provider. Our results show that our model is not prone to collusion and will converge only if one network announces the fair price.
- 14 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (7) , 5710-5721
Fair Pricing in Heterogeneous Internet-of-Things Wireless Access Networks Using Crowdsourcing
Price and the quality of service are two key factors taken into account by wireless network users when they choose their network provider. The recent advances in wireless technology and massive infrastructure deployments have led to better coverage, and currently at each given wirelessly covered area there are a few network providers and each have different pricing strategies. These providers can potentially set unfair expensive prices for their services. In this article, we propose a novel crowdsourcing-based approach for fair wireless service pricing in the Internet of Things (IoT). In our considered oligopoly, the regulatory sets a dynamic maximum allowed price of service to prevent anti-trust behavior and unfair service pricing. We propose a three-tire pricing model, where the regulator, wireless network providers, and clients are the players of our game. Our method takes client preferences into account in pricing and discovers the fair service pricing just above the marginal costs of each network provider. Our results show that our model is not prone to collusion and will converge only if one network announces the fair price.
- 21 January 2020
- Published by Springer Nature in Wireless Networks
- Vol. 26 (4) , 3053-3068
A new Walrasian mechanism design for optimal pricing and resource allocation in heterogeneous wireless access networks
- 21 January 2020
- Published by Springer Nature in Wireless Networks
- Vol. 26 (4) , 3053-3068
A new Walrasian mechanism design for optimal pricing and resource allocation in heterogeneous wireless access networks
- 31 January 2019
- Published by Springer Nature in Wireless Networks
- Vol. 25 (6) , 3557-3577
Game theoretic spectrum allocation for competing wireless access technologies to maximize the social welfare
- 31 January 2019
- Published by Springer Nature in Wireless Networks
- Vol. 25 (6) , 3557-3577
Game theoretic spectrum allocation for competing wireless access technologies to maximize the social welfare
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 949-956
General Time-Dependent Sequenced Route Queries in Road Networks
Spatial databases have been an active area of research over years. In this paper, we study how to answer the General Time-Dependent Sequenced Route queries. Given the origin and destination of a user over a time-dependent road network graph, an ordered list of categories of interests and a departure time interval, our goal is to find the minimum travel time path along with the best departure time that minimizes the total travel time from the source location to the given destination passing through a sequence of points of interests belonging to each of the specified categories of interest. The challenge of this problem is the added complexity to the optimal sequenced route queries, where we assume that first the road network is time-dependent, and secondly the user defines a departure time interval instead of one single departure time instance. For processing general time-dependent sequenced route queries, we propose an efficient solution as Continuous-Time Sequenced Route approach. Our proposed approach traverses the road network based on A*-search paradigm equipped with an efficient heuristic function, for shrinking the search space. Extensive experiments are conducted to verify the efficiency of our proposed approach.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 949-956
General Time-Dependent Sequenced Route Queries in Road Networks
Spatial databases have been an active area of research over years. In this paper, we study how to answer the General Time-Dependent Sequenced Route queries. Given the origin and destination of a user over a time-dependent road network graph, an ordered list of categories of interests and a departure time interval, our goal is to find the minimum travel time path along with the best departure time that minimizes the total travel time from the source location to the given destination passing through a sequence of points of interests belonging to each of the specified categories of interest. The challenge of this problem is the added complexity to the optimal sequenced route queries, where we assume that first the road network is time-dependent, and secondly the user defines a departure time interval instead of one single departure time instance. For processing general time-dependent sequenced route queries, we propose an efficient solution as Continuous-Time Sequenced Route approach. Our proposed approach traverses the road network based on A*-search paradigm equipped with an efficient heuristic function, for shrinking the search space. Extensive experiments are conducted to verify the efficiency of our proposed approach.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
The optimal meeting point based on trip plans in spatial databases
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
The optimal meeting point based on trip plans in spatial databases
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 129-140
Mechanism design for pricing and bandwidth allocation in heterogeneous wireless networks to maximize the social welfare
In this paper, we present a mechanism for bandwidth allocation and pricing in heterogeneous wireless networks. A proposed three stage game involves three types of agents 1) Network providers 2) Regulatory agent and 3) The Clients play the game. The goal of our mechanism design is increasing the social welfare means that while the network providers are satisfied from preparing and releasing the bandwidth, the clients deliver their bandwidth with a suitable price. When the Purchasing power in a society increases, we can interfere that the client welfare is increased but the very-low price for the products is not profitable for the producers thus to increase the social welfare we should attend to the welfare of network providers as well as the clients. The proposed mechanism guarantees the maximum payoff for the network providers and offers the clients to weighting and ranking the available networks and then prepares the best request bundle to receive the service. The violation from the proposed mechanism is not profitable for network providers and clients and as it is proved in the paper the allocation result is Pareto efficient.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 129-140
Mechanism design for pricing and bandwidth allocation in heterogeneous wireless networks to maximize the social welfare
In this paper, we present a mechanism for bandwidth allocation and pricing in heterogeneous wireless networks. A proposed three stage game involves three types of agents 1) Network providers 2) Regulatory agent and 3) The Clients play the game. The goal of our mechanism design is increasing the social welfare means that while the network providers are satisfied from preparing and releasing the bandwidth, the clients deliver their bandwidth with a suitable price. When the Purchasing power in a society increases, we can interfere that the client welfare is increased but the very-low price for the products is not profitable for the producers thus to increase the social welfare we should attend to the welfare of network providers as well as the clients. The proposed mechanism guarantees the maximum payoff for the network providers and offers the clients to weighting and ranking the available networks and then prepares the best request bundle to receive the service. The violation from the proposed mechanism is not profitable for network providers and clients and as it is proved in the paper the allocation result is Pareto efficient.
- Open Access
- 29 March 2014
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 7 (2) , 273
A General Approach for Minimizing the Maximum Interference of a Wireless Ad-Hoc Network in Plane
The interference reduction is one of the most important problems in the field of wireless sensor networks. Wireless sensor network elements are small mobile receiver and transmitters. The energy of processor and other components of each device is supplied by a small battery with restricted energy. One of the meanings that play an important role in energy consumption is the interference of signals. The interference of messages through a wireless network, results in message failing and transmitter should resend its message, thus the interference directly affect on the energy consumption of transmitter. This paper presents an algorithm which suggests the best subgraph for the input distribution of the nodes in the plane how the maximum interference of the proposed graph has the minimum value. The input of the application is the complete network graph, which means we know the cost of each link in the network graph. Without any lose of generality the Euclidean distance could be used as the weight of each link. The links are arranged and ranked according to their weights, in an iterative process the link which imposition minimum increase on the network interference with some extra conditions which is proposed in future sections, is added to resulting topology and is eliminated from list until all nodes are connected together. Experimental results show the efficiency of proposed algorithm not only for one dimensional known distribution like exponential node chain, but also for two dimensional distributions like two Exponential node chains and alpha-Spiral node chains.
- 29 March 2014
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 7 (2) , 273
Open AccessA General Approach for Minimizing the Maximum Interference of a Wireless Ad-Hoc Network in Plane
The interference reduction is one of the most important problems in the field of wireless sensor networks. Wireless sensor network elements are small mobile receiver and transmitters. The energy of processor and other components of each device is supplied by a small battery with restricted energy. One of the meanings that play an important role in energy consumption is the interference of signals. The interference of messages through a wireless network, results in message failing and transmitter should resend its message, thus the interference directly affect on the energy consumption of transmitter. This paper presents an algorithm which suggests the best subgraph for the input distribution of the nodes in the plane how the maximum interference of the proposed graph has the minimum value. The input of the application is the complete network graph, which means we know the cost of each link in the network graph. Without any lose of generality the Euclidean distance could be used as the weight of each link. The links are arranged and ranked according to their weights, in an iterative process the link which imposition minimum increase on the network interference with some extra conditions which is proposed in future sections, is added to resulting topology and is eliminated from list until all nodes are connected together. Experimental results show the efficiency of proposed algorithm not only for one dimensional known distribution like exponential node chain, but also for two dimensional distributions like two Exponential node chains and alpha-Spiral node chains.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Analysis of required resources for a node using queue system in an ad hoc network
Required resource for nodes in an ad hoc network with specific parameters (e.g. node-count and topology) is one of the most important problems for the manufacturer. In this paper, in the first phase, we showed that according to the proposed game model for the node behaviour, the network converge to a steady state and in the second phase, the process of a node in forwarding the received packets is modeled as a queue system and according to the load of a node the required resources (e.g. buffer-size and average service rate).
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Analysis of required resources for a node using queue system in an ad hoc network
Required resource for nodes in an ad hoc network with specific parameters (e.g. node-count and topology) is one of the most important problems for the manufacturer. In this paper, in the first phase, we showed that according to the proposed game model for the node behaviour, the network converge to a steady state and in the second phase, the process of a node in forwarding the received packets is modeled as a queue system and according to the load of a node the required resources (e.g. buffer-size and average service rate).