| 查看: 3689 | 回复: 21 | |||
ssjcumt新虫 (小有名气)
|
[交流]
IEEE Comm. letter, rejected & resubmission allowed,修改稿可超四页吗？
|
||
|
按照审稿人要求感觉肯定四页不够用，修改稿可以超过四页吗？ 如果改投，这种四五页的短文还有哪些杂志可以接收？请大神帮着推荐几家。 另外，这种 rejected & resubmissin有多大希望呢？ 三个审稿人，一个意见是“the performance of the proposed protocol has to be compared with a benchmark scheme where the 。。。。。”，但是这个review要求进行对比的这个benchmark和我的虽然有点类似，但是其实没有什么可比性。 另外一个说我的其中一个参数假设的太理想化了，不太合理（其实我另外一篇也是这个假设，审稿人也没说什么），也提到了要我跟别人的方案去比较。 第三个审稿人意见特别多，写了两页，其他的问题都好回答，就其中一条比较难对付，是说我的为什么要这么做？方案为什么这么设计。其实没有办法证明这个方案最优，因为我是首先在这种实际环境下提方案的。 “研究有没有意义”这种问题，考虑角度不同，结论也不同。 请问大家，我这种情况，还有修改的价值么？感觉审稿人对我的研究领域还挺熟悉。像“the assumption seems too ideal.”，“the usefulness of the proposed protocol”这样的问题，应该从哪儿入手呢？ 编辑来信如下： Dear Author(s): The review of the referenced manuscript, CL2015-2411, is now complete. I regret to inform you that based on the enclosed reviews and my own reading of your manuscript, I am unable to recommend its publication in IEEE Communications Letters. You may revise and resubmit your manuscript to IEEE Communications Letters. When you do so, please include a cover letter that indicates the new submission is a revision of an earlier manuscript and the reference number of that prior manuscript. Also include as a supporting document a point-by-point response to the comments of the reviewers and the editor. The responses to comments file must be uploaded in PDF format in the same section in your submission as the body of your paper in ScholarOne Manuscripts, and not under the cover letter. Please also be aware that ALL submissions to IEEE Communications letters must complete the Electronic Copyright Process. If you decide to resubmit your manuscript you should complete the resubmission through the Manuscript Central. Click on "Manuscripts with Decisions" under My Manuscripts on the left side of your Author Dashboard and then click on "Create a Resubmission" under the Actions Column next to your manuscript. Your resubmission will be due within 75 days and is due on 10-Feb-2016. Please ensure that your revision is submitted in a timely manner as the web-based system will not allow a revision to enter the system after 75 days have elapsed. Please be aware that the time at which your revision permission will expire is 11:59 PM EST on the 75th day. Note, that according to the IEEE COMML policy, the maximum number of permitted resubmissions after a Reject-Resubmission Allowed decision is one (1) and the maximum number of permitted Minor Revisions is (2). Additional comments include: I have been able to obtain 3 reviews for this manuscript. Although the reviewers agree that this is an interesting work, they nevertheless provide comments for improving the manuscript and pinpoint some issues that need to be addressed. Addressing the reviewers\' comments requires a major revision of the manuscript. For the potential resubmission, please provide point-to-point responses to all of the reviewers\' concerns, and modify the paper where necessary. The reviewers\' comments are found at the end of this email. Thank you for submitting your work to the IEEE Communications Letters. Regards, Nikola Zlatanov Editor IEEE Communications Letters Reviewer: 1 Comments to the Author This paper investigates the performance analysis of a practical tow-way protocol which takes a joint consideration of the finite relay buffer, signalling overhead and lossy link. The basis of analysis is a Markov chain model of the proposed protocol. The paper is well-written and the analyses sound. The proposed protocol is very simple (which is good in part) and has to be compared with the best benchmark schemes in the literature. The author claim that the quality of the links are taken into account but it seems that the resulting contribution is very narrow in the proposed protocol. In fact, from Fig. 2, the relay always transmits if he has something in both queues. That is why the states (l,k) where both l and k are bigger than one do not exist. Therefore, the performance of the proposed protocol has to be compared with a benchmark scheme where the users and the relay are selected for transmission based on the qualities of the links (all states (l,k) are then present). It seems that reference [8] has already investigated this case for the ideal scenario where the signaling overhead is not taken into account. This protocol can serve at least as an upper bound. Reviewer: 2 Comments to the Author This paper considers a practical two-way relay protocol and proposes a Markov chain model to analyze this protocol. The closed form expressions for the throughput and delay are derived. I have the following comments. 1. In Section II-A, the authors propose a practical BNC protocol. However, it seems to me that it is just a threshold-based scheduling policy, where the threshold is 1 packet. The process of this protocol, e.g., waiting time slots, ACK/NACKs, is only an implementation of the threshold-based policy. Moreover, why the threshold is chosen to be 1 packet? Intuitively, the threshold should be chosen based on the link quality statistics, i.e., the successful packet rate in this manuscript. In addition, the Markov chain model and the analysis in the following sections highly depend on the protocol with this particular threshold. Therefore, the usefulness of the proposed protocol and the analysis in this manuscript appears to be questionable. 2. The authors state that they consider overflow probabilities in the abstract, the last paragraph in Section III, and the conclusion. However, throughout this manuscript, I cannot find any discussion or analysis about buffer overflow, which is an important issue in finite buffer systems. Actually, from the transition probability in Eq. (2), we can see that the impact of buffer overflow is ignored。 3. According the BNC protocol and the Markov chain in Fig. 2, there are only 2(L+K) states. However, in Eq. (5), (7), and Eq. (8), it appears to me that the authors consider (L+1)×(K +1) states. Please clarify it. 4.这一条是要我证明一个公式。很容易就证明了。 5. Minor comments: 1) In the introduction, the definition of BNC and the difference between BNC and PNC are not clearly illustrated. 2) In Section II-A, the authors consider packet transmission, however, using the XOR operation in bit layer, i.e., BNC. Please clarify this confusion. 3) In Page 6/11, Line 14, what is the meaning of traditional scheduling? 4) In Section II-B, what is the duration of a time slot? Do you consider a slotted system? This should be introduced in Section II-A. 5) In Fig. 2, the two rightmost states in the first and second lines should be (0,K) and (1, K). 6) In Page 7/11, Line 34, the definitions of SiU and SiR can hardly be understood. 7) In Eq. (4), what are the state spaces of i and j? 8) In Page 7/11, Line 48, please specify the location of the method in [10]. 9) In Page 8/11, Line 18, the definition of the throughput is missing. 10) In Page 8/11, Line 18 and Line 24, what are the meanings of the duration of each packet and the average duration of one packet? 11) Section III is not well organized. I suggest the authors to summarize the results for the symmetric case in a lemma. 12) In Eq. (18), what is the summation taken over? Reviewer: 3 Comments to the Author This paper studied two-way relay channel with finite relay buffer using Markov model. However, the following questions should be carefully revised. First, a lot of works investigated the buffering with network coding by using Markov method. So the differences of the work compared with existing ones should be clearly summarized in order to outline the contribution of the paper. Second, it is assumed that A and B has infinite buffer and always has data to be transmitted. Compared with some existing works, where the sources were assumed with finite buffer or with some stochastic data arriving, the assumption in this paper seems too ideal. Thirdly, more simulation results on comparison with other protocols with network coding and buffering should be provided. Fourthly, the protocol in this paper should be described more clearly. For example, the description of “In contrast to the traditional scheduling, the scheduling messages in this protocol are replaced by the waiting timeslot, and the ACK/NACKs from R to A and B are piggybacked by the next packets. These can save a considerable signaling overhead (the preamble).” is not clear enough. |
回复此楼» 猜你喜欢
调剂
已经有6人回复
-
348分环境工程·调剂
已经有7人回复
-
0835学硕299求调剂 08大类可接受
已经有3人回复
-
357求调剂
已经有10人回复
-
材料334求调剂
已经有7人回复
-
286求调剂
已经有8人回复
-
353求调剂
已经有3人回复
-
288求调剂 一志愿哈工大 材料与化工
已经有6人回复
-
297求调剂
已经有7人回复
-
材料295
已经有9人回复
» 本主题相关价值贴推荐，对您同样有帮助:
- IEEE Comm. letter, rejected & resubmission allowed, 请教修改稿上传形式？
已经有4人回复
- IEEE (COMM. Lett.)投稿经验
已经有24人回复
- Awaiting Reviewer Selection两周了能不能联系一下editor
已经有4人回复
- 我很囧~ 之千万别学我(5), 当 reviewer 的心路历程 (中级学者必看心得)— 自我行销篇
已经有41人回复
- Ieee wireless communications letters 是SCI 么
已经有2人回复
- 经验分享,IEEE Trans On CAS PAR II.
已经有11人回复
- 中国计算机学会推荐国际学术刊物与会议网络与信息安全
已经有0人回复
- IEEE SPL 论文被拒
已经有8人回复
- 【转帖】TD-LTE成功将给WiMAX致命一击：先发优势渐失
已经有5人回复
- 【转帖】40G/100G以太网标准制订正式启动
已经有1人回复
whcyb
木虫 (小有名气)
- 应助: 0 (幼儿园)
- 金币: 1368.1
- 散金: 2200
- 红花: 1
- 帖子: 185
- 在线: 191.4小时
- 虫号: 2785795
- 注册: 2013-11-07
- 性别: GG
- 专业: 通信理论与系统
★ ★ ★
小木虫: 金币+0.5, 给个红包，谢谢回帖
ssjcumt: 金币+2, 大修已经回来了，现在在小修中 2016-02-02 17:50:56
小木虫: 金币+0.5, 给个红包，谢谢回帖
ssjcumt: 金币+2, 大修已经回来了，现在在小修中 2016-02-02 17:50:56
|
这种情况就是大修，好好改会接收的，建议改后重投 发自小木虫Android客户端 |
2楼2015-12-02 17:42:52
zbconquer
木虫 (正式写手)
- 应助: 77 (初中生)
- 金币: 1901.1
- 散金: 1105
- 红花: 25
- 帖子: 843
- 在线: 411.7小时
- 虫号: 693619
- 注册: 2009-01-16
- 性别: GG
- 专业: 通信理论与系统
18楼2016-01-30 21:28:39
3楼2015-12-02 19:31:33
whcyb
木虫 (小有名气)
- 应助: 0 (幼儿园)
- 金币: 1368.1
- 散金: 2200
- 红花: 1
- 帖子: 185
- 在线: 191.4小时
- 虫号: 2785795
- 注册: 2013-11-07
- 性别: GG
- 专业: 通信理论与系统
★
小木虫: 金币+0.5, 给个红包，谢谢回帖
小木虫: 金币+0.5, 给个红包，谢谢回帖
|
editor一般不会有偏见的吧。另外，你确定邮件抄送的其他人不是主编和adm？双盲审的期刊怎么会把审稿人的邮件地址给你看到~~目前接收短文的知道的只有TVT（6页），Spl，ieee wireless communication letter（非sci，创刊时间太短，但检索迟早的事），还有一个是ieice t communication(15年10月1号开始接收四页，要差一点，日本的，发文要会员)。所以，还是建议改改重投吧，把一些不重要的要舍得删，精简一下。中的概率还是非常高的。 发自小木虫Android客户端 |
7楼2015-12-02 21:12:55
zbconquer
木虫 (正式写手)
- 应助: 77 (初中生)
- 金币: 1901.1
- 散金: 1105
- 红花: 25
- 帖子: 843
- 在线: 411.7小时
- 虫号: 693619
- 注册: 2009-01-16
- 性别: GG
- 专业: 通信理论与系统
9楼2015-12-02 21:58:42
zbconquer
木虫 (正式写手)
- 应助: 77 (初中生)
- 金币: 1901.1
- 散金: 1105
- 红花: 25
- 帖子: 843
- 在线: 411.7小时
- 虫号: 693619
- 注册: 2009-01-16
- 性别: GG
- 专业: 通信理论与系统
10楼2015-12-02 22:02:11
13楼2016-01-04 14:31:04
zbking
铁杆木虫 (正式写手)
- 应助: 46 (小学生)
- 金币: 10225.9
- 散金: 19
- 红花: 8
- 帖子: 875
- 在线: 867.1小时
- 虫号: 2524034
- 注册: 2013-06-27
- 性别: GG
- 专业: 计算机网络
15楼2016-01-06 14:49:57
ssjcumt
新虫 (小有名气)
- 应助: 1 (幼儿园)
- 金币: 50.9
- 散金: 120
- 帖子: 167
- 在线: 48.2小时
- 虫号: 1420773
- 注册: 2011-09-28
- 专业: 通信理论与系统
19楼2016-03-04 21:11:01
ssjcumt
新虫 (小有名气)
- 应助: 1 (幼儿园)
- 金币: 50.9
- 散金: 120
- 帖子: 167
- 在线: 48.2小时
- 虫号: 1420773
- 注册: 2011-09-28
- 专业: 通信理论与系统
4楼2015-12-02 20:13:17
ssjcumt
新虫 (小有名气)
- 应助: 1 (幼儿园)
- 金币: 50.9
- 散金: 120
- 帖子: 167
- 在线: 48.2小时
- 虫号: 1420773
- 注册: 2011-09-28
- 专业: 通信理论与系统
5楼2015-12-02 20:19:21
ssjcumt
新虫 (小有名气)
- 应助: 1 (幼儿园)
- 金币: 50.9
- 散金: 120
- 帖子: 167
- 在线: 48.2小时
- 虫号: 1420773
- 注册: 2011-09-28
- 专业: 通信理论与系统
6楼2015-12-02 20:38:47
whcyb
木虫 (小有名气)
- 应助: 0 (幼儿园)
- 金币: 1368.1
- 散金: 2200
- 红花: 1
- 帖子: 185
- 在线: 191.4小时
- 虫号: 2785795
- 注册: 2013-11-07
- 性别: GG
- 专业: 通信理论与系统
8楼2015-12-02 21:42:40
