• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.415-418
• /
• 2014

The CBS methodology has been standardized in order to make a rapid broadcast of emergency alert message for cellular users. However, the standard does not specify a retransmission request mechanism in the case that the users fail in receiving the alert message. Therefore, we propose a retransmission request scheme based on cognitive radio for the CBS technology in this letter. The simulation results confirm that our proposed scheme is very suitable for the retransmission method in CBS-based emergency alert broadcast systems.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.130-138
• /
• 2009

6LoWPAN is IPv6 packets transmission technology at Sensor network over the IEEE 802.15.4 Standard MAC and Physical layer. Adaptation layer between IP layer and MAC layer performs fragmentation and reassembly of packet for transmit IPv6 packets. RFC4944, IETF 6LoWPAN WG standard document define packet fragmentation and reassembly. In this paper, we propose the IRM(Immediate Retransmission Method) and SRM(Selective Retransmission Method) to manage packet fragmentation and reassembly at 6LoWPAN. Each time destination receives a fragmented packet, it sends Ack message to the source node on IRM. However, on SRM, the destination node receives all fragmented packet, it sends Ack message or Nak message to the source node. In this case, Nak message include the dropped packet number. To compare the performance of the proposed schemes, we develop a simulator using C++. The result of simulation shows the proposed schemes provider better performance than RFC4944 standard scheme.

• Journal of Korea Multimedia Society
• /
• v.20 no.12
• /
• pp.1849-1855
• /
• 2017

The main purpose of cooperative communications is improvement of communication quality and efficient use of transmission power. In this paper, a cooperative retransmission method is proposed, where neighbor nodes that receive messages correctly between transmit and receive nodes will participate in retransmission of the erroneous packet of the direct link. When the proposed retransmission method is used, the performance of the PER can be greatly improved. In case that the limited information is included in the NACK message, the transmit power of the retransmission packet can be reduced using the proper power control method.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.148-155
• /
• 2008

In wireless data communication systems, retransmission of an erroneous packet is inevitable due to the harsh communication environment. In this paper, an efficient retransmission scheme using cooperation from neighboring nodes is investigated. In the cooperative retransmission scheme, an erroneous packet is transmitted to the destination by cooperative nodes which have favorable channels. This cooperative retransmission scheme requires no a priori information of neighboring nodes and has no limitation on the number of cooperating nodes. Distributed beamforming is used to accommodate multiple cooperating nodes. Phase and frequency offsets of cooperating signals are extracted from the NACK message and used to co-phase retransmitted data packets. The outage probability of the cooperative retransmission scheme is analyzed for the case of perfect synchronization and when the offsets are estimated. To reduce the impact of the residual phase and frequency offsets in cooperating signals, a low-rate feedback scheme is also investigated. It is shown that improved outage probability and reduced packet error rate (PER) performance can be achieved even for long data packets. The proposed cooperative retransmission scheme is found to outperform simple retransmission by the source as well as decode-and-forward cooperation.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.526-535
• /
• 2010

In this paper, we propose the fault-tolerant network-based mobility management scheme for supporting multimedia services of broadcasting & communications convergence in fixed mobile convergence (FMC) networks. The proposed scheme is based on AIMS (Access Independent Mobility Service) which is developed for the mobility support among heterogeneous access networks. To support stable location management and handover control for a MN, the proposed scheme supports stable management of binding information by sensing network attachment and detachment of a mobile node (MN). In addition, the proposed fault-tolerant (FT) AIMS supports a function of message retransmission for the support of handover control message and a function of heartbeat message transmission for the support of stable access network environments to a mobile node. We evaluate and analyze the performance of the proposed scheme through the implementation of AIMS system test-bed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.20-28
• /
• 1999

In this paper, we propose a new datagram delivery strategy at the home agent to improve the end-to-end performance by reducing retransmission overheads during handover. Changed routing might be able to cause packet disordering and this in turn could cause unnecessary retransmission at the fixed host and finally results in performance degradation. In our proposal, the home agent begins to buffer received datagrams instead of transmitting them after receiving a registration request message from the foreign agent and then transmits them again after for a certain time. Simulation results show that our proposal may successfully solve this problem at little cost.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.395-396
• /
• 2014

최근 소셜 네트워크 서비스로 대표되는 정보유통 매체의 급격한 발전으로 인해 데이터 빅뱅(Data Big Bang)이라 할 수 있는 데이터의 폭발적인 증가 현상에 따라 빅데이터에 대한 관심이 급격히 증대되고 있다. 빅데이터 관련 기술들은 기본적으로 대용량 데이터를 하나의 노드로 관리하는 것이 아닌 여러 노드를 연결하기 때문에 효율적인 데이터 관리를 위해서 노드 간 연결을 담당하는 라우팅 알고리즘의 중요성 역시 대두되고 있다. 본 논문에서 대용량 데이터를 위한 효율적 라우팅 알고리즘을 위해 새로운 라우팅 메시지 재전송 기법을 위한 혼잡 확률 연산 알고리즘을 제안한다.