Real-time Distributed Graph Partition and Embedding of Large Network (2018)

W. Qi, Bin Xie, etc. "Real-time Distributed Graph Partition and Embedding of Large Network," CCgrid, IEEE, 2018, Submitted.

Optimize the Spectrum Sensing and Decision Making Strategies under Uncertainty for SATCOM (2016)

W. Qi, H. Li, S. Agarwal, K. Pham, Bin Xie, "Optimize the Spectrum Sensing and Decision Making Strategies under Uncertainty for SATCOM," MILCOM, IEEE, 2016.

Abstract:

The ability to provide accurate spectrum sensing and decision making under an uncertainty environment is proving useful for the military SATCOM to increases the spectrum utilization. Dynamic spectrum access(DSA) allows a secondary user to access the spectrum holes that are not occupied by the primary users. However, the spectrum sensing for DSA is normally performed in a complex SATCOM environment under uncertainty, caused by the high GEO/LEO mobility, weak signals after a long distance of propagation, the high interference and jamming in an adversarial environment, etc. The uncertainty results in a high error probability in the spectrum sensing. In such a case, DSA requires a decision-making process to optimally determine which channels to sense and access. In this paper, we propose an approach for optimal spectrum sensing and decision making that mathematically models the uncertainty in the SATCOM while the whole system throughput is maximized. Specifically, we model the DSA with decision making as a Partially Observable Markov Decision Process (POMDP) problem. Optimal DSA strategy has been discussed by an optimization process. Monte Carlo simulations are carried out and our simulation results demonstrate the efficiency of the proposed DSA strategy.

An Inverse Problem in Wireless Mesh Network (2015)

M. S. Khan, A. Kumar, Bin Xie "An Inverse Problem in Wireless Mesh Network," Accepted CyberC 2015, IEEE, 2015.

Abstract:

The wireless mesh network technology has been studied extensively over the last few years. It can be deployed to provide the broadband Internet services in rural and geographically disadvantaged areas, due to the ability to enable the extended coverage. It also provides an alternative to the last mile broadband access. In this paper, we present a network performance analysis using the network tomography paradigm to estimate the end-to-end link performance of the information flows over the mesh networks. A network tomography base routing scheme Expectation-Maximization (EM) routing approach is proposed to estimate the network flow performance such as delay, which again can be used for routing optimization over the network to achieve desirable performance. We then compare the estimated results with the NS-2 simulations.

Privacy-preserving Ranked Multi-Keyword Search Leveraging Polynomial Function in Cloud Computing (2014)

Y. Ren, Y. Chen, J. Yang, and Bin Xie, "Privacy-preserving Ranked Multi- Keyword Search Leveraging Polynomial Function in Cloud Computing," In Pro- ceeding of Globecom, IEEE, 2014.

Abstract:

The rapid deployment of cloud computing provides users with the ability to outsource their data to public cloud for economic savings and flexibility. To protect data privacy, users have to encrypt the data before outsourcing to the cloud, which makes the data utilization, such as data retrieval, a challenging task. It is thus desirable to enable the search service over encrypted cloud data for supporting effective and efficient data retrieval over a large number of data users and documents in the cloud. Existing approaches on encrypted cloud data search either focus on single keyword search or become inefficient when a large amount of documents are present, and thus have little support for the efficient multi-keyword search. In this paper, we propose a light-weight search approach that supports efficient multi-keyword ranked search in cloud computing system. Specifically, we first propose a basic scheme using polynomial function to hide the encrypted keyword and search patterns for efficient multi-keyword ranked search. To enhance the search privacy, we propose a privacy-preserving scheme which utilizes the secure inner product method for protecting the privacy of the searched multi-keywords. We analyze the privacy guarantee of our proposed scheme and conduct extensive experiments based on the real-world dataset. The experiment results demonstrate that our scheme can enable the encrypted multi-keyword ranked search service with high efficiency in cloud computing.

CAPPA: Context Aware Privacy Protecting Advertising - An Extension to CLOPRO Framework (2014)

A. Pandit, P. Polina, Anup Kumar, Bin Xie, "CAPPA: Context Aware Privacy Protecting Advertising - An Extension to CLOPRO Framework," IEEE Services computing conference (SCC-2014), Alaska, pages 805-812.

Abstract:

Advent of 4G networks, IPV6 and increased number of subscribers to these, has triggered many free applications that are easy to install on smart mobile devices, a primary computing device for many. The free application markets are sustainable as revenue model for most of these service providers is through profiling of users and pushing of the advertisements to the users. This imposes a serious threat to user's privacy. Most of the existing solutions starve the developers of their revenue by falsifying / altering the information of the users. In this paper, we attempt to bridge this gap by extending our integrated Context Cloaking Privacy Protection framework (CLOPRO) that achieves identity privacy, location privacy, and query privacy without depriving the service provider of sustainable revenue generated through the use of the Context Aware Privacy Preserving Advertising (CAPPA). The CLOPRO framework has been shown to provide privacy to the user while using location based services. In this paper we demonstrate how this framework can be extended to deliver the advertisements / coupons based on users interests, specified at the time of registration, and the current context of the user without revealing these details to the service provider. The original service requests of the registered users are modified by the CLOPRO framework using concepts of clustering and abstraction. The results are filtered to deliver the relevant information to the user. Since the advertisements received are relevant to the user, the click rate is likely to increase ensuring increased revenue for service provider. The proposed framework has O(n) complexity.

SD2S: Social-based Distributed Data Storage (2013)

Phani Polina, Tuan T. Tran, Bin Xie, and Anup Kumar, “SD2S: Social-based Distributed Data Storage,” In Proceeding of IEEE Local Computer Network (LCN), 2013.

Abstract:

Storing large amounts of data is challenging as it requires large reliable storage space. Currently, peer-to-peer(P2P) systems have been implemented for this purpose. However, these systems provide no guarantee of data retrieval as the data availability is determined by the interest of the users. On the other hand, cloud storage systems, built on top of a pool of powerful servers, can provide reliable data storage; however, they are costly and vulnerable to privacy leakage. This paper proposes a novel distributed data storage system based on the social networks. Particularly, our system utilizes the social information of the users to find the potential storage nodes. The storage nodes are then selected based on the social ties with the data owner. In order to quickly obtain the potential storage nodes, we provide an efficient algorithm to search and compute the social ties in the social networks. The system performance is verified through both theoretical analysis and simulations. The results show that data stored in our proposed system is reliable and stable given the random nature of storage nodes joining and leaving the system. A marginal performance gain is achieved in comparison to P2P systems.

Showcase of a Fragment-based Distributed Cloud Storage System (2013)

Tuan T. Tran, P. Polina, X. Tang, Z. Jia, Y. Yang, A. Kumar, Bin Xie, “Showcase of a Fragment-based Distributed Cloud Storage System,” In Proceeding of IEEE Local Computer Network (LCN), 2013.

Abstract:

We propose to demonstrate a prototype of fragment-based distributed cloud storage system. The prototype is implemented by using efficient encoding/decoding, multiple-layer encryption and spatial data distribution for data efficiency and security. We will demonstrate that the proposed prototype offers significant improvement of data protection, compared with the file-based storage system, on both data reliability and security. For example, we will show that how fragment-based user data is processed and distributed over the cloud, or from security aspect, we will show how the system copes with the cybersecurity attacks during which some of the storage nodes are compromised (e.g., all stored data is lost and storage nodes are inaccessible.) The demonstration is performed via a web-based interface on several mobile devices which remotely connect to our prototype via the Internet.

Fuzzy Keyword Search in Cloud Computing (2013)

Yanzhi Ren, Yingying Chen, Bin Xie, Willam J. Maxey, “Fuzzy Keyword Search in Cloud Computing,” In Proceeding of IEEE CNS, 2013.

Abstract:

As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a very challenging task. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. That is, there is no tolerance of minor typos and format inconsistencies which, on the other hand, are typical user searching behavior and happen very frequently. This significant drawback makes existing techniques unsuitable in Cloud Computing as it greatly affects system usability, rendering user searching experiences very frustrating and system efficacy very low. In this paper, for the first time we formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search greatly enhances system usability by returning the matching files when users' searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity and develop an advanced technique on constructing fuzzy keyword sets, which greatly reduces the storage and representation overheads. Through rigorous security analysis, we show that our proposed solution is secure and privacy-preserving, while correctly realizing the goal of fuzzy keyword search.

Stitching Algorithm: A Network Performance Analysis Tool for Dynamic Mobile Networks (2012)

Mohammad S. Khan, Anup Kumar, and Bin Xie, “Stitching Algorithm: A Network Performance Analysis Tool for Dynamic Mobile Networks,” In Proceeding of CIIECC, 2012.

Abstract:

The performance analysis of the mobile ad-hoc network (MANET) is a challenging issue. In this paper, network tomography is studied to analyse the network performance in a dynamic MANET. For such a purpose, a network tomography analytical model is proposed for a dynamic network environment. Expected Maximization (EM) algorithm for network tomography is able to estimate the network performance parameter in accordance to network performance observations. Our study is different than current network tomography approaches where are applied for static wired network. Over the dynamic network, we proposed a new algorithm that is called Stitching algorithm to aggregate the dynamic performance. Specifically, the stitching algorithm concatenates the performance parameter i.e. link delay, from distinguish time periods. Therefore, the network behaviour as well as the corresponding performance in a mobile ad-hoc network can be derived over a continuous period.

Distributed Optimal Power Control for Multicarrier Cognitive Systems (2012)

G. Ru, H. Li, T. Tran, W. Lin, L. Liu, and H. Wu “Distributed Optimal Power Control for Multicarrier Cognitive Systems," IEEE GLOBECOM, 2012.

Abstract:

In this paper, the power optimization of the multicarrier cognitive system underlying the primary network is investigated. We consider the interference coupled cognitive network under individual secondary user's power constraint and primary user's rate constraint. A multicarrier discrete distributed (MCDD) algorithm based on Gibbs sampler is proposed. Although the problem is nonconcave, MCDD is proved to converge to the global optimal solution. To reduce the computational complexity and convergence time, the Gibbs sampler based Lagrangian algorithm (GSLA) is proposed to get a near optimal solution. We also provide simulation results to show the effectiveness of the proposed algorithms.

Adaptive Scheduling for Multicasting Hard Deadline Constrained Prioritized Data via Network Coding (2012)

T. Tran, H. Li, W. Lin, L. Liu, and S. Khan “Adaptive Scheduling for Multicasting Hard Deadline Constrained Prioritized Data via Network Coding,” IEEE GLOBECOM, 2012.

Abstract:

Network coding offers a promising platform for multicast transmission by approaching its min-cut capacity. However, pushing the network throughput toward this upper bound comes with a sacrifice in delivery delay due to the decoding procedure that requires performing batch of coded packets. Further, in some transmission scenarios where the receivers experience deep fading or unable to collect a full set of the transmitted data, no useful information is recovered. The effect is more severe in the networks where the transmitted information has priority structure with hard deadline constraint due to the limited delivery time and data interdependencies. In this paper, we consider single-hop wireless networks where the transmitter wishes to multicast hard deadline constrained prioritized data to many receivers over lossy channels. We first study the network performance of a variety of transmission techniques, depending on how the transmitter schedules transmission in each time slot. We then propose an adaptive encoding and scheduling technique to maximize the network throughput. To find the optimal transmission scheduling at the presence of the network dynamics, we cast the problem in the framework of Markov Decision Processes (MDP) and use backward induction method to find an optimal solution. We further propose simulation-based algorithm and greedy scheduling technique that obtain high performance with much lower time complexity. Both analytical and simulation results have been provided to corroborate the effectiveness of the proposed techniques.

Secure Wireless Multicast for Delay- Sensitive Data via Network Coding and Adaptive Scheduling (2012)

T. Tran, H. Li, L. Liu, and S. Khan “Secure Wireless Multicast for Delay- Sensitive Data via Network Coding and Adaptive Scheduling,” in IEEE International Conference on Communications (ICC) June, 2012.

Abstract:

Wireless multicast for delay-sensitive data is challenging because different receivers may experience different packet losses. Network coding offers significant advantages over the traditional Automatic Repeat-reQuest (ARQ) protocols in that it mitigates the need for retransmission and has the potential to approach the min-cut capacity. Network-coded multicast would be, however, vulnerable to false packet injection attacks, in which the adversary injects bogus packets to prevent receivers from correctly decoding the original data. Without a right defense in place, even a single bogus packet can completely change the decoding outcome. Existing solutions either incur high computation cost or cannot withstand high packet loss. In this paper, we propose a novel scheme to defend against false packet injection attacks on network-coded multicast for delay-sensitive data. Specifically, we propose an efficient authentication mechanism based on null space properties of coded packets, aiming to enable receivers to detect any bogus packets with high probability. We further design an adaptive scheduling algorithm based on Markov Decision Processes (MDP) to maximize the number of authenticated packets that can be received within a given time constraint. Both analytical and simulation results have been provided to demonstrate the efficacy and efficiency of our proposed scheme.

When Compressive Sampling Meets Multicast: Outage Analysis and Subblock Network Coding (2011)

C. Thejaswi, T. Tran, and J. Zhang “When Compressive Sampling Meets Multicast: Outage Analysis and Subblock Network Coding,” INFOCOM, 2011.

Bin Xie, Anup Kumar, and Dharma P. Agrawal, “Enabling Multi-Service on 3G and Beyond: Challenges and Future Directions,” IEEE Wireless Communication Magazine , Volume 15, Issue 3, Pages 66-72, June 2008.

This paper studies multicasting compressively sampled signals from a source to many receivers, over lossy wireless channels. Our focus is on the network outage from the perspective of signal distortion across all receivers, for both cases where the transmitter may or may not be capable of reconstructing the compressively sampled signals. Capitalizing on extreme value theory, we characterize the network outage in terms of key system parameters, including the erasure probability, the number of receivers and the sparse structure of the signal. We show that when the transmitter can reconstruct the compressively sensed signal, the strategy of using network coding to multicast the reconstructed signal coefficients can reduce the network outage significantly. We observe, however, that the traditional network coding could result in suboptimal performance with power-law decay signals. Thus motivated, we devise a new method, namely subblock network coding, which involves fragmenting the data into subblocks, and allocating time slots to different subblocks, based on its priority. We formulate the corresponding optimal allocation as an integer programming problem. Since integer programming is often intractable, we develop a heuristic algorithm that prioritizes the time slot allocation by exploiting the inherent priority structure of power-law decay signals. Numerical results show that the proposed schemes outperform the traditional methods with significant margins.

Signal Strength Seeded Frequency Hopping: A Frequency Hopping Selection Scheme for Wireless Sensor Networks (2010)

Robert Kelley, Anup Kumar, Bin Xie, and Xiangqian Liu, “Signal Strength Seeded Frequency Hopping: A Frequency Hopping Selection Scheme for Wireless Sensor Networks,” International Conference on Computer and Network Technology, 2010.

Abstract:

One approach to securing radio signals in wireless sensor networks is frequency hopping in which transmitters and receivers change frequencies at a predetermined interval using a pattern of frequencies that is programmed a priori or calculated dynamically via a shared seeding mechanism. For these systems, if an adversary can physically capture a node in the network and steal the seed or hopping set, it can compromise the network. To protect against this weakness, we propose Signal Strength Seed Frequency Hopping, a hopping set selection scheme in which the seed used to calculate a dynamic hopping set is generated using signal strength measurements collected after the network has been deployed. We show our scheme has sufficient stochasticity to produce hopping sets that cannot be easily reproduced by an adversary.

Decentralized BDI-based Intelligent Multiagent for Optimizing Wireless Sensor Networks (2010)

Bin Xie, Jingli Li, Sanjuli Agrawal, “Decentralized BDI-based Intelligent Multiagent for Optimizing Wireless Sensor Networks,” IEEE, IET International Symposium on Communication Systems, Networks and Digital Signal Processing, 2010.

Abstract:

Organized intelligent communications can effectively improve the surveillance quality for wireless sensor networks. In this paper, we propose a decentralized Belief-Desire-Intention (BDI) oriented system that adopts the BDI mental architecture for wireless sensor networks. It tunes the sensor operational parameters in order to reduce the power consumption upon the satisfactory of the situational awareness quality. In the BDI intelligent architecture, the agent behavior is composed of beliefs, desires, intentions, and actions. Various methods are used in the agents to optimize the initial sensing coverage, network connectivity, senor sleep schemes, and packet transmissions. Simulation results for a special situational awareness application demonstrate the effectiveness of the proposed system.

Adaptive Network Coding for Wireless Access Networks (2010)

T. Tran and T. Nguyen “Adaptive Network Coding for Wireless Access Networks,” the 19th IEEE International Conference on Computer Communications and Networks (ICCCN), August, 2010 (runner-up for best paper award).

Abstract:

We propose a framework for optimizing the quality of service of multiple simultaneous flows in wireless access networks via network coding. Specifically, we consider the typical scenario in which multiple flows originate from multiple sources in the Internet and terminate at multiple users in a wireless network. In the current infrastructure, the wireless base station is responsible for relaying the packets from the Internet to the wireless users without any modification to the packet content. On the other hand, in the proposed approach, the wireless base station is allowed to perform network coding by appropriate linear mixing and channel coding of packets from different incoming flows before broadcasting a single flow of mixed or coded packets to all wireless users. Each user then uses an appropriate decoding method to recover its own packets from the set of coded packets that it receives. We show that in principle, for the given channel conditions and QoS requirements, appropriate mixing and channel coding of packets across different flows can lead to substantial quality improvement for both real-time and non-real time flows. On the other hand, blind mixing can be detrimental. We formulate this mixing problem as a combinatorial optimization problem, and propose a heuristic algorithm based on simulated-annealing method to approximate the optimal solution. Simulation results verify the performance improvement resulting from the proposed approach over the non-network coding and the state-of-the-art network coding approaches.

Prioritized Wireless Transmissions using Random Linear Codes (2010)

T. Tran and T. Nguyen “Prioritized Wireless Transmissions using Random Linear Codes,” the Fifth Network Coding Symposium (NetCod), June, 2010.

Abstract:

We investigate approximation algorithms for the problem of prioritized broadcast transmissions over independent erasure channels first described in Tran et al., 2009. In this work, the authors showed that under some settings, the achievable throughput regions for prioritized broadcast transmissions can be computed by a polynomial-time algorithm. In this paper, we study a class of approximate algorithms based on the Markov Chain Mote Carlo (MCMC) method, for obtaining the maximum sum of prioritized receiver's throughputs. Theoretical analysis and simulation results show the correctness and the convergence speed of the proposed algorithms.

Social Behavior Association and Influence in Social Networks (2009)

Bin Xie, Anup Kumar, Padmanabhan Ramaswamy, and Laurence T. Yang, Sanjuli, Agrawal, “Social Behavior Association and Infuence in Social Networks,” International Workshop on Cyber Physical and Social Computing (CPSC), 2009.

Abstract:

In a social network, many social behaviors exhibit the property of association that the behaviors of an individual influence the others who are contacted. For example, the message that carries the news may spread through a portion of the social network that constructs a social interaction propagation graph. In this paper, we model the social interaction influence and its propagation over the social network. We compute the infection probability in the social interaction propagation graph. Furthermore, we implement the Apriori algorithm that allows us to explore the social interaction association and compute the infection probability on a large scale social network. The complexity is compared with a centralized implementation and a distributed implementation.

On Achieving the Maximum Internet Capacity in Wireless Mesh Networks (2009)

Bin Xie, Haitang Wang, and Dharma P. Agrawal, ”On Achieving the Maximum Internet Capacity in Wireless Mesh Networks,” 11th IEEE International Conference on High Performance Computing and Communications (HPCC), 2009.

Abstract:

A Wireless Mesh Network (WMN) is connected by multiple wireless mesh routers that are able to operate multiple channels for increased network capacity. At the same time, the infrastructure such as Internet gateway provides the Internet connectivity and thus the mobile users in the network can access the Internet by multi-hop route of mesh routers. As other wireless networks, the network capacity is a fundamental issue in the WMN. The analytical results in this paper show that the upper bound of network capacity. Only when the number of Internet gateway nodes asymptotically grows with the number of mesh routers, the network capacity achieves significant capacity gain. We theoretically compute the WMN upper bounds of the infrastructure network capacity and its ad hoc capacity as well.

Distributed Trust Relationship and Polynomial Key Generation for IEEE 802.16m Networks (2009)

Andrew DeCarlo, Jonathan Portny, Sherman Tyler, Bin Xie, Ranga Reddy, and David Zhao, “Distributed Trust Relationship and Polynomial Key Generation for IEEE 802.16m Networks, ” IEEE Mobile WiMAX Symposium, 2009.

Abstract:

Mobile Relay Stations (RSs) provide Broadband Wireless Access (BWA) networks with additional mobility, which extends network coverage and advances dynamic networking and ubiquitous computing. However, there are many unresolved security vulnerabilities in the current IEEE 802.16 standard, such as BS/RS spoofing. Additional measures are needed to ensure that each component in the network is a trusted entity, verified by a trusted server and accessible through secure private channels. We suggest a Distributed Trust Relationship (DTR) with Polynomial-based Key Generation as a way of mutually validating trustworthiness between network components and preventing compromised components from infecting the entire network.

On Achievable Throughput Region of Prioritized Transmissions Via Network Coding (2009)

T. Tran, T. Nguyen, and R. Raich “On Achievable Throughput Region of Prioritized Transmissions Via Network Coding,” the 18th IEEE International Conference on Computer Communications and Networks (ICCCN), 2009.

Abstract:

We investigate the achievable throughput regions for scenarios involving prioritized transmissions. Prioritized transmissions are useful in many multimedia networking applications where the transmitted data have an inherent hierarchy such that a piece of data at one level is only useful if all the pieces of data at all the lower levels are present. Formally, the prioritized transmission refers to the notion that, given M prioritized packets in the decreasing order of importance, a1, a2, ..., am to be delivered to a receiver, then the packet ai is useful to a receiver only if it has received all packets aj with j < i successfully. Thus, the prioritized throughput can be abstractly represented j - 1 where j is the position of the first lost packet. In this paper we investigate the achievable throughput regions of prioritized transmissions from a source to multiple receivers via a shared and lossy channel. We assume that the source is an oracle such that it knows precisely whether a packet is lost or received at any receiver in any future time slot, thus it can schedule the packet transmission in such a way to maximize the receiver throughputs. We show that using network coding technique, the achievable throughput region for the broadcast scenarios can be substantially enlarged. Furthermore, for some erasure patterns, the achievable throughput region using network coding technique is optimal in the sense that no scheme can do better.

A Case for Joint Network Coding and Power Control for Wireless Linear Networks (2009)

T. Tran, D. Nguyen, and T. Nguyen, “A Case for Joint Network Coding and Power Control for Wireless Linear Networks," IEEE International Workshop on Wireless Network Coding (WiNC), June, 2009.

Abstract:

We investigate the power consumption and bandwidth usage for information exchange between two terminal nodes in a linear wireless ad hoc network. Specifically, we propose a joint network coding and adaptive power control (NCPC) scheme which regulates the transmission power to reduce the overall energy usage and to increase the bandwidth efficiency. Analysis and numerical results show that our proposed technique reduces power consumption while increasing the network throughput as compared with the existing transmission techniques.

Secure and Efficient Authentication in Wireless Mesh Networks using Merkle Trees (2008)

Lakshmi Santhanam, Bin Xie, and Dharma P. Agrawal, “Secure and Efficient Authentication in Wireless Mesh Networks using Merkle Trees,” IEEE Local Computer Network (LCN) Workshop on Network Security (WNS), 2008.

Abstract:

In the recent years, wireless mesh network (WMN) has evolved as a new paradigm for broadband wireless Internet access. The self-configurability, open wireless infrastructure, and different management styles of WMN make them vulnerable to malicious attackers. As a first step to secure WMNs, it is critical to incorporate an authentication mechanism for mesh clients. The existing proposals are primarily based on public key certificates, which incur considerable overhead in signature verification. We propose a network layer authentication mechanism called Merkle Tree based Mesh Authentication Protocol (MT-MAP) for WMNs. It incorporates inexpensive hash operations using Merkle tree to authenticate single/multihop mesh clients. We also show how the use of hash tree facilitates fast and periodic refresh of authentication certificates. Finally, we present a security analysis of MT-MAP against impersonation and replay attacks.

Flow-based Channel Assignment in Channel Constrained Wireless Mesh Networks (2008)

Weihuang Fu, Bin Xie, Xiaoyuan Wang, and Dharma P. Agrawal, “Flow-based Channel Assignment in Channel Constrained Wireless Mesh Networks,” International Conference on Computer Communications and Networks (ICCCN), 2008.

Abstract:

Wireless mesh network (WMN) technology extends the service coverage by supporting multi-hop communication and enhances the network capacity by utilizing multi-radio and multichannel. The number of multiple channels is essential for the implementation and the efficiency of channel assignment. While the number of channels is not sufficient, channel assignment needs to consider the channel sharing at certain mesh routers (MRs). The distribution of traffic flows in the network greatly affects the channel assignment. Different to a mobile ad hoc network (MANET), the traffic in a WMN is predominated by the Internet traffic. In this paper, we analyze the number of channels for a feasible conflict free channel assignment in such a network. We also propose a flow-based channel assignment in the channel constrained situation by implementing channel mergence algorithm so that MRs can appropriately share the channel resource. Extensive simulations are performed to illustrate the effectiveness of our proposed scheme.

Internet Gateway Deployment Optimization in a Multi-channel Multi-radio Wireless Mesh Network (2008)

Bing He, Bin Xie, and Dharma P. Agrawal, “Internet Gateway Deployment Optimization in a Multi-channel Multi-radio Wireless Mesh Network,” IEEE Wireless Communications and Networking Conference (WCNC), 2008.

Abstract:

In a wireless mesh network (WMN), mesh routers (MRs) are interconnected by wireless links and form a wireless backbone to provide ubiquitous high-speed Internet connectivity for mobile clients (MCs). The wireless backbone is tightly integrated with the Internet by a special kind of nodes called as Internet gateways (IGWs). Even though the capacity of WMN can be improved by equipping the MRs with multiple radios working at non-overlapping channels, the deployment of IGW is critical to the network performance of WMN. In this paper, we address the IGW placement problem based on a hierarchical cluster based architecture. The problem is first formulated as a linear program (LP) issue, then some heuristic algorithms are developed. Our simulation results show the effectiveness of the proposed algorithms.

Heterogeneous Interface Configuration in Wireless Mesh Network (2008)

Junfang Wang, Bin Xie, Kan Cai, and Dharma P. Agrawal, “Heterogeneous Interface Configuration in Wireless Mesh Network,” IEEE Wireless Communications and Networking Conference (WCNC), 2008.

Abstract

The network performance such as node capacity in a wireless mesh network (WMN) could be limited due to inappropriate interface configuration. Mesh routers (MRs) with heavy load may suffer from interface shortage. On the other hand, a MR with less load experiences a low utilization of interfaces. In this paper, we advocate heterogeneous interface configuration to appropriately configure the MRs' interfaces. It achieves the purpose of minimizing the total number of interfaces in a WMN while guaranteeing the various constraints such as traffic demand. We first formulate the problem when the traffic demand is non-uniformly distributed. On the basis of theoretical analysis, we propose a heuristic algorithm to find a ";close-to- optimal"; solution for interface configuration. Our simulation shows the effectiveness of our proposed heuristic algorithm.

Internet Media Streaming using Network Coding and Path Diversity (2008)

D. Nguyen, T. Tran, T. Pham, and V. Le, “Internet Media Streaming using Network Coding and Path Diversity," IEEE GLOBECOM, 2008.

Abstract:

Delivering live media content over best-effort Internet is a challenging task due to a number of factors such as packet loss, delay, and bandwidth fluctuation. As a result, many approaches have been proposed ranging from auto repeat request-typed solutions, forward error correcting code to routing and scheduling protocols and network architecture design. Multiple path streaming is an important solution which exploits the path diversity to satisfy the high transmission bandwidth requirement of streaming applications. Recently, network coding has been proposed for efficient information dissemination over packet-switched networks. In this paper, we propose a network coding framework for multiple path streaming over the Internet. In particular, we use a number of random network coding schemes in order to both exploit the benefits of path diversity and prevent packet loss. Our framework works at the application layer using the UDP service and is independent of the current network infrastructure.

Joint Network Coding and Adaptive Power Control for Cellular Radio Networks (2008)

T. Tran, D. Nguyen, T. Nguyen, and Duc Tran, “Joint Network Coding and Adaptive Power Control for Cellular Radio Networks," IEEE ICCE, 2008.

Abstract:

We investigate the problem of optimizing power consumption and bandwidth usage in cellular radio networks. In this paper we consider a wireless broadcast network, organized in cells, in which each transmitter wants to deliver the same amount of data to all receivers inside its cell. Traditionally, the transmitter in each cell radiates a fixed power at which the receiver at the border of the cell can receive, in theory, a signal whose energy is greater than its required threshold and satisfies condition of signal to noise and interference ratio (SIR). When a receiver in a cell receives an error packet, the transmitter in that cell will retransmit until the receiver receives it successfully. Instead in network coding approach, the transmitter will store index of the error packets, then it will consider combining them before sending out. The goal of this paper is to provide an analysis on the power consumption and bandwidth utilization of network coding techniques at the signal layer. Especially, we propose a novel technique in which network coding and adaptive power control are joined together to improve network performance. The simulation results show that our proposed technique substantially reduces power consumption while increases the network throughput compare with the traditional transmission technique, Automatic Repeat reQuest (ARQ).

Hybrid ARQ-Random Network Coding for Wireless Media Streaming (2008)

D. Nguyen, T. Tran, T. Nguyen, and B. Bose, “Hybrid ARQ-Random Network Coding for Wireless Media Streaming," IEEE ICCE, 2008.

Abstract:

This paper proposes hybrid ARQ-random network coding frameworks for real-time media broadcast over single-hop wireless networks. We model the wireless channel as a packet erasure channel and our proposed schemes aim at minimizing the packet erasure rate in order to enhance the media quality at receivers. We consider two forms of random network coding: uniform random network coding (URNC) and hierarchical random network coding (HRNC) in combination with a number of packet scheduling policies based on a limited number of feedbacks from receivers. Our simulation results show that the hybrid frameworks can improve the quality of media applications significantly compared with the conventional scheme without using network coding.

A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks (2008)

T. Tran, T. Nguyen, and B. Bose, “A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks,” the Fourth Workshop on Network Coding, Theory and Applications (NetCod), January, 2008.

Abstract:

Reliable transmission over an error-prone channel is typically accomplished via channel coding or retransmission of the lost information. In this paper, we investigate a joint network-channel coding technique to increase the bandwidth efficiency of wireless networks. In particular, we show that the proposed joint network-channel coding approach which combines the recent network coding (NC) concept with the traditional forward error correction (FEC) technique, can increase the bandwidth efficiency in single-hop wireless networks such as WLAN or WiMAX networks. We present some analytical results on the bandwidth efficiency for both broadcast and unicast scenarios. Based on these theoretical results, we provide a heuristic algorithm that dynamically selects the optimal level of FEC to be used with network coding technique for given channel conditions. For typical channel characteristics, both simulations and theoretical results confirm that the proposed joint network channel coding approach can reduce the bandwidth usage up to five times over the automatic repeat request (ARQ) technique and up to two times over the HARQ technique.

Enhanced Approach for Random Key Pre-Distribution in Wireless Sensor Networks (2007)

T. Tran, T. Nguyen, and B. Bose, “A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks,” the Fourth Workshop on Network Coding, Theory and Applications (NetCod), January, 2008.

Abstract:

Reliable transmission over an error-prone channel is typically accomplished via channel coding or retransmission of the lost information. In this paper, we investigate a joint network-channel coding technique to increase the bandwidth efficiency of wireless networks. In particular, we show that the proposed joint network-channel coding approach which combines the recent network coding (NC) concept with the traditional forward error correction (FEC) technique, can increase the bandwidth efficiency in single-hop wireless networks such as WLAN or WiMAX networks. We present some analytical results on the bandwidth efficiency for both broadcast and unicast scenarios. Based on these theoretical results, we provide a heuristic algorithm that dynamically selects the optimal level of FEC to be used with network coding technique for given channel conditions. For typical channel characteristics, both simulations and theoretical results confirm that the proposed joint network channel coding approach can reduce the bandwidth usage up to five times over the automatic repeat request (ARQ) technique and up to two times over the HARQ technique.

ROPAS: Cross-layer Cognitive Architecture for Mobile UWB Networks (2007)

Chittabrata Goash, Bin Xie, and Dharma P. Agrawal, “ROPAS: Cross-layer Cognitive Architecture for Mobile UWB Networks,” 4th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), 2007.

Abstract:

The allocation of channel bandwidth without significantly increasing the interference among existing users is a challenge for the future UWB networks. Our research work presents a novel rake optimization and power aware scheduling (ROPAS) architecture for UWB networks. We propose to use cognitive radio (CR) for dynamic channel allocation among the requesting users while limiting the average power transmitted in each sub-band. In our proposed ROPAS architecture, dynamic channel allocation is achieved by a CR-based cross-layer design between the PHY and medium access control (MAC) layers. The joint power control and link scheduling in the MAC layer reduces adjacent channel and multi-access interference introduced by multiple access of the links. Furthermore, the Rake optimization with its strategic selection of propagation paths achieves the minimal bit-error rate (BER) at the rake receiver by mixed integer programming. Our simulated-based performance evaluation confirms the effectiveness and novelty of our proposed ROPAS architecture.

Optimizing the Internet Gateway Deployment in a Wireless Mesh Network (2007)

Bing He, Bin Xie, and Dharma P. Agrawal, “Optimizing the Internet Gateway Deployment in a Wireless Mesh Network,” 4th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), 2007.

Abstract:

In a wireless mesh network (WMN), mesh routers (MRs) are interconnected by wireless links and form a wireless backbone to provide ubiquitous high-speed Internet connectivity for mobile clients. The wireless backbone is tightly integrated with the Internet by nodes called as Internet gateways (IGWs). In this paper, we address the IGW deployment problem which is shown to be NP-hard. We first formulate it as a linear program (LP) issue, then develop two heuristic algorithms for the purpose of cost-efficient IGW deployment. We further compare our algorithms with a leading approach by extensive simulations. Our analysis shows the effectiveness of the proposed algorithms.

Efficient Mesh Router Placement in Wireless Mesh Networks (2007)

Wang Junfang, Bin Xie, Cai Kai, and Dharma P. Agrawal, “Efficient Mesh Router Placement in Wireless Mesh Networks,” 4th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), 2007.

Abstract:

The placement of mesh routers (MRs) in building a wireless mesh network (WMN) is the first step to ensure the desired network performance. Given a network domain, the fundamental issue in placing MRs is to find the minimal configuration of MRs so as to satisfy the network coverage, connectivity, and Internet traffic demand. In this paper, the problem is addressed under a constraint network model in which the traffic demand is non-uniformly distributed and the candidate positions for MRs are pre-decided. After formulating the MR placement problem, we first provide the theoretical analysis to validate the traffic demand and determine the optimal position of Internet gateway (IGW). To reduce complexity of determining the locations of MRs while satisfying the traffic constraint, we propose an effective heuristic algorithm to obtain an close-to-optimal solution. Finally, our simulation results verify our analytical model and show the effectiveness of our proposed algorithm.

Faulty Sensor Detection in Wireless Sensor Networks using Polynomial Regression (2007)

Torsha Banerjee, Bin Xie, and Dharma P.Agrwal, "Faulty Sensor Detection in Wireless Sensor Networks using Polynomial Regression," IEEE 50th Global Telecom- munication Conference (Globecom), 2007.

Achieving Fault Tolerance in Data Aggregation in Wireless Sensor Networks (2007)

Torsha Banerjee, Bin Xie, and Dharma P.Agrwal, “Achieving Fault Tolerance in Data Aggregation in Wireless Sensor Networks,” IEEE 50th Global Telecommunication Conference (Globecom), 2007.

Abstract:

This paper identifies faulty sensor(s) in a polynomial-based data aggregation scenario, TREG proposed in our earlier work. In TREG, function approximation is performed over the entire range of data and only coefficients of a polynomial (P) are passed instead of aggregated data. Performing further mathematical operations on the calculated 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. We achieve the following goals: (1) uncorrelated readings from a specific sensor helps in detecting a faulty sensor, (2) faulty sensors are detected near the source and isolated preventing them from affecting the accuracy of the overall aggregated data and reducing the overall delay. Results show that a faulty sensor can be detected with an average accuracy of 94 %. With increase in node density, accuracy in faulty sensor detection improves as more nodes are able to report the information to their nearest tree node.

Achieving Fault Tolerance in Data Aggregation in Wireless Sensor Networks (2007)

Torsha Banerjee, Bin Xie, and Dharma P.Agrwal, “Achieving Fault Tolerance in Data Aggregation in Wireless Sensor Networks,” IEEE 50th Global Telecommunication Conference (Globecom), 2007.

Abstract:

This paper identifies faulty sensor(s) in a polynomial-based data aggregation scenario, TREG proposed in our earlier work. In TREG, function approximation is performed over the entire range of data and only coefficients of a polynomial (P) are passed instead of aggregated data. Performing further mathematical operations on the calculated 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. We achieve the following goals: (1) uncorrelated readings from a specific sensor helps in detecting a faulty sensor, (2) faulty sensors are detected near the source and isolated preventing them from affecting the accuracy of the overall aggregated data and reducing the overall delay. Results show that a faulty sensor can be detected with an average accuracy of 94 %. With increase in node density, accuracy in faulty sensor detection improves as more nodes are able to report the information to their nearest tree node.

DCLAD: Distributed Cluster Based Localization Anomaly Detection in Wireless Sensor Network Using Single Mobile Beacon (2007)

Paladugu Karthika, Lakshmi Santhanam, Bin Xie, and Dharma P. Agrawal, “DCLAD: Distributed Cluster Based Localization Anomaly Detection in Wireless Sensor Network Using Single Mobile Beacon,” Military Communication Conference (MILCOM), 2007.

Abstract:

In the last few years, Wireless Sensor Networks (WSNs) have emerged as a disrupting technology for myriad military and civilian applications. They demand an accurate location of the event detected and is done by using a mobile beacon node to provide accurate location and assume a benign environment. However, in a hostile military environment, such a node can be easily tampered by an adversary. In this paper, we propose a distributed cluster based anomaly detection scheme by assigning few randomly chosen cluster heads a critical task of estimating the reliability of the mobile beacon node. As localization of remaining nodes is cautiously performed only after verifying the authenticity of the mobile beacon node, a considerable overhead is saved in the incorrect localization of the entire network. We perform extensive simulation for different attacks and observe our scheme to have a high detection rate of 99% and a very less false positive rate of 20%.

LIMOC: Enhancing the Lifetime of a Sensor Network with Mobile Clusterheads (2007)

Torsha Benerjee, Bin Xie, Jung Hyun Jun, and Dharma P. Agrawal, “LIMOC: Enhancing the LIfetime of a Sensor Network with MObile Clusterheads,” IEEE 65th Vehicular Technology Conference (VTC), 2007.

Abstract:

This paper proposes a scheme for enhancement of network Lifetime using MObile Clusterheads (LIMOC) in a wireless sensor network (WSN). The low energy, static sensor nodes sense physical parameters and route the data to the highly energy-rich nodes called ClusterHeads (CHs) which are mobile and can transmit data directly to the base station (BS). A collaborative strategy among the CHs increases the lifetime (hence residual energy) of the network further. Simulation has shown that residual energy of the network can be improved by 45% by making the CHs always move towards the event in an event-driven network. For general cases, increased energy savings is obtained by making the CH move towards the center of equilibrium w.r.t. to both the total residual energy and data flow of the network.

A Tree-Based Channel Assignment Scheme for Wireless Mesh Network (2007)

Weihuang Fu, Bin Xie, Dharma P. Agrawal, and Anup Kumar, “A Tree-Based Channel Assignment Scheme for Wireless Mesh Network,” IEEE International Workshop on Heterogenous Multi-hop Wireless and Mobile Network (IEEE MHWMN) in conjunction with MASS, 2007.

Abstract:

Unlike ad hoc networks where traffic is randomly distributed among every pair of nodes, the traffic in wireless mesh networks (WMNs) is predominantly toward or from the Internet Gateways (IGWs)for Internet services. Due to this, interference and collision are more serious in the Mesh Router (MRs) closer to the IGWs and the Internet throughput of the network is limited by the number of orthogonal channels and radios of the IGW. In this paper, we propose a channel assignment scheme which exploits a tree-based topology in WMNs and implements a heuristic channel assignment algorithm, aiming to achieve the maximal Internet throughput. The channels are sequentially assigned level by level in the tree, starting from the IGW. The simulation results show that the network using this scheme achieve the Internet throughput close to the maximal capacity of IGW.

PERD: Polynomial based Event Region Detection in Wireless Sensor Networks (2007)

Torsha Banerjee, Demin Wang, Bin Xie, and Dharma P.Agrwal, “PERD: Polynomial based Event Region Detection in Wireless Sensor Networks,” IEEE International Conference on Communication (ICC), 2007.

Abstract:

We propose a polynomial-based scheme that addresses the problem of event region detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function approximation of the event using multivariate polynomial regression. Only the coefficients of this polynomial are then transmitted up the tree instead of aggregated data. PERD includes two components: event recognition and event report with boundary detection. In addition, PERD is capable of detecting single event or multiple events simultaneously occurring in the WSN. Since PERD is implemented over a polynomial tree on a WSN in a distributed manner, it is easily scalable and computation overhead is very light. 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% with increase in communication range.

Load-Balanced Mesh Router Migration for Wireless Mesh Networks (2006)

Bin Xie, Yingbin Yu, Anup Kumar, and Dharma P. Agrawal, “Load-Balanced Mesh Router Migration for Wireless Mesh Networks,” IEEE 49th Global Telecommunication Conference (Globecom), 2006.

Abstract:

Load-balancing among domains in a wireless mesh network (WMN) is normally achieved by changing the Internet attachment of mesh routers (MRs) that carry the traffic from mobile stations (MSs). The greediness of load-balancing algorithms may force MRs to frequently change their Internet attachments, and thus degrade network performance due to inter-domain mobility of the associated MSs. In this paper, we discuss the negative impact on the performance of MSs' mobility, due to inter-domain reassignment of MR. A MR migration scheme is proposed to achieve a tradeoff between load-balancing and inter-domain reassignment of MR. The proposed load-balancing scheme for WMNs includes: an initialization procedure to divide a WMN into domains, and a load adjustment procedure to rebalance the traffic load among the neighboring domains when required. We also provide a framework for handling inter-domain mobility in support of multi-hop communication using the Multi-hop cellular IP. Our simulation results show that the proposed protocol effectively controls MR's change in connectivity as well as MS's mobility.

GMSP: A Generalized Security Multi-hop Protocol for Heterogeneous Multi-hop Wireless Network (2006)

Bin Xie, and Anup Kumar, Dharma P. Agrawal, and S. Srinivasan “GMSP: A Generalized Security Multi-hop Protocol for Heterogeneous Multi-hop Wireless Network,” IEEE Wireless Communication and Network Conference (WCNC), 2006.

Abstract:

Multi-hop cellular networks offer attractive benefits for the next generation of wireless communication by integrating ad hoc relaying to cellular networks. However, most of the existing architectures and protocols for multi-hop cellular networks suffer from a variety of security threats in an adversarial environment. The existing architectures and protocols are not capable of providing end-to-end security protection for mobile users. A generalized multi-hop security protocol (GMSP) is proposed in this paper to achieve an effective route discovery protection from a range of potential security threats. The proposed multi-hop security protocol integrates mobile IP security and ad hoc security schemes. Moreover, the proposed protocol is flexible enough for fulfilling security protection for most existing heterogeneous multi-hop cellular architectures.

GMSP: A Generalized Security Multi-hop Protocol for Heterogeneous Multi-hop Wireless Network (2006)

Bin Xie, and Anup Kumar, Dharma P. Agrawal, and S. Srinivasan “GMSP: A Generalized Security Multi-hop Protocol for Heterogeneous Multi-hop Wireless Network,” IEEE Wireless Communication and Network Conference (WCNC), 2006.

Abstract:

Multi-hop cellular networks offer attractive benefits for the next generation of wireless communication by integrating ad hoc relaying to cellular networks. However, most of the existing architectures and protocols for multi-hop cellular networks suffer from a variety of security threats in an adversarial environment. The existing architectures and protocols are not capable of providing end-to-end security protection for mobile users. A generalized multi-hop security protocol (GMSP) is proposed in this paper to achieve an effective route discovery protection from a range of potential security threats. The proposed multi-hop security protocol integrates mobile IP security and ad hoc security schemes. Moreover, the proposed protocol is flexible enough for fulfilling security protection for most existing heterogeneous multi-hop cellular architectures.

Mobility and Routing Management for Heterogeneous Multi-hop Wireless Networks (2005)

Bin Xie, Anup Kumar, D. Cavalcanti, and Dharma P. Agrawal “Mobility and Routing Management for Heterogeneous Multi-hop Wireless Networks,” IEEE international workshop on HMWMN (Heterogeneous Multi-hop Wireless and Mobile Network) in conjunction with MASS, October 2005.

Abstract:

This paper proposes a new heterogeneous multi-hop cellular IP (MCIP) network that integrates multi-hop communication with cellular IP. MCIP increases the coverage of the wireless network and improves the network robustness against adverse propagation phenomena by supporting communication in dead zones and areas with poor radio coverage. MCIP includes three components: location management, connection management and route reconfiguration. Location management is responsible for maintaining the location information for mobile stations (MSs) in a local domain. Connection management establishes an initial path for data transmission and a route reconfiguration mechanism is proposed to take advantage of various multi-hop connection alternatives available based on terminal interfaces, network accessibility and topology. Our simulation results show that MCIP performs well in networks of various sizes.

An Integrated Framework for Internet and Ad hoc Network Security (2004)

Bin Xie, and Anup Kumar, “A Integrated Framework for Internet and Ad hoc Network Security”, IEEE Symposium on Computers and Communications (ISCC), June 2004.

Abstract:

Extending mobile IP to ad hoc networks with the foreign agent (FA) acting as the bridge between the wired network and ad hoc networks can provide the global Internet connectivity for ad hoc hosts. The existing research in the area of the integrated wired and ad hoc network is carried out in a nonadversarial setting. This work proposes an effective solution to solve the security related problems encountered in these integrated networks. The proposed approach uses the modified minimal public based authentication protocol not only for mobility binding at the home agent (HA) but also for access control and route discovery. This security protocol also excludes malicious nodes from performing the ad hoc network routing. This paper focuses on preventing ad hoc hosts from the attacks of antiintegrity, anticonfidentiality, antiauthentication and duplication.

Full Internet Connectivity for Ad hoc Networks (2004)

Bin Xie, and Anup Kumar, “Full Internet Connectivity for Ad hoc Networks”, 1st IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), October, 2004.

An Integrated Protocol for Internet and Ad hoc Network communication (2004)

Bin Xie, and Anup Kumar, "An Integrated Protocol for Internet and Ad hoc Network communication", 12th International Conference on Advanced Computing and Communication (ADCOM), December, 2004.