Analysis of required resources for a node using queue system in an ad hoc network

Author

Haghighatdoost, Vahid ; Khorsandi, Siavash

Author_Institution

Comput. Eng. & IT Dept., Amirkabir Univ. of Technol., Tehran, Iran

fYear

2013

fDate

4-6 July 2013

Firstpage

1

Lastpage

7

Abstract

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).

Keywords

Markov processes; ad hoc networks; cooperative communication; game theory; queueing theory; resource allocation; ad hoc network; average service rate; buffer-size; game model; node behaviour; node-count; queue system; required resources; topology; Ad hoc networks; Games; Heuristic algorithms; Mobile computing; Network topology; Steady-state; Topology; Ad hoc Network; Game Theory; Markov chain; Nash Equlibrium; Queue System; Resource Analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Computing, Communications and Networking Technologies (ICCCNT),2013 Fourth International Conference on

Conference_Location

Tiruchengode

Print_ISBN

978-1-4799-3925-1

Type

conf

DOI

10.1109/ICCCNT.2013.6726696

Filename

6726696