Analysis and Improvement of the Nodes in GPRS protocol

Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 492

This Paper With 11 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICEECET03_063

تاریخ نمایه سازی: 6 اسفند 1395

Abstract:

We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router’s immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility’s frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR’s scalability on densely deployed wireless networks.

Keywords:

GPSR - Point - Sourse - Packet code - Delay

Authors

Younes Safari Sefid Chaghaei

Young Researchers & Elite Club, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran

Hamed Moradi

Young Researchers & Elite Club, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • ABRAMSON, N. The ALOHA system - another alternative for computer ...
  • B HARG HAVAN _ A., DEMERS, S., SHENKER, S., AND ...
  • BOSE, P., MORIN, P., STOJMENOV C, I., AND URRUTIA, J. ...
  • BROCH, J., MALTZ, D., JOHNSON, D., HU, Y., _ AND ...
  • CALI, F., CONTI, M., AND GREGORI, E. IEEE 802.11 wireless ...
  • C HANDRAKA SAN, A., AM I RTHARAJAP _ R., CHO, ...
  • FINN, G. G. Routing and addressing problems in large metrop ...
  • FLOYD, S., AND JACOBOSON, V. The synchronizati _ of periodic ...
  • GABRIEL, K., AND SOKAL, R. A new statistical approach to ...
  • HAAS, Z., AND PEARLMAN, M. The performance of query control ...
  • IEEE COMPITER SOCIETY LAN MAN STANDARDS COMMITTE .Wireless LAN Medium ...
  • JOHNSON, D. B., AND MALTZ, D. B. Dynamic source routing ...
  • KAHN, J. M., KATZ, R. H., AND PISTER, K. S. ...
  • KARN, P. MACA-a new channel access method for packet radio. ...
  • KARP, B. Geographic routing for wireless networks. Presentation at AFOSR ...
  • KARP, B. Greedy perimeter state routing. Invited Seminar at the ...
  • KO, Y., AND VAIDYA, N. Location-aided routing in mobile ad ...
  • LI, J., JANNOTTI, J., DECOUTO, D., KARGER, D., AND MORRIS, ...
  • MALTZ, D., BROCH, J., JETCHEVA, J., AND JOHNSON, D. The ...
  • PARK, V., AND CORSON, M. A highly adaptive distributed routing ...
  • PERKINS, C. Ad hoc _ demand distance vector (AODV) routing. ...
  • PERKINS, C., AND BHAGWAT, P. H ighly-dynamic de stinati on-sequenced ...
  • SALTZER, J., REED, D. P., AND CLARK, D. End-to-end arguments ...
  • SHEPARD, T. A channel access scheme for large dense packet ...
  • THE CMU MONARCH GROUP .Wireless and Mobility Extensions to ns-2. ...
  • TOUSSAINT, _ The relative neighborhood graph of a finite planar ...
  • WARD, A., JONES, A., AND HOPPER, A. A new location ...
  • ZAUMEN, W., AND GARC IA-LUNA ACEVES, J. Dynamics of distributed ...
  • Harsch, C.; Festag, A.; Papadimitratos, P., :Secure Position-Based Routing for ...
  • نمایش کامل مراجع