Search Results/Filters    

Filters

Year

Banks




Expert Group










Full-Text


Issue Info: 
  • Year: 

    1395
  • Volume: 

    3
Measures: 
  • Views: 

    394
  • Downloads: 

    0
Abstract: 

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

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 394

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Issue Info: 
  • Year: 

    1395
  • Volume: 

    3
Measures: 
  • Views: 

    219
  • Downloads: 

    0
Abstract: 

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

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 219

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Issue Info: 
  • Year: 

    2021
  • Volume: 

    51
  • Issue: 

    4
  • Pages: 

    431-441
Measures: 
  • Citations: 

    0
  • Views: 

    147
  • Downloads: 

    24
Abstract: 

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.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 147

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 24 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Writer: 

PARSA ALI | Moghim Neda

Issue Info: 
  • Year: 

    2016
  • Volume: 

    8
Measures: 
  • Views: 

    134
  • Downloads: 

    86
Abstract: 

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.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 134

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 86
Author(s): 

VAIDYANATHAN B. | AHUJA R.K.

Issue Info: 
  • Year: 

    2008
  • Volume: 

    42
  • Issue: 

    -
  • Pages: 

    492-507
Measures: 
  • Citations: 

    1
  • Views: 

    131
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 131

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2014
  • Volume: 

    4
  • Issue: 

    2
  • Pages: 

    0-0
Measures: 
  • Citations: 

    1
  • Views: 

    94
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 94

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2016
  • Volume: 

    3
Measures: 
  • Views: 

    126
  • Downloads: 

    66
Abstract: 

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.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 126

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 66
Author(s): 

BUTT S.E. | HOUSHYAR AMIR

Journal: 

Scientia Iranica

Issue Info: 
  • Year: 

    2002
  • Volume: 

    9
  • Issue: 

    3
  • Pages: 

    187-192
Measures: 
  • Citations: 

    0
  • Views: 

    361
  • Downloads: 

    225
Keywords: 
Abstract: 

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.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 361

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 225 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Journal: 

INTERFACES

Issue Info: 
  • Year: 

    2005
  • Volume: 

    35
  • Issue: 

    1
  • Pages: 

    24-36
Measures: 
  • Citations: 

    1
  • Views: 

    157
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 157

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 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