Facing limited network resources such as bandwidth and processing capability, the Internet will have congestion from time to time. In this paper, we propose a scheme to maximize the total utility offered by the network to the end user during congested times. We believe the only way to achieve our goal is to make the scheme application-aware, that is, to take advantage of the characteristics of the application. To make our scheme scalable, it is designed to be class-based. Traffic from applications with similar characteristics is classified into the same class. We adopted the RED queue management mechanism to adaptively control the traffic belonging to the same class. To achieve the optimal utility, the traffic belonging to different classes should be controlled differently. By adjusting link bandwidth assignments of different classes, the scheme can achieve the goal and adapt to the changes of dynamical incoming traffic. We use the control theoretical approach to analyze our scheme. In this paper, we focus on optimizing the control on two types of traffic flows: TCP and Simple UDP (SUDP, modeling audio or video applications based on UDP). We derive the differential equations to model the dynamics of SUDP traffic flows and drive stability conditions for the system with both SUDP and TCP traffic flows. In our study, we also find analytical results on the TCP traffic stable point are not accurate, so we derived new formulas on the TCP traffic stable point. We verified the proposed scheme with extensive NS2 simulations.

With the advent of ubiquitous computing society, many advanced technologies have enabled wireless sensor networks which consist of small sensor nodes. However, the sensor nodes have limited computing resources such as small size memory, low battery life, short transmission range, and low computational capabilities. Thus, decreasing energy consumption is one of the most significant issues in wireless sensor networks. In addition, numerous applications for wireless sensor networks are recently spreading to various fields (health-care, surveillance, location tracking, unmanned monitoring, nuclear reactor control, crop harvesting control, u-city, building automation etc.). For many of them, supporting security functionalities is an indispensable feature. Especially in case wireless sensor networks should provide a sufficient variety of security functions, sensor nodes are required to have more powerful performance and more energy demanding features. In other words, simultaneously providing security features and saving energy faces a trade-off problem. This paper presents a novel energy-efficient security architecture in an IEEE 802.15.4-based wireless sensor network called the Hybrid Adaptive Security (HAS) framework in order to resolve the trade off issue between security and energy. Moreover, we present a performance analysis based on the experimental results and a real implementation model in order to verify the proposed approach.

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

Users want to browse and search various web contents with mobile devices which can be used anywhere and anytime without limitations, in the same manner as desktop. But mobile devices have limited resources compared to desktop in terms of computing performance, network bandwidth, screen size for full browsing, and etc, so there are many difficulties in providing support for mobile devices to fully use desktop-based web contents. Recently, mobile network bandwidth has been greatly improved, however, since mobile devices cannot provide the same environment as desktop, users still feel inconvenienced. To provide web contents optimized for each user device, there have been studies about analyzing code to extract blocks for adaptation to a mobile environment. But since web contents are divided into several items such as menu, login, news, shopping, etc, if the block dividing basis is limited only to code or segment size, it will be difficult for users to recognize and find the items they need. Also it is necessary to resolve interface issues, which are the biggest inconvenience for users browsing in a mobile environment. In this paper, we suggest a personalized adaptation system that extracts item blocks from desktop-based web contents based on user interests, layers them, and adapts them for users so they can see preferred contents first.

Multiple-input multiple-output (MIMO) multiplexing is an attractive technology that increases the channel capacity without requiring additional spectral resources. The design of low complexity and high performance detection algorithms capable of accurately demultiplexing the transmitted signals is challenging. In this technical survey, we introduce the state-of-the-art MIMO detection techniques. These techniques are divided into three categories, viz. linear detection (LD), decision-feedback detection (DFD), and tree-search detection (TSD). Also, we introduce the lattice basis reduction techniques that obtain a more orthogonal channel matrix over which the detection is done. Detailed discussions on the advantages and drawbacks of each detection algorithm are also introduced. Furthermore, several recent author contributions related to MIMO detection are revisited throughout this survey.

We describe a method to decompose a cube with trilinear interpolation into a collection of tetrahedra with linear interpolation, where the isosurface topology is preserved for all isovalues during decomposition. Visualization algorithms that require input scalar data to be defined on a tetrahedral grid can utilize our method to process 3D rectilinear data with topological correctness. As one of many possible examples, we apply the decomposition method to topologically accurate tetrahedral mesh extraction of an interval volume from trilinear volumetric imaging data. The topological correctness of the resulting mesh can be critical for accurate simulation and visualization.