• Title/Summary/Keyword: mobile ad-hoc network

Search Result 808, Processing Time 0.025 seconds

Development of Energy Efficiency Routing Technique for Mobile Ad-hoc Sensor Network (모바일 에드-혹 센서 네트워크를 위한 에너지 효율적 라우팅 기법 개발)

  • Lee, YangMin;Lee, KwangYong;Lee, JaeKee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.547-548
    • /
    • 2009
  • The development of USN(Ubiquitous Sensor Network) technology is creating numerous application areas. Although a network configuration with fixed sensors was the norm in the past, the coexistence of mobile and fixed sensor nodes is a new trend. Fixed sensor networks focused on the energy efficiency of nodes, but the latest studies consider guaranteeing the mobility of nodes and maintaining their connectivity, while remaining energy efficient at the same time. This paper proposes a routing protocol for a mobile ad-hoc sensor network that improves the mobility, connectivity and energy efficiency of nodes while allowing for the management and maintenance of a large number of nodes even in a complex communication environment where mobile and fixed nodes coexist. An algorithm for multi-hop multi-paths, a technique for topology reconfiguration by node movement prediction and vibration sensors, path setting for a large number of nodes, and efficient data transfer technology have been introduced to implement the modified LEAHC-AOMDV protocol. Furthermore, the excellence of this protocol was verified through a comparative experiment with the conventional LEACH protocol.

A Connection Entropy-based Multi-Rate Routing Protocol for Mobile Ad Hoc Networks

  • Hieu, Cao Trong;Hong, Choong-Seon
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.3
    • /
    • pp.225-239
    • /
    • 2010
  • This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

Position-Based Multicast Routing in Mobile Ad hoc Networks: An Analytical Study

  • Qabajeh, Mohammad M.;Adballa, Aisha H.;Khalifa, Othman O.;Qabajeh, Liana K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1586-1605
    • /
    • 2012
  • With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

A Study on Wireless Home Network Platform for End-to-End Seamless Connection and TCP Performance Improvement (종단간 끊김없는 연결과 TCP 성능의 향상을 위한 무선 홈네트워크 플랫폼에 관한 연구)

  • Kim, Byoung-Hoon;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1295-1309
    • /
    • 2007
  • A wireless access point is used for all communications in the infrastructure mode wireless home networking, including communication between mobile nodes in the same service area. When a mobile station in the infrastructure mode wireless home networking moves into a dead zone, the communication between the mobile station and the access point is disconnected. To solve this problem, the existing wireless home network platforms focus on the ad hoc mode wireless home networking. However, the performance of an ad hoc network is poorly decreased when the number of mobile participating in the ad hoc network increases. In addition, although the ad hoc routing technique is necessary to support seamless communication of mobile nodes, the existing routing protocols, such as AODV and DSR, do not consider that a wireless channel state could affect performance significantly. Therefore, we propose a wireless home networking platform based on the ESCOD (End-to-end Seamless multi-hop COnnection based on Dual network mode) technique incorporating the VLR (Virtual Link Routing) scheme that supports end-to-end seamless connections. Extensive experiments show that the proposed wireless home networking platform incorporating the VLR scheme outperforms wireless home networking platforms based on the AODV and the DSR routing protocols respectively in terms of low packet transmission failure rate, fast packet transmission time, high TCP performance, and a wider coverage area of wireless home networks.

  • PDF

Secure Routing Mechanism using one-time digital signature in Ad-hoc Networks (애드혹 네트워크에서의 one-time 전자 서명을 이용한 라우팅 보안 메커니즘)

  • Pyeon, Hye-Jin;Doh, In-Shil;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.623-632
    • /
    • 2005
  • In ad-hoc network, there is no fixed infrastructure such as base stations or mobile switching centers. The security of ad-hoc network is more vulnerable than traditional networks because of the basic characteristics of ad-hoc network, and current muting protocols for ad-hoc networks allow many different types of attacks by malicious nodes. Malicious nodes can disrupt the correct functioning of a routing protocol by modifying routing information, by fabricating false routing information and by impersonating other nodes. We propose a routing suity mechanism based on one-time digital signature. In our proposal, we use one-time digital signatures based on one-way hash functions in order to limit or prevent attacks of malicious nodes. For the purpose of generating and keeping a large number of public key sets, we derive multiple sets of the keys from hash chains by repeated hashing of the public key elements in the first set. After that, each node publishes its own public keys, broadcasts routing message including one-time digital signature during route discovery and route setup. This mechanism provides authentication and message integrity and prevents attacks from malicious nodes. Simulation results indicate that our mechanism increases the routing overhead in a highly mobile environment, but provides great security in the route discovery process and increases the network efficiency.

A Research of LEACH Protocol improved Mobility and Connectivity on WSN using Feature of AOMDV and Vibration Sensor (AOMDV의 특성과 진동 센서를 적용한 이동성과 연결성이 개선된 WSN용 LEACH 프로토콜 연구)

  • Lee, Yang-Min;Won, Joon-We;Cha, Mi-Yang;Lee, Jae-Kee
    • The KIPS Transactions:PartC
    • /
    • v.18C no.3
    • /
    • pp.167-178
    • /
    • 2011
  • As the growth of ubiquitous services, various types of ad hoc networks have emerged. In particular, wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are widely known ad hoc networks, but there are also other kinds of wireless ad hoc networks in which the characteristics of the aforementioned two network types are mixed together. This paper proposes a variant of the Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol modified to be suitable in such a combined network environment. That is, the proposed routing protocol provides node detection and route discovery/maintenance in a network with a large number of mobile sensor nodes, while preserving node mobility, network connectivity, and energy efficiency. The proposed routing protocol is implemented with a multi-hop multi-path algorithm, a topology reconfiguration technique using node movement estimation and vibration sensors, and an efficient path selection and data transmission technique for a great many moving nodes. In the experiments, the performance of the proposed protocol is demonstrated by comparing it to the conventional LEACH protocol.

An Entropy-based Dynamic Routing Protocol for Supporting Effective Route Stability in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 효과적인 경로 안정성을 지원하기 위한 엔트로피 기반 동적 라우팅 프로토콜)

  • An, Beongku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.6
    • /
    • pp.29-34
    • /
    • 2008
  • In this paper, we propose an entropy-based dynamic routing protocol for supporting effective route stability in mobile ad-hoc wireless sensor networks(MAWSN). The basic ideas and features are as follows. First, construction of entropy-based stable routing route using mobility of nodes between a source node and a destination node. Second, usage of location and direction information for route construction to support resource saving. Third, We consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET. The simulation results show the proposed routing protocol can effectively support route stability and packet delivery ratio.

  • PDF

CooRP: A Cooperative Routing Protocol in Mobile Ad-hoc Wireless Sensor Networks (CooRP: 모바일 Ad-hoc 무선 센서 네트워크에서 협력 라우팅 프로토콜)

  • An, Beong-Ku;Lee, Joo-Sang;Kim, Nam-Soo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.6
    • /
    • pp.25-34
    • /
    • 2011
  • In this paper, In this paper, we propose a Cooperative Routing Protocol (CooRP) for supporting network convergence and transmission services efficiently in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main contributions and features of this paper are as follows. First, the routing routes are decided on route stability based on entropy concepts using mobility of nodes within the direction guided line region to increase the operational lifetime of routes as well as reduce control overhead for route construction. Second, a cooperative data transmission strategy based on the constructed stable routing route is used to increase packet delivery ratio with advanced SNR. Third, a theoretical analysis for cooperative data transmission of the proposed CooRP with outage probability is presented. The performance evaluation of the proposed CooRP is performed via simulation using OPNET and analysis. The results of performance evaluation show that the proposed CooRP by using stable routing routes and cooperative transmission can increase packet delivery ratio efficiently.

A Secure and Effective Optimal Path Searching Method on Certificate Chains in Mobile Ad hoc NETworks (모바일 애드흑 네트워크의 안전하고 효과적인 치적의 인증경로 탐색 기법)

  • Choi, Sung-Jae;Kim, Yong-Woo;Lee, Hong-Ki;Song, Joo-Seok;Nyang, Dae-Mon
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.310-317
    • /
    • 2005
  • In opposition to conventional networks, mobile ad hoc networks usually do not offer trust about nodes or online access through certificate authorities or centralized servers. But, nodes in those systems need process that can search path as well as trust each other to exchange data in safety For these reasons, traditional security measures that require online trusted authorities or certificate storages are not well-suited for securing ad hoc networks. In this paper, I propose a secure and effective method to search the optimized path using profitable flooding techniques on certificate chains in MANETS(Mobile Ad hoc NETworks). This system includes not only using routing protocols that are generally broadcasting packets but also finding nodes securely and verifing the process through tiust relationships between nodes that are searched.

CRARQ: A Cooperative Routing using ARQ-based Transmission in Mobile Ad-hoc Wireless Sensor Networks (CRARQ: 모바일 Ad-hoc 무선 센서 네트워크를 위한 ARQ 전송기반 협력도움 라우팅 프로토콜)

  • Duy, Tran-Trung;An, Beong-Ku;Kong, Hyung-Yun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.2
    • /
    • pp.36-43
    • /
    • 2009
  • In this paper, we propose a Cooperative Routing using ARQ-based Transmission (CRARQ) in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The goals of the CRARQ are to improve both the efficiency of transmission and the reliability of transmission together. The main features and contributions of the proposed CRARQ for supporting these goals are as follows. First, CRARQ uses a reactive concept to construct a route from a source to a destination. Second, CRARQ chooses the most stable relay at each hop along the route by mobility-based strategy. Third, cooperative transmission using the ARQ technique which can improve reliability is used at each hop to send data packets from source to destination. Finally, we present a theoretical analysis model for the proposed CRARQ. The performance evaluation of our protocol is implemented via simulation using Optimized Network Engineering Tool (OPNET) and analysis. The results of both simulation and analysis show that CRARQ achieves the improved packet delivery ratio (PDR) and outage probability.