The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper investigates the resource allocation in terms of sub carrier assignment for maximizing the overall network throughput. In the existing subcarrier assignment algorithm, some users may obtain none of subcarrier while a few number of users with better channels obtain most of the resources. Therefore, we present an algorithm to solve the relay selection and resource assignment with the threshold...
Radio Frequency Identification system has some critical issues like tag collision and reader collision. Dynamic Framed Slotted Aloha is one of popular algorithms which is proposed to address tag collision issue in RFID. This method needs to guess the number of tags in each identification cycle to gain its best performance. So in this paper we propose a novel tag estimation method which is comprises...
The paper describes an adaptive control of MIMO (multi-input multi-output) systems under parametric uncertainty. A control algorithm consecutive compensator for doublechannel plant is analyzed. Applicability conditions of control law for foregoing plant are proposed. Efficiency of control scheme is illustrated by simulation results.
Mobile cloud computing (MCC) is a new converged computing paradigm. The central idea of MCC is to use powerful backend computing nodes to enhance capabilities of small devices. An effective approach to realize this is to use task migrations. There are already a number of research efforts to MCC helping to make decisions for task migrations. In this paper, we make a short survey on decision making...
Since Mark Weiser defined program slicing first time in his Ph.D thesis in 1979, number of papers have been presented in this area. Program slicing is a well known program analysis technique that extracts the elements of a program related to a particular computation. A large number of various program slicing variants have been studied and algorithms have been implemented to compute slice. This paper...
With the growth of internet, web technology evolved rapidly. Before 10 years nearly all webpages were static in nature, and with the growth of technology the major part of a web is dynamic in nature and updated frequently. For a website, website developer creates a master webpage with some static content which is dynamically reused on other webpages. In the previous research, the ranking of webpages...
A novel hybrid NAND Flash management strategy optimization algorithm is proposed in this paper, which can greatly improve the write performance and the efficiency of garbage collection. We improve the write speed of the system by a self-adaptively dynamic address mapping mechanism and considering the spatial locality and temporal locality of the sector address mapping table. So we call our algorithm...
Dijkstra algorithm is a classic algorithm of computing the shortest path between two points. In past the amount of urban vehicles is small, so the shortest path is the optimal one. However, with the increasing of cars, traffic congestion is serious. The path calculated by using traditional Dijkstra is still the shortest path, but it is not necessarily the optimal. Therefore, in order to solve the...
How to adjust parameters to adapt to the dynamic network conditions is a main problem in wireless communications. There are not any effective methods to deal with this problem, especially in non-saturation conditions. By analyzing feedback signal of channel, we introduce a linear adjustment rules of CW about idle slot intervals of channel, which can be used in non-saturation conditions. And then,...
With the emergence of Self-Organizing Network (SON) functions network operators are faced with a practical problem: coordination of SON instances. The SON functions are usually designed in a standalone manner, i.e. they do not take into account the possibility that other instances of the same or different SON functions may be running in the network. This creates the risk of conflicts and network instability...
Healthcare social networking has known a prominent popularity. Nowadays, millions of healthcare communities are appeared. Community detection methods in social networks have essentially focused on static graphs neglecting the temporal characteristics of net-works. Recently, motivated by the dynamic nature of real world projected on virtual social networks, an increasing number of evolutionary properties...
With the ease of carrying out an auction through internet, the electronic auction market is expanding rapidly. In online (i.e., continuous) eBay-like combinatorial auctions, bidders are allowed to join and leave the auction at any time, and in the process, bidders can repetitively bid on packages of items of their choice. In such multi-agent e-business systems, the seller is compelled to provide information...
Traffic accidents are a fact of life. While accidents are sometimes unavoidable, studies show that the long response time required for emergency responders to arrive is a primary reason behind increased fatalities in serious accidents. One way to reduce this response time is to reduce the amount of time it takes to report an accident. Smartphones are ubiquitous and with network connectivity are perfect...
To describe the dynamics taking place in networks that structurally change over time, we propose an approach to search for attributes whose value changes impact the topology of the graph. In several applications, it appears that the variations of a group of attributes are often followed by some structural changes in the graph that one may assume they generate. We formalize the triggering pattern discovery...
Most real-world social networks are inherently dynamic and composed of communities that are constantly changing in membership. As a result, recent years have witnessed increased attention toward the challenging problem of detecting evolving communities. This paper presents a game-theoretic approach for community detection in dynamic social networks in which each node is treated as a rational agent...
To reduce energy waste in future cellular networks, the most effective and reliable method is to close idle base stations when not needed, but how to find the proper and optimal method to control the target cell and the adjacent ones are still blank according to recent researches. In this work, we extend our research in cooperative scheme, and figure out a heuristic control method of eNodeBs in GREEN...
The Boltzmann Transport Equation (BTE) is a fundamental law governing the evolution of large sets of particles. BTE numerical solvers are involved in various physical contexts such as nuclear core simulation. A large class of BTE solvers are based on a so-called sweep algorithm that represents the vast majority of the computing operations. In this work, we present an implementation of this sweep algorithm...
An improved Rapidly-exploring Random Tree∗ (RRT∗) algorithm was given, which focused on the problem of UAV path planning in 3-D dynamic environment. By considering the constraint of the UAV, the frequency of collision checking in the searching stage was reduced. And this could save searching time. D∗ Lite algorithm was introduced to RRT∗ to solve the dynamic path planning problem. The information...
The route planning of RUAV (Reconnaissance Unmanned Aerial Vehicle) in unknown environment is a difficult problem, especially when goal is vague. In order to solve the problem, paper proposes the Regional Heuristic D∗(RHD∗) algorithm. This method divides the whole environment into a series of quasi-goal regions, and then calls RHD∗ algorithm to get the reference route. When the RUAV flying along with...
Routing in Mobile ad hoc Sensor Network (MASNet) have become a dynamic research area owing to its impact on various science and engineering applications. A secure multipath algorithm has been presented in this research which facilitates the nodes in MASNet to execute on-demand discovery and forming set of paths. An Enhanced Secure Multipath Routing (ESMR) is formed with an adaptive behaviour on route...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.