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 proposes three algorithms based on the contention tree algorithm to improve the system performance by utilizing the different additional of feedback information. These three algorithms are derived from adding of skipped slots and/or adaptive frame size strategies. Average access delay is analyzed to evaluate the system performance which is measured in term of the number of used slots in...
A Wireless Sensor Network (WSN) consists of large number of small, inexpensive nodes that depend on their sensors, transmission and routing capabilities to collect and disseminate critical data. The energy consumption is a key design criterion for WSN routing algorithms due to the limited availability of energy within network nodes. Hence, energy-efficient routing mechanism is one of the most critical...
Large multiplication is widely used in modern cryptography systems, multimedia and signal processing applications. This paper presents three pipelined large multiplier (PLM) design methods that use specialized multiplier logic provided in modern FPGA platforms. The presented design methods provide efficient usage of symmetric multiplier resources. Also, they can be used to map a large multiplier even...
Nowadays, with the evolution of the mobile devices towards a multimode architecture, the users have the opportunity to utilize a wealth of services across a multitude of radio access technologies (RAT's). Variety of vertical handoff algorithms (VHA) have been proposed to help the user to select dynamically the best access network (BAN) in terms of quality of service. However, due to nature of VHA...
In order to ease congestion phenomenon in the case of limited resources of nodes, this paper presents an adaptive congestion control algorithm based on the node's priority. The proposed algorithm confirms prioritization according to the degree of congestion situation, and then adaptively chooses its probability of accessing channel in order to quickly relieve the congestion in this region. Experimental...
In the view of the large scale and increasing kinds of service of space information networks, a service- oriented topology control algorithm is proposed. According to demands of existing service, the topology of network is divided into several logical sub-topologies, on which construct the corresponding topology. Taking the communication pattern as an example, the augmentation-based approach is adopted...
The single message ferry routing scheme works well in the small scale clustered DTNs (Delay/Disruption Tolerant Networks). However, as the increasing of the network scale, this scheme will lead to high delay. To solve this problem, a hierachical multiple ferries routing scheme (HMFRS) was proposed in this paper. In this scheme, a message ferry and a ferry access point are deployed in each DTN cluster,...
Nodes in large-scale network are always divided into many clusters in order to facilitate network management. Super-node based P2P network is an example. The physical scope and the number of clusters are two conflicting objectives and clustering algorithm should strike a balance between them. In this paper, nodes clustering problem is formally described and pre-optimized k-means algorithm is put forward...
Delay Tolerant Networks (DTNs) are occasionally-connected networks. They have high latency, long queuing time, limited resources and intermittent connectivity, which are different from traditional networks. Message Ferry (MF) scheme provides efficient data delivery for DTNs. In the MF scheme, nodes move proactively to send and receive messages. In this paper, we propose a ferry routing scheme for...
The ZigBee wireless sensor network is an important supporting technology of IoT (Internet of Things). For the reason that various applications of IoT may incur heavy traffic on the network of ZigBee, and the existing methods of constructing ZigBee topology routing tree fail to consider both the link configuration and the busy-degree of the node, so the existing routing algorithm should be optimized...
Cloud computing services are becoming integral part of people's daily life. These services are supported by Internet data centers (IDCs). As demand for cloud computing services soars, energy consumed by IDCs is skyrocketing. This paper studies an energy management problem -- how to minimize energy cost for IDCs in deregulated electricity markets. While several existing works handle this problem by...
Track assignment is a critical step between global routing and detailed routing in modern VLSI chip designs. Crosstalk, which is largely decided by wire adjacency, has significant impact on interconnect delay and circuit performance. Therefore, the amount of crosstalk should be restrained in order to satisfy timing constraints. In this work, a novel track assignment algorithm is proposed to reduce...
Due to the limitation of DTN resource and intermittent connection, it's challenging to design a mechanism which achieves high message delivery successful ratio and control congestion to satisfy the demand. In this paper, a novel DTN congestion control routing mechanism, Ant Colony Optimization(ACO) for DTN congestion control algorithm(ADC) is proposed. In the message delivery, this mechanism can actively...
In order to accelerate logic simulation, it is highly beneficial to simulate the circuit design on FPGA hardware. This is often referred to as emulation, and we use the terms simulation and emulation interchangeably in this paper. However, limited hardware on FPGAs prevents large designs from being implemented on a single FPGA. Hence there is a need to partition the design and simulate it on a multi-FPGA...
The aim of this paper is to improve the energy efficiency during network discovery in heterogeneous networking environments. To this end, we propose a novel network discovery algorithm that exploits both user and network context information in order to efficiently adapt the network scanning period, thus avoiding unnecessary energy-consuming scanning or mis-detection of available networks that can...
When congestion happens at the node of DTN, the regular approach is to delete the old message of these nodes in order to make memory space for the new arrival message to remove congestion. A new method for the selection of message to delete, congestion control routing algorithm based on Simulated Annealing and regional movement (SARM) are proposed in this paper. This mechanism is under the premise...
To accommodate the dynamic characteristics in opportunistic networks, ``carry-and-forward'' technique is utilized. In this paradigm, the next hop forwarding relay node is usually decided by inferring future contact opportunities. A practical method is to predict future encounter time using nodes' contact history. But limited by prediction accuracy, this method has only an uncertain effect on improving...
Routing is one of the most significant challenges regarding mobile ad hoc networks (MANETs). Having no fixed infrastructure as well as frequent changes of network topology, as a result of nodes mobility, necessitates cooperation of all nodes in routing of packets. Lack of cooperation in routing can result in performance reduction and even network denial of service. Uncooperative behavior can be performed...
The lack of available and practical analysis about some regular knowledge of mobility models has limit their applications to mobile ad hoc networks. As the mobility models have the great significance effects on the network performance, and meanwhile, existing in-depth researches are mostly based on the i.i.d. mobility model which is a way of globe move, the desire for the effective and reasonable...
Ant colony optimization (ACO) is a kind of new type heuristically optimizing algorithm, having ability to organize itself. In order to solve the problem that QoS routing faces while study at present, this paper proposes a new QoS routing algorithm based on an improved ACO which introduces a routing quality based parameter adaptive mechanism. Simulation results demonstrate that the algorithm has a...
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.