Why does it pay to be selfish in a MANET?

Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions     

A novel metal-insulator-metal structure for field-programmabledevices

A metal-insulator-metal (MIM) capacitor structure has been developed for use in field-programmable gate arrays (FPGAs) as a voltage-programmable link (VPL). The structure relies on a combination of a refractory metal and aluminum as the lower electrode, and either a similar combination or aluminum alone as the top electrode. The insulator is prepared by means of plasma-enhanced chemical vapor deposition (PECVD). It comprises a sandwich of nearly stoichiometric silicon dioxide interposed between two like layers of silicon-rich silicon nitride. The structure has displayed characteristics desirable for use in emerging FPGA technology, including high density, low on-resistance, reduced capacitance, and low programming voltage     

Fault tolerant multiple event detection in a wireless sensor network

With an increasing acceptance of Wireless Sensor Networks (WSNs), the health of individual sensor is becoming critical in identifying important events in the region of interest. One of the key challenges in detecting event in a WSN is how to detect it accurately transmitting minimum information providing sufficient details about the event. At the same time, it is also important to devise a strategy to handle multiple events occurring simultaneously. In this paper, we propose a Polynomial-based scheme that addresses these problems of Event Region Detection (PERD) by having a aggregation tree of sensor nodes. We employ a data aggregation scheme, TREG (proposed in our earlier work) to perform function approximation of the event using a multivariate polynomial regression. Only coefficients of the polynomial (P$P$) are passed instead of aggregated data. PERD includes two components: event recognition and event report with boundary detection. This can be performed for multiple simultaneously occurring events. We also identify faulty sensor(s) using the aggregation tree. Performing further mathematical operations on the calculated P$P$ can identify the maximum (max) and minimum (min) values of the sensed attribute and their locations. Therefore, if any sensor reports a data value outside the [min, max] range, it can be identified as a faulty sensor. Since PERD is implemented over a polynomial tree on a WSN in a distributed manner, it is easily scalable and computation overhead is marginal. Results reveal that event(s) can be detected by PERD with error in detection remaining almost constant achieving a percentage error within a threshold of 10%$10\%$ with increase in communication range. Results also show that a faulty sensor can be detected with an average accuracy of 94%$94\%$ and it increases with increase in node density.     

Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks

Localization algorithm continues to be an important and challenging topic in today's wireless sensor networks (WSNs). In this paper, a novel range-free localization algorithm using expected hop progress (LAEP) to predict the location of any sensor in a WSN is proposed. This algorithm is based on an accurate analysis of hop progress in a WSN with randomly deployed sensors and arbitrary node density. By deriving the expected hop progress from a network model for WSNs in terms of network parameters, the distance between any pair of sensors can be accurately computed. Since the distance estimation is a key issue in localization systems for WSNs, the proposed range-free LAEP achieves better performance and less communication overhead as compared to some existent schemes like DV-Hop and RAW. In addition, we study the effect of anchor placement on the algorithm performance by deriving the corresponding mean position error range. Extensive simulations are performed and the results are observed to be in good agreement with the theoretical analysis.     

Adaptive state-based multi-radio multi-channel multi-path routing in Wireless Mesh Networks

Wireless Mesh Networks (WMNs) are envisioned to seamlessly extend the network connectivity to end users by forming a wireless backbone that requires minimal infrastructure. Unfortunately for WMNs, frequent link quality fluctuations, excessive load on selective links, congestion, and limited capacity due to the half-duplex nature of radios are some key limiting factors that hinder their deployment. To address these problems, we propose a novel Adaptive State-based Multi-path Routing Protocol (ASMRP), which constructs Directed Acyclic Graphs (DAGs) from each Mesh Router (MR) to Internet Gateways (IGWs) and effectively discovers multiple optimal path set between any given MR-IGW pair. A congestion aware traffic splitting algorithm to balance traffic over these multiple paths is presented which synergistically improves the overall performance of the WMNs. We design a novel Neighbor State Maintenance module that innovatively employs a state machine at each MR to monitor the quality of links connecting its neighbors in order to cope with unreliable wireless links. We also employ a 4-radio architecture for MRs, which allows them to communicate over multiple radios tuned to non-overlapping channels and better utilize the available spectrum. Through extensive simulations using ns-2, we observe that ASMRP substantially improves the achieved throughput (～5 times gain in comparison to AODV), and significantly minimizes end-to-end latencies. We also show that ASMRP ensures fairness in the network under varying traffic load conditions.     

Polynomial based scheme (PBS) for establishing Authentic Associations in Wireless Mesh Networks

The varying degree of mobility of Mesh Clients has provided much more flexibility in Wireless Mesh Networks, and establishing an Authentic Association among entities is a non-trivial problem. In this paper, we introduce a Polynomial Based scheme which provides pair-wise connectivity, low communication, marginal storage overhead and high scalability while making on the fly Authentic Association feasible. The proposed scheme is also observed to be resilient against both traffic analysis and node capture attacks.     

Perimeter discovery in wireless sensor networks

In this paper, we focus on the perimeter detection problem using wireless sensor networks, as perimeter detection has a wide range of uses in several areas. We present a decentralized localized algorithm where sensor nodes determine if they are located along the perimeter of a wireless sensor network. Our proposed algorithm uses the location neighborhood information in conjunction with the Barycentric technique to determine if the sensor node enclosed by neighboring nodes, and consequently, if it is located within the interior of the wireless sensor network. We define performance metrics to analyze the performance of our approach and the simulation shows that the algorithm gives fairly accurate results.     

Distributed key management for dynamic groups in MANETs

Most existing solutions to group security in Mobile Ad Hoc Networks (MANETs) rely on a multicast Core Based Tree (CBT) for key distribution. Such solutions, although suitable for systems with low mobility and static characteristics, are unsuitable for dynamic and sparse groups with changing neighborhoods. In this paper, we propose an entirely decentralized key generation mechanism, employing a central trusted entity only during initialization. Using our approach, keys can be established between group members with absolutely no prior communication. The solution relies on threshold cryptography and introduces a novel concept of Node-Group-Key (NGK) mapping. We have provided an extensive analytical model for the computations involved and communication costs and have also provided a lie detection mechanism. Simulation results show appreciable performance improvement and enhanced robustness.     

A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem

Abstract: Every year, billions of dollars are spent on rail track maintenance to keep the serviceability of the railroad network. These maintenance projects (of different types) must be performed by suitable maintenance teams within a planning horizon. This article presents a time‐space network model to solve the track maintenance scheduling problem (TMSP). The objective is to minimize the total travel costs of the maintenance teams as well as the impact of maintenance projects on railroad operation, which are formulated by three types of side constraints: mutually exclusive, time window, and precedence constraints. An iterative heuristic solution approach is proposed to solve the large‐scale TMSP model with a large number of side constraints. The proposed model and solution approach are applied to a large‐scale real‐world problem. Compared to the current industry practice the model outcome eliminated all hard side‐constraint violations and reduced the total objective value (travel costs and soft side‐constraint violation penalties) by 66.8%.     

Heat transfer from a vertical fin array by laminar natural convection and radiation—A quasi‐3D approach

A quasi‐3D numerical model is developed to study the problem of laminar natural convection and radiation heat transfer from a vertical fin array. An enclosure is formed by two adjacent vertical fins and vertical base in the fin array. Results obtained from this enclosure are used to predict heat transfer rate from a vertical fin array. All the governing equations related to fluid in the enclosure, together with the heat conduction equation in both fins are solved by using the Alternating Direction Implicit (ADI) method for getting the temperatures along the height of the fin and the temperature of the fluid in the enclosure. Separate analysis is carried out to calculate the heat transfer rates from the end fins in the fin array. A numerical study has been carried out for the effect of fin height, fin spacing, fin array base temperature, and fin emissivity on total heat transfer rates and effectiveness of the fin array. The numerical results obtained for an eight‐fin array show good agreement with the available experimental data. Results show that the fin spacing is the most significant parameter and there exists an optimum value for the fin spacing for which the heat transfer rate from the fin array is maximum. Correlations are presented for predicting the total heat transfer rate, average Nusselt number, and effectiveness of the fin array. © 2011 Wiley Periodicals, Inc. Heat Trans Asian Res; Published online in Wiley Online Library ( wileyonlinelibrary.com/journal/htj ). DOI 10.1002/htj.20360