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.
In this paper a wafer-level chip-scale packing (WLCSP) for si-based driver using bump technique will be presented. The WLCSP is completely fabricated using conductive redistribution layer (RDL) technology which include dielectric material polyimide (PI) and RDL metallization, then the copper bumps are electroplated on the under bumping metallization (UBM) layer. The diameter of the bump is 200um and...
In the wireless sensor networks with multiple mobile sinks, the movement of sinks or failure of sensor nodes may leads to the breakage of existing routes. In order to repair broken path with lower communication overhead in terms of both energy and delay, we propose an efficient routing recovery protocol with endocrine cooperative particle swarm optimization algorithm to establish and optimize the...
This paper presents the routing recovery problem of mobile sink wireless sensor networks (mWSNs), which is caused by the sink mobility. We propose an immune orthogonal learning particle swarm optimization algorithm (IOLPSOA) based routing recovery method to build and optimize the alternative path, in order to repair the broken path and maintain the available route from the source nodes to the mobile...
Due to the lack of the mechanism within BGP to verify the authority of an Autonomous System (AS) to announce Network Layer Reachable Information (NLRI), a specific IP prefix may be hijacked by a suspicious AS, leading to Internet instability even crash. Current proposals either are still no widely deployed for expensive overhead and complex key management, such as S-BGP, soBGP, etc, or can be incrementally...
Cognitive networks become hotspot in the field of network research recently. It is considered a valid solution for heterogeneous networks. In this paper, we propose a new architecture of cognitive networks and divide its cognitive capabilities into three sub-layers named access cognitive layer, network cognitive layer and service cognitive layer. The aim of the design is to implement cognitive capabilities...
Multipath inter-domain routing can solve many technical flaws which have been exposed in BGP, but the market-driven factors have more direct relationship with its deployment. In order to analyze impact of these market-driven elements, this paper established an optimization model for Internet service provider (ISP) revenues based on user's utility function. Then, the solution using Lagrange multiplier...
A concentrator-based load balancing multi-path self routing switching fabric(LB-MPSR-C) was proposed recently, which was based on sorting concentrators, load-balanced and Birkhoff von-Neumann switching theory. This structure can achieve 100% throughput under admissible traffic pattern, its scalability for super large scale switching system and property of lowest hardware complexity have been deeply...
We address the problem of routing mobile agent with fusion cost in WSN under two scenarios: all source nodes, and a part of source nodes to be visited, respectively. Two objective functions in terms of minimizing transmission and fusion energy expenditure in the two scenarios are formulated, and proved to be NP-complete. Furthermore, we propose a two-level encoding based genetic algorithm (GA) to...
The problem of computing a route for a mobile agent to local regions or specified nodes in a distributed sensor network is considered, both in a single region or multi-region cases. With all specified nodes visited, this paper formulates the route computation problem in terms of minimizing an objective function, which is directly proportional to the energy consumption and path loss. Further, we propose...
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.