Bin Xie, Anup Kumar, Padmanabhan Ramaswamy, and Laurence T. Yang, Sanjuli, Agrawal, International Workshop on Cyber Physical and Social Computing (CPSC), 2009.
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.
Bin Xie, Haitang Wang, and Dharma P. Agrawal, 11th IEEE International Conference on High Performance Computing and Communications (HPCC), 2009.
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.
Andrew DeCarlo, Jonathan Portny, Sherman Tyler, Bin Xie, Ranga Reddy, and David Zhao, IEEE Mobile WiMAX Symposium, 2009.
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.
T. Tran, T. Nguyen, and R. Raich, the 18th IEEE International Conference on Computer Communications and Networks (ICCCN), 2009.
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.
T. Tran, D. Nguyen, and T. Nguyen, IEEE International Workshop on Wireless Network Coding (WiNC), June, 2009.
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.
Lakshmi Santhanam, Bin Xie, and Dharma P. Agrawal, IEEE Local Computer Network (LCN) Workshop on Network Security (WNS), 2008.
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.
Weihuang Fu, Bin Xie, Xiaoyuan Wang, and Dharma P. Agrawal, International Conference on Computer Communications and Networks (ICCCN), 2008.
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.
Bing He, Bin Xie, and Dharma P. Agrawal, IEEE Wireless Communications and Networking Conference (WCNC), 2008.
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.
Junfang Wang, Bin Xie, Kan Cai, and Dharma P. Agrawal, IEEE Wireless Communications and Networking Conference (WCNC), 2008.
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.
D. Nguyen, T. Tran, T. Pham, and V. Le, IEEE GLOBECOM, 2008.
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.
T. Tran, D. Nguyen, T. Nguyen, and Duc Tran, IEEE ICCE, 2008.
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).
D. Nguyen, T. Tran, T. Nguyen, and B. Bose, IEEE ICCE, 2008.
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.
T. Tran, T. Nguyen, and B. Bose, the Fourth Workshop on Network Coding, Theory and Applications (NetCod), January, 2008.
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.
Chittabrata Goash, Bin Xie, and Dharma P. Agrawal, 4th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), 2007.
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.
Bing He, Bin Xie, and Dharma P. Agrawal, 4th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), 2007.
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.
Wang Junfang, Bin Xie, Cai Kai, and Dharma P. Agrawal, 4th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), 2007.
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.
Torsha Banerjee, Bin Xie, and Dharma P.Agrwal, IEEE 50th Global Telecom- munication Conference (Globecom), 2007.
Torsha Banerjee, Bin Xie, and Dharma P.Agrwal, IEEE 50th Global Telecommunication Conference (Globecom), 2007.
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.
Torsha Banerjee, Bin Xie, and Dharma P.Agrwal, IEEE 50th Global Telecommunication Conference (Globecom), 2007.
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.
Paladugu Karthika, Lakshmi Santhanam, Bin Xie, and Dharma P. Agrawal, Military Communication Conference (MILCOM), 2007.
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%.
Torsha Benerjee, Bin Xie, Jung Hyun Jun, and Dharma P. Agrawal, IEEE 65th Vehicular Technology Conference (VTC), 2007.
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.
Weihuang Fu, Bin Xie, Dharma P. Agrawal, and Anup Kumar, IEEE International Workshop on Heterogenous Multi-hop Wireless and Mobile Network (IEEE MHWMN) in conjunction with MASS, 2007.
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.
Torsha Banerjee, Demin Wang, Bin Xie, and Dharma P.Agrwal, IEEE International Conference on Communication (ICC), 2007.
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.
Bin Xie, Yingbin Yu, Anup Kumar, and Dharma P. Agrawal, IEEE 49th Global Telecommunication Conference (Globecom), 2006.
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.
Bin Xie, and Anup Kumar, Dharma P. Agrawal, and S. Srinivasan, IEEE Wireless Communication and Network Conference (WCNC), 2006.
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.
Bin Xie, and Anup Kumar, Dharma P. Agrawal, and S. Srinivasan, IEEE Wireless Communication and Network Conference (WCNC), 2006.
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.
Bin Xie, Anup Kumar, D. Cavalcanti, and Dharma P. Agrawal, IEEE international workshop on HMWMN (Heterogeneous Multi-hop Wireless and Mobile Network) in conjunction with MASS, October 2005.
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.
Bin Xie, and Anup Kumar, IEEE Symposium on Computers and Communications (ISCC), June 2004.
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.
Bin Xie, and Anup Kumar, 1st IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS), October, 2004.
Bin Xie, and Anup Kumar, 12th International Conference on Advanced Computing and Communication (ADCOM), December, 2004.