• Title/Summary/Keyword: Mobile Ad-hoc Wireless Networks

Search Result 284, Processing Time 0.024 seconds

A Design of Sensor Web service Framework for Wireless Sensor Networks Environment (무선 센서 네트워크 환경에 대한 센서 웹 서비스 프레임워크의 설계)

  • Kim, Yong-Tae;Jeong, Yoon-Su;Park, Byung-Joo;Park, Gil-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.123-131
    • /
    • 2009
  • In this paper, we design ZigBee RF based framework for mobile web service on collected data by sensor node and transmitting data to data base by sensor network and remote sensing server through wireless connection. The proposed system is an integrated platform of sensor network for the sensor management and providing SOA based sensor web access. This paper combines SOA technology with sensor network. composes sensor node as web view, and provides high capability. extensiveness, reliability, and usability to the user who accesses to sensor web. The mobile message conversion module, SOAP message processing module. WSDL message generator, and mobile web service module is embodied for improving the capacity of the framework. The capacity evaluation of local wireless communication system which is proposed in this paper is analyzed through NS-2 simulation.

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.

Evaluation on Routing Protocols over MANETs with Fading Channel (Fading 채널의 MANET에서의 라우팅 프로토콜 성능 분석)

  • Afzal, Muhammad Khalil;Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.41-46
    • /
    • 2011
  • Mobile Ad-Hoc networks (MANET) has been getting the spotlight in the area of the wireless networks because of its flexibility and salability, and developing of many applications with it. As a consequence, MANETs are required to process not only simple data traffics, but also multimedia traffics, which has some constraints on the performances. However, unlike wired-networks, the wireless networks have frequent route-disconnections due to some reasons such as channel errors and mobility. Such frequent link disconnections makes the delivery of multimedia traffics difficult. Even though there many researches on multimedia transmissions on various environments, the performances of multimedia transmissions over fading channel and mobility even using various routing protocols have not been evaluated. Therefore, this paper extensively simulates the MPEG-4 video transmission over fading channel environment with node's mobility. In addition, the performances with two routing protocols such as AODV and DSR are compared. Finally, the simulation results shows that DSR protocol has the better performances to deliver MPEG-4 traffic.

Design and Implementation of DYMO Protocol Using NanoQplus in Wireless Sensor Networks (무선 센서 네트워크에서 NanoQplus를 이용한 DYMO 프로토콜 설계와 구현)

  • Oh, Su-Taek;Bae, Jang-Sik;Jeong, Hong-Jong;Kim, Dong-Kyun;Park, Jung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.184-191
    • /
    • 2008
  • NanoQplus, which is an embedded operating system for wireless sensor networks (WSNs) and developed by Electronics and Telecommunications Research Institute (ETRI), provides programmer-friendly preemptive multi-threading programming technique, but it has poor network protocol stack, as compared to TinyOS, one of the famous operating systems for WSNs. In this paper, we apply dynamic MANET on-demand routing (DYMO) protocol, which is being standardized in Internet Engineering Task Force (IETF), to NanoQplus. Since DYMO has been proposed for mobile ad-hoc networks (MANETs) and MANETs have less resource restrictions than WSNs, the basic DYMO protocol cannot be applied to WSNs without modifications. Moreover, coherence with MAC protocol should be considered in order to eliminate redundant data between MAC and network layers. Thus, we propose a modified version of the basic DYMO protocol for NanoQplus. The experimental results from a real sensor network test-bed show that the DYMO implementation using NanoQplus works efficiently in WSNs.

Adaptive Power Saving Protocol Based on Traffic Estimation for Wi-Fi Direct Networks (Wi-Fi Direct 망을 위한 부하량 예측 기반의 전력 절감 기법)

  • Yoo, Hongseok;Park, Yang-Woo;Lee, Chae-Soo;Yun, Tae-Jin
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.4
    • /
    • pp.207-212
    • /
    • 2015
  • Wi-Fi Direct allows battery powered mobile devices to form a wireless ad hoc network. Since one member of the network called Group Owner (GO) takes the role of managing the network, the network lifetime is mainly affected by the energy efficiency of GO. Hence, Wi-Fi Direct defines power saving schemes that allow GO to save the energy by turning off its radio interface during the periods called absence periods. However, the Wi-Fi Direct specification does not specify how to set parameters (denoted by PS parameters) determining the schedule of the absence periods. In this paper, we therefore propose a novel traffic-aware power saving scheme for Wi-Fi Direct networks. In particular, the proposed scheme estimates the application-level traffic load and adaptively tunes the PS parameters according to the estimated value.

Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs

  • Kumar, Adarsh;Gopal, Krishna;Aggarwal, Alok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.1119-1143
    • /
    • 2014
  • Lightweight trust mechanism with lightweight cryptographic primitives has emerged as an important mechanism in resource constraint wireless sensor based mobile devices. In this work, outlier detection in lightweight Mobile Ad-hoc NETworks (MANETs) is extended to create the space of reliable trust cycle with anomaly detection mechanism and minimum energy losses [1]. Further, system is tested against outliers through detection ratios and anomaly scores before incorporating virtual programmable nodes to increase the efficiency. Security in proposed system is verified through ProVerif automated toolkit and mathematical analysis shows that it is strong against bad mouthing and on-off attacks. Performance of proposed technique is analyzed over different MANET routing protocols with variations in number of nodes and it is observed that system provide good amount of throughput with maximum of 20% increase in delay on increase of maximum of 100 nodes. System is reflecting good amount of scalability, optimization of resources and security. Lightweight modeling and policy analysis with lightweight cryptographic primitives shows that the intruders can be detection in few milliseconds without any conflicts in access rights.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

Design of A-GBSR Protocol Using Beacon Message in 802.11p WAVE (802.11p WAVE에서 비콘메시지를 이용한 A-GBSR 프로토콜 설계)

  • Jeong, Seon-Mi;Kim, Hyun-Ju;Kim, Chang-Geun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1554-1560
    • /
    • 2015
  • 802.11p WAVE is the next-generation wireless communication that can make Ad-hoc network communication possible for Vehicle-to-Vehicle. GBSR protocol, one of the 802.11p WAVE protocols, mainly focuses on improvements in networks that have a tendency to disconnect. However, it does not consider the transmission time and velocity of a packet thus, there is a disadvantage of there being a delay in the transmission velocity, in urgent situations like car accidents, emergency patients transportation and crimes. In this paper, we proposed A-GBSR protocol for transmission of a packet to mobile node which has a high speed through the improved beacon message and Adaptive Neighbor list Management that are considering of the GBSR protocol transmission velocity.

Case Study for Ship Ad-hoc Networks under a Maritime Channel Model in Coastline Areas

  • Su, Xin;Yu, HaiFeng;Chang, KyungHi;Kim, Seung-Geun;Lim, Yong-Kon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4002-4014
    • /
    • 2015
  • ITU-R M.1842-1, as a well-known specification dedicated to maritime mobile applications, has standardized wireless transmission protocols according to the particular characteristics of a maritime communications scenario. A time division multiple access (TDMA) frame structure, along with modulation schemes to achieve a high data rate, has been described clearly in ITU-R M.1842-1. However, several specification items are still under "to be decided" status, which brings ambiguity to research works. In addition, the current version of ITU-R M.1842-1 is focused mainly on maritime transmissions in open-sea areas, where the cyclic prefix (CP) is set to zero and only 16-QAM is used in the multi-carrier (MC) system. System performance might be dramatically degraded in coastline areas due to the inter-symbol interference (ISI) caused by selective fading. This is because there is a higher probability that the signal will be reflected by obstacles in coastline areas. In this paper, we introduce the transmission resource block (TRB) dedicated to ITU-R M.1842-1 for a ship ad-hoc network (SANET), where the pilot pattern of TRB is based on the terrestrial trunked radio (TETRA). After that, we evaluated SANET performance under the maritime channel model in a coastline area. In order to avoid noise amplification and to overcome the ISI caused by selective fading, several strategies are suggested and compared in the channel estimation and equalization procedures, where the link-level simulation results finally validate our proposals.

A New Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 새로운 키 사전 분배 구조)

  • Kim, Tae-Yeon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.183-188
    • /
    • 2009
  • Wireless sensor networks will be broadly deployed in the real world and widely utilized for various applications. A prerequisite for secure communication among the sensor nodes is that the nodes should share a session key to bootstrap their trust relationship. The open problems are how to verify the identity of communicating nodes and how to minimize any information about the keys disclosed to the other side during key agreement. At any rate, any one of the existing schemes cannot perfectly solve these problems due to some drawbacks. Accordingly, we propose a new pre-distribution scheme with the following merits. First, it supports authentication services. Second, each node can only find some indices of key spaces that are shared with the other side, without revealing unshared key information. Lastly, it substantially improves resilience of network against node capture. Performance and security analyses have proven that our scheme is suitable for sensor networks in terms of performance and security aspects.