• Proceedings of the KIPE Conference
• /
• 2005.07a
• /
• pp.609-611
• /
• 2005

쿼리에 응답하는 데이터 전달방식에서는 일반적으로 쿼리가 네트워크 전체에 뿌려진다. 하지만 쿼리가 특정지역의 정보만을 요구하는 경우 그 쿼리는 네트워크 전체에 뿌려질 필요가 없다. 본 논문에서 우리는 제한된 쿼리 전달 기법을 제안한다. 제안된 기법은 네트워크를 섹터와 레벨단위의 논리적 영역을 만들고 쿼리가 필요로 하는 정보가 속한 최소한의 영역으로만 쿼리를 전달함으로써 불필요한 쿼리 전달을 줄이고자 하는 것이다. 성능평가에서는 제안된 기법을 사용함으로써 센서 노드들의 평균 소비되는 에너지를 줄이고 네트워크의 생존시간을 늘리는 결과를 보였다.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.115-122
• /
• 2017

In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.169-178
• /
• 2023

Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.506-514
• /
• 2009

To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.532-543
• /
• 2004

Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.596-610
• /
• 2017

As a 'network of networks,' the Internet globally connects a huge number of regional and individual networks and provides us with new hopes and possibilities. However, a nation-state as well as the legal order of the 'state'(constitution) has limitations that are all too clear in order to regulate this new world formed by the Internet. It will soon be impossible for a single state to control these global information networks, and they will not be consistently and vertically operated and managed by anyone. As a result, ideologies or jurisdictions that support the legal order of a nation-state are no longer sufficient to control information delivery beyond borders. Furthermore, the development of the Internet and emergence of cyber space in the information society has led to the idea of 'extinction' of nation-states. Nevertheless, the conclusion that the state will be extinct due to the development of the information society is still nothing more than a hasty assumption. In other words, the information society does not indicate the end of the state. Rather, we must now clearly perceive that the object of our research and discussions must be the role and function of the nation-state in the newly emerged information society in the global aspect and international aspect, as well as in relationships with individuals or organizations that now have unimaginably strong information power. It is clear at this point that nation-states will lose the function and authority they have enjoyed or exercised to a certain degree, but this certainly does not indicate that nation-states are, and will be, unnecessary or useless. Rather, it is necessary to focus on the list of tasks that must be accepted by nation-states in the changed information society, as well as responsibilities and means to perform those tasks.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.640-652
• /
• 2012

Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.927-934
• /
• 2019

Recently, mobile devices have evolved into small computers with various functions according to user requirements. Careful attention must be paid to the design of the power supply network for the stable operation of the application processor (AP), the wireless communication modem, the high performance camera, and the various interfaces of the mobile device to implement various functions of the mobile device. In this paper, we analyzed and verified the method of optimizing the design parameters such as the position, capacity, and number of decoupling capacitors to meet the target impedance required by the driver IC chip to ensure the stability of the power supply network of mobile devices that should be designed as wiring type due to mounting density limitation. The proposed wired power supply network design method can be applied to various applications including high-speed signal transmission line in addition to mobile applications.

• Journal of Information Processing Systems
• /
• v.5 no.1
• /
• pp.33-40
• /
• 2009

Ever since the network-based malicious code commonly known as a 'worm' surfaced in the early part of the 1980's, its prevalence has grown more and more. The RCS (Random Constant Spreading) worm has become a dominant, malicious virus in recent computer networking circles. The worm retards the availability of an overall network by exhausting resources such as CPU capacity, network peripherals and transfer bandwidth, causing damage to an uninfected system as well as an infected system. The generation and spreading cycle of these worms progress rapidly. The existing studies to counter malicious code have studied the Microscopic Model for detecting worm generation based on some specific pattern or sign of attack, thus preventing its spread by countering the worm directly on detection. However, due to zero-day threat actualization, rapid spreading of the RCS worm and reduction of survival time, securing a security model to ensure the survivability of the network became an urgent problem that the existing solution-oriented security measures did not address. This paper analyzes the recently studied efficient dynamic network. Essentially, this paper suggests a model that dynamically controls the RCS worm using the characteristics of Power-Law and depth distribution of the delivery node, which is commonly seen in preferential growth networks. Moreover, we suggest a model that dynamically controls the spread of the worm using information about the depth distribution of delivery. We also verified via simulation that the load for each node was minimized at an optimal depth to effectively restrain the spread of the worm.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.191-200
• /
• 2022

Constrained Application Protocol (CoAP) is a standardized protocol by the Internet Engineering Task Force (IETF) for the Internet of things (IoT). IoT devices have limited computation power, memory, and connectivity capabilities. One of the significant problems in IoT networks is congestion control. The CoAP standard has an exponential backoff congestion control mechanism, which may not be adequate for all IoT applications. Each IoT application would have different characteristics, requiring a novel algorithm to handle congestion in the IoT network. Unnecessary retransmissions, and packet collisions, caused due to lossy links and higher packet error rates, lead to congestion in the IoT network. This paper presents an adaptive congestion control protocol for CoAP, Adaptive Congestion Control with a Backoff algorithm (ACCB). AACB is an extension to our earlier protocol AdCoCoA. The proposed algorithm estimates RTT, RTTVAR, and RTO using dynamic factors instead of fixed values. Also, the backoff mechanism has dynamic factors to estimate the RTO value on retransmissions. This dynamic adaptation helps to improve CoAP performance and reduce retransmissions. The results show ACCB has significantly higher goodput (49.5%, 436.5%, 312.7%), packet delivery ratio (10.1%, 56%, 23.3%), and transmission rate (37.7%, 265%, 175.3%); compare to CoAP, CoCoA+ and AdCoCoA respectively in linear scenario. The results show ACCB has significantly higher goodput (60.5%, 482%,202.1%), packet delivery ratio (7.6%, 60.6%, 26%), and transmission rate (40.9%, 284%, 146.45%); compare to CoAP, CoCoA+ and AdCoCoA respectively in random walk scenario. ACCB has similar retransmission index compare to CoAp, CoCoA+ and AdCoCoA respectively in both the scenarios.