• Title/Summary/Keyword: 패킷 지불 방식

Search Result 5, Processing Time 0.027 seconds

A Mechanism for Handling Selfish Nodes using Credit in Sensor Networks (센서 네트워크에서 크레딧을 이용한 이기적인 노드 처리 방안)

  • Choe, Jong-Won;Yoo, Dong-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.2
    • /
    • pp.120-129
    • /
    • 2008
  • The purpose of sensor network is gathering the information from sensor nodes. If there are selfish node that deliberately avoid packet forwarding to save their own energy, the sensor network has trouble to collect information smoothly. To solve this problem we suggest a mechanism which uses credit payment schema according to the amount of forwarding packets. Sensor nodes use credits to send their own message and they forward packets of other sensor nodes to get credits. To offer authenticity we combined the roles of sink node and server, also we used piggybacking not to send additional report message. The packet trace route is almost fixed because sensor node doesn't have mobility. In this case, it happens that some sensor nodes which don't receive forwarding packets therefore they can't get credit. So, we suggested the way to give more credits to these sensor nodes. Finally, we simulated the suggested mechanism to evaluate performance with ns2(network simulator). As a result, packet transmission rate was kept on a high rate and the number of arrival packets to sink node was increased. Also, we could verify that more sensor nodes live longer due to deceasing the energy consumption of sensor nodes.

A Routing Independent Selfish Node Management Scheme for Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 라우팅 방식과 무관한 이기적인 노드 관리 방안)

  • Ahn, Sang-Hyun;Yoo, Young-Hwan;Lee, Jae-Woon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.149-155
    • /
    • 2006
  • Existing routing protocols for mobile ad hoc networks (MANETs) have assumed that all nodes voluntarily participate in forwarding others' packets. In the case when a MANET consists of nodes belonging to multiple organizations, mobile nodes may deliberately avoid packet forwarding to save their own energy, resulting in network performance degradation. In this paper, to make nodes volunteer in packet forwarding, a credit payment scheme called Protocol-Independent Fairness Algorithm (PIFA) is proposed. PIFA can be utilized irrespective of the type of basic routing protocols, while previous methods are compatible only with source routing mechanisms like DSR. According to simulation results, we can know that PIFA can prevent network performance degradation by inducing selfish nodes to participate in packet forwarding.

Fast Packet Filter ing using Network Coprocessor (네트워크 보조 프로세서를 사용한 고속 패킷 필터링)

  • Yi, Hong-Seok;Kim, Jong-Su;Chung, Ki-Hyun;Choi, Kyung-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.1129-1132
    • /
    • 2003
  • 사용자의 인터넷 서비스 고속화 요구가 증대되면서 스위치나 라우터 보안 장비와 같은 인터네트워킹 장비들의 성능 향상 요구도 커지고 있는데 이는 패킷을 처리하는 양과 속도를 향상시켜야 하다는 것을 의미한다. 스위치와 같은 라인 인터페이스 장치들은 주로 전용 하드웨어로 설계되므로 네트워크의 트래픽 처리 성능을 보장받을 수 있으나, 보안 장비나 네트워크 응용 장비들은 일반 서버 기반에서 트래픽을 처리하는 경우가 많아 시스템적으로 성능 향상에 제약을 받거나 성능 향상을 위해서 높은 비용을 지불해야 한다. 근래의 이러한 통신 관련 장비들에서의 패킷 처리 방식은 단순한 연결 차원을 넘어 패킷을 분석하고 연결을 제어하는 모습을 보이고 있는데 이러한 추가 작업 때문에라도 시스템에 많은 부하가 발생한다. 이러한 트래픽의 분석 처리를 빠르게 하기 위해서는 입력된 데이터와 설정된 규칙간의 비교와 판단이 빨라질 필요가 있는데, 본 논문에서는 이를 위해 기존에 연구된 몇 가지 S/W 적인 해결 방법과 H/W 적인 방법들을 분석하고, 더 나은 검색 성능을 위해 H/W 기반 네트워크 보조 프로세서를 이용한 방식을 제안하고 실험을 통하여 검증하였다.

  • PDF

Load-Balancing and Fairness Support Mechanisms in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서의 부하 균등화 및 공평성 지원 방법)

  • Ahn Sanghyun;Yoo Younghwan;Lim Yujin
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.889-894
    • /
    • 2004
  • Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

Pricing Decisions to Control Quality-of-Service in Integrated Voice/Data Mobile Communication System (음성/데이터 통합 이동통신시스템에서의 서비스 품질을 고려한 가격결정모델)

  • Kim Whan Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10B
    • /
    • pp.866-879
    • /
    • 2004
  • This paper presents a pricing model for maximizing a service provider's profit, taking into account consumers' quality-of-service dependent willingness to pay, in integrated voice/data mobile services. For the voice and the data services, time-sensitive pricing and volume-sensitive pricing mechanism will be applied, respectively, as in the case of Korea's mobile service market. Assuming that consumers are very sensitive to call interruption during handoff moments, the model presented here considers reserving guard channels exclusively for handoff traffic, in the process of frequency channels allocation, as well as guaranteeing consumers quality of service regarding call interruption rate. Ultimately, this model proposes a means to guarantee the quality of service in the short term, through pricing strategies as well as channel allocation policies, and the simulation results show that without expanding system resources, there exists a trade-off between profit and quality-of-service guarantee.