Olfactory bulb network model of gamma oscillations (Bathellier et al. 2006; Lagier et al. 2007)

 Download zip file 
Help downloading and running models
Accession:91387
This model implements a network of 100 mitral cells connected with asynchronous inhibitory "synapses" that is meant to reproduce the GABAergic transmission of ensembles of connected granule cells. For appropriate parameters of this special synapse the model generates gamma oscillations with properties very similar to what is observed in olfactory bulb slices (See Bathellier et al. 2006, Lagier et al. 2007). Mitral cells are modeled as single compartment neurons with a small number of different voltage gated channels. Parameters were tuned to reproduce the fast subthreshold oscillation of the membrane potential observed experimentally (see Desmaisons et al. 1999).
References:
1 . Bathellier B, Lagier S, Faure P, Lledo PM (2006) Circuit properties generating gamma oscillations in a network model of the olfactory bulb. J Neurophysiol 95:2678-91 [PubMed]
2 . Lagier S, Panzanelli P, Russo RE, Nissant A, Bathellier B, Sassoè-Pognetto M, Fritschy JM, Lledo PM (2007) GABAergic inhibition at dendrodendritic synapses tunes gamma oscillations in the olfactory bulb. Proc Natl Acad Sci U S A 104:7259-64 [PubMed]
3 . Bathellier B, Lagier S, Faure P, Lledo PM (2006) Corrigendum for Bathellier et al., J Neurophysiol 95 (4) 2678-2691. J Neurophysiol 95:3961-3962
Model Information (Click on a link to find other models with that property)
Model Type: Realistic Network;
Brain Region(s)/Organism: Olfactory bulb;
Cell Type(s): Olfactory bulb main mitral GLU cell;
Channel(s): I Na,p; I Na,t; I A; I K;
Gap Junctions:
Receptor(s): GabaA;
Gene(s):
Transmitter(s):
Simulation Environment: C or C++ program;
Model Concept(s): Oscillations; Delay; Olfaction;
Implementer(s):
Search NeuronDB for information about:  Olfactory bulb main mitral GLU cell; GabaA; I Na,p; I Na,t; I A; I K;
/*************************************************************************/
/**********             	   ChanTAUrk4.cpp                *************/
/*************************************************************************/
/****                                                                 ****/
/****              Methods  for the class Stepmaster                  ****/
/****    commands initialisation and steps of attached Steppers       ****/
/****                                                                 ****/
/*************************************************************************/





#include "StepmstrRk4.h"
#include "StepperRk4.h"

// global Stepmaster:
Stepmaster gStepmaster;


Stepmaster::Stepmaster()			// constructor
{
	itsListHead = itsListTail = 0;
	itsCurIdx = 0;
}

Stepmaster::~Stepmaster()			// destructor
{
	// destroy all attached Steppers before we die
	
	StepperNode *nextNode, *curNode;
	for (curNode = itsListHead; curNode; curNode = nextNode) {
		nextNode = curNode->itsNext;
		delete curNode;
	}

	// now we can die peacefully
}


void Stepmaster::Attach( Stepper& pStepper)
{
	// first, if the Stepper is already attached to another Stepmaster,
	// then remove it
	if (pStepper.itsMaster) pStepper.itsMaster->Remove( pStepper );
	
	// now add the given stepper to the tail of the list
	StepperNode *node = new StepperNode( itsListTail, pStepper );
	itsListTail = node;
	if (!itsListHead) itsListHead = node;
	
	// and set its pointer to point to us
	pStepper.itsMaster = this;
}



void Stepmaster::doStepinit(const real dt )
{
	// call the Stepinit method for all attached Steppers
	
	for (StepperNode *node=itsListHead; node; node = node->itsNext) {
		node->itsStepper->Init(dt);
	}

}


/* General step function. The only one that update the time */ 

void Stepmaster::StepAll( const real dt )
{
	// call the Step(dt) method for all attached Steppers
	
	for (StepperNode *node=itsListHead; node; node = node->itsNext) {
		node->itsStepper->Step(dt);
	}

	// now update itsCurIdx
	itsCurIdx = !itsCurIdx;
}


/* Runge Kutta step functions : one for each step of the method */


void Stepmaster::doStepk1( const real dt )
{
	// call the Stepk1(dt) method for all attached Steppers
	
	for (StepperNode *node=itsListHead; node; node = node->itsNext) {
		node->itsStepper->Stepk1(dt);
	}

}
void Stepmaster::doStepk2( const real dt )
{
	// call the Stepk2(dt) method for all attached Steppers
	
	for (StepperNode *node=itsListHead; node; node = node->itsNext) {
		node->itsStepper->Stepk2(dt);
	}

}
void Stepmaster::doStepk3( const real dt )
{
	// call the Stepk3(dt) method for all attached Steppers
	
	for (StepperNode *node=itsListHead; node; node = node->itsNext) {
		node->itsStepper->Stepk3(dt);
	}

}

void Stepmaster::doStepk4( const real dt )
{
	// call the Stepk4(dt) method for all attached Steppers
	
	for (StepperNode *node=itsListHead; node; node = node->itsNext) {
		node->itsStepper->Stepk4(dt);
	}

}




void Stepmaster::Remove( Stepper& pStepper )
{
	// the given Stepper is either dying or attaching to another master
	// so remove it from our list, and update its pointer
	
	StepperNode *curNode, *lastNode=0;
	for (curNode = itsListHead; curNode;
				lastNode = curNode, curNode = curNode->itsNext) {
		if ( curNode->itsStepper == &pStepper ) {
			// found it!  now remove it from the list
			if (lastNode) lastNode->itsNext = curNode->itsNext;
			if (curNode==itsListHead) itsListHead = curNode->itsNext;
			if (curNode==itsListTail) itsListTail = lastNode;
			delete curNode;
			pStepper.itsMaster = 0;
			return;
		}
	}
	
	// if we get to this point, it means we didn't find the given Stepper
	// this should never happen -- if you want to throw an exception,
	// do it here
}


Loading data, please wait...