• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.996-1001
• /
• 2010

In this paper, network selection algorithm for services of mobile IPTV(internet protocol television) and implementation of a hierarchical processing system for reducing overload by terminal with low speed is proposed. This algorithm selects the network according to the following priorities derived from formulas; value that uses remaining bandwidth, network cost, signal strength. If terminal has a low processing power for using selected network and TV service, quality of service declines due to the system overloading. Hence, we implemented system which processes selected network and TV services accomplished by layer divided. Through experiments results, the method of direct user network selection waits for bandwidth assignment. However, on the one hand, that waiting time in exhausted situation will be very long. On the other hand, if we consider the priority plot of used networks, we should select the network with the best state. Therefore, data transmission rate will keep on average and the waiting time will be low.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.420-422
• /
• 2004

The non-ideal characteristics of wireless communication are found in sensor network. And sensor network must also address new raised issues. The efficient ad-hoc routing algorithm is considered the nice solution for new raised sensor network problems. To design this efficient ad-hoc routing algorithm, we study and evaluate new components in routing algorithm. Namely, new components are Link estimator, Neighbor table and Parent selection. We have tested this related experiment using the TIP-30C. TIP-30C is sensor network node that is designed by KETI(Korea Electronic Technology Institute).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.608-614
• /
• 2009

In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.570-577
• /
• 2018

With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.389-395
• /
• 2022

A Mobile Sensor Network is widely used in real time applications. A critical need in Mobile Sensor Network is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes"EERA: Energy Efficient Routing Algorithm for Mobile Sensor Network" is divided into five phases. 1, Cluster Formation 2.Cluster head and Transmission head selection 3.Path Establishment / Route discovery and 4,Data Transmission. Experimental Analysis has been done and is found that the proposed method performs better than the existing method with respect to four parameters.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.1
• /
• pp.18-23
• /
• 2009

The conventional channel selection method for a ZigBee communication network basically detects the energy values in all channels. In the ISM band, no license is required to use channels in this band, so there may exist various interference factors in this band. It is well known that WLAN is the major interference factor degrading the performance of ZigBee in the ISM band. In this paper, we propose an efficient channel selection algorithm which uses the pattern of two types of WLAN channel uses as the a priori information of IEEE 802.11 band IEEE 802.11g. By using the proposed algorithm, we may save the time required to select channels for the ZigBee communications.

• Journal of Korea Multimedia Society
• /
• v.21 no.11
• /
• pp.1288-1296
• /
• 2018

PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.29-35
• /
• 2009

An efficient stochastic channel selection algorithm for cognitive radio networks is proposed and analyzed in this paper. With the new algorithm utilizing quality of channels, the stationary level of the channels in idle state and history performance, we can find the best channel for secondary users to transmit data. Moreover, this method not only restricts channel switching of secondary users but also adapts to random resource environment of cognitive radio network. The advantages of the proposed algorithm are demonstrated clearly through computer simulation.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.2
• /
• pp.142-147
• /
• 2008

In wireless sensor networks, one of the most important issue is improvement of network lifetime with an efficient energy consumption. we repose effective multi-hop routing algorithm which increases the number of nodes alive at any time. In our algorithm we use the dynamic selection of cluster head and short distance transmission method. We simulated the proposed algorithm by using Network Simulator 2 and compared its performance with LEACH. The experimental result shows that the number of the nodes alive is increased up to 39.71[%] during the simulation time.