• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.165-173
• /
• 2008

Hybrid ad hoc networks are integrated networks referred to Home Networks, Telematics and Sensor networks can offer various services. Specially, in ad hoc network where each node is responsible for forwarding neighbor nodes' data packets, it should net only reduce the overall energy consumption but also balance individual battery power. Unbalanced energy usage will result in earlier node failure in overloaded nodes. it leads to network partitioning and reduces network lifetime. Therefore, this paper studied the routing protocol considering efficiency of energy. The suggested algorithm can predict the status of energy in each node using the energy prediction model. This can reduce the overload of establishing route path and balance individual battery power. The suggested algorithm can reduce power consumption as well as increase network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.34-40
• /
• 2009

In this paper, we derive the average received beampattern at each receive node which is randomly distributed within a disk when considering a collaborative beanforming between transmission nodes which are randomly distributed within another disk for ad hoc sensor network. Numerical results show that the radius of disk at the transmitter determines the beamwidth of mainbeam, and the sidebeam is affected by the number of transmitter nodes. We also consider K receive groups and divide the transmit sensor modes into K groups to support each receive group using beamforming, and derive the SINR at each receive node. Finally, we investigate the effects of beampattern and interference on total sum capacity among all receive node, and numerically determine the number of transmit nodes for each group which can achieve the maximal sum capacity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2563-2567
• /
• 2011

Advances in smart sensors, embedded systems, low-power design, ad-hoc networks and MEMS have allowed the development of low-cost small sensor nodes with computation and wireless communication capabilities that can form distributed wireless sensor networks. Time information and time synchronization are fundamental building blocks in wireless sensor networks since many sensor network applications need time information for object tracking, consistent state updates, duplicate detection and temporal order delivery. Various time synchronization protocols have been proposed for sensor networks because of the characteristics of sensor networks which have limited computing power and resources. However, none of these protocols have been designed with time representation scheme in mind. Global time format such as UTC TOD (Universal Time Coordinated, Time Of Day) is very useful in sensor network applications. In this paper we propose network time protocol extension for global time presentation in wireless sensor networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.313-316
• /
• 2009

A novel approach for electrocardiogram (ECG) analysis within a functional sensor node has been developed and evaluated. The main aim is to reduce data collision, traffic over loads and power consumption in healthcare applications of wireless sensor networks (WSN). The sensor node attached on the patient's bodysurface around the heart can perform ECG analysis based on a QRS detection algorithm to detect abnormal condition of the patient. Data transfer is activated only after detected abnormality in the ECG. This system can reduce packet loss during transmission by reducing traffic overload. In addition, it saves power supply energy leading to more reliable, cheap and user-friendly operation in the WSN based ubiquitous health monitoring.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.9-18
• /
• 2008

Mobile devices do not need the fixed network infrastructure in ad-hoc network, these devices communicate each other through the distributed control. Accordingly, mobile devices can discover several services using dynamic searching method and provide safely public ownership of these services. Ad-hoc network needs the distributed control and topology of dynamic network because the limited power for processing and network communication. This paper is devoted to provide the secure protocol that provides efficient services discovery using SDP(Service Discovery Protocol) and considers the security requirements. Proposed protocol provides the distributed control based on PKI without central server, the discovery of trusted service, secure telecommunication, the identification among mobile devices, and service access control by user authority.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1436-1458
• /
• 2017

Quorum-based algorithms are widely used for solving several problems in mobile ad hoc networks (MANET) and wireless sensor networks (WSN). Several quorum-based protocols are proposed for multi-hop ad hoc networks that each one has its pros and cons. Quorum-based protocol (QEC or QPS) is the first study in the asynchronous sleep scheduling protocols. At the time, most of the proposed protocols were non-adaptive ones. But nowadays, adaptive quorum-based protocols have gained increasing attention, because we need protocols which can change their quorum size adaptively with network conditions. In this paper, we first introduce the most popular quorum systems and explain quorum system properties and its performance criteria. Then, we present a comparative and comprehensive survey of the non-adaptive and adaptive quorum-based protocols which are subsequently discussed in depth. We also present the comparison of different quorum systems in terms of the expected quorum overlap size (EQOS) and active ratio. Finally, we summarize the pros and cons of current adaptive and non-adaptive quorum-based protocols.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.268-286
• /
• 2008

In this work, we review the routing models that use game theoretical methodologies. A very common assumption in the analysis and development of networking algorithms is the full cooperation of the participating nodes. Most of the analytical tools are based on this assumption. However, the reality may differ considerably. The existence of multiple domains belonging to different authorities or even the selfishness of the nodes themselves could result in a performance that significantly deviates from the expected one. Even though it is known to be extensively used in the fields of economics and biology, game theory has attracted the interest of researchers in the field of communication networking as well. Nowadays, game theory is used for the analysis and modeling of protocols in several layers, routing included. This review aims at providing an elucidation of the terminology and principles behind game theory and the most popular and recent routing models. The examined networks are both the traditional networks where latency is of paramount importance and the emerging ad hoc and sensor networks, where energy is the main concern.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.68-75
• /
• 2017

In this paper, we propose an energy entropy based multipath routing protocol using dynamic forwarding range in mobile ad-hoc wireless sensor networks. The main features and contributions of the proposed routing protocol are as follows. First, can select stable routing routes by using the calculated route entropy based on energy information of sensor nodes. Second, using dynamic forwarding range based on the route stability of route entropy can reduce energy, control overhead, delay for route establishment, finally improve data transmission efficiency. The performance evaluation using OPNET shows that the proposed routing protocol can efficiently support PDR.