DAP-MAC - Revision history

Hanyu: /* Overview */

2015-02-16T20:11:57Z

Overview

← Older revision		Revision as of 20:11, 16 February 2015
Line 6:		Line 6:
	The main features of DAP-MAC are summarized below.		The main features of DAP-MAC are summarized below.

-	*'''Concurrent Transmissions.''' The unique channel access compatibility relation, characterized by the distance difference between senders and their common intended receiver, is utilized to achieve ~~transmission pipelining (i.e.~~ concurrent transmissions) and to improve the channel utilization significantly.	+	*'''Concurrent Transmissions.''' The unique channel access compatibility relation, characterized by the distance difference between senders and their common intended receiver, is utilized to achieve concurrent transmissions and to improve the channel utilization significantly.

	*'''Stochastic Transmission Strategy.''' The optimal stochastic transmission strategy eliminates the usage of inefficient handshaking, which is yielded by a utility-optimization framework maximizing the network throughput and maintaining minimal packet collisions.		*'''Stochastic Transmission Strategy.''' The optimal stochastic transmission strategy eliminates the usage of inefficient handshaking, which is yielded by a utility-optimization framework maximizing the network throughput and maintaining minimal packet collisions.

Hanyu: /* Overview */

2015-02-16T20:11:32Z

Overview

← Older revision		Revision as of 20:11, 16 February 2015
Line 6:		Line 6:
	The main features of DAP-MAC are summarized below.		The main features of DAP-MAC are summarized below.

-	*'''~~Transmission Pipelining~~.''' The unique channel access compatibility relation, characterized by the distance difference between senders and their common intended receiver, is utilized to achieve transmission pipelining (i.e. concurrent transmissions) and to improve the channel utilization significantly.	+	*'''Concurrent Transmissions.''' The unique channel access compatibility relation, characterized by the distance difference between senders and their common intended receiver, is utilized to achieve transmission pipelining (i.e. concurrent transmissions) and to improve the channel utilization significantly.

	*'''Stochastic Transmission Strategy.''' The optimal stochastic transmission strategy eliminates the usage of inefficient handshaking, which is yielded by a utility-optimization framework maximizing the network throughput and maintaining minimal packet collisions.		*'''Stochastic Transmission Strategy.''' The optimal stochastic transmission strategy eliminates the usage of inefficient handshaking, which is yielded by a utility-optimization framework maximizing the network throughput and maintaining minimal packet collisions.

Hanyu: /* Motivation */

2015-01-28T21:24:47Z

Motivation

← Older revision		Revision as of 21:24, 28 January 2015
Line 20:		Line 20:
	We focus on leveraging the long propagation delay of underwater acoustic communications rather than being constrained by it in networking design. The non-neglectable propagation delay makes certain strict requirements in RF-based wireless networks unnecessary for underwater acoustic networks, such as the exclusive channel access.		We focus on leveraging the long propagation delay of underwater acoustic communications rather than being constrained by it in networking design. The non-neglectable propagation delay makes certain strict requirements in RF-based wireless networks unnecessary for underwater acoustic networks, such as the exclusive channel access.

-	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if ~~the following inequality~~ is satisfied.	+	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if certain condition is satisfied.

	= Design =		= Design =

Hanyu: /* Design */

2015-01-28T21:24:08Z

Design

← Older revision		Revision as of 21:24, 28 January 2015
Line 23:		Line 23:

	= Design =		= Design =
-
-	~~== The Utility-Optimization Framework ==~~
-
-
-	~~== The Optimal Channel Access Probabilities ==~~

	= Simulation Tools =		= Simulation Tools =
	The simulation tool of DAP-MAC is fully developed on the widely used network simulator OMNeT++, using [http://www.omnetpp.org OMNet++-4.3] with [http://inet.omnetpp.org INET-1.99.4] extension. The DAP-MAC package will be provided upon release (coming soon).		The simulation tool of DAP-MAC is fully developed on the widely used network simulator OMNeT++, using [http://www.omnetpp.org OMNet++-4.3] with [http://inet.omnetpp.org INET-1.99.4] extension. The DAP-MAC package will be provided upon release (coming soon).

Hanyu: /* The Optimal Access Probabilities and Throughput */

2015-01-28T21:22:18Z

The Optimal Access Probabilities and Throughput

← Older revision		Revision as of 21:22, 28 January 2015
Line 27:		Line 27:


-	== The Optimal Access Probabilities ~~and Throughput~~ ==	+	== The Optimal Channel Access Probabilities ==

	= Simulation Tools =		= Simulation Tools =
	The simulation tool of DAP-MAC is fully developed on the widely used network simulator OMNeT++, using [http://www.omnetpp.org OMNet++-4.3] with [http://inet.omnetpp.org INET-1.99.4] extension. The DAP-MAC package will be provided upon release (coming soon).		The simulation tool of DAP-MAC is fully developed on the widely used network simulator OMNeT++, using [http://www.omnetpp.org OMNet++-4.3] with [http://inet.omnetpp.org INET-1.99.4] extension. The DAP-MAC package will be provided upon release (coming soon).

Hanyu: /* Design */

2015-01-28T21:21:59Z

Design

← Older revision		Revision as of 21:21, 28 January 2015
Line 23:		Line 23:

	= Design =		= Design =
		+
		+	== The Utility-Optimization Framework ==
		+
		+
		+	== The Optimal Access Probabilities and Throughput ==

	= Simulation Tools =		= Simulation Tools =
	The simulation tool of DAP-MAC is fully developed on the widely used network simulator OMNeT++, using [http://www.omnetpp.org OMNet++-4.3] with [http://inet.omnetpp.org INET-1.99.4] extension. The DAP-MAC package will be provided upon release (coming soon).		The simulation tool of DAP-MAC is fully developed on the widely used network simulator OMNeT++, using [http://www.omnetpp.org OMNet++-4.3] with [http://inet.omnetpp.org INET-1.99.4] extension. The DAP-MAC package will be provided upon release (coming soon).

Hanyu: /* Motivation */

2015-01-28T21:20:40Z

Motivation

← Older revision		Revision as of 21:20, 28 January 2015
Line 20:		Line 20:
	We focus on leveraging the long propagation delay of underwater acoustic communications rather than being constrained by it in networking design. The non-neglectable propagation delay makes certain strict requirements in RF-based wireless networks unnecessary for underwater acoustic networks, such as the exclusive channel access.		We focus on leveraging the long propagation delay of underwater acoustic communications rather than being constrained by it in networking design. The non-neglectable propagation delay makes certain strict requirements in RF-based wireless networks unnecessary for underwater acoustic networks, such as the exclusive channel access.

-	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:	+	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied.
-		+
-	~~<math>~~	+
-	~~a+b~~	+
-	~~</math>~~	+

	= Design =		= Design =

Hanyu: /* Motivation */

2015-01-28T21:20:23Z

Motivation

← Older revision		Revision as of 21:20, 28 January 2015
Line 22:		Line 22:
	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:		In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:

-	<math>a+b</math>	+	<math>
		+	a+b
		+	</math>

	= Design =		= Design =

Hanyu: /* Motivation */

2015-01-28T21:17:41Z

Motivation

← Older revision		Revision as of 21:17, 28 January 2015
Line 21:		Line 21:

	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:		In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:
-	<math>	+
-	a+b	+	<math>a+b</math>
-	</math>	+

	= Design =		= Design =

Hanyu: /* Motivation */

2015-01-28T21:17:24Z

Motivation

← Older revision		Revision as of 21:17, 28 January 2015
Line 21:		Line 21:

	In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:		In UWSNs, packets sent concurrently by different senders may arrive at their intended receiver at different times and can be decoded separately. The figure on the right shows an example where nodes A and B are sending packets to node C at the beginning of a slot in a time-slotted system. The two packets can arrive at C apart without collision, if the following inequality is satisfied:
-	<math>	+	<math>
-	~~Q(s,~~a~~)\leftarrow(1-\alpha)Q(s,a)~~+,	+	a+b
-	</math>	+	</math>

	= Design =		= Design =