دانلود رایگان مجموعه مقالات علمی اشپرینگر در زمینه منطق فازی — بخش سی و دوم
منطق فازی (Fuzzy Logic) اولین بار در پی تنظیم نظریه مجموعه‌های فازی به وسیله پروفسور لطفی زاده (۱۹۶۵ میلادی) در صحنه محاسبات نو ظاهر شد. در واقع منطق فازی از منطق ارزش‌های «صفر و یک» نرم‌افزارهای کلاسیک فراتر رفته و درگاهی جدید برای دنیای علوم نرم‌افزاری و رایانه‌ها می‌گشاید، زیرا فضای شناور و نامحدود بین اعداد صفر و یک را نیز در منطق و استدلال‌های خود به کار می‌گیرد. در ادامه مقالات علمی انتشارات بین المللی اشپرینگر (Springer) در زمینه منطق فازی (Fuzzy Logic) برای دانلود آمده است. می توانید برای دانلود هر یک از مقالات از سرور دانلود متلب سایت، بر روی لینک دانلود هر یک از آن ها، کلیک کنید.
این نوشته حاوی بخشی از مجموعه کامل مقالات است. برای دریافت سایر بخش ها، به لینک زیر مراجعه نمایید:
دانلود رایگان مجموعه مقالات علمی اشپرینگر در زمینه منطق فازی — فهرست اصلی
| عنوان اصلی مقاله | Clustering and OFDMA-based MAC protocol (COMAC) for vehicular ad hoc networks |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Khalid Abdel Hafeez, Lian Zhao, Zaiyi Liao, Bobby Ngok-Wah Ma |
| چکیده / توضیح | The IEEE community is working on the wireless access in vehicular environments as a main technology for vehicular ad hoc networks. The medium access control (MAC) protocol of this system known as IEEE 802.11p is based on the distributed coordination function (DCF) of the IEEE 802.11 and enhanced DCF of the IEEE 802.11e that have low performance especially in high-density networks with nodes of high mobility. In this paper, we propose a novel MAC protocol where nodes dynamically organize themselves into clusters. Cluster heads are elected based on their stability on the road with minimal overhead since all clustering information is embedded in control channel's safety messages. The proposed MAC protocol is adaptable to drivers' behavior on the road and has learning mechanism for predicting the future speed and position of all cluster members using the fuzzy logic inference system. By using OFDMA, each cluster will use a set of subcarriers that are different from the neighboring clusters to eliminate the hidden terminal problem. Increasing the system reliability, reducing the time delay for vehicular safety applications and efficiently clustering vehicles in highly dynamic and dense networks in a distributed manner are the main contributions of our proposed MAC protocol. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | Fuzzy-assisted social-based routing for urban vehicular environments |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Rashid Hafeez Khokhar, Rafidah Md Noor, Kayhan Zrar Ghafoor, Chih-Heng Ke, Md Asri Ngadi |
| چکیده / توضیح | In the autonomous environment of Vehicular Ad hoc NETwork (VANET), vehicles randomly move with high speed and rely on each other for successful data transmission process. The routing can be difficult or impossible to predict in such intermittent vehicles connectivity and highly dynamic topology. The existing routing solutions do not consider the knowledge that behaviour patterns exist in real-time urban vehicular networks. In this article, we propose a fuzzy-assisted social-based routing (FAST) protocol that takes the advantage of social behaviour of humans on the road to make optimal and secure routing decisions. FAST uses prior global knowledge of real-time vehicular traffic for packet routing from the source to the destination. In FAST, fuzzy inference system leverages friendship mechanism to make critical decisions at intersections which is based on prior global knowledge of real-time vehicular traffic information. The simulation results in urban vehicular environment for with and without obstacles scenario show that the FAST performs best in terms of packet delivery ratio with upto 32% increase, average delay 80% decrease, and hops count 50% decrease compared to the state of the art VANET routing solutions. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | A framework for service provisioning in virtual sensor networks |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Lambros Sarakis, Theodore Zahariadis, Helen-Catherine Leligou, Mischa Dohler |
| چکیده / توضیح | The majority of research and development efforts in the area of Wireless Sensor Networks (WSNs) focus on WSN systems that are dedicated for a specific application. However, this trend is currently being replaced by resource-rich WSN deployments that are expected to provide capabilities in excess of any application's requirements. In this regard, the concept of virtual sensor networking is an emerging approach that enables the decoupling of the physical sensor deployment from the applications running on top of it, allowing in this way the dynamic collaboration of a subset of sensor nodes and helping the proliferation of new services and applications beyond the scope of the original deployment. In this context, the article presents the architecture of a system for the realization of Virtual Sensor Networks (VSNs). The aim of the proposed architecture is to enable the realization of scalable, flexible, adaptive, energy-efficient, and trust-aware VSN platforms, focusing on the reduction of deployment complexity and management cost, and on advanced interoperability mechanisms. The efforts have been put towards specifying a service provisioning architecture and mechanisms for advanced sensor and middleware design. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | An overview of learning mechanisms for cognitive systems |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Aimilia Bantouna, Vera Stavroulaki, Yiouli Kritikou, Kostas Tsagkaris, Panagiotis Demestichas, Klaus Moessner |
| چکیده / توضیح | Cognitive systems were first introduced by Mitola and in the last decade they have proved to be beneficial in self-management functionalities of future generation networks. The advantages and the way that networks gain benefits from cognitive systems is analysed in this article. Moreover, since such systems are closely related to machine learning, the focus of this article is also placed on machine learning techniques applied both in the network and the user devices side. In particular, celebrating 10 years of cognitive systems, this survey-oriented article presents an extended state-of-the-art of machine learning applied to cognitive systems as coming from the recent research and an overview of three different learning capabilities of both the network and the user device. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | A distributed multi-robot adaptive sampling scheme for the estimation of the spatial distribution in widespread fields |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Muhammad F Mysorewala, Lahouari Cheded, Dan O Popa |
| چکیده / توضیح | Monitoring widespread environmental fields is undoubtedly a practically important area of research with many complex and challenging tasks. It involves the building of models of the fields or natural phenomena to be monitored, the estimation of the spatio-temporal distribution of a variety of environmental parameters of interest, such as moisture or salinity in a crop field, or the spatial distribution of vital natural resources such as oil and gas, etc. Sampling, a key operation of the monitoring process, is a broad methodology for gathering statistical information about the phenomenon, or environmental variable, being monitored. To efficiently monitor widespread fields and estimate the spatio-temporal distribution of some particular environmental variable, calls for the use of a sampling strategy can fuse information from different scales of sensors. Such an attractive strategy is well catered for by both the capabilities and distributed nature of wireless sensor networks and the mobility of robots performing the sampling (sensing) tasks. This sampling strategy could even be rendered “adaptive” in that the decision of “where to sample next” evolves temporally with past measurements and is optimally computed. In this article, we examine various single-robot and multi-robot adaptive sampling schemes based on different extended Kalman filter filtering structures such as centralized and decentralized filters as well as our own novel decentralized and distributed filters. Our investigation shows that, whereas the first two filters suffer from a heavy computational or communication load, our proposed method, through its key feature of distributing the filtering task amongst the robots used, manages to reduce both loads and the total reconstruction time. It also enjoys the added attractive feature of scalability that allows the structure of the proposed monitoring scheme to grow with the complexity of the field under study. Our results are corroborated by our simulation work and offer ample encouragement for a further theoretical investigation of some properties of the proposed scheme and its implementation on a physical system. Both of these activities are currently underway. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | MDP-based handover policy in wireless relay systems |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Xiaoyu Dang, Jin-Yuan Wang, Zhe Cao |
| چکیده / توضیح | Wireless relay transmission has been considered as a supplementary technology for future wireless communication system, and handover is a key element in wireless relay transmissions to support users’ mobility. Handover failure will result in the forced termination of an ongoing call, and a good handover scheme will provide good system performance. This article focuses on the handover decision problem in wireless relay transmission systems. Initially, the architecture of a single-cell relay system is introduced. The handover decision problem is formulated as a Markov decision process (MDP). In the proposed model, a profit function is used to evaluate the quality-of-service of the chosen serving node, and a cost function is used to model processing load and signaling cost. Based on the profit and cost functions, the reward function is formulated. Moreover, the objective is to maximize the expected total reward per connection. The value iteration algorithm is employed to determine the optimal handover policy. Furthermore, the analysis is generalized to multi-cell relay systems. Numerical results show that the proposed MDP-based handover policy is well behaved in wireless relay systems. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | Admission control in wireless ad hoc networks: a survey |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Lyes Khoukhi, Hakim Badis, Leila Merghem-Boulahia, Moez Esseghir |
| چکیده / توضیح | Wireless mobile ad hoc networks (MANETs) have emerged as a key technology for next-generation wireless networking. Because of their advantages over other wireless networks, MANETs are undergoing rapid progress and inspiring numerous applications. However, many technical issues are still facing the deployment of this technology, and one of the most challenging aspects is the quality of service (QoS) provisioning for multimedia real-time applications. MANETs are expected to offer a diverse range of services to support real-time traffic and conventional data in an integrated fashion. Because of the diversified QoS requirements of these services, QoS models are needed for an efficient usage of network resources. One of the most crucial mechanisms for providing QoS support is admission control (AC). AC has the task of estimating the state of network's resources and thereby to decide which application data flows can be admitted without promising more resources than are available and thus violating previously made guarantees. In order to provide a better understanding of the AC research challenges in MANETs, this paper presents a detailed investigation of current state-of-the-art AC models in ad hoc networks. A brief outline of the admission function, feedback to route failures, as well as the advantages and drawbacks of each discussed model are given. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | Proactive integrated handoff management in cognitive radio mobile ad hoc networks |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Samad Nejatian, Sharifah Kamilah Syed-Yusof, Nurul Mu’azzah Abdul Latiff, Vahid Asadpour, Haleh Hosseini |
| چکیده / توضیح | In cognitive radio networks, the secondary users (SUs) switch the data transmission to another empty spectrum band to give priority to primary users (PUs). In this paper, channel switching in cognitive radio mobile ad hoc networks (CR-MANETs) through an established route is modeled. The probability of channel availability in this route is calculated based on the PU's activity, SU's mobility, and channel heterogeneity. Based on the proposed model, the channel and link availability time are predicted. These predictions are used for channel assignment in the proposed channel allocation scheme. A handoff threshold as well as a life time threshold is used in order to reduce the handoff delay and the number of channel handoffs originating from the short channel usage time. When the channel handoff cannot be done due to the SU's mobility, the local flow handoff is performed to find an appropriate node in the vicinity of a potential link breakage and transfer the current data flow to it. The local flow handoff is performed to avoid possible flow disruption and also to reduce the delay caused by the link breakage. The study reveals that the channel heterogeneity and SU's mobility must be considered as important factors, which affect the performance of the handoff management in the CR-MANETs. The results emphasize on the improvement of the route maintenance probability after using the local flow handoff. It is also stated that the amounts of handoff requirement and handoff delay are decreased after using the predicted channel usage life time and handoff threshold time. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | Optimizing end user QoS in heterogeneous network environments using reputation and prediction |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | David Giacomini, Anjali Agarwal |
| چکیده / توضیح | Telecommunication consumers are fueling a demand for mobile devices that are rapidly increasing in their capability to provide a wider range of services. These services in turn are consuming more bandwidth and require richer quality of service (QoS) in order to ensure a good end user experience when performing activities such as streaming video content or facilitating voice over IP. As a result, network providers are expanding and improving their coverage area while technology to establish Wi-Fi hotspots is becoming more accessible to every day users. This combination of increase in demand and accessibility, coupled with users' ever-increasing expectations for high quality service presents a growing need to seamlessly optimize the use of the overlaid heterogeneous networks in urban areas to maximize the end user experience via the use of a vertical handover mechanism (VHO). Grey systems theory has been used in a wide range of systems including economic, financial, transportation, and military to accurately forecast time series based on limited information. In this paper, we build on a novel reputation-based VHO decision rating system by proposing the use of the grey model first-order one variable, GM(1,1), in the handover decision making progress. The low complexity of the GM(1,1) model allows for a quick and efficient prediction of the future reputation score for a given network, providing deeper insight into the current state of the target network. Furthermore, simulations show that the proposed model, in comparison with the original reputation model, improves the decision capability of a mobile node and helps balance the load across the heterogeneous networks employing its strategy. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
| عنوان اصلی مقاله | I3S: Intelligent spectrum sensing scheme for cognitive radio networks |
| نوع مقاله | مقاله ژورنال |
| نویسندگان | Waleed Ejaz, Najam ul Hasan, Seok Lee, Hyung Seok Kim |
| چکیده / توضیح | Reliable spectrum sensing is one of the most crucial aspects for the successful deployment of cognitive radio (CR) technology. For CR, it is not possible to transmit on a licensed band and sense it simultaneously, therefore sensing must be interleaved with transmission. Spectrum sensing in CR is challenged by a number of uncertainties, which degrade the sensing performance and in turn require much more time to achieve the targeted sensing efficiency. Hence, the authors propose a spectrum sensing scheme which obtains reliable results with less mean detection time. First, the scheme determines a better matched filter, or a combination of energy and cyclostationary detectors based on the power and band of interest. In the combined energy and cyclostationary detector, an energy detector with a bi-threshold is used, and the cyclostationary detector is applied only if the energy of the signal lies between two thresholds. Second, sensing is performed by the selection choice resulting from the first step. To evaluate the scheme’s performance, the results are compared with those where only an energy detector, matched filter, or cyclostationary detector are performed. The performance metrics are the probability of detection, probability of false alarm, and mean detection time. |
| لینک های پیشنهادی | |
| لینک دانلود مقاله | (برای دانلود کلیک کنید) |
Loading...