• Title/Summary/Keyword: Message Transmission Protocol

Search Result 229, Processing Time 0.026 seconds

Network Realization for a Distributed Control of a Humanoid Robot (휴머노이드 로봇의 분산 제어를 위한 네트윅 구현)

  • Lee Bo-Hee;Kong Jung-Shik;Kim Jin-Geol
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.485-492
    • /
    • 2006
  • This paper deals with implementation of network for distributed control system of a humanoid robot ISHURO(Inha Semyung Humanoid Robot). A humanoid robot needs much degree of freedom structurally and much data for having flexible movement. To realize such a humanoid robot, distributed control method is preferred to the centralized one since it gives a compactness, modularity and flexibility for the controllers. For organizing distributed control system of a humanoid robot, a control processor on a board is needed to individually control the joint motor and communication technology between the processors is required to transmit its information within control time. The processor is DSP-based processor and includes CAN network on a chip. It shares the computational load such as monitoring the sensor information and controlling the actuator between each of modules. In this paper, the communication architecture is suggested and its message protocol are discussed including message structure, time consumption for transmission, and controller structure at the view of distributed control for a humanoid robot. All of the sequence are simulated with Matlab and then verified with real walking experiment by ISHURO.

New Proxy Blind Signcryption Scheme for Secure Multiple Digital Messages Transmission Based on Elliptic Curve Cryptography

  • Su, Pin-Chang;Tsai, Chien-Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5537-5555
    • /
    • 2017
  • Having the characteristics of unlinkability, anonymity, and unforgeability, blind signatures are widely used for privacy-related applications such as electronic cash, electronic voting and electronic auction systems where to maintain the anonymity of the participants. Among these applications, the blinded message is needed for a certain purpose by which users delegate signing operation and communicate with each other in a trusted manner. This application leads to the need of proxy blind signature schemes. Proxy blind signature is an important type of cryptographic primitive to realize the properties of both blind signature and proxy signature. Over the past years, many proxy blind signature algorithms have been adopted to fulfill such task based on the discrete logarithm problem (DLP) and the elliptic curve discrete log problem (ECDLP), and most of the existing studies mainly aim to provide effective models to satisfy the security requirements concerning a single blinded message. Unlike many previous works, the proposed scheme applies the signcryption paradigm to the proxy blind signature technology for handling multiple blinded messages at a time based on elliptic curve cryptography (ECC). This innovative method thus has a higher level of security to achieve the security goals of both blind signature and proxy signature. Moreover, the evaluation results show that this proposed protocol is more efficient, consuming low communication overhead while increasing the volume of digital messages compared to the performance from other solutions. Due to these features, this design is able to be implemented in small low-power intelligent devices and very suitable and easily adoptable for e-system applications in pervasive mobile computing environment.

Modeling and Simulation of Fuzzy based Propagation Limiting Method for message routing in Wireless Sensor Networks (무선 센서 네트워크에서 메시지 라우팅을 위한 퍼지 기반 전달 영역 제한 기법의 모델링 및 시뮬레이션)

  • Chi, Sang-Hoon;Lee, Hae-Young;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.4
    • /
    • pp.29-39
    • /
    • 2006
  • Sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. A number of routing protocols to transmit the data between the base station and sensor nodes have been proposed. Intanagonwiwat et al. proposed the directed diffusion in which the base station sends interest messages and waits for data from the nodes in the specific regions. Since the directed diffusion propagates every interest message to whole nodes in the network, it causes energy dissipation of nodes. In this paper, we propose a novel data propagation method, which limits the data transmission area according to a threshold value for reducing the energy consumption in the network. A fuzzy logic is exploited to determine the threshold value by considering the energy and density of all the deployed nodes. The simulation models are designed and implemented based on DEVS formalism which is theoretically well grounded means of expressing discrete event simulation models.

  • PDF

A Survey of IEEE 1588 Time Synchronization Performance (IEEE 1588 시간 동기화 성능에 대한 조사)

  • Jahja, Rico Hartono;Jeon, Seong-Yong;Shin, Seok-Joo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.2
    • /
    • pp.165-176
    • /
    • 2015
  • Clock or time synchronization protocol is one of the crucial factors that could determine the quality of the communication. With the rapid development of the network technology, more robust clock synchronization algorithm is required. IEEE 1588 is one of the possible solutions for a robust clock synchronization algorithm; however, there are still some challenges that need to be concerned in IEEE 1588 in term of reducing and stabilizing the PDV value. This survey paper shows several solutions that could improve the performance of IEEE 1588, including modifying the PTP message transmission, optimizing PTP method, filtering techniques, and using the hardware timestamp instead of application layer timestamp, and so on. Despite the improvement that is created with these techniques, the clock synchronization algorithm is still an open issue in the network communication.

An AODV Re-route Methods for Low-Retransmission in Wireless Sensor Networks (무선센서네트워크에서 저-재전송율을 위한 AODV 경로 재설정 방법)

  • Son, Nam-Rye;Jung, Min-A;Lee, Sung-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.844-851
    • /
    • 2010
  • Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.

Efficient Channel Assignment Scheme in HiperLAN/2 WLAN (HiperLAN/2 무선랜에서 효율적인 채널할당방안)

  • Lim, Seog-Ku
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3654-3659
    • /
    • 2011
  • The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channels. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoints, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

Dynamic Channel Assignment Scheme Considering Number of Success and Collision in HiperLNA/2 WLAN (HiperLAN/2 무선랜에서 성공과 충돌수를 고려한 동적채널할당 방안)

  • Lim, seog-ku
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.682-686
    • /
    • 2009
  • The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoint, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed.

  • PDF

Electronic Musical Score Transmitting System (전자악보 전송 시스템)

  • Lee, Jun-Yeon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.5
    • /
    • pp.1640-1645
    • /
    • 2010
  • There exists an inconvenience that players of each instrument pass musical score in orchestra recital. In this paper, we implement the electronic musical score transmitting system that possible to hand sheet music automatically, using Mini - ITX and LCD Panel. We made them unite with a sheet music pair, and it was made and a message and data transmission were embodied using reliable TCP/IP socket communication. In this paper, the client hands sheet music automatic, and server implemented the manual function to manage each clients individually. Because one band can be managed by one Access file all together, it is easy to manage each band. Along with this, this system selects TCP/IP as the reliable transfer protocol that protect loss and errors.

Dynamic Channel Assignment Scheme Based on the Number of Success and Collision of Random Channel in HIPERLAN/2 (HIPERLAN/2에서 랜덤채널의 성공수와 충돌수에 기반한 동적 채널할당 방안)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.12 no.3
    • /
    • pp.347-353
    • /
    • 2011
  • In HIPERLAN/2, the radio channels are assigned by AP(Access Point) that is centrally operated and the MAC protocol is based on TDMA/TDD. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Hence the number of RCH should be allocated properly according to traffic. From these point, this paper proposes an scheme that dynamically assigned the number of RCH which is based on the number of success and collision of message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

Efficient RCH Assignment Scheme in HiperLNA/2 WLAN (HiperLAN/2 무선랜에서 효율적인 RCH 할당방안)

  • Lim, Seog-ku
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.987-990
    • /
    • 2009
  • The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoint, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed.

  • PDF