Aug. 2013 doc.: 15-13-0485-00-0008
Submission HL, ZC, CW, QL, PR @InterDigitalSlide 1
Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs)
Submission Title: [Simulation Results for Final Proposal 15-3-0380]Date Submitted: [Aug 2013]Source: [Hongkun Li, Zhuo Chen, Chonggang Wang, Qing Li, Paul Russell Jr.]Company [InterDigital Communications Corporation]Address [781 Third Avenue, King of Prussia, PA 19406-1409, USA] Voice:[610-878-5695], FAX: [610-878-7885], E-Mail:[[email protected]]Re: [Simulation Results for Final Proposal]
Abstract: [This document presents simulation results on the MAC system design for 802.15.8 (PAC)]
Purpose: [To discuss performance of proposed system design for 802.15.8 (PAC)]
Notice: This document has been prepared to assist the IEEE P802.15. It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein.Release: The contributor acknowledges and accepts that this contribution becomes the property of IEEE and may be made publicly available by P802.15.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 2
Content
1. Performance of Discovery Procedure2. Performance of Peering (Association)
Procedure3. Performance of Data Communication4. References
– All the technique details in this presentation can be found in the final proposal [2]: “IEEE-15-13-0380-02-0008”
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 3
1. Performance of Discovery Procedure
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 4
Terms and Concepts--Discovery• Peer Device (PD): A PAC device • Tx PD: a PD that keeps sending discovery frames (i.e.,
beacon or repeated discovery request) within the proximity to be discovered
• Rx PD: a PD that is configured with a Tx PD, and keeps scanning the discovery frames to discover the desired TxPD.
• To discover: A Rx PD scans discovery frames to find the desired Tx PD.
• To be discovered: A Tx PD sends out discovery frames to be discovered by a Rx PD within the proximity.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 5
Background--Discovery• Discovery Schemes
– Beacon based discovery: • A Tx PD sends beacon at beginning of its application frame to be
discovered.– Discovery request based discovery:
• A Tx PD sends “to be discovered” request once or multiple times after beacon in its application frame.
• Channel Management Scheme– Contend for accessing the common channel (i.e. CCDCH) for channel
allocation request.– Insert application frame at the allocated location within a superframe.
• Topology Generation– Follow the 2-step procedure in the TGD
• Drop Tx PD first, and then randomly drop Rx PDs within 50 meters of each Tx PD.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 6
Simulation Scenarios--Discovery• Scenario 1: “to discover” scenario
1. All Tx PDs are turned on at time 0 and start contention based channel allocation request.
2. Then, all Tx PDs send beacon or “to be discovered” request on the allocated channel.
3. Then, all Rx PDs are randomly turned on.
• Scenario 2: “to be discovered” scenario1. All Rx PDs are turned on at time 0.2. Then, all Tx PDs are randomly turned on from time 0 and start
contention based channel allocation request.3. Then, all Tx PDs send beacon or “to be discovered” request on
the allocated channel.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 7
Simulation Configuration Set 1--Discovery• For the cases of 100, 500, 1000 PDs, there are 5, 10, 20 Tx PDs respectively.
Parameter Value
Slot size 1 ms
CCDCH length 10 ms (10 slots)
Number of Superframes 100
Superframe length 120 ms (120 slots)
Simulation time Number of Superframe * Superframe length * Slot size= 12 seconds
Beacon interval 1 * Superframe length
Application frame length 5 ms (5 slots)
Bandwidth 10 MHz
Channel data rate 3 Mbps
General parameters TGD revision 7 [1]
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 8
Simulation Configuration Set 2--Discovery• For the case of 5000 PDs, there are 50, 100, 200, …,500, 1000 Tx PDs.
Parameter Value
Slot size 1 ms
CCDCH length 20 ms (20 slots)
Number of Superframes 30
Superframe length 320 ms (320 slots)
Simulation time Number of Superframe * Superframe length * Slot size= 9.6 seconds
Beacon interval 1 * Superframe length
Application frame length 5 ms (5 slots)
Bandwidth 10 MHz
General parameters TGD revision 7 [1]
Channel data rate 3 Mbps
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 9
Discovery Performance Metrics• Discovery latency
– “to discover” latency (measured in scenario 1):• This metric is determined from the time that a Rx PD is turned on to the time
that the Rx PD discovers the desired Tx PD.– “to be discovered” latency (measured in scenario 2)
• This metric is determined from the time that a Tx PD is turned on for contention based channel request to the time that the Tx PD is successfully discovered by the first Rx PD.
• Power consumption– “to discover” power consumption (measured in scenario 1):
• This metric is determined as the total power consumed by a Rx PD for listening to the channel and receiving either the beacon or discovery request message to discover a Tx PD.
– ‘to be discovered’ power consumption (measured in scenario 2):• This metric is determined as the total power consumed by a Tx PD
from the time of requesting the channel to the time when all Rx PDs have discovered the Tx PD.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 10
Discovery Performance Metrics (Cont.)
• Rx PD discover ratio:– This metric is determined as the ratio between the
number of Rx PDs that successfully discover the desired Tx PD and the total number of Rx PDs
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 11
“to discover” Latency vs Ratio (Scenario 1)
All Rx PDs discover the desired Tx PDs within 1 superframe after turned on
Discovery Request scheme achieves a shorter latency than the Beacon Based scheme due to:1) Rx PD is randomly
turned on 2) Repeated discovery
requests offers more chances for discovery in the Discovery Request scheme
0 20 40 60 80 100 1200
0.2
0.4
0.6
0.8
1
Latency (ms)
Rx
PD
Dis
cove
r Rat
io
1000 PDs, Beacon interval=Superframe length=120ms
5Tx, Beacon Based10Tx, Beacon Based20Tx, Beacon Based20Tx, Discovery Req10Tx, Discovery Req5Tx, Discovery Req
1 superframe length
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 12
“ to discover” Latency vs Ratio (Scenario 1)
All Rx PD discovers the desired Tx PD within 1 superframe after turned on
0 40 80 120 160 200 240 280 320 3600
0.2
0.4
0.6
0.8
1
Latency (ms)
Rx
PD
Dis
cove
r Rat
io5000 PDs, Beacon interval=Superframe length=320ms
50Tx, Discovery Req100Tx, Discovery Req500Tx, Discovery Req1000Tx, Discovery Req1000Tx, Beacon Based500Tx, Beacon Based100Tx, Beacon Based50Tx, Beacon Based
1 superframe length
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 13
CDF of “to discover” Power Consumption (scenario 1)
0 0.5 1 1.5 2 2.5 30
0.2
0.4
0.6
0.8
1
Power Consumption (mW*s)
CD
F500 PDs, Beacon interval=Superframe length=120ms
5Tx, Discovery Req10Tx, Discovery Req20Tx, Discovery Req20Tx, Beacon Based10Tx, Beacon Based5Tx, Beacon Based
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 14
CDF of “to discover” Power Consumption (Scenario 1)
0 2 4 6 8 100
0.2
0.4
0.6
0.8
1
Power Consumption (mW*s)
CD
F5000 PDs, Beacon interval=Superframe length=320ms
50Tx, Discovery Req100Tx, Discovery Req500Tx, Discovery Req1000Tx, Discovery Req1000Tx, Beacon Based500Tx, Beacon Based100Tx, Beacon Based50Tx, Beacon Based
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 15
Number of Tx PDs vs Average “to discover” Power Consumption (Scenario 1)
5 10 15 201.42
1.43
1.44
1.45
1.46
1.47
1.48
1.49
1.5
Number of Tx PDs
Ave
rage
Pow
er C
onsu
mpt
ion
(mW
*s)
1000PD, Beacon Based1000PD, Discovery Req500PD, Beacon Based500PD, Discovery Req100PD, Beacon Based100PD, Discovery Req
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 16
CDF of “ to be discovered” Latency (Scenario 2)
Over 95% of Tx PD are discovered by all its Rx PDs within 3 Superframes from the starting time.
0 40 80 120 160 200 240 280 320 360 4000
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Latency (ms)
CD
F
1000 PDs, Beacon interval=Superframe length=120ms
5Tx, Beacon Based10Tx, Beacon Based20Tx, Beacon Based20Tx, Discovery Req10Tx, Discovery Req5Tx, Discovery Req
Listening period= 1 superframe
channel allocaiton throughcontention = 1superframe
Common channel atbeginning of a superframe
1 superframe
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 17
CDF of “to be discovered” Power Consumption (Scenario 2)
1000 PDs, Beacon interval=Superframe length=120ms
5 5.5 6 6.5 7 7.50
0.2
0.4
0.6
0.8
1
Power Consumption (mW*s)
CD
F
5Tx, Discovery Req10Tx, Discovery Re20Tx, Discovery Re
5 5.5 6 6.5 7 7.50
0.2
0.4
0.6
0.8
1
Power Consumption (mW*s)
CD
F
5Tx, Beacon Based10Tx, Beacon Based20Tx, Beacon Based
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 18
Number of Tx PDs vs Average “to be discovered” Power Consumption (scenario 2)
5 10 15 205.7
5.8
5.9
6
6.1
6.2
6.3
6.4Beacon interval=Superframe length=120ms
Number of Tx PDs
Ave
rage
Pow
er C
onsu
mpt
ion
(mW
*s)
1000PDs, Discovery Req500PDs, Discovery Req100PDs, Discovery Req1000PDs, Beacon Based500PDs, Beacon Based100PDs, Beacon Based
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 19
Conclusion--Discovery• Discovery Latency
– The ‘to discover’ latency will not exceed 1 Superframe length for all Rx PDs, which is independent of network density.
– The ‘to be discovered’ latency will not exceed 4 Superframes for all TxPDs, which is independent of network density.
– Discovery Request scheme has a shorter latency than Beacon Based scheme.
• Power Consumption– Beacon Based scheme consumes similar amount of power as Discovery
Request scheme.
• Rx PD discover ratio– All Rx PDs are able to discover the desired Tx PD within 1
Superframe, i.e., the discovery ratio is 100%.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 20
2. Performance of Peering/AssociationProcedure
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 21
Terms and Concepts
• Peering Requestor– The PD that initiates the peering (association) process by
sending a peering (association) request message to the Peering Responder.
• Peering Responder– The PD that receives the peering (association) request
message and sends a peering (association) response message to the Peering Requestor.
• CAP (Contention Access Period)– First part of an application frame after application beacon,
i.e., DCDCH.• CFP (Contention Free Period)
– Second part of an application frame after CAP.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 22
Background--Peering (Association) • Peering Schemes
– CAP/CFP-based• Peering Requestors send peering request messages during CAP.• Peering Responder sends response messages during CFP.
– Unicast separate responses to each peering requestor.– Broadcast an aggregated response to all peering requestors.
– CAP-based • Peering Requestors send peering request messages during CAP.• Peering Responder sends response messages during CAP
– Unicast separate responses to each peering requestor.– Broadcast an aggregated response to all peering requestors.
• Channel Access Schemes– Fast Channel Access (FCA):
• A PD contends channel with a priority randomly chosen from [1, #Priority Classes]
• A PD performs backoff for a period randomly chosen from [1,tDCDCH] when it senses channel busy or experiences a transmission failure.
– Slotted CSMA/CA• Initial Backoff (IBF)
– PDs perform an initial backoff before contending for the channel.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 23
Fast Channel Access (FCA)
Peer 1
Peer 2
Peer i
DCDCHSlot1 Slot2 Slot3
ti
Beacon
Inactive
t1Detection
DCDCH available
Peer1 Data Peer1 Data
(Peeri is timed out)
t2
DCDCHbusy
Access DCDCH
inject blocking signal
Start fast DCDCHaccessing
Is the channel occupied?
No
Access the DCDCH with association request
- Wait for tPeeri- Scan DCDCH
Is the channel occupied?
No
Yes
Wait for random (tDCDCH)
time
Yes
Is timed out tEndDCDCH?
Yes
No
Scan DCDCH for tScanDCDCH
Notes Parameters
tScanDCDCH: time window for scanning DCDCHtDCDCHi: initial waiting time before peer i detects the DCDCH againtEndDCDCH: End for current DCDCHtPeeri: Waiting time before detecting the DCDCH again by Peer i of P2PNW based on the priority class
Receive APPframe beacon?
No
Yes
Fast Channel Access for Intra-P2PNW Communications through DCDCH
Priority-based DCDCH Access
tDCDCH
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 24
Aggregated Peering (Association) Response
After received peering (association) request messages from PD A, B and C, responder Peer Z will broadcast a single aggregated peering (association) response message to three PD A, B and C.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 25
Simulation Configuration• Network Configuration
– There are 100 PDs in the network (i.e. 99 Peering Requestors and 1 Peering Responder)– Peering Requestors are randomly placed within 50 meters from the Peering Responder. – All Peering Requestors start peering process at time 0.– The transmission of each peering request or response message can be completed within 1 slot (i.e. 1
ms).• Simulation Scenarios
– Set 1: CAP/CFP-based Peering, FCA priority range [1, 10], slotted CSMA/CA, IBF enabled or disabled.
– Set 2: CAP/CFP-based Peering, various FCA priority range, IBF disabled.– Set 3: CAP/CFP-based & CAP-based Peering, FCA priority range [1, 10], slotted CSMA/CA, IBF
disabled.Parameter ValueSlot size 1 ms
DCDCH (CAP) length 9 ms (9 slots)
CFP length 1 ms (1 slots)
Application frame length 10 ms (10 slots)
Superframe length 100 ms (100 slots)
General parameters TGD revision 7 [1]
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 26
Performance Metrics--Peering (Association)
• Peering overhead: total number of messages (request and response) transmitted by all PDs until all Requestors are peered.
• Peering latency: the time (in Superframes) from all the Requestors start the peering procedure to the time that all Requestors are peered.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 27
Simulation Scenario--Set 1
Scenario Requestmessage on
Responsemessage on
ChannelAccess
PriorityRange
IBF AggregatedResponse
1 CAP CFP FCA [1,10] N Y
2 CAP CFP FCA [1,10] N N
3 CAP CFP FCA [1,10] Y Y
4 CAP CFP FCA [1,10] Y N
5 CAP CFP CSMA N/A N Y
6 CAP CFP CSMA N/A N N
7 CAP CFP CSMA N/A Y Y
8 CAP CFP CSMA N/A Y N
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 28
Simulation Results--Peering Overhead•Scenario 3 achieves the best performance ( i.e. FCA with Initial Backoff and aggregated response)•The use of aggregated scheme reduces peering overhead.•FCA performs better than CSMA.•IBF reduces less overhead for FCA compared with CSMA.
10 50 100 150 200 250 3000
100
200
300
400
500
600
700
800
900
1000
tDCDCH in FCA or Backoff Window in CSMA (slots)
Pee
ring
Ove
rhea
d
Scenario 1: CFP IBF:0 Aggregated:1Scenario 2: CFP IBF:0 Aggregated:0Scenario 3: CFP IBF:1 Aggregated:1Scenario 4: CFP IBF:1 Aggregated:0Scenario 5: CSMA IBF:0 Aggregated:1Scenario 6: CSMA IBF:0 Aggregated:0Scenario 7: CSMA IBF:1 Aggregated:1Scenario 8: CSMA IBF:1 Aggregated:0
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 29
Simulation Results--Peering Latency
•FCA performs better than slotted CSMA/CA.
•IBF decreases the latency for slotted CSMA/CA, but has little impact on FCA.
10 40 70 100 130 160 190 220 250 28020
30
40
50
60
70
80
tDCDCH in FCA or Backoff Window in CSMA (slots)
Late
ncy
(sup
erfra
mes
)
Scenario 1&2: CFP IBF: 0 Aggregated: 0 or 1Scenario 3&4: CFP IBF: 1 Aggregated: 0 or 1Scenario 4&5: CSMA IBF: 0 Aggregated: 0 or 1Scenario 5&6: CSMA IBF: 1 Aggregated: 0 or 1
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 30
Simulation Scenario—Set 2
Scenario Requestmessage on
Responsemessage on
ChannelAccess
PriorityRange
IBF AggregatedResponse
1 CAP CFP FCA [1,10] N Y
2 CAP CFP FCA [1,10] N N
3 CAP CFP FCA [1,20] N Y
4 CAP CFP FCA [1,20] N N
5 CAP CFP FCA [1,50] N Y
6 CAP CFP FCA [1,50] N N
7 CAP CFP FCA [1,99] N Y
8 CAP CFP FCA [1,99] N N
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 31
Simulation Results--Peering Overhead•Scenario 7 provides the best performance due to highest priority classes and aggregated response.
•The use of the aggregated scheme reduces peering overhead.
•Increasing number of priority classes reduces the peering overhead.
50 100 150 200 250 30010100
150
200
250
300
350
400
450
500
550
600
tDCDCH(slots)
Pee
ring
Ove
rhea
d
Scenario 1: Prioirty Range:[1,10] Aggregated:1Scenario 2: Prioirty Range:[1,10] Aggregated:0Scenario 3: Prioirty Range:[1,20] Aggregated:1Scenario 4: Prioirty Range:[1,20] Aggregated:0Scenario 5: Prioirty Range:[1,50] Aggregated:1Scenario 6: Prioirty Range:[1,50] Aggregated:0Scenario 7: Prioirty Range:[1,99] Aggregated:1Scenario 8: Prioirty Range:[1,99] Aggregated:0
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 32
Simulation Results--Peering Latency•Scenarios 7&8 achieve the best performance due to highest priority classes.
•Increasing number of priority classes reduces the minimum peering latency of FCA.
•When tDCDCH becomes large, it dominates the peering latency over the other factors, such as priority class.
50 100 150 200 250 3001020
30
40
50
60
70
80
tDCDCH(slots)
Late
ncy
(sup
erfra
mes
)
Scenario 1&2: Prioirty Range:[1,10] Aggregated:1 or 0Scenario 3&4: Prioirty Range:[1,20] Aggregated:1 or 0Scenario 5&6: Prioirty Range:[1,50] Aggregated:1 or 0Scenario 7&8: Prioirty Range:[1,99] Aggregated:1 or 0
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 33
Simulation Scenarios--Set 3
Scenario Requestmessage on
Responsemessage on
ChannelAccess
PriorityRange
IBF AggregatedResponse
1 CAP CFP FCA [1,10] N Y2 CAP CFP FCA [1,10] N N3 CAP CFP CSMA N/A N Y4 CAP CFP CSMA N/A N N5 CAP CAP CSMA N/A N Y6 CAP CAP CSMA N/A N N
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 34
Simulation Results – Peering Overhead•Scenario 5 provides the best performance ( i.e. CAP/CFP based scheme with FCA and aggregated response).
•CAP/CFP-based peering scheme performs better than CAP only peering scheme.
•The use of aggregated scheme reduces the peering overhead for all schemes.
10 50 100 150 200 250 3000
100
200
300
400
500
600
700
800
900
1000
tDCDCH in FCA or Backoff Window in CSMA (slots)
Pee
ring
Ove
rhea
d
Scenario 1: CFP FCA Aggregated:1Scenario 2: CFP FCA Aggregated:0Scenario 3: CFP CSMA Aggregated:1Scenario 4: CFP CSMA Aggregated:0Scenario 5: CAP CSMA Aggregated:1Scenario 6: CAP CSMA Aggregated:0
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 35
Simulation Results--Peering Latency•Scenario 5&6 achieve the best performance ( i.e. CAP/CFP-based scheme with FCA).
•CAP/CFP-based peering scheme performs better than CAP only peering scheme.
•The use of aggregated scheme reduces the peering latency for CAP-based scheme.
10 50 100 150 200 250 30020
30
40
50
60
70
80
90
100
tDCDCH in FCA or Backoff Window in CSMA (slots)
Late
ncy
(sup
erfra
me)
Scenario 1&2: CFP FCA Aggregated:1 or 0Scenario 3&4: CFP CSMA Aggregated:1 or 0Scenario 5: CAP CSMA Aggregated:1Scenario 6: CAP CSMA Aggregated:0
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 36
Conclusions
• Aggregated peering response scheme reduces the peering overhead for both slotted CSMA/CA and FCA.
• CAP/CFP-based peering scheme performs better than CAP only peering scheme.
• Fast Channel Accessing (FCA) performs better than slotted CSMA/CA.
• Initial Backoff (IBF) reduces the peering overhead more for slotted CSMA/CA than FCA.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 37
3. Performance of Data Communication
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 38
Terms and Concepts
• Tx PD: a PD that generates data packet and sends to the peered Rx PD.
• Rx PD: a PD that receives the data packet from its peered Tx PD.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 39
Background• Data transmission is contention free within each application
frame.
CCDCH(1st i slots)
App1DCDCH
(1st i1 slots)
App2DCDCH
(1st i2 slots)
App Frame 1
App3DCDCH
(1st i3 slots)
App Frame 2 App Frame 1 App Frame 2App Frame3
Superframe1
Superframe Beacon 1
App Beacon2(App2)
App Beacon3(App3)
App Beacon2(App2)
App Beacon3(App3)
Superframe2
App Beacon1(App1)
Superframe Beacon 2
App Beacon1(App1)
Common Period
Application Period
Common Period
Application Period
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 40
Simulation Configuration--Data Communication
Parameter Value
Slot size 1 msCCDCH length 20 ms (10ms for number of Tx PD < 50)Application frame length 1 Beacon + 1 MPDUNumber of application frames in a superframe
30 (10 for number of Tx PD < 50)
Superframe length (Number of application frames in a superframe * Application frame length) + CCDCH length
Beacon interval 1 superframe length Bandwidth 10 MHzChannel data rate 9 Mbps (QPSK, 3/4)General parameters TGD revision 7 [1]Traffic model Full buffer & Poisson arrival
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 41
Performance Metrics• Area sum goodput: Mbps/km2
• Jain’s fairness index• MAC-to-MAC latency (only for Poisson arrival)
– From the time instant that the MAC at Tx PD decides to transmit a packet to the time instant that the Rx PD successfully receives the packet at MAC.
• Data packet reception efficiency (ratio)– The total number of successfully received packet to the total
number of transmitted packet including retransmission procedure.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 42
Area Sum Goodput (1)
5 10 15 200
2
4
6
8
10
12
Number of Tx
Aer
a su
m g
oodp
ut (M
ps/k
m2 )
MPDU size=512 bytes, Superframe length=30ms
Poisson, IAT=100msPoisson, IAT=10msPoisson, IAT=1msFull Buffer
IAT: inter-arrival time
Poisson arrival process has the same performance as the Full Buffer model on the long term, if the IAT is smaller than Superframe length.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 43
Area Sum Goodput (2)
50 100 150 200 250 300 350 400 450 500 5500
20
40
60
80
100
120
Number of Tx
Aer
a su
m g
oodp
ut (M
ps/k
m2 )
Superframe length=80ms, MPDU size=512 bytes
Poission Arrival, IAT=100msPoission Arrival, IAT=10msFull Buffer
Poisson arrival process has the same performance as the Full Buffer model on the long term, if the IAT is smaller than Superframe length.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 44
MAC-to-MAC latency (1)
The MAC-to-MAC latency of a data packet is bounded by Superframelength.
0 5 10 15 20 25 30 350
0.2
0.4
0.6
0.8
1
Latency (ms)
CD
F
Poisson arrival, MPDU size=512 bytes, superframe length=30ms
5Tx, IAT=100ms10Tx, IAT=100ms20Tx, IAT=100ms20Tx, IAT=10ms10Tx, IAT=10ms5Tx, IAT=10ms
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 45
MAC-to-MAC latency (2)
The MAC-to-MAC latency of a data packet is bounded by Superframe length.
0 10 20 30 40 50 60 70 80 900
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Latency (ms)
CD
F
Poisson Arrival, MPDU size=512 bytes, superframe length=80ms
50Tx, IAT=100ms100Tx, IAT=100ms200Tx, IAT=100ms400Tx, IAT=100ms512Tx, IAT=100ms50Tx, IAT=10ms100Tx, IAT=10ms200Tx, IAT=10ms400Tx, IAT=10ms512Tx, IAT=10ms
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 46
Fairness and Efficiency
• Jain’s fairness index is always close to 1 due to:– All Tx PDs have equal opportunity to send data within a
superframe through the CFP of their application frames.
• Data packet reception efficiency (ratio) is always 1 due to:• Packet error rate is 0 with channel model (i.e., path loss within 50
meters) and MCS (QPSK and ¾ coding rate).• Data is transmitted over CFP within each application frame.
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 47
Conclusion
• MAC-to-MAC latency is bounded by the Superframelength due to the contention free data transmission.
• Each Tx PD achieves almost the same throughput ( i.e., the fairness index is close to 1).
Submission HL, ZC, CW, QL, PR @InterDigital
Aug. 2013 doc.: 15-13-0485-00-0008
Slide 48
References
• [1] IEEE 802.15.8 Technical Guidance Document• [2] Interdigital’s final proposal: IEEE-15-13-0380-
02-0008
Aug. 2013 doc.: 15-13-0485-00-0008
Submission HL, ZC, CW, QL, PR @InterDigitalSlide 49
Thank You!
Any Questions? [email protected]