• Title/Summary/Keyword: Mobile wireless networks

Search Result 1,352, Processing Time 0.03 seconds

An Efficient Flooding Algorithm for Position-based Wireless Ad hoc Networks (위치 기반 무선 애드 혹 네트워크에서의 효율적인 플러딩 기법)

  • JaeGal, Chan;Lee, Chae-Woo
    • 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.

A routing Algorithm by Broadcasting a Bitmap in Wireless Sensor Networks (무선 센서 네트워크에서의 비트맵 브로드캐스팅 라우팅 알고리즘)

  • Jung Sang-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.459-468
    • /
    • 2006
  • Current routing in sensor networks focuses on finding methods for energy-efficient route setup and reliable relaying of data from the sensors to the sink so that the lifetime of the network is maximized. The existing routing protocols do not have routing tables to determine a path when packets are transferred. A sensor network by a routing table increases a cost of maintaining and updating a path, because sensor nodes have characteristics to be mobile and constrained capacity and resources. This paper proposes a new routing algorithm by broadcasting a bitmap in order to reduce the number of messages transferred when routing paths are established. Each node has a routing table with a bitmap, which contains link information. A bitmap is formed two-dimensional array, which consists of each row and column represented with a bit. The node only updates its own bitmap if it receives a bitmap from another adjacent nodes after the broadcasting. There by, each node has a bitmap with partial links information not total links information on the network. The proposed routing algorithm reduces the number of messages for routing establishment at least 10% compared with the previous algorithms.

Design and Implementation of Query Processor for Moving Objects (이동객체를 위한 질의처리 컴포넌트의 설계 및 구현)

  • Kim, Kyoung-Sook;Kwon, O-Je;Byun, Hee-Young;Jo, Dae-Soo;Kim, Tae-Wan;Li, Ki-Joune
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.1 s.11
    • /
    • pp.31-50
    • /
    • 2004
  • With the growth of wireless communication networks and mobile devices taking in GPS, Location-Based Service(LBS) is becoming an integral part of mobile applications. LBS can deal with location-aware features such as persons holding mobile phones or vehicles equipped with GPS, and provide the users with the location information of the features. Thus it is necessary to develop moving object database systems to store, manage, and query moving objects which change their locations continuously as time passes. In this paper, we design and implement a query processing component which deals with moving objects as a key data type. For this component, we define a new SQL-like query language(called MOQL) and as a consequence, design and implement modules that analyze and execute queries. It supports various types of operators that process range queries, infer topological relations, compute trajectories, and find k-nearest neighbors. It can be used as a subsystem if other application systems which deal moving objects and also supports ADO.NET interface that can be used to interact end-users.

  • PDF

AFLRS: An AODV-based Fast Local Repair Scheme in Ad Hoc Networks (AFLRS: 애드 혹 네트워크에서 AODV에 기반한 빠른 경로 복구 기법)

  • 서현곤;김기형;서재홍
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.81-90
    • /
    • 2004
  • A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies without the use of any existing network infrastructure. The AODV (Ad Hoc On-Demand Distance Vector) Protocol is one of the typical reactive routing protocols, in that mobile nodes initiate routing activities only in the presence of data packets in need of a route. In this paper, we focus upon the local repair mechanism of AODV. When a link is broken, the upstream node of the broken link repairs the route to the destination by initiating a local route discovery process. The process involves the flooding of AODV control messages in every node within a radius of the length from the initiating node to the destination. In this paper, we propose an efficient local repair scheme for AODV called AFLRS (AODV-based Fast Local Repair Scheme). AFLRS utilizes the existing routing information in the intermediate nodes which have been on the active route to the destination before a link break occurs. AFLRS can reduce the flooding range of AODV control messages and the route recovery time because it can repair route through the intermediate nodes. For the performance evaluation of the proposed AFLRS, we have simulated the local repair mechanisms by using NS2 and AODV-UU. The performance results show that AFLRS can achieve faster route recovery than the local repair mechanism of AODV.

Performance Analysis of Fast Handover Scheme Based on Secure Smart Mobility in PMIPv6 Networks (프록시 모바일 IPv6 네트워크에서 안전한 스마트 이동성에 기반한 빠른 핸드오버 기법의 성능분석)

  • Yoon, KyoungWon;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.121-133
    • /
    • 2013
  • Defect-free transfer service on the Next-generation wireless network extensive roaming mobile node (MN) to provide efficient mobility management has become very important. MIPv6(Mobility IPv6) is one of mobility management scheme proposed by IETF(Internet Engineering Task Force), and IPv6-based mobility management techniques have been developed in various forms. One of each management techniques, IPv6-based mobility management techniques for PMIPv6 (MIPv6) system to improve the performance of a variety of F-PMIPv6 (Fast Handover for Proxy MIPv6) is proposed. However, the F-PMIPv6 is cannot be excellent than PMIPv6 in all scenarios. Therefor, to select a proper mobility management scheme between PMIPv6 and F-PMIPv6 becomes an interesting issue, for its potenrials in enhancing the capacity and scalability of the system. In this paper, we develop an analytical model to analyze the applicability of PMIPv6 and F-PMIPv6. Based on this model, we design an Secure Smart Mobility Support(SSM) scheme that selects the better alternative between PMIPv6 and F-PMIPv6 for a user according to its changing mobility and service characteristics. When F-PMIPv6 is adopted, SSM chooses the best mobility anchor point and regional size to optimize the system performance. Numerical results illustrate the impact of some key parameters on the applicability of PMIPv6 and F-PMIPv6. Finally, SSM has proven even better result than PMIPv6 and F-PMIPv6.

An Origin-Centric Communication Scheme to Support Sink Mobility for Continuous Object Detection in IWSNs (산업용 무선 센서망을 이용한 연속개체 탐지에서 이동 싱크 지원을 위한 발원점 중심의 통신방안)

  • Kim, Myung-Eun;Kim, Cheonyong;Yim, Yongbin;Kim, Sang-Ha;Son, Young-Sung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.12
    • /
    • pp.301-312
    • /
    • 2018
  • In industrial wireless sensor networks, the continuous object detection such as fire or toxic gas detection is one of major applications. A continuous object occurs at a specific point and then diffuses over a wide area. Therefore, many studies have focused on accurately detecting a continuous object and delivering data to a static sink with an energy-efficient way. Recently, some applications such as fire suppression require mobile sinks to provide real-time response. However, the sink mobility support in continuous object detection brings challenging issues. The existing approaches supporting sink mobility are designed for individual object detection, so they establish one-to-one communication between a source and a mobile sink for location update. But these approaches are not appropriate for a continuous object detection since a mobile sink should establish one-to-many communication with all sources. The one-to-many communication increases energy consumption and thus shortens the network lifetime. In this paper, we propose the origin-centric communication scheme to support sink mobility in a continuous object detection. Simulation results verify that the proposed scheme surpasses all the other work in terms of energy consumption.

A Study for Factors Influencing the Usage Increase and Decrease of Mobile Data Service: Based on The Two Factor Theory (모바일 데이터 서비스 사용량 증감에 영향을 미치는 요인들에 관한 연구: 이요인 이론(Two Factor Theory)을 바탕으로)

  • Lee, Sang-Hoon;Kim, Il-Kyung;Lee, Ho-Geun;Park, Hyun-Jee
    • Asia pacific journal of information systems
    • /
    • v.17 no.2
    • /
    • pp.97-122
    • /
    • 2007
  • Conventional networking and telecommunications infrastructure characterized by wires, fixed location, and inflexibility is giving way to mobile technologies. Numerous research reports point to the ultimate domination of wireless communication. With the increasing prevalence of advanced cell-phones, various mobile data services (hereafter MDS) are gaining popularity. Although cellular networks were originally introduced for voice communications, statistics indicate that data services are replacing the matured voice service as the growth engine for telecom service providers. For example, SK Telecom, the Korea's largest mobile service provider, reported that 25.6% of revenue and 28.5% of profit came from MDS in 2006 and the share is growing. Statistics also indicate that, in 2006, the average revenue per user (ARPU) for voice didn't change but MDS grew seven percents from the previous year, further highlighting its growth potential. MDS is defined "as an assortment of digital data services that can be accessed using a mobile device over a wide geographic area." A variety of MDS have been deployed, with a few reaching the status of killer applications. Many of them need to access the Internet through the cellular-phone infrastructure. In the past, when the cellular network didn't have acceptable bandwidth for data services, SMS (short messaging service) dominated MDS. Now, Internet-ready, next-generation cell-phones are driving rich digital data services into the fabric of everyday life, These include news on various topics, Internet search, mapping and location-based information, mobile banking and gaming, downloading (i.e., screen savers), multimedia streaming, and various communication services (i.e., email, short messaging, messenger, and chaffing). The huge economic stake MDS has on its stakeholders warrants focused research to understand associated dynamics behind its adoption. Lyytinen and Yoo(2002) pointed out the limitation of traditional adoption models in explaining the rapid diffusion of innovations such as P2P or mobile services. Also, despite the increasing popularity of MDS, unexpected drop in its usage is observed among some people. Intrigued by these observations, an exploratory study was conducted to examine decision factors of MDS usage. Data analysis revealed that the increase and decrease of MDS use was influenced by different forces. The findings of the exploratory study triggered our confirmatory research effort to validate the uni-directionality of studied factors in affecting MDS usage. This differs from extant studies of IS/IT adoption that are largely grounded on the assumption of bi-directionality of explanatory variables in determining the level of dependent variables (i.e., user satisfaction, service usage). The research goal is, therefore, to examine if increase and decrease in the usage of MDS are explained by two separate groups of variables pertaining to information quality and system quality. For this, we investigate following research questions: (1) Does the information quality of MDS increase service usage?; (2) Does the system quality of MDS decrease service usage?; and (3) Does user motivation for subscribing MDS moderate the effect information and system quality have on service usage? The research questions and subsequent analysis are grounded on the two factor theory pioneered by Hertzberg et al(1959). To answer the research questions, in the first, an exploratory study based on 378 survey responses was conducted to learn about important decision factors of MDS usage. It revealed discrepancy between the influencing forces of usage increase and those of usage decrease. Based on the findings from the exploratory study and the two-factor theory, we postulated information quality as the motivator and system quality as the de-motivator (or hygiene) of MDS. Then, a confirmative study was undertaken on their respective role in encouraging and discouraging the usage of mobile data service.

Distributed Grid Scheme using S-GRID for Location Information Management of a Large Number of Moving Objects (대용량 이동객체의 위치정보 관리를 위한 S-GRID를 이용한 분산 그리드 기법)

  • Kim, Young-Chang;Kim, Young-Jin;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.4
    • /
    • pp.11-19
    • /
    • 2008
  • Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

  • PDF

A New Fast Transcoder for Resizing Coded Video Sequences (부호화된 영상의 크기를 변환하는 새로운 고속 트랜스코더)

  • Park, Il-Woo;Cho, Yong-Gook;Myung, Jin-Su;Chae, Byung-Jo;Oh, Seoung-Jun;Yang, Chang-Mo;Cho, We-Duke
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.652-663
    • /
    • 2002
  • Recently, many advanced video application services over the mobile wireless networks have required a transcoder which can efficiently reduce the size of compressed video bitstreams. The transcoder can be worked in either the spatial domain or the DCT domain. In this paper, we propose a new fast hybrid-type transcoder which can efficiently reduce the frame size with keeping the visual quality. The proposed scheme consists of two major processes: a transform domain process and a spatial domain process. We also propose a scheme for coding mode selection and motion vector refinement. Experimental results show that our approach can reduce the computational complexity more than any other conventional spatial-domain transcoder with keeping the visual quality.

Cost-Effective Deployment and Operation of the IEEE802.16j based WiBro MMR Network (IEEE802.16j 기반 WiBro MMR 네트워크의 효율적 구축 및 운용에 관한 연구)

  • Ryu, Seungwan;Choi, Go-Bong;Myung, Kwangsik;Park, Seikwon;Cho, Choong-Ho;Lee, Hyong-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.2
    • /
    • pp.223-234
    • /
    • 2008
  • Mobile multi-hop relaying (MMR) technology is being considered as a promising solution capable to enhance coverage, user throughput, and system capacity of the current wired backbone dependent wireless access networks. Since the relaying nodes do not need a wired backbone access, MMR technology offers easy and low-cost deployment, flexible cell planning, and adaptive traffic handling performance. In this paper, we investigate performance and cost effectiveness of the MMR technology deployment in the IEEE802.16j based WiBro/WiMAX systems. We first introduce standardization activities and research issues of MMR WiBro/ WiMAX systems. Since the coverage extension problem may occur in metropolitan areas as well as suburban or rural areas where user density is relatively low or moderate, we introduce several MMR topologies and analyze cost-effectiveness of MMR based coverage extension with respect to the user traffic density. Then, we argue cost effect on MMR technology deployment and throughput performance, Finally, we introduce further study issues including sectorized base station based MMR deployment approaches and the single and multi-frame structure MMR approaches.