Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Kyung-Hi Chang / Song Chong / Jong-Taek Oh / Jae-Jin Lee / Myung-Sik Yoo
Volume & Issues
Volume 34, Issue 12C - Dec 2009
Volume 34, Issue 12B - Dec 2009
Volume 34, Issue 12A - Dec 2009
Volume 34, Issue 11C - Nov 2009
Volume 34, Issue 11B - Nov 2009
Volume 34, Issue 11A - Nov 2009
Volume 34, Issue 10C - Oct 2009
Volume 34, Issue 10B - Oct 2009
Volume 34, Issue 10A - Oct 2009
Volume 34, Issue 9C - Sep 2009
Volume 34, Issue 9B - Sep 2009
Volume 34, Issue 9A - Sep 2009
Volume 34, Issue 8C - Aug 2009
Volume 34, Issue 8B - Aug 2009
Volume 34, Issue 8A - Aug 2009
Volume 34, Issue 7C - Jul 2009
Volume 34, Issue 7B - Jul 2009
Volume 34, Issue 7A - Jul 2009
Volume 34, Issue 6C - Jun 2009
Volume 34, Issue 6B - Jun 2009
Volume 34, Issue 6A - Jun 2009
Volume 34, Issue 5C - May 2009
Volume 34, Issue 5B - May 2009
Volume 34, Issue 5A - May 2009
Volume 34, Issue 4C - Apr 2009
Volume 34, Issue 4B - Apr 2009
Volume 34, Issue 4A - Apr 2009
Volume 34, Issue 3C - Mar 2009
Volume 34, Issue 3B - Mar 2009
Volume 34, Issue 3A - Mar 2009
Volume 34, Issue 2C - Feb 2009
Volume 34, Issue 2B - Feb 2009
Volume 34, Issue 2A - Feb 2009
Volume 34, Issue 1C - Jan 2009
Volume 34, Issue 1B - Jan 2009
Volume 34, Issue 1A - Jan 2009
Selecting the target year
A Life-Critical Data Transmission Scheme for Wireless Body Area Networks
Choi, Won-Suk ; Cho, Sung-Rae ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1329~1335
In this paper, we propose a new medium access control protocol referred to as DCTW (Dual Channel Transmission Scheme for wireless body area networks). Wireless body area networks (WBANs) requires prioritization mechanism for life-critical data to transmit the data as early as possible. The proposed DCTW exploits a narrow band for transmitting life-critical data while it uses a broadband channel to transmit normal data. Since the narrow band is dedicated to life-critical data, the DCTW can effectively reduce the delay of life-critical data transmission. Through extensive simulation, we show the DCTW outperforms other existing schemes.
An Energy-Aware Multi-tree Video Multicast Scheme in Wireless Ad Hoc Networks
Park, Jae-Young ; Kang, Kyung-Ran ; Cho, Young-Jong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1336~1348
In this paper, we propose an energy-aware multi-tree video multicast scheme for wireless ad hoc networks. Some network nodes may have energy enough to receive and forward the whole video content whereas some may not. Even though the video quality may vary depending on the remaining energy, our scheme enables the low-energy nodes to join the video multicast session. The video stream is split into a set of multiple and independent descriptions by MDC (Multiple description coding) scheme. Each description corresponds to a substream and number of substreams determine the video quality. The member nodes determine how many substreams it would receive depending on the remaining energy and expected amount of packets per substream. So does the intermediate tree nodes. That builds a tree per substream and multiple trees per session. The data source disseminates each substream through corresponding tree. The video quality of the member nodes varies according to number of participating trees. We evaluate the performance of our scheme by simulation. Our scheme showed better peak signal to noise ratio and extended the lifetime of the network nodes compared with MAODV, which builds a single tree, and MT-MAODV, which builds multiple trees but does not consider the available energy.
Modified LEACH Protocol improving the Stabilization of Topology in Metal Obstacle Environment
Yi, Ki-One ; Lee, Jae-Kee ; Kwark, Gwang-Hoon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1349~1358
Because of the limitation of supporting power, the current WSN(Wireless Sensor Network) Technologies whose one of the core attributes is low power consumption are the best solution for shipping container networking in stack environment such as on vessel. So it is effective to use the Wireless Sensor Network Technology. In this case, many nodes join in the network through a sink node because there are difficulties to get big money and efforts to set up a lot of sink node. It needs clustering-based proactive protocol to manage many nodes. But it shows low reliability because they have effect on radio frequency in metal obstacle environments(interference, distortion, reflection, and etc) like the intelligent container. In this paper, we proposed an improved Modified LEACH Protocol for stableness radio frequency environment. In the proposed protocol, we tried to join the network and derived stable topology composition after the measuring of link quality. Finally, we verified that the proposed protocol is composing more stable topology than previously protocol in metal obstacle environment.
Scalable and Robust Data Dissemination Scheme for Large-Scale Wireless Sensor Networks
Park, Soo-Chang ; Lee, Eui-Sin ; Park, Ho-Sung ; Lee, Jeong-Cheol ; Oh, Seung-Min ; Jung, Ju-Hyun ; Kim, Sang-Ha ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1359~1370
In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.
A Node-Disjoint Multi-Path Routing Protocol in AODV-based Mobile Ad-hoc Networks
Kim, Tae-Hun ; Chung, Shang-Hwa ; Kang, Su-Young ; Yoo, Young-Hwan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1371~1379
In this paper, we propose a new multi-path routing protocol to provide reliable and stable data transmission in MANET that is composed of high-mobility nodes. The new multi-path routing establishes the main route by the mechanism based on AODV, and then finds the backup route that node-disjoint from the main route by making add nodes in the main route not participate in it. The data transmission starts immediately after finding the main route. And the backup route search process is taking place while data is transmitted to reduce the transmission delay. When either of the main route or the backup route is broken, data is transmitted continuously through the other route and the broken route is recovered to node-disjoint route by the route maintenance process. The result of the simulation based on the Qualnet simulator shows that the backup route exists 62.5% of the time when the main route is broken. And proposed routing protocol improved the packet transmission rate by 2~3% and reduced the end-to-end delay by 10% compared with AODV and AODV-Local Repair.
Advanced Calendar Queue Scheduler Design Methodology
Kim, Jin-Sil ; Chung, Won-Young ; Lee, Jung-Hee ; Lee, Yong-Surk ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1380~1386
In this paper, we propose a CQS(Calendar Queue Scheduler) architecture which was designed for processing multimedia and timing traffic in home network. With various characteristics of the increased traffic flowed in home such as VoIP, VOD, IPTV, and Best-efforts traffic, the needs of managing QoS(Quality of Service) are being discussed. Making a group regarding application or service is effective to guarantee successful QoS under the restricted circumstances. The proposed design is aimed for home gateway corresponding to the end points of receiver on end-to-end QoS and eligible for supporting multimedia traffic within restricted network sources and optimizing queue sizes. Then, we simulated the area for each module and each memory. The area for each module is referenced by NAND(
) Gate(11.09) when synthesizing with Magnachip 0.18 CMOS libraries through the Synopsys Design Compiler. We verified the portion of memory is 85.38% of the entire CQS. And each memory size is extracted through CACTI 5.3(a unit in mm2). According to the increase of the memory’sentry, the increment of memory area gradually increases, and defining the day size for 1 year definitely affects the total CQS area. In this paper, we discussed design methodology and operation for each module when designing CQS by hardware.
In Base-station with Multi-channels Using the Second Law of Cosines the Position Estimation Method
Lee, Hyun-Sung ; Bok, Young-Su ; Shin, Hye-Jung ; Park, Byung-Woo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1387~1398
In the latest we will make a demand for the precision position estimation for the Mobile-station(MS)'s position. But, we have a lot of problems the position estimation method using the existing method. The Base-station(BS) measure a distance according to time delay waves to receive propagate from the MS and estimate the position using the existing circle equation with method to be selected BSs in close proximity the MS. It knows that happens a lot of error the estimated position and the true position. This paper propose that the method is selected round BSs to estimate for MS's position and estimated the angle using the second law of cosine. This paper demonstrate that using simulation the proposal method is a predominant method to compare with the existing method.
Efficient and Scalable Overlay Multicast Mechanism for Real-time Tree Construction
Nam, Yun-Seung ; Im, Dong-Gee ; Yang, Hyun-Jong ; Nam, Ji-Seung ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1399~1406
In the internet broadcast, efficient and scalable mechanism of multicast is needed for the communication between groups. Furthermore, Optimization of the multicast tree is required to improve the performance of overlay multicast. This optimization is well-known as NP-complete. If a node in the tree has limited out-degree, a user who wants to join the group has to find parent user who has already joined. In this paper, the users who want to join the group need to setup their level using delay test from source node. And then new users can find candidate parent nodes effectively using ACK-SEND approach and take proper position by comparing level. The closer node of the user to root node should be located in lower level. Also, even if a barrier is caused, fast recovery will be guaranteed using ACK-SEND approach. Through this, the newcomer node can fine their location in the multicast tree and join the group fast and effectively.
Design of E-Document Management System Using Dynamic Group Key based on OOXML
Lee, Young-Gu ; Kim, Hyun-Chul ; Jung, Taik-Yeong ; Jun, Moon-Seog ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1407~1417
We propose a e-document management system that can provide segmented page information on a document according to different levels of authority from access control environment. The proposed system creates hierarchy identifier using a one-way hash chain and therefore does not need to own key information for all users as in existing system. Also by creating group keys by compounding hash chain hierarchy identifier with randomly formed group identifier, the system can flexibly respond to dynamic changes from group member movements while at the same time resolving the problems of key formation and management in document encoding technique using symmetric key for each page. Lastly as a result of comparative analysis through an experiment with existing e-document management systems, the proposed system showed superiority in the efficiency of encoding and decoding document and the speed of encoding and decoding by the pages.
Design of an Efficient FTL Algorithm for Flash Memory Accesses Using Sector-level Mapping
Yoon, Tae-Hyun ; Kim, Kwang-Soo ; Hwang, Sun-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1418~1425
This paper proposes a novel FTL (Flash Translation Layer) algorithm based on sector-level mapping to reduce the number of total erase operations in flash memory accesses. The proposed algorithm can reduce the number of erase operations by utilizing the sector-level mapping table when writing data at flash memory. Sector-level mapping technique reduces flash memory access time and extendsthe life time of the flash memory. In the algorithm, wear-leveling is implemented by selecting victim blocks having the minimal number of erase operations, when empty spaces for write are not available. To evaluate the performance of the proposed FTL algorithm, experiments were performed on several applications, such as MP3 players, MPEG players, web browsers and document editors. The proposed algorithm reduces the number of erase operations by 72.4% and 61.9%, when compared with well-known BAST and FAST algorithms, respectively.
Power Saving Algorithm based on Long-term Sleep Period for RFID/USN systems
Kang, Yu-Chol ; Hwang, Jun-Ho ; Yoo, Myung-Sik ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1426~1434
RFID/USN is considered as a key convergence technology in future ubiquitous network. In RFID/USN, the power saving issue receives a great attention due to limited battery lifetime of sensor node. In this paper, we propose a new power saving algorithm, which takes advantage of long-term sleep period. To provide a full network connectivity and balance the battery consumption among sensor nodes, the proposed algorithm intelligently selects the long-term sleep sensor nodes. With mathematical analysis and simulations, we prove that the proposed algorithm can significantly reduce the power consumption of sensor nodes as compared to existing algorithms.
Simulation of ULP Self-Sustaining Sensor Node System
Kim, Yun-Ho ; Seong, Yeong-Rak ; Oh, Ha-Ryoung ; Park, Jun-Seok ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1435~1443
In this paper, an energy harvesting sensor network system is modeled and simulated by using the DEVS (Discrete Event System Specification) formalism. The system is composed of a sink (master) node, which is battery or mains powered, and a set of sensor (slave) nodes, each of which harvests ambient energy and converts it into electrical energy. For simulation, (i) the behavior of energy harvesting and storing circuits of the slave node is partitioned into a set of piecewise continuous segments and then each segment is represented as a discrete state; (ii) the interaction among the master node and components of the slave node is investigated preciously; and (iii) the investigated result is modeled and simulated by using the DEVS formalism.
EPCglobal Gen 2 Tag Identification Performance Analysis Modifying the C model in the Q Algorithm
Park, Jong-Myung ; Cho, Sung-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1444~1451
This paper first proposes diverse C determining models in the Q algorithm which is proposed in the EPCglobal C1 Gen 2 standard and then compares and analyzes its performance. EPCglobal C1 Gen 2 standard proposes the slot-count (Q) selection algorithm for multiple tag identification environment, but there is no such definition for the C value which modifies the Q value depending on collision or no reply. During the tag anti-collision process, the Q algorithm adds C to the Q when there is a collision and reduces the Q by C when there is no reply. The modified Q value updates new slot-counts for tags which determines the tag identification speed, so the C value is an important factor. However, many researches only intend to increase the tag identification speed by proposing a new method or modifying the Q algorithm without any research about the C value. This paper suggests diverse C models which satisfies the EPCglobal C1 Gen 2 and analyzes their performance in the multi tag identification environment. The result of this paper can be used as an index for future researches on EPCglobal C1 Gen 2 C models and multiple tag identification performance.
Development of UHF Band Tag Antenna using Radio Frequency Identification Multipurpose Complex Card
Byun, Jong-Hun ; Sung, Bong-Geun ; Choi, Eun-Jung ; Ju, Dae-Geun ; Yoo, Dae-Won ; Cho, Byung-Lok ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1452~1458
In this paper, Our proposed Multipurpose Complex Card UHF band RFID small-size Tag antenna. Multi purpose Complex Card UHF band RFID small-size Tag antenna that is to minimize the low efficiency of RFID Tag Read Range that generates space limitation and a conductor surrounded by inducing fingerpring system with dual(HF, UHF) Card is presented. Our proposed UHF band RFID small-size Tag antenna is for the Multipurpose Complex Card that is mounted on the fingerpring system as well as the HF Tag. It also enables to minimize and facilitates Tag chip matching by adjusting Tapered, Meander line and Loop structure. Given the card substance properties and periphery circuit, the proposed small-size Tag antenna, in this report, is designed with PET film with size of
. The RFID small-size Tag method for measurements is used by EPCglobal Static Test instrument in Anechoic Chamber, which is tested with dual Card, within the car and in wallet. It is found that Read Range is 3.8m from the EPCglobal Static Test, Maximum Read Range within the car from the field test results in 7.6m. Proposed Tag antenna is will be used in the parking control security system.
A Message Reduction Method for Performance Improvement of the ISO/IEC 18000-7 based Active RFID System
Yoon, Won-Ju ; Chung, Sang-Hwa ; Kang, Su-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1459~1467
In this paper, we propose a novel method for improving the tag collection performance in active RFID systems by modifying the tag collection algorithm in the ISO/IEC 18000-7 standard. The proposed method enables to reduce the time slot size by reducing the response message size from the tag and to decrease the number of command messages from the reader throughout the tag collection process. This results in reducing the time required for tag collection and the battery consumption on tags by decreasing the total amount of messages. Via the simulation experiments, we evaluated the performance of the tag collection applied with the proposed method, compared with that of the basic tag collection complying with the standard. The simulation results showed that the proposed method could decrease the total amount of messages between the reader and tags dramatically and reduce the average tag collection time by 19.99% and 16.03% when the reader requested the additional data of 50 bytes and 100 bytes from the tags, respectively.
A Study of UHF RFID Metallic Tag Design for Long Reading Range Using a Cavity Structure
Lee, Jin-Seong ; Lee, Kyoung-Hwan ; Yeo, Jun-Ho ; Chung, You-Chung ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1468~1474
This paper shows an UHF RFID metallic tags using a Cavity structure for a long reading range. The reading range of a general passive tag is limited because the EIRP of a reader system is limited as 36㏈m by ISO 18000-6. To extend the reading range, the tag antenna should have a high gain antenna structure. The designed tag antenna is recognized over 10m range with a Cavity structure. The directivity pattern and the performance of the tag with the Cavity structure is stable when it is attached to a metallic object. The designed tag antenna has two kinds as cavity thickness. The sizes of designed tag antennas are
They can be attached to a large metallic materials and heavy equipments. The measured reading ranges of the tags are about 11m and 15m when they are attached to a metallic object.
An Efficient Shortcut Path Algorithm using Depth in Zigbee Network
Kim, Duck-Young ; Jung, Woo-Sub ; Cho, Sung-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1475~1482
In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.
Low Complexity Bit Loading Algorithm with Power-constraint for OFDM-based Wireless Sensor Communication
Oh, Seoung-Youl ; Ko, Hyeon-Mok ; Kwon, Soon-Mok ; Kim, Chee-Ha ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1483~1490
Orthogonal frequency division multiplexing (OFDM) has been investigated as an enabling technology for future wireless communications such as ad hoc, mesh and sensor networks. However, prior works on bit-loading lack consideration of the constraints on energy and computing facility in sensor networks. In this paper, we suggest an adaptive bit allocation algorithm for a frequency selective fading channel environment which exploits channel state information obtained through a feedback channel. The proposed algorithm significantly reduces computational complexity and satisfies the power budget. Also, its throughput is comparable to the optimum solution. Simulation results support the claim stated.
A Method to Improve Location Estimation of Sensor Node
Han, Hyeun-Jin ; Kwon, Tae-Wook ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1491~1497
Existing methods to measure are based on ToA (Timer of Arrival), RSS (Received Signal Strength), AoA(Angle of Arrival) and other methods. In this paper, we propose a compensation of ToA and RSS methods to measure more precisely the distance of nodes. The comparison experiments with the traditional ToA method show that the average error value of proposed method is reduced 30%. We believe that this proposal can improve location estimation of sensor nodes in wireless sensor networks.
Tree-based Multi-channel Communication with Interference Avoidance using Dynamic Channel Switching in Wireless Sensor Network
Mohd, Noor Islam ; Choi, Sun-Woong ; Jang, Yeong-Min ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1498~1505
In centralized control sensor network, tree-based multi-channel communication overcomes the recurrent channel switching and makes possible to transfer data simultaneously from different sources. In our paper, we propose a greedy algorithm named as NIT (Non-Intersecting Tree) that the trees can avoid inter-tree interference. We also propose channel switching technique by which trees can avoid link failure or area blocking due to external interference locally without rerunningthe algorithm and without interrupting the whole network. At first we applied our algorithm for a random topology and then we evaluate the performance of the network using NS-2 simulator. The results show that with the increasing of channel the throughputand delivery ratio are increased significantly. We got better performance than a using a recent proposed Tree-based Multi-Channel Protocol (TMCP).
Synchronization Method in PJM Mode of 13.56 MHz RFID
Youn, Jae-Hyuk ; Yang, Hoon-Gee ; Yang, Sung-Hyun ; Kang, Bong-Soon ; Bae, Ji-Hoon ; Choi, Gil-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1506~1513
This paper presents a synchronization method to determine the exact demodulation time using the MFM Flag of the 18000-3 PJM mode, along with the hardware structure to implement the proposed method. The proposed system detects an incipient peak using ITS(Initial Time Selector) and a correlator and achieves the final synchronization via identifying the peak position from the comparison of the outputs of two followed additional correlators. The peak detection algorithm and the choice of the templates of the correlators are described. Simulation results show that the proposed system performs successfully in noisy environment.
A Hierarchical Cluster Tree Based Address Assignment Method for Large and Scalable Wireless Sensor Networks
Park, Jong-Jun ; Jeong, Hoon ; Hwang, So-Young ; Joo, Seong-Soon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1514~1523
It is well known that the current wireless sensor networks addressing methods do not work efficiently in networks more than a few hundred nodes. A standard protocol in ZigBee-Standard feature in ZigBee 2007 gives balanced tree based address assignment method with distributed manner. However, it was limited to cover less than hundreds of sensor nodes due to the wasteful use of available address space, because composed sensor networks usually make an unbalanced tree topology in the real deployment. In this paper, we proposed the hierarchical cluster tree based address assignment method to support large and scalable networks. This method provides unique address for each node with distributed manner and supports hierarchical cluster tree on-demand. Simulation results show that the proposed method reduces orphan nodes due to the address exhaustion and supports larger network with limited address space compared with the ZigBee distributed address assignment method defined in ZigBee-Standard feature in ZigBee 2007.
Technological Trend for Wireless Ingestible Capsule Design
Park, Jong-Man ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1524~1534
In recent, diagnosing and monitoring technology via in vivo information has been evolved rapidly in worldwide with such capsule-kinds means of incorporating an RFID tag as wireless communication tool. Thus circumstance is pressing local body in Korea to research and develop ingestible RFID capsule which has more miniaturized form, less low power, harmless. This paper focused to investigate new technology and patents, R&D information for adopting proper frequency and designing wireless ingestible capsule antenna system, and suggested practical assignments to implement local R&D. Descriptions are consist of introduction, technology outline, tendency for R&D, patent, market, conclusion and suggestion.
An Efficient Search Algorithm for Shorten Routing Path in ZigBee Networks
Kim, Doo-Hyun ; Cho, Sung-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 34, issue 12B, 2009, Pages 1535~1541
In this paper, we suggest an efficient path searching algorithm that reduces the hop count when each node sends a data in ZigBee networks. As the hop count reduces, the network traffic is also reduces and leads to less energy consumption. This enables the sensor network live longer with limited node power. The proposed path searching algorithm consists of two sub-algorithms. One for upstream process and the other for downstream process. When a node selects its proper routing path, the node not only uses the information of the parent and child node, but it also uses the neighbor nodes for each node. In the simulation, we changed various network environment factors such as network parameters, number of nodes, and number of neighbor nodes and observed their performances. We compare the performance to the previous ZigBee Tree routing algorithm with separate two algorithms, the upstream and the downstream, and then compare the performance when all two algorithms are applied.