فیلترها/جستجو در نتایج    

فیلترها

سال

بانک‌ها




گروه تخصصی










متن کامل


اطلاعات دوره: 
  • سال: 

    1395
  • دوره: 

    3
تعامل: 
  • بازدید: 

    394
  • دانلود: 

    117
چکیده: 

لطفا برای مشاهده چکیده به متن کامل (PDF) مراجعه فرمایید.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 394

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 117
اطلاعات دوره: 
  • سال: 

    1395
  • دوره: 

    3
تعامل: 
  • بازدید: 

    219
  • دانلود: 

    103
چکیده: 

لطفا برای مشاهده چکیده به متن کامل (PDF) مراجعه فرمایید.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 219

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 103
اطلاعات دوره: 
  • سال: 

    1400
  • دوره: 

    51
  • شماره: 

    4
  • صفحات: 

    431-441
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    147
  • دانلود: 

    24
چکیده: 

Different types of contact, including contact between node pairs, any-contact of nodes, and contacts of the entire network, are used to characterize social relations in mobile social networks. Different modes of Routing, from the point of view of message delivery semantics, encompass unicasting, multicasting, any-casting, and broadcasting. Studies have shown that using probability distribution functions of contact data, which is mainly assumed to be homogeneous for nodes, improves the performance of these networks. However, there exists an important challenge in studies on distributions. A lot of works apply the distribution of one type of contact to other types. Hence in Routing applications, it causes to use of the distribution of one type of contact for any mode of Routing. This study provides a complete solution to model each type of homogeneous contact data distribution and to use them in different modes of Routing. We propose a Routing algorithm that uses this new model. Results show that our solution improves the average latency of comparing methods Epidemic, TCCB, and DR about 3.5-times, 30%, and 45%, respectively. It achieves a delivery rate of about 5% and 6%, and average latency about 6% and 8% better than that of DR and TCCB, respectively.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 147

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 24 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
اطلاعات دوره: 
  • سال: 

    1388
  • دوره: 

    15
تعامل: 
  • بازدید: 

    262
  • دانلود: 

    107
چکیده: 

لطفا برای مشاهده چکیده به متن کامل (PDF) مراجعه فرمایید.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 262

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 107
نویسنده: 

PARSA ALI | Moghim Neda

اطلاعات دوره: 
  • سال: 

    2016
  • دوره: 

    8
تعامل: 
  • بازدید: 

    134
  • دانلود: 

    0
چکیده: 

OPPORTUNISTIC Routing IS A NEW Routing PARADIGM IN WIRELESS AD-HOC NETWORKS. IN THIS PARADIGM, THE PACKETS ARE ROUTED WITH NO FIXED AND PREDETERMINED NEXT HOP IN THE NETWORK. BROADCAST NATURE OF WIRELESS MEDIUM IS USED IN OPPORTUNISTIC Routing AND THE NEXT HOP WILL BE SELECTED OF THE RECEIVERS OF A PACKET. A PROBLEM THAT HAS STILL REMAINED IN OPPORTUNISTIC Routing IS CONGESTION OCCURRENCE ALONG THE SHORTEST PATHS. THIS IS DUE TO UNSUITABLE NEXT HOP SELECTION THROUGH THE UTILIZED Routing METRIC. QUEUE LENGTH CONSIDERATION IN THE Routing METRIC IS NECESSARY BUT NOT SUFFICIENT TO AVOID NETWORK CONGESTION. THEREFORE, A Routing METRIC IS PROPOSED IN THIS PAPER THAT CONSIDERS THE TRANSMISSION RATE OF THE NODES IN ADDITION TO THEIR BACKLOG QUEUE. SIMULATION RESULTS SHOW THAT THE PROPOSED METRIC HAS BETTER PERFORMANCE COMPARED TO THE METRIC THAT ONLY CONSIDERS THE QUEUE LENGTH IN THE NEXT HOP SELECTION PROCEDURE.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 134

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
نویسندگان: 

VAIDYANATHAN B. | AHUJA R.K.

نشریه: 

TRANSPORTATION SCIENCE

اطلاعات دوره: 
  • سال: 

    2008
  • دوره: 

    42
  • شماره: 

    -
  • صفحات: 

    492-507
تعامل: 
  • استنادات: 

    1
  • بازدید: 

    132
  • دانلود: 

    0
کلیدواژه: 
چکیده: 

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 132

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
نویسندگان: 

ZAIN UL ABIDIN JAFFRI S.R.

اطلاعات دوره: 
  • سال: 

    2014
  • دوره: 

    4
  • شماره: 

    2
  • صفحات: 

    0-0
تعامل: 
  • استنادات: 

    1
  • بازدید: 

    95
  • دانلود: 

    0
کلیدواژه: 
چکیده: 

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 95

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسنده: 

Mohammadi somar Mehdi

اطلاعات دوره: 
  • سال: 

    2016
  • دوره: 

    3
تعامل: 
  • بازدید: 

    128
  • دانلود: 

    0
چکیده: 

WIRELESS SENSOR NETWORKS HAVE A LARGE NUMBER OF NODES WHICH INFORMATION DIFFUSION RELATED TO THEM REQUIRES THEIR OWN UNIQUE Routing. THE PROPOSED ALGORITHM PROVIDES MULTICAST CAPABILITY, MULTI-PATH FOR THE SENSOR NETWORKS. IN THE FOLLOWING, PROPOSED ALGORITHM (SMO WSN) COMPARED WITH ALGORITHMS SPBM & ODMRP. THEN RESEARCH SHOWS THAT THE PROPOSED ALGORITHM HAS BEEN USED BY THREE EVALUATION CRITERIA (AVG. END TO END PATH LENGTH, CONTROL OVERHEAD, PACKET DELIVERY RATIO) TO COMPARE WITH TWO OTHER ALGORITHMS, WHICH TO SOME EXTENT IMPROVEMENT EFFICIENCY OF THE PROPOSED ALGORITHM CAN BE REACHABLE IN COMPARED TO THE TWO OTHER ALGORITHMS. THEN WE WILL ACHIEVE TO A BALANCED DEGREE AMONG THESE THREE EVALUATION CRITERIA SO THAT PROPORTION AMONG THE CRITERIA WILL BE MADE. AND INSTEAD OF A COMPLETELY IMPROVEMENT OF ONE CRITERION AND LOSE OTHER CRITERIA, WE CAN OBTAIN THE CONVINCING AMOUNT FOR EACH OF THE CRITERIA. IT WILL DO BY CLASSIFYING ENVIRONMENT TO THE CERTAIN AREAS AND AT FIRST, EACH PACKET AMONG NODES BE DISTRIBUTED IN AREA. THEN THIS PACKAGE THROUGH SOME OF APPROPRIATE NODES WILL BE TRANSFERRED TO ADJACENT AREAS. IF THE AREA IS WITHOUT ANY NODES WHICH ARE MEMBERS OF MULTICAST GROUP SO THE PACKET WILL NOT BE DISTRIBUTED IN THAT AREA. EACH NODE IN ITS BUFFER CAN STORE UP IDENTIFIER OF EACH PACKET THAT HAS EVER SENT TO AVOID SENDING REDUNDANT PACKETS. IN THIS WAY, THE PACKETS THROUGH MULTIPLE PATHS AMONG DIFFERENT AREAS OF THE NETWORK ARE RELEASED.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 128

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
نویسندگان: 

BUTT S.E. | HOUSHYAR AMIR

نشریه: 

Scientia Iranica

اطلاعات دوره: 
  • سال: 

    2002
  • دوره: 

    9
  • شماره: 

    3
  • صفحات: 

    187-192
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    361
  • دانلود: 

    0
کلیدواژه: 
چکیده: 

With the changes in the workplace and the added element of competition, it is apparent that the efficient scheduling of resources such as machines, labor and material is extremely important. Scheduling covers a broad array of topics, such as machine scheduling and sequencing, vehicle and fleet scheduling, crew scheduling, employee scheduling, project scheduling, lot-size scheduling, interval (or reservation) scheduling and timetabling. This article reviews the literature to identify the state-of-the-art research on scheduling and Routing problems.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 361

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

SAHOO S. | KIM S. | KIM B.I. | KRAAS B. | POPOVJR A.

نشریه: 

INTERFACES

اطلاعات دوره: 
  • سال: 

    2005
  • دوره: 

    35
  • شماره: 

    1
  • صفحات: 

    24-36
تعامل: 
  • استنادات: 

    1
  • بازدید: 

    157
  • دانلود: 

    0
کلیدواژه: 
چکیده: 

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 157

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button