• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.361-370
• /
• 2004

All active nudes which have no physically direct connection with each other in If network must be able to compose and manage network topology Informations. Besides one active program can be performed by the active nodes when every active packet for this program is transmitted without any loss of packets. Also the active packets should be transmitted effectively to minimize the transmission delay and securely from threatens. In this thesis, the discovery scheme of active nodes is adapted for active nodes in IP networks to compose and manage the topology information. The scheme for the efficient, reliable and secure transmission of active packets is also proposed. The sequence number is assigned to every active packet. If a receiver detects the loss of active packet checking the sequence number, the receiver requests the retransmission of the lost packet to the previous active node. kiter receiving an active packet and adapting security and reliability schemes, intermediate active nodes not only copy and send the Packet Instantly but also apply some suity mechanisms to it. And the active packet transmission engine is proposed to provide these transmission schemes The simulation of the adapted active node discovery scheme and the proposed active packet transmission engine is performed. The simulation results show that the adapted active node discovery scheme is efficient and the proposed active engine has the low latency and the high performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.17-28
• /
• 2008

Rapid transmission of packets is important in mobile ad hoc networks. Therefore, a flooding algorithm which can guarantee a short delay is useful in various ways of packet transmission. Flooding algorithm is one of the packet transmission methods that broadcasts a packet to all nodes within a transmission range. It does not rebroadcast the same packet which is already received from other nodes. Basically, flooding algorithm's advantages are that it simply writes an address and a sequence number in a packet, and it can be adapted for topological changes easily. However, the basic flooding algorithm has a shortcoming that causes excessive traffic because all nodes transmit a packet at least once. To solve this problem, research about flooding algorithms that constrains duplicated transmission of packets based on probabilistic and geographical information is going on. However, the existing algorithm cannot guarantee short delay and low traffic. To reduce a delay, in this paper we propose a flooding scheme where a node which receives a broadcasted packet chooses and allocates a priority to one of its neighbor nodes and then the node transmits the packet promptly to the node to whom the priority was given. Moreover, we propose a totally fresh a roach to constrain duplicated transmission by searching a node that already received the same packet by using node's geographical position information. Lastly, we compare the performance of the proposed algorithm with the existing algorithm through simulation. The results show that the proposed algorithm can distribute packets through a lower number of total packet transmissions and faster delivery time than the existing algorithm.

• Journal of Advanced Navigation Technology
• /
• v.6 no.2
• /
• pp.158-167
• /
• 2002

In this paper, it is analyzed that WAP packet transmission time to improve performance of WAP using SAR-QT algorithm in Bluetooth channel. The order for SAR-QT algorithm to improve the transfer capability, it is fragmented in WTP total messages that are coming down from upper layer and then the packets are sent one at time in baseband. And it is studied that transmission time for WAP over Bluetooth according to DMI, DM3 or DM5 packet type using SAR-QT algorithm in Bluetooth piconet environment. This SAR-QT algorithm decreases WAP packet transmission time of L2CAP baseband packets by sending packet that are spanning multiple slots. From the results, in WAP over Bluetooth channels, it is found out that WTP packet size ought to be increased to decrease transmission time of WAP packet. In addition, considering BER in wireless channel, optimal WTP packet size is achieved for WAP over Bluetooth in a Rician fading environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.140-150
• /
• 2012

In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.

• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.91-102
• /
• 2022

With the evolution of wireless sensor network (WSN) technology, the routing policy has foremost importance in the Internet of Things (IoT). A systematic routing policy is one of the primary mechanics to make certain the precise and robust transmission of wireless sensor networks in an energy-efficient manner. In an IoT environment, WSN is utilized for controlling services concerning data like, data gathering, sensing and transmission. With the advantages of IoT potentialities, the traditional routing in a WSN are augmented with decision-making in an energy efficient manner to concur finer optimization. In this paper, we study how to combine IoT-based deep learning classifier with routing called, Kriging Regressive Deep Belief Neural Learning (KR-DBNL) to propose an efficient data packet routing to cope with scalability issues and therefore ensure robust data packet transmission. The KR-DBNL method includes four layers, namely input layer, two hidden layers and one output layer for performing data transmission between source and destination sensor node. Initially, the KR-DBNL method acquires the patient data from different location. Followed by which, the input layer transmits sensor nodes to first hidden layer where analysis of energy consumption, bandwidth consumption and light intensity are made using kriging regression function to perform classification. According to classified results, sensor nodes are classified into higher performance and lower performance sensor nodes. The higher performance sensor nodes are then transmitted to second hidden layer. Here high performance sensor nodes neighbouring sensor with higher signal strength and frequency are selected and sent to the output layer where the actual data packet transmission is performed. Experimental evaluation is carried out on factors such as energy consumption, packet delivery ratio, packet loss rate and end-to-end delay with respect to number of patient data packets and sensor nodes.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.1-6
• /
• 2006

In this paper, we have analyzed transmission time for WAP over CDMA using turbo code scheme. In order for SAR to improve the transfer capability, the transmission of messages have been simulated using a fragmentation that begins with the total package and incremental fragmentation for each layer using the WTP to define the resultant packet size and the level of fragmentation for each proceeding layer. This turbo code scheme decreases transmission time of RLP baseband packets by sending packets. From the results, we were able to obtain packet transmission time and optimal WTP packet size for WAP over CDMA in a Rician fading channel.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.45-50
• /
• 2008

Many applications of sensor network require connection to the Internet. The transmission protocol of traditional sensor network was designed within the sensor network itself. However, based on 6LoWPAN which can be accessed using IPv6, direct connection is possible between the sensor network and the TCP/IP network outside. Transmission of data in applications of sensor network falls into two main categories. One is a small packet that is periodically produced such as packet related to temperature and humidity. The other is a relatively large packet that brings about network overheads such as images. We investigated the conformance test and pros and cons of application data over the transmission protocol of Zigbee and 6LoWPAN. As a result, both Zigbee and 6LoWPAN have shown low rate of loss for periodic data and have in creased reliability of data transfer. When transmitting streaming image data, both ACK, non ACK mode of Zigbee and UDP of 6LoWPAN minimized transmission time but suffered the consequences of high packet loss. Even though TCP of 6LoWPAN required a long transmission time, we were able to confirm that no loss has occurred.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.729-738
• /
• 1995

We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poison process. The switch transmits queued packets on a priority basis with three phases of preemption mechanism. Namely, the transmission time of each packet consists of a preemptive-repeat part for the header, a preemptive-resume part for the information field, and a nonpreemptive part for the trailer. By an exact analysis of the associated queueing model, we obtain the Laplace-Stieltjes transform of the distribution function for the delay, i.e., the time from arrival to transmission completion, of a packet for each class. We derive a set of equations that calculates the mean response time for each class recursively. Based on this result, we plot the numerical values of the mean response times for several parameter settings. The probability generating function and the mean for the number of packets of each class present in the system at an arbitrary time are also given.