CDMA S_ALOHA ????? ?? ?? ?? ?? ?? ?? - ????????? - ?????? : ???? ?? - DBpia
&Caps Lock? ?? ????.&&????? ??????.&
????????? ?28? 7A?,
5-492 (8 pages)
?????? ??????, ?? ? ??? ? ????.
This paper propose a transmission probability control scheme for guaranteeing fair packet transmissions in CDMA slotted ALOHA system. In CDMA slotted ALOHA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are caused entirely by multiple access interference. Therefore, in order to maximize the system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability of mobile stations in the next slot according to the offered load and then broadcasts this probability to all the mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and average delay than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.
?? ??? ???? ??? ????.
??? ?? (0)
????? ????
?? ??? ??? ?? ??? ????.
Cited by linking (CrossRef)
? 1 ??? ?? ?? (37)
??? ????? ??? ???.
???, ????????, ??????????? 20(5), 6
???, ????????, ??????????? 19(4), 2
???, ????????, ??????????? 17(11), -2574
???, ????????, ??????????? 13(3), 4
???, ????????, ??????????? 12(9), -1574
???, ???, ???, ???????, ??????? ??????? 34(1D), 2
???, ????????, ??????????? 11(2), 2
???, ???, ????????, ??????????? 10(5), 1
???, ???, ????????, ??????????? 10(4), 4
???, ???, ????????, ??????????? 10(3), 6
?? ? ?? ?? (15)
? ????? ??? ???.
??, ???, ???, ???, ???, ?????????,
???, ???, ???, ???, ?????????,
???, ???, ???, ?????????,
???, ???, ???, ???, ?????????,
???, ???, ?????????,
???, ???, ?????????,
???, ?????????,
???, ?????????,
???, ???, ?????????,
???, ?????????,
DBpia ????? ?? ???? ??? ?????. ?? ??? ??????? ?? ? ?? ?? ??? ?? ??? ??? ????? ??????.
DBpia ????
? ??? ???!
Intaek Lim, ????????, Journal of information and communication convergence engineering 9(1),
Intaek Lim, ????????, Journal of information and communication convergence engineering 8(6), 4
Nor Diana Yaakob, Tanabe Hidehiko, Umeda Hiroyuki, ???????, ??????? ??????? ,
???, ???, ???, ??????, ?????? ??????? , 0
Tae Joong Kim, Seung Chan Bang, Young Nam Han, ???????, ??????? ???? ??? 3,
?? ???? ??
?? ??? ?? ???? ?? ??? ????.
0%20%40%60%80%100%
??????? ???? ?? ???? ???? ?????? ???, ?????? ? ???? ??? ????? ??? ?? ????.&?, ??????? ???? ????? ????? ?? ??? ?? ????, ?? ?? ?? ??? ?? ????? ????? ?? ??? ?? ??, ?? ??, ???? ?? ???, ?? ??? ??, ???? ? ????? ?? ?, ???? ??? ? ? ????.
??? ??? ???? ? ??? ???. (?? ?? ?? ??)
?? ??? ???
hanmail.net
hanmir.net
lycos.co.kr
yahoo.co.kr
???? ?? ??
(1) ???? ?? · ??? ?? ??
- ?? ?? : ??, ??/??, ??, ??? ??
- ?? ?? : ?? ?? ??? ?? ??, ?? ?? ??
- ?? ? ?? ?? : ?? ?? ?? ? 1?
※ DBpia? ???? ??? ???? ????? ?????.
(2) ???? ?3? ??? ?? ??
?? ?? : ??, ??/??, ??, ??? ??
???? ???? ?? ?? : ?? ?? ??? ?? ??, ?? ?? ??
???? ???? ?? ? ?? ?? : ?? ?? ?? ? 1?
(3) ? ?? ??? DBpia? ????????? ?????.
???? ?? · ??? ?????.
???? ?3? ???
?????. ?? ??? ???????.
?? ???? ????? ?????.
?? ?? ??? ?? ? ???? ??? ????? ??? ??, DBpia ????? ??? ???. ( / 02-707-0496)
??????&????: ??? &???????: 116-81-67057& ?????????: ?2011-?????-0376?
????: 02-707-0496 &??: 02-717-4305& ????: dbpia@nurimedia.co.kr
??: (07281) ????? ???? ??? 63, 4? (??? 6?)
Copyright(C) NURIMEDIA. ALL RIGHTS RESERVED.
??? ???? ????? DBpia!
???? ???? ? ? ??? ??? ?? ???? ? ????.
???? ????:
‘????’? ????? ???? ???? ??? ?????.?? ?? ? ???? ?? ????? ?????.
????? '?? ??' ???. ?? ???? ? ??? ?? ??? ???? ????.
&{0} ???? ???? ????.
?? ?? ???? ?? ???, ????(QuckView)? ???? ? ????.
?????? ? ??? ??? ???? ???? ????? ‘?? ?? ??’? ????.
??? ????? ?? ?? ???? ? ????.
DBpia? ????? ?? ??? ?? ??? ??????, ??? ?? ? ??? ??? ???? ? ????. ?????? ?????, ?? ??? ??? ???.
* ?????? ????? ????? ???? ? ????.
??? ?? ????? ?? ?? ???? ? ????. ??? ?????????
?? ?? ???? ?? ???, ????(QuckView)? ???? ? ????.
???? '???? ???'? ?????, ???? ?? ??? ???? ? ????.
??? ????? ?? ?? ???? ? ????.
?? ?? ???? ?? ???, ????(QuckView)? ???? ? ????.
??? ????? ?? ?? ???? ? ????.
DBpia? ????? ?? ??? ?? ??? ??????, ??? ?? ? ??? ??? ???? ? ????. ?????? ?????, ?? ??? ??? ???.
* ?????? ????? ????? ???? ? ????.
'?????’? DBpia ????? ??? ? ?? ?????.
DBpia ?????? ???? ??? ??? ??? ? ????.
& - ?? PDF ?? ???? ?, ??? ??? ?? ?? ?? ??
& - ??? ???? ?? ?? ?? ??
& - ???? ??? ???? ???? ??? ??
& - ???, ???? ?? ????? ??
DBpia ????? ??? ??, ???? ???? ? ???,
???/?? ???? ???? ?? ? ????? ? ????.>> slotaloha.c
slotaloha.c ( 文件浏览 )
Sample simulation program:
ALOHA protocol, with a &p-persistent&
feature added.
There are NNodes network nodes which transmit on the same channel.
Time is slotted, i.e. transmission can begin only at integer times.
If more than one station attempts transmission during a given slot,
they will &collide,& corrupting each others' messages, and they
must try again.
To avoid repeated collisions, a station which has
a frame to be transmitted will do so only with probability P.
interface hardware generates a random number between 0 and 1, and
transmits only if the number is less than P; otherwise it waits
until the next slot and repeats the process.
We say a station is ACTIVE if it h otherwise
it is IDLE.
An IDLE station will become active in any given slot
with probability NewMsgProb.
We are interested in the long-run average message delay.
approximation to &long-run& will be 10,000 time slots. */
#include &stdlib.h&
/* needed for RAND_MAX */
#define IDLE 0
#define ACTIVE 1
#define NSLOTS 10000
#define MAXNODES 100
int NNodes, /* number of nodes in the network */
State[MAXNODES], /* current node states, IDLE or ACTIVE */
Delay[MAXNODES], /* delays so far to message, if any, at each node */
NMsg, /* number of successfully transmitted messages so far */
SumD /* overall total delays accumulated so far */
float P, /* probability that an ACTIVE node will send */
NewMsgP /* probability that an IDLE node will become ACTIVE */
/* the function Rnd(Prob) simulates a random event of probability
Prob, with the return value 1 meaning the event occurred and 0
meaning that it did not occur */
int Rnd(Prob)
return((rand() & Prob * RAND_MAX));
Init(argc,argv)
55 char **
sscanf(argv[1],&%f&,&NewMsgProb);
sscanf(argv[2],&%f&,&P);
sscanf(argv[3],&%d&,&NNodes);
SumDelay = 0;
for (Node = 0; Node & NN Node++)
State[Node] = IDLE;
main(argc,argv)
71 char **
int Slot,NTry,Node,TryN
Init(argc,argv);
/* simulate the system for NSLOTS time periods */
for (Slot = 0; Slot & NSLOTS; Slot++)
/* for each node, check whether it has changed from IDLE to
ACTIVE, and if ACTIVE (from just now or beforehand) check
whether it will attempt to transmit */
for (Node = 0; Node & NN Node++)
if (State[Node] == IDLE && Rnd(NewMsgProb))
State[Node] = ACTIVE;
Delay[Node] = 0;
if (State[Node] == ACTIVE)
Delay[Node]++;
/* decide whether to transmit */
if (Rnd(P))
TryNode = N
/* a successful transmission will occur if exactly one node
attempted transmission */
if (NTry == 1)
SumDelay += Delay[TryNode];
State[TryNode] = IDLE;
if (NMsg & 0)
printf(&long-run average delay = %f\n&,SumDelay/((float) NMsg));
printf(&NMsg = 0\n&);
展开＞ ＜收缩
下载源码到电脑，阅读使用更方便
还剩0行未阅读，继续阅读 ▼
Sponsored links
源码文件列表
温馨提示： 点击源码文件名可预览文件内容哦 ^_^
4.01 kB 06:12
Sponsored links
评价成功，多谢！
下载slotaloha.c.tar.gz
CodeForge积分（原CF币）全新升级，功能更强大，使用更便捷，不仅可以用来下载海量源代码马上还可兑换精美小礼品了
您的积分不足
支付宝优惠套餐快速获取 30 积分
10积分 / ￥100
30积分 / ￥200原价 ￥300 元
100积分 / ￥500原价 ￥1000 元
订单支付完成后，积分将自动加入到您的账号。以下是优惠期的人民币价格，优惠期过后将恢复美元价格。
支付宝支付宝付款
微信钱包微信付款
更多付款方式：、
您本次下载所消耗的积分将转交上传作者。
同一源码，30天内重复下载，只扣除一次积分。
鲁ICP备号-3 runtime:Elapsed:26.094ms 5.8
登录 CodeForge
还没有CodeForge账号？
Switch to the English version?
^_^"呃 ...
Sorry!这位大神很神秘，未开通博客呢，请浏览一下其他的吧Alohaa Living Bar电话,地址,价格,营业时间(图)-伊瓜苏市-大众点评网
华东地区：
中部西部：
华南地区：
国外热门：
Alohaa Living Bar
该商户还没有点评
已经到店消费过？来写第一封点评吧！
&2003-, All Rights Reserved.　　本站发布的所有内容，未经许可，不得转载，详见。