MCRP - Revision history

Kluth: /* Channel Selection Algorithm */

2006-07-23T13:42:16Z

Channel Selection Algorithm

← Older revision		Revision as of 13:42, 23 July 2006
Line 188:		Line 188:

	If the route is feasible, the channel is selected according to the channel table. If a channel has value ≥ 2, the channel has to be selected, or if two channels have value 1, one of these channels with minimum interference is selected. Finally, if only one channel has value 1 and all others 0, then select any channel with minimum interference level. (The interference level on a channel is determined by use of the flow table.)		If the route is feasible, the channel is selected according to the channel table. If a channel has value ≥ 2, the channel has to be selected, or if two channels have value 1, one of these channels with minimum interference is selected. Finally, if only one channel has value 1 and all others 0, then select any channel with minimum interference level. (The interference level on a channel is determined by use of the flow table.)

	Scenario 4

	==Delayed Reply==		==Delayed Reply==

Kluth: /* Channel Selection */

2006-07-23T13:40:05Z

Channel Selection

← Older revision		Revision as of 13:40, 23 July 2006
Line 144:		Line 144:

	[[Image:MCRP_Channel_Table.png]]		[[Image:MCRP_Channel_Table.png]]
	<center>Channel Table</center>		<center>Channel Table</center><br/><br/>

	As the RREQs are forwarded, each node updates the channel		As the RREQs are forwarded, each node updates the channel
Line 162:		Line 162:
	[[Image:MCRP_Scenario_4_Channel_Table.png]]		[[Image:MCRP_Scenario_4_Channel_Table.png]]

	<center>Building the channel table</center>		<center>Building the channel table</center><br/><br/>

	The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.		The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.
Line 168:		Line 168:
	[[Image:MCRP_Flow_Table.png]]		[[Image:MCRP_Flow_Table.png]]
	<center>Flow Table: Fc - number of flows on channel c</center>		<center>Flow Table: Fc - number of flows on channel c</center>
			<br/><br/>

	Each node transmits HELLO messages periodically, which contain the node’s channel and its flow state. In this way, all nodes build their own flow table by recording the number of flows on each channel for themselves and their neighbors.		Each node transmits HELLO messages periodically, which contain the node’s channel and its flow state. In this way, all nodes build their own flow table by recording the number of flows on each channel for themselves and their neighbors.
Line 178:		Line 179:

	<center>Node flow tables and building of RREQ flow table</center>		<center>Node flow tables and building of RREQ flow table</center>
			<br/><br/>

	==Channel Selection Algorithm==		==Channel Selection Algorithm==

Kluth: /* MCRP - Route Discovery */

2006-07-23T13:38:58Z

MCRP - Route Discovery

← Older revision		Revision as of 13:38, 23 July 2006
Line 100:		Line 100:
	[[Image:MCRP_Route_Entry.png]]		[[Image:MCRP_Route_Entry.png]]

	<center>Route Entry</center>		<center>A Route Entry</center>
			<br/><br/>

	Finally, upon receiving the RREQ, the destination node picks the channel and route to use for communication and sends a Route Reply (RREP). Intermediate nodes on the path drop RREP packets if a node would have to enter an infeasible state.		Finally, upon receiving the RREQ, the destination node picks the channel and route to use for communication and sends a Route Reply (RREP). Intermediate nodes on the path drop RREP packets if a node would have to enter an infeasible state.

Kluth: /* Channel Selection */

2006-07-23T13:37:45Z

Channel Selection

← Older revision		Revision as of 13:37, 23 July 2006
Line 161:		Line 161:
	[[Image:MCRP_Scenario_4_Channel_Table.png]]		[[Image:MCRP_Scenario_4_Channel_Table.png]]

			<center>Building the channel table</center>

	The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.		The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.
Line 174:		Line 175:

	[[Image:MCRP_Scenario_4_Flow_Table.png]]		[[Image:MCRP_Scenario_4_Flow_Table.png]]

			<center>Node flow tables and building of RREQ flow table</center>

	==Channel Selection Algorithm==		==Channel Selection Algorithm==

Kluth: /* Channel Selection */

2006-07-23T13:35:12Z

Channel Selection

← Older revision		Revision as of 13:35, 23 July 2006
Line 159:		Line 159:
	</dl>		</dl>

			[[Image:MCRP_Scenario_4_Channel_Table.png]]
	Scenario 4


⚫	<center>Flow Table: Fc - number of flows on channel c</center>

	The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.		The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.

			[[Image:MCRP_Flow_Table.png]]
		⚫	<center>Flow Table: Fc - number of flows on channel c</center>

	Each node transmits HELLO messages periodically, which contain the node’s channel and its flow state. In this way, all nodes build their own flow table by recording the number of flows on each channel for themselves and their neighbors.		Each node transmits HELLO messages periodically, which contain the node’s channel and its flow state. In this way, all nodes build their own flow table by recording the number of flows on each channel for themselves and their neighbors.
Line 172:		Line 173:
	If Fc(node) > Fc(rreq) then update Fc(rreq) := Fc(node)		If Fc(node) > Fc(rreq) then update Fc(rreq) := Fc(node)

			[[Image:MCRP_Scenario_4_Flow_Table.png]]
	Scenario 4

	==Channel Selection Algorithm==		==Channel Selection Algorithm==

Kluth: /* Channel Selection */

2006-07-23T13:31:24Z

Channel Selection

← Older revision		Revision as of 13:31, 23 July 2006
Line 142:		Line 142:
	To implement the channel selection, RREQs contain a channel table and a flow table.		To implement the channel selection, RREQs contain a channel table and a flow table.

			[[Image:MCRP_Channel_Table.png]]
	Channel Table ~~(Pic)~~		<center>Channel Table</center>

	As the RREQs are forwarded, each node updates the channel		As the RREQs are forwarded, each node updates the channel
Line 160:		Line 161:
	Scenario 4		Scenario 4


	Flow Table
	Fc - number of flows on channel c		<center>Flow Table: Fc - number of flows on channel c</center>

	The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.		The best channel could be determined by a different metric as well, but in this case the flow table is used to determine the interference level of each channel used in the path. The flow table contains the number of flows on a channel. Each node has its own flow table, and there is another flow table being sent in the RREQs.

Kluth: /* MCRP - Route Discovery */

2006-07-23T13:25:56Z

MCRP - Route Discovery

← Older revision		Revision as of 13:25, 23 July 2006
Line 98:		Line 98:
	operating channel in the forwarded RREQ. The reverse path to source is set up while forwarding RREQs.		operating channel in the forwarded RREQ. The reverse path to source is set up while forwarding RREQs.

			[[Image:MCRP_Route_Entry.png]]
	Route Entry (Pic)

			<center>Route Entry</center>

	Finally, upon receiving the RREQ, the destination node picks the channel and route to use for communication and sends a Route Reply (RREP). Intermediate nodes on the path drop RREP packets if a node would have to enter an infeasible state.		Finally, upon receiving the RREQ, the destination node picks the channel and route to use for communication and sends a Route Reply (RREP). Intermediate nodes on the path drop RREP packets if a node would have to enter an infeasible state.
Line 131:		Line 133:

	Locked nodes are not allowed to change state to avoid two consecutive switching nodes. When “force” is used, at least one flow loses the route. Its source needs to perform route discovery again, but to avoid oscillation of nodes caused by two forced flows, “forced” nodes temporarily do not accept another RREP with force-flag set.		Locked nodes are not allowed to change state to avoid two consecutive switching nodes. When “force” is used, at least one flow loses the route. Its source needs to perform route discovery again, but to avoid oscillation of nodes caused by two forced flows, “forced” nodes temporarily do not accept another RREP with force-flag set.


	Scenario 4

	==Channel Selection==		==Channel Selection==

Kluth: /* Multi-Channel Routing Protocol - MCRP */

2006-07-23T13:02:13Z

Multi-Channel Routing Protocol - MCRP

← Older revision		Revision as of 13:02, 23 July 2006
Line 91:		Line 91:
	</dl>		</dl>

			[[Image:MCRP_Scenario_2b_Node_States.png]]
	Scenario 2b

	==MCRP - Route Discovery==		==MCRP - Route Discovery==

Kluth: /* Constraints */

2006-07-23T12:59:52Z

Constraints

← Older revision		Revision as of 12:59, 23 July 2006
Line 70:		Line 70:
	case two, even though more channels are available. Nodes may		case two, even though more channels are available. Nodes may
	not switch channels too frequently, such as per-packet.		not switch channels too frequently, such as per-packet.

	Scenario 3

	=Multi-Channel Routing Protocol - MCRP=		=Multi-Channel Routing Protocol - MCRP=

Kluth: /* Channel Assignment Approaches */

2006-07-23T12:56:10Z

Channel Assignment Approaches

← Older revision		Revision as of 12:56, 23 July 2006
Line 53:		Line 53:
	and additional intersecting flows would require node-disjoint flows		and additional intersecting flows would require node-disjoint flows
	on different channels to switch to the same channel.		on different channels to switch to the same channel.

			[[Image:MCRP_Scenario_2b.png]]

	Two issues need to be addressed to work around these problems.		Two issues need to be addressed to work around these problems.
	Some specific nodes must be able to switch channels and the		Some specific nodes must be able to switch channels and the
	deafness problem must be avoided.		deafness problem must be avoided.

	Scenario 2a
	Scenario 2b

	==Constraints==		==Constraints==