SatNode Class Reference

#include <satnode.h>

Inheritance diagram for SatNode:

Collaboration diagram for SatNode:

[legend]

---

Detailed Description

Definition at line 54 of file satnode.h.

Public Member Functions
void	add_route (char *dst, NsObject *target)
virtual void	AddAdj (nodeid_t a, int w=1)
void	addNeighbor (Node *node)
int	address ()
void	delete_route (char *dst, NsObject *nullagent)
Channel *	downlink ()
void	Dump (void)
EnergyModel *	energy_model ()
bool	exist_namchan () const
virtual nodeid_t	GetNeighbor (Nix_t)
virtual NixPair_t	GetNix (nodeid_t)
virtual Nixl_t	GetNixl ()
const struct if_head &	ifhead () const
void	insert (struct node_head *head)
NsObject *	intf_to_target (int32_t)
const struct linklist_head &	linklisthead () const
Location *	location ()
virtual void	namlog (const char *fmt,...)
virtual const NodeWeight_t	NextAdj (const NodeWeight_t &)
Node *	nextnode ()
int	nodeid ()
SatPosition *	position ()
SatRouteAgent *	ragent ()
void	route_notify (RoutingModule *rtm)
	SatNode ()
void	set_table_size (int level, int csize)
void	set_table_size (int nn)
SatTrace *	trace ()
void	unreg_route_notify (RoutingModule *rtm)
void	Update (void)
void	UpdateNeighbors (void)
Channel *	uplink ()
Static Public Member Functions
static int	addNode (int)
static Node *	get_node_by_address (nsaddr_t)
static int	IsASatNode (int)
Data Fields
int	link_changes
EdgeVec_t	m_Adj
nodeid_t	m_id
Neighbor *	neighbor
neighbor_list_node *	neighbor_list_
int	route_changes
double	time_arrival
double	time_transition
Static Public Attributes
static int	dist_routing_ = 0
static struct node_head	nodehead_
Protected Member Functions
int	command (int argc, const char *const *argv)
void	dumpSats ()
	LIST_ENTRY (Node) entry
void	namdump ()
Protected Attributes
int	address_
SatChannel *	downlink_
EnergyModel *	energy_model_
LinkHandoffMgr *	hm_
if_head	ifhead_
linklist_head	linklisthead_
Location *	location_
Tcl_Channel	namChan_
int	nodeid_
SatPosition *	pos_
SatRouteAgent *	ragent_
RoutingModule *	rtnotif_
SatTrace *	trace_
SatChannel *	uplink_
Static Protected Attributes
static int	maxsatnodelist_ = 0
static char	nwrk_ [NODE_NAMLOG_BUFSZ]
static int *	satnodelist_ = NULL

---

Constructor & Destructor Documentation

SatNode::SatNode (   )

Definition at line 61 of file satnode.cc. References dist_routing_. : ragent_(0), trace_(0), hm_(0) { bind_bool("dist_routing_", &dist_routing_); }

---

Member Function Documentation

void Node::add_route (  char *  dst, NsObject *  target )  [virtual, inherited]

Reimplemented from ParentNode. Definition at line 241 of file node.cc. References RoutingModule::add_route(), and Node::rtnotif_. { if (rtnotif_) rtnotif_->add_route(dst, target); } Here is the call graph for this function:

virtual void Node::AddAdj (  nodeid_t  a, int  w = 1 )  [virtual, inherited]

Reimplemented from RNode.

void Node::addNeighbor (  Node *  node  )  [inherited]

Definition at line 262 of file node.cc. References Node::neighbor, Node::neighbor_list_, neighbor_list_node::next, and neighbor_list_node::nodeid. Referenced by Node::command(). { neighbor_list_node* nlistItem = (neighbor_list_node *)malloc(sizeof(neighbor_list_node)); nlistItem->nodeid = neighbor->nodeid(); nlistItem->next = neighbor_list_; neighbor_list_=nlistItem; }

int SatNode::addNode (  int   )  [static]

Definition at line 151 of file satnode.cc. References MAXSATNODELIST, maxsatnodelist_, and satnodelist_. Referenced by command(). { if (maxsatnodelist_ == 0) { satnodelist_ = new int[MAXSATNODELIST]; memset(satnodelist_, 0, MAXSATNODELIST * sizeof(satnodelist_)); maxsatnodelist_ = MAXSATNODELIST; } assert(nodenum < 2*maxsatnodelist_); if (nodenum >= maxsatnodelist_) { // Double size of array int i; int* temp = new int[2 * maxsatnodelist_]; memset(temp, 0, 2 * maxsatnodelist_ * sizeof(temp)); for (i = 0; i < maxsatnodelist_; i++) { temp[i] = satnodelist_[i]; } delete [] satnodelist_; satnodelist_ = temp; maxsatnodelist_ *= 2; } satnodelist_[nodenum] = 1; return 0; }

int Node::address (   )  [inline, virtual, inherited]

Reimplemented from ParentNode. Definition at line 131 of file node.h. Referenced by ARPTable::arpinput(), ARPTable::arpresolve(), SctpAgent::command(), PushbackAgent::command(), God::command(), SatRouteObject::compute_topology(), GridKeeper::dump(), dumpSats(), GridKeeper::get_neighbors(), LinkHandoffMgr::get_peer_linkhead(), GridHandler::handle(), WebTrafPool::launchReq(), SatRouteObject::populate_routing_tables(), and EmpFtpTrafSession::sendFile(). { return address_;}

int SatNode::command (  int  argc, const char *const *  argv )  [protected, virtual]

Reimplemented from Node. Definition at line 66 of file satnode.cc. References addNode(), Node::command(), downlink_, dumpSats(), hm_, Node::ifhead_, Phy::insertnode(), pos_, ragent_, Phy::setnode(), LinkHandoffMgr::start(), trace_, and uplink_. { Tcl& tcl = Tcl::instance(); if (argc == 2) { if (strcmp(argv[1], "set_downlink") == 0) { if (downlink_ != NULL) { tcl.result(downlink_->name()); return (TCL_OK); } } else if (strcmp(argv[1], "set_uplink") == 0) { if (downlink_ != NULL) { tcl.result(uplink_->name()); return (TCL_OK); } } else if (strcmp(argv[1], "start_handoff") == 0) { if (hm_) hm_->start(); else { printf("Error: starting non-existent "); printf("handoff mgr\n"); exit(1); } return (TCL_OK); } else if (strcmp(argv[1], "dump_sats") == 0) { dumpSats(); return (TCL_OK); } } if (argc == 3) { if (strcmp(argv[1], "set_uplink") == 0) { uplink_ = (SatChannel *) TclObject::lookup(argv[2]); if (uplink_ == 0) { tcl.resultf("no such object %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if (strcmp(argv[1], "set_downlink") == 0) { downlink_ = (SatChannel *) TclObject::lookup(argv[2]); if (downlink_ == 0) { tcl.resultf("no such object %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if (strcmp(argv[1], "set_trace") == 0) { trace_ = (SatTrace *) TclObject::lookup(argv[2]); if (trace_ == 0) { tcl.resultf("no such object %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if (strcmp(argv[1], "set_ragent") == 0) { ragent_ = (SatRouteAgent *) TclObject::lookup(argv[2]); if (ragent_ == 0) { tcl.resultf("no such object %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if(strcmp(argv[1], "addif") == 0) { SatPhy* n = (SatPhy*) TclObject::lookup(argv[2]); if(n == 0) return TCL_ERROR; n->insertnode(&ifhead_); n->setnode(this); return TCL_OK; } else if (strcmp(argv[1], "set_position") == 0) { pos_ = (SatPosition*) TclObject::lookup(argv[2]); if (pos_ == 0) { tcl.resultf("no such object %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if (strcmp(argv[1], "set_handoff_mgr") == 0) { hm_ = (LinkHandoffMgr*) TclObject::lookup(argv[2]); if (hm_ == 0) { tcl.resultf("no such object %s", argv[2]); return (TCL_ERROR); } return (TCL_OK); } else if (strcmp(argv[1], "set_address") == 0) { addNode(atoi(argv[2])); return (TCL_OK); } } return (Node::command(argc, argv)); } Here is the call graph for this function:

void Node::delete_route (  char *  dst, NsObject *  nullagent )  [virtual, inherited]

Reimplemented from ParentNode. Definition at line 247 of file node.cc. References RoutingModule::delete_route(), and Node::rtnotif_. { if (rtnotif_) rtnotif_->delete_route(dst, nullagent); } Here is the call graph for this function:

Channel* SatNode::downlink (   )  [inline]

Definition at line 65 of file satnode.h. References downlink_. { return ((Channel*) downlink_);}

void Node::Dump (  void   )  [inherited]

Definition at line 624 of file calcdest.cc. References Node::destination, Node::direction, Neighbor::index, Node::index, Node::neighbor, Node::position, Neighbor::reachable, Node::speed, Node::time_arrival, Node::time_transition, Node::time_update, vector::X, vector::Y, and vector::Z. { Neighbor *m; u_int32_t i; fprintf(stdout, "Node: %d\tpos: (%.2f, %.2f, %.2f) dst: (%.2f, %.2f, %.2f)\n", index, position.X, position.Y, position.Z, destination.X, destination.Y, destination.Z); fprintf(stdout, "\tdir: (%.2f, %.2f, %.2f) speed: %.2f\n", direction.X, direction.Y, direction.Z, speed); fprintf(stdout, "\tArrival: %.2f, Update: %.2f, Transition: %.2f\n", time_arrival, time_update, time_transition); for(i = 1; i < NODES; i++) { m = &neighbor[i]; fprintf(stdout, "\tNeighbor: %d (%lx), Reachable: %d, Transition Time: %.2f\n", m->index, (long) m, m->reachable, m->time_transition); } }

void SatNode::dumpSats (   )  [protected]

Definition at line 186 of file satnode.cc. References Node::address(), SatPosition::coord(), SatGeometry::get_latitude(), SatGeometry::get_longitude(), IsASatNode(), Node::nextnode(), Node::nodehead_, NOW, PolarSatPosition::plane(), position(), POSITION_SAT_POLAR, RAD_TO_DEG, and SatPosition::type(). Referenced by command(). { SatNode *snodep, *peer_snodep; SatPosition *sposp, *peer_sposp; PolarSatPosition *polar_sposp; SatLinkHead *slhp; int linktype; printf("\nDumping satellites at time %.2f\n\n", NOW); for (snodep= (SatNode*) Node::nodehead_.lh_first; snodep; snodep = (SatNode*) snodep->nextnode()) { if (!SatNode::IsASatNode(snodep->address())) continue; sposp = snodep->position(); printf("%d\t%.2f\t%.2f", snodep->address(), RAD_TO_DEG(SatGeometry::get_latitude(sposp->coord())), RAD_TO_DEG(SatGeometry::get_longitude(sposp->coord()))); // If SatNode is polar, append plane information if (sposp->type()==POSITION_SAT_POLAR) { polar_sposp = (PolarSatPosition*) snodep->position(); printf ("\t%d", polar_sposp->plane()); } else if (sposp->type()==POSITION_SAT_GEO) { printf ("\tGEO"); } else if (sposp->type()==POSITION_SAT_TERM) { printf ("\tTERM"); } printf("\n"); } printf("\n"); // Dump satellite links // There is a static list of address classifiers //QQQ printf("Links:\n"); for (snodep = (SatNode*) Node::nodehead_.lh_first; snodep; snodep = (SatNode*) snodep->nextnode()) { if (!SatNode::IsASatNode(snodep->address())) continue; // XXX Not all links necessarily satlinks for (slhp = (SatLinkHead*) snodep->linklisthead_.lh_first; slhp; slhp = (SatLinkHead*) slhp->nextlinkhead() ) { linktype = slhp->type(); if (linktype == LINK_GENERIC) continue; if (!slhp->linkup_) continue; // Link is up. // Print out source and dest coordinates. sposp = snodep->position(); peer_snodep = hm_->get_peer(slhp); if (peer_snodep == 0) continue; // this link interface is not attached // need something in here for txs. peer_sposp = peer_snodep->position(); printf("%.2f\t%.2f\t%.2f\t%.2f\t%d\n", RAD_TO_DEG(SatGeometry::get_latitude(sposp->coord())), RAD_TO_DEG(SatGeometry::get_longitude(sposp->coord())), RAD_TO_DEG(SatGeometry::get_latitude(peer_sposp->coord())), RAD_TO_DEG(SatGeometry::get_longitude(peer_sposp->coord())), linktype); } } printf("\nDumped satellites at time %.2f\n\n", NOW); } Here is the call graph for this function:

EnergyModel* Node::energy_model (   )  [inline, inherited]

Definition at line 192 of file node.h. Referenced by MobileNode::command(), WirelessPhy::em(), EnergyTimer::EnergyTimer(), EnergyTimer::expire(), CMUTrace::format_mac_common(), CMUTrace::format_rtp(), GAFAgent::myttl(), CMUTrace::nam_format(), CMUTrace::node_energy(), GAFAgent::node_off(), GAFAgent::node_on(), Phy802_15_4::recv(), Mac802_15_4::recv(), Mac802_11::send(), and Mac802_15_4::sendDown(). { return energy_model_; }

bool Node::exist_namchan (   )  const [inline, inherited]

Definition at line 133 of file node.h. Referenced by EnergyModel::set_node_sleep(). { return (namChan_ != 0); }

Node * Node::get_node_by_address (  nsaddr_t   )  [static, inherited]

Definition at line 315 of file node.cc. References Node::address_, Node::nextnode(), and Node::Node(). Referenced by CMUTrace::format_mac_common(), CMUTrace::format_rtp(), GAFAgent::GAFAgent(), CMUTrace::nam_format(), and CMUTrace::node_energy(). { Node * tnode = nodehead_.lh_first; for (; tnode; tnode = tnode->nextnode()) { if (tnode->address_ == id ) { return (tnode); } } return NULL; } Here is the call graph for this function:

virtual nodeid_t RNode::GetNeighbor (  Nix_t   )  [virtual, inherited]

virtual NixPair_t Node::GetNix (  nodeid_t   )  [virtual, inherited]

Reimplemented from RNode.

virtual Nixl_t RNode::GetNixl (   )  [virtual, inherited]

Reimplemented in NixNode.

const struct if_head& Node::ifhead (   )  const [inline, inherited]

Definition at line 148 of file node.h. Referenced by GAFAgent::myttl(), GAFAgent::node_off(), GAFAgent::node_on(), and WirelessChannel::sendUp(). { return ifhead_; }

void Node::insert (  struct node_head *  head  )  [inline, inherited]

Definition at line 141 of file node.h. References LIST_INSERT_HEAD. Referenced by Node::Node(). { LIST_INSERT_HEAD(head, this, entry); }

NsObject * Node::intf_to_target (  int32_t   )  [inherited]

Definition at line 305 of file node.cc. References LinkHead::label(), Node::linklisthead_, and LinkHead::nextlinkhead(). { LinkHead *lhp = linklisthead_.lh_first; for (; lhp; lhp = lhp->nextlinkhead()) if (label == lhp->label()) return ((NsObject*) lhp); return NULL; } Here is the call graph for this function:

int SatNode::IsASatNode (  int   )  [static]

Definition at line 175 of file satnode.cc. References maxsatnodelist_, and satnodelist_. Referenced by SatRouteObject::compute_topology(), dumpSats(), and SatRouteObject::populate_routing_tables(). { if (nodenum > maxsatnodelist_) { printf("Error: IsASatNode() nodenum %d greater than maxsatnodelist_ %d\n", nodenum, maxsatnodelist_); exit(1); } return satnodelist_[nodenum]; }

const struct linklist_head& Node::linklisthead (   )  const [inline, inherited]

Definition at line 149 of file node.h. Referenced by SatRouteObject::compute_topology(), LinkHandoffMgr::get_peer_next_linkhead(), SatLinkHandoffMgr::handoff(), and TermLinkHandoffMgr::handoff(). { return linklisthead_; }

Node::LIST_ENTRY (  Node   )  [protected, inherited]

Location* Node::location (   )  [inline, inherited]

Definition at line 193 of file node.h. { return location_; }

void Node::namdump (   )  [protected, inherited]

Definition at line 281 of file node.cc. References abort(), Node::namChan_, NODE_NAMLOG_BUFSZ, and Node::nwrk_. Referenced by Node::namlog(), and MobileNode::set_destination(). { int n = 0; /* Otherwise nwrk_ isn't initialized */ n = strlen(nwrk_); if (n >= NODE_NAMLOG_BUFSZ-1) { fprintf(stderr, "Node::namdump() exceeds buffer size. Bail out.\n"); abort(); } if (n > 0) { /* * tack on a newline (temporarily) instead * of doing two writes */ nwrk_[n] = '\n'; nwrk_[n + 1] = 0; (void)Tcl_Write(namChan_, nwrk_, n + 1); nwrk_[n] = 0; } } Here is the call graph for this function:

void Node::namlog (  const char *  fmt,   ... )  [virtual, inherited]

Definition at line 270 of file node.cc. References Node::namChan_, Node::namdump(), and Node::nwrk_. { // Don't do anything if we don't have a log file. if (namChan_ == 0) return; va_list ap; va_start(ap, fmt); vsprintf(nwrk_, fmt, ap); namdump(); } Here is the call graph for this function:

virtual const NodeWeight_t Node::NextAdj (  const NodeWeight_t &   )  [virtual, inherited]

Reimplemented from RNode.

Node* Node::nextnode (   )  [inline, inherited]

Reimplemented in MobileNode. Definition at line 144 of file node.h. Referenced by SatRouteObject::compute_topology(), dumpSats(), Node::get_node_by_address(), and SatRouteObject::populate_routing_tables(). { return entry.le_next; }

int Node::nodeid (   )  [inline, virtual, inherited]

Reimplemented from ParentNode. Definition at line 132 of file node.h. Referenced by PushbackAgent::calculateLowerBound(), PushbackAgent::command(), PushbackAgent::getQID(), LoggingDataStruct::LoggingDataStruct(), CMUTrace::nam_format(), PushbackAgent::printMsg(), PushbackAgent::processPushbackStatus(), PushbackAgent::pushbackCancel(), PushbackAgent::pushbackCheck(), PushbackAgent::pushbackRefresh(), PushbackAgent::pushbackStatus(), PushbackAgent::refreshUpstreamLimits(), and PushbackQueue::timeout(). { return nodeid_;}

SatPosition* SatNode::position (   )  [inline]

Definition at line 60 of file satnode.h. References pos_. Referenced by dumpSats(), and SatLinkHandoffMgr::handoff(). { return pos_; }

SatRouteAgent* SatNode::ragent (   )  [inline]

Definition at line 59 of file satnode.h. References ragent_. Referenced by SatLL::getRoute(), and SatRouteObject::populate_routing_tables(). { return ragent_; }

void Node::route_notify (  RoutingModule *  rtm  )  [inherited]

Definition at line 222 of file node.cc. References RoutingModule::route_notify(), and Node::rtnotif_. Referenced by VcRoutingModule::command(), ManualRoutingModule::command(), HierRoutingModule::command(), McastRoutingModule::command(), QSRoutingModule::command(), SourceRoutingModule::command(), BaseRoutingModule::command(), and MPLSModule::command(). { if (rtnotif_ == NULL) rtnotif_ = rtm; else rtnotif_->route_notify(rtm); } Here is the call graph for this function:

void Node::set_table_size (  int  level, int  csize )  [virtual, inherited]

Reimplemented from ParentNode. Definition at line 257 of file node.cc. References Node::rtnotif_, and RoutingModule::set_table_size(). { if (rtnotif_) rtnotif_->set_table_size(level, csize); } Here is the call graph for this function:

void Node::set_table_size (  int  nn  )  [virtual, inherited]

Reimplemented from ParentNode. Definition at line 252 of file node.cc. References Node::rtnotif_, and RoutingModule::set_table_size(). { if (rtnotif_) rtnotif_->set_table_size(nn); } Here is the call graph for this function:

SatTrace* SatNode::trace (   )  [inline]

Definition at line 61 of file satnode.h. References trace_. { return trace_; }

void Node::unreg_route_notify (  RoutingModule *  rtm  )  [inherited]

Definition at line 229 of file node.cc. References RoutingModule::next_rtm_, Node::rtnotif_, and RoutingModule::unreg_route_notify(). Referenced by VcRoutingModule::command(), ManualRoutingModule::command(), HierRoutingModule::command(), McastRoutingModule::command(), QSRoutingModule::command(), SourceRoutingModule::command(), BaseRoutingModule::command(), and MPLSModule::command(). { if (rtnotif_) { if (rtnotif_ == rtm) { //RoutingModule *tmp = rtnotif_; rtnotif_= rtnotif_->next_rtm_; //free (tmp); } else rtnotif_->unreg_route_notify(rtm); } } Here is the call graph for this function:

void Node::Update (  void   )  [inherited]

Definition at line 427 of file calcdest.cc. References Node::destination, Node::direction, vector::length(), LIST_NEXT, LIST_REMOVE, MAXTIME, Node::position, setdest::speed, Node::speed, TIME, Node::time_arrival, Node::time_transition, Node::time_update, setdest::X, vector::X, setdest::Y, vector::Y, and vector::Z. { struct setdest *setdest = traj.lh_first; position += (speed * (TIME - time_update)) * direction; if(TIME == time_arrival) { if (NULL == setdest) { destination = position; direction.X = direction.Y = direction.Z = 0.0; speed = 0.0; time_arrival = MAXTIME + 1; } else { vector v; destination.X = setdest->X; destination.Y = setdest->Y; speed = setdest->speed; if (0.0 == speed) { // it's a pause at the current location if (LIST_NEXT(setdest,traj)) time_arrival = LIST_NEXT(setdest,traj)->time; else time_arrival = MAXTIME + 1; } else { // we're moving somewhere, when do we get there? v = destination - position; direction = v / v.length(); time_arrival = TIME + v.length() / speed; } LIST_REMOVE(setdest,traj); free(setdest); } } time_update = TIME; time_transition = 0.0; } Here is the call graph for this function:

void Node::UpdateNeighbors (  void   )  [inherited]

Definition at line 472 of file calcdest.cc. References a, b, Node::direction, Node::index, vector::length(), m1, m2, Node::neighbor, NodeList, Node::position, RANGE, ROUND_ERROR, SANITY_CHECKS, Node::speed, and TIME. { static Node *n2; static Neighbor *m1, *m2; static vector D, B, v1, v2; static double a, b, c, t1, t2, Q; static u_int32_t i, reachable; v1 = speed * direction; /* * Only need to go from INDEX --> N for each one since links * are symmetric. */ for(i = index+1; i < NODES; i++) { m1 = &neighbor[i]; n2 = &NodeList[i]; m2 = &n2->neighbor[index]; assert(i == m1->index); assert(m1->index == n2->index); assert(index == m2->index); assert(m1->reachable == m2->reachable); reachable = m1->reachable; /* ================================================== Determine Reachability ================================================== */ { vector d = position - n2->position; if(d.length() < RANGE) { #ifdef SANITY_CHECKS if(TIME > 0.0 && m1->reachable == 0) assert(RANGE - d.length() < ROUND_ERROR); #endif m1->reachable = m2->reachable = 1; } // Boundary condition handled below. else { #ifdef SANITY_CHECKS if(TIME > 0.0 && m1->reachable == 1) assert(d.length() - RANGE < ROUND_ERROR); #endif m1->reachable = m2->reachable = 0; } #ifdef DEBUG fprintf(stdout, "# %.6f (%d, %d) %.2fm\n", TIME, index, m1->index, d.length()); #endif } /* ================================================== Determine Next Event Time ================================================== */ v2 = n2->speed * n2->direction; D = v2 - v1; B = n2->position - position; a = (D.X * D.X) + (D.Y * D.Y) + (D.Z * D.Z); b = 2 * ((D.X * B.X) + (D.Y * B.Y) + (D.Z * B.Z)); c = (B.X * B.X) + (B.Y * B.Y) + (B.Z * B.Z) - (RANGE * RANGE); if(a == 0.0) { /* * No Finite Solution */ m1->time_transition= 0.0; m2->time_transition= 0.0; goto next; } Q = b * b - 4 * a * c; if(Q < 0.0) { /* * No real roots. */ m1->time_transition = 0.0; m2->time_transition = 0.0; goto next; } Q = sqrt(Q); t1 = (-b + Q) / (2 * a); t2 = (-b - Q) / (2 * a); // Stupid Rounding/Boundary Cases if(t1 > 0.0 && t1 < ROUND_ERROR) t1 = 0.0; if(t1 < 0.0 && -t1 < ROUND_ERROR) t1 = 0.0; if(t2 > 0.0 && t2 < ROUND_ERROR) t2 = 0.0; if(t2 < 0.0 && -t2 < ROUND_ERROR) t2 = 0.0; if(t1 < 0.0 && t2 < 0.0) { /* * No "future" time solution. */ m1->time_transition = 0.0; m2->time_transition = 0.0; goto next; } /* * Boundary conditions. */ if((t1 == 0.0 && t2 > 0.0) || (t2 == 0.0 && t1 > 0.0)) { m1->reachable = m2->reachable = 1; m1->time_transition = m2->time_transition = TIME + max(t1, t2); } else if((t1 == 0.0 && t2 < 0.0) || (t2 == 0.0 && t1 < 0.0)) { m1->reachable = m2->reachable = 0; m1->time_transition = m2->time_transition = 0.0; } /* * Non-boundary conditions. */ else if(t1 > 0.0 && t2 > 0.0) { m1->time_transition = TIME + min(t1, t2); m2->time_transition = TIME + min(t1, t2); } else if(t1 > 0.0) { m1->time_transition = TIME + t1; m2->time_transition = TIME + t1; } else { m1->time_transition = TIME + t2; m2->time_transition = TIME + t2; } /* ================================================== Update the transition times for both NODEs. ================================================== */ if(time_transition == 0.0 || (m1->time_transition && time_transition > m1->time_transition)) { time_transition = m1->time_transition; } if(n2->time_transition == 0.0 || (m2->time_transition && n2->time_transition > m2->time_transition)) { n2->time_transition = m2->time_transition; } next: if(reachable != m1->reachable && TIME > 0.0) { LinkChangeCount++; link_changes++; n2->link_changes++; } } } Here is the call graph for this function:

Channel* SatNode::uplink (   )  [inline]

Definition at line 64 of file satnode.h. References uplink_. { return ((Channel*) uplink_);}

---

Field Documentation

int Node::address_ [protected, inherited]

Reimplemented from ParentNode. Definition at line 169 of file node.h. Referenced by MobileNode::bound_position(), Node::command(), MobileNode::command(), MobileNode::dump(), Node::get_node_by_address(), MobileNode::log_energy(), MobileNode::log_movement(), MobileNode::random_destination(), MobileNode::set_destination(), MobileNode::start(), and MobileNode::update_position().

int SatNode::dist_routing_ = 0 [static]

Definition at line 68 of file satnode.h. Referenced by SatNode().

SatChannel* SatNode::downlink_ [protected]

Definition at line 75 of file satnode.h. Referenced by command(), and downlink().

EnergyModel* Node::energy_model_ [protected, inherited]

Definition at line 195 of file node.h. Referenced by Node::command(), and MobileNode::log_energy().

LinkHandoffMgr* SatNode::hm_ [protected]

Definition at line 78 of file satnode.h. Referenced by command().

struct if_head Node::ifhead_ [protected, inherited]

Definition at line 179 of file node.h. Referenced by command(), MobileNode::command(), MobileNode::dump(), MobileNode::MobileNode(), and Node::Node().

int Node::link_changes [inherited]

Definition at line 86 of file setdest.h.

struct linklist_head Node::linklisthead_ [protected, inherited]

Definition at line 180 of file node.h. Referenced by Node::command(), Node::intf_to_target(), and Node::Node().

Location* Node::location_ [protected, inherited]

Definition at line 199 of file node.h.

EdgeVec_t Node::m_Adj [inherited]

Definition at line 82 of file tnode.h.

nodeid_t RNode::m_id [inherited]

Definition at line 42 of file rnode.h. Referenced by NixNode::Id().

int SatNode::maxsatnodelist_ = 0 [static, protected]

Definition at line 81 of file satnode.h. Referenced by addNode(), and IsASatNode().

Tcl_Channel Node::namChan_ [protected, inherited]

Definition at line 173 of file node.h. Referenced by Node::command(), Node::namdump(), Node::namlog(), and MobileNode::set_destination().

Neighbor* Node::neighbor [inherited]

Definition at line 109 of file setdest.h. Referenced by Node::addNeighbor(), Node::Dump(), and Node::UpdateNeighbors().

neighbor_list_node* Node::neighbor_list_ [inherited]

Definition at line 154 of file node.h. Referenced by Node::addNeighbor(), LoggingDataStruct::LoggingDataStruct(), and Node::Node().

struct node_head Node::nodehead_ [static, inherited]

Definition at line 140 of file node.h. Referenced by SatRouteObject::compute_topology(), dumpSats(), Node::Node(), and SatRouteObject::populate_routing_tables().

int Node::nodeid_ [protected, inherited]

Reimplemented from ParentNode. Definition at line 170 of file node.h. Referenced by Node::command(), and MobileNode::set_destination().

char Node::nwrk_ [static, protected, inherited]

Definition at line 176 of file node.h. Referenced by Node::namdump(), Node::namlog(), and MobileNode::set_destination().

SatPosition* SatNode::pos_ [protected]

Definition at line 76 of file satnode.h. Referenced by command(), and position().

SatRouteAgent* SatNode::ragent_ [protected]

Definition at line 73 of file satnode.h. Referenced by command(), and ragent().

int Node::route_changes [inherited]

Definition at line 85 of file setdest.h. Referenced by show_diffs().

RoutingModule* Node::rtnotif_ [protected, inherited]

Definition at line 183 of file node.h. Referenced by Node::add_route(), Node::delete_route(), Node::route_notify(), Node::set_table_size(), and Node::unreg_route_notify().

int * SatNode::satnodelist_ = NULL [static, protected]

Definition at line 80 of file satnode.h. Referenced by addNode(), and IsASatNode().

double Node::time_arrival [inherited]

Definition at line 81 of file setdest.h. Referenced by Node::Dump(), and Node::Update().

double Node::time_transition [inherited]

Definition at line 82 of file setdest.h. Referenced by Node::Dump(), main(), and Node::Update().

SatTrace* SatNode::trace_ [protected]

Definition at line 77 of file satnode.h. Referenced by command(), and trace().

SatChannel* SatNode::uplink_ [protected]

Definition at line 74 of file satnode.h. Referenced by command(), and uplink().

---

The documentation for this class was generated from the following files:

• satnode.h
• satnode.cc

---