Jie Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jie Wu has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Zhen Jiang
West Chester University
3 shared publications - Chi-Sing Leung
Department of Electrical Engineering, City University of Hong Kong, Kowloon Tong, Hong Kong
2 shared publications - John Sum
Institute of Technology Management, National Chung Hsing University, Taichung 402, Taiwan
2 shared publications - Shuhui Yang
Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431,
2 shared publications - Xiuqi Li
Department of Computer Science and Engineering , Florida Atlantic University , Boca Raton, FL, 33431, USA
2 shared publications - Allen Wynn
Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA
1 shared publication
Latest Publications
- 1 February 2009
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 24 (1) , 69-84
SMRS: A scalable multi-path routing scheme
Source routing has been extensively investigated as a method of improving diversity in path selection. Due to its limited scalability, the application of source routing is hindered today. Yang and Wetherall proposed a tag-based routing architecture to provide a set of non-shortest-path routes as an alternative to explicit source routes. The idea is that each router constructs a deflection set with the 1-hop route information and utilises tags as hints to independently deflect packets to the neighbours in the deflection set. To find more diverse paths, one approach is to increase the route knowledge of every node. However, there is a tradeoff in that more route knowledge leads to more diverse loop-free and dead end-free paths, but it also causes more overhead. In this paper, our objective lies in designing a method to find more diverse paths, with minimum knowledge. In addition, the tag-based deflection approach does not consider the length of the utilised paths as a main issue, which may lead to long paths. With this in mind, we propose a scalable multi-path routing scheme (SMRS), which consists of two components. One is the extension of the Yang and Wetherall approach to 2-hop history information. The other is the next hop selection algorithms to control the average length of the utilised paths. Comprehensive simulations are conducted to compare the performance of the tag-based deflection routing and SMRS.
- 1 February 2009
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 24 (1) , 69-84
SMRS: A scalable multi-path routing scheme
Source routing has been extensively investigated as a method of improving diversity in path selection. Due to its limited scalability, the application of source routing is hindered today. Yang and Wetherall proposed a tag-based routing architecture to provide a set of non-shortest-path routes as an alternative to explicit source routes. The idea is that each router constructs a deflection set with the 1-hop route information and utilises tags as hints to independently deflect packets to the neighbours in the deflection set. To find more diverse paths, one approach is to increase the route knowledge of every node. However, there is a tradeoff in that more route knowledge leads to more diverse loop-free and dead end-free paths, but it also causes more overhead. In this paper, our objective lies in designing a method to find more diverse paths, with minimum knowledge. In addition, the tag-based deflection approach does not consider the length of the utilised paths as a main issue, which may lead to long paths. With this in mind, we propose a scalable multi-path routing scheme (SMRS), which consists of two components. One is the extension of the Yang and Wetherall approach to 2-hop history information. The other is the next hop selection algorithms to control the average length of the utilised paths. Comprehensive simulations are conducted to compare the performance of the tag-based deflection routing and SMRS.
- 1 January 2009
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 31 (2) , 84-89
On Unbounded Zero-One Knapsack With Discrete-Sized Objects
This paper presents an approximated solution for an unbounded knapsack problem where the sizes of objectsare discrete values: where pis are the profits that are uniformly distributed random variables in [0,1]. The sizes cis are discrete random variables which are distributed uniformly in {1/M, 2/M,…, (M-1)/M, 1}. zn(M) is the total profit to be maximized. Assuming that M is large, it is found that the optimal profit zn(M) is approximately equal to An example from auction is used to explain and illustrate the use of the derived solution in estimating the profit.- 1 January 2009
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 31 (2) , 84-89
On Unbounded Zero-One Knapsack With Discrete-Sized Objects
This paper presents an approximated solution for an unbounded knapsack problem where the sizes of objectsare discrete values: where pis are the profits that are uniformly distributed random variables in [0,1]. The sizes cis are discrete random variables which are distributed uniformly in {1/M, 2/M,…, (M-1)/M, 1}. zn(M) is the total profit to be maximized. Assuming that M is large, it is found that the optimal profit zn(M) is approximately equal to An example from auction is used to explain and illustrate the use of the derived solution in estimating the profit.- 28 June 2008
- Published by Springer Nature in Wireless Networks
- Vol. 16 (1) , 141-152
Mobility control for achieving optimal configuration in wireless sensor networks
- 28 June 2008
- Published by Springer Nature in Wireless Networks
- Vol. 16 (1) , 141-152
Mobility control for achieving optimal configuration in wireless sensor networks
- 1 May 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (3) , 327-342
SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes
- 1 May 2008
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 23 (3) , 327-342
SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes
- 16 January 2008
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 23 (1) , 17-44
ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks
Existing searches in unstructured peer-to-peer (P2P) networks are either blind or informed based on simple heuristics. Blind schemes suffer from low query quality. Simple heuristics lack theoretical background to support the simulation results. In this paper, we propose an intelligent searching scheme, called intelligent search by reinforcement learning (ISRL), which systematically seeks the best route to desired files by reinforcement learning (RL). In artificial intelligence, RL has been proven to be able to learn the best sequence of actions to achieve a certain goal. To discover the best path to desired files, ISRL not only explores new paths by forwarding queries to randomly chosen neighbors, but also exploits the paths that have been discovered for reducing the cumulative query cost. We design three models of ISRL: a basic version for finding one desired file, MP-ISRL for finding at least k files, and C-ISRL for reducing maintenance overhead through clustering when there are many queries. ISRL outperforms existing searching approaches in unstructured P2P networks by achieving similar query quality with lower cumulative query cost. The experimental result confirms the performance improvement of ISRL.
- 16 January 2008
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 23 (1) , 17-44
ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks
Existing searches in unstructured peer-to-peer (P2P) networks are either blind or informed based on simple heuristics. Blind schemes suffer from low query quality. Simple heuristics lack theoretical background to support the simulation results. In this paper, we propose an intelligent searching scheme, called intelligent search by reinforcement learning (ISRL), which systematically seeks the best route to desired files by reinforcement learning (RL). In artificial intelligence, RL has been proven to be able to learn the best sequence of actions to achieve a certain goal. To discover the best path to desired files, ISRL not only explores new paths by forwarding queries to randomly chosen neighbors, but also exploits the paths that have been discovered for reducing the cumulative query cost. We design three models of ISRL: a basic version for finding one desired file, MP-ISRL for finding at least k files, and C-ISRL for reducing maintenance overhead through clustering when there are many queries. ISRL outperforms existing searching approaches in unstructured P2P networks by achieving similar query quality with lower cumulative query cost. The experimental result confirms the performance improvement of ISRL.
- 1 January 2008
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 30 (4) , 279-288
Analysis on a Simulated Model for Gnutell a Topology: Connectedness and Extension
This paper presents a model to generate and study Gnutella topology from an original point of view. Instead of using characteristics of the final topology, the network is constructively created from scratch and its connectedness is studied by simulation. As the resultant topology has the same node degree distribution as what has been measured from the true Gnutella and a virus outbreak simulation has shown that the network is not connected, it is argued that the true Gnutella might not be a connected network. To improve the connected ability of the model, a modification on the connection mechanism is proposed and the topological change of the network is studied by simulation. Although the node degree distribution of the resultant topology is deviated from the measurement results, this new connection mechanism can indeed improve the connectedness of the network that is confirmed by the virus outbreak simulation.
- 1 January 2008
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 30 (4) , 279-288
Analysis on a Simulated Model for Gnutell a Topology: Connectedness and Extension
This paper presents a model to generate and study Gnutella topology from an original point of view. Instead of using characteristics of the final topology, the network is constructively created from scratch and its connectedness is studied by simulation. As the resultant topology has the same node degree distribution as what has been measured from the true Gnutella and a virus outbreak simulation has shown that the network is not connected, it is argued that the true Gnutella might not be a connected network. To improve the connected ability of the model, a modification on the connection mechanism is proposed and the topological change of the network is studied by simulation. Although the node degree distribution of the resultant topology is deviated from the measurement results, this new connection mechanism can indeed improve the connectedness of the network that is confirmed by the virus outbreak simulation.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Fault-Tolerant Topology Control for Heterogeneous Wireless Sensor Networks
This paper addresses fault-tolerant topology control in a heterogeneous wireless sensor network consisting of several resource-rich supernodes used for data relaying and a large number of energy constrained wireless sensor nodes. We introduce the fc-degree Anycast Topology Control (fc-ATC) problem with the objective of selecting each sensor's transmission range such that each sensor is fc-vertex supernode connected and the maximum sensor transmission power is minimized. Such topologies are needed for applications that support sensor data reporting even in the event of failures of up to k-1 sensor nodes. We propose two solutions for the k-ATC problem: a greedy centralized algorithm that produces the optimal solution and a distributed and localized algorithm that incrementally adjusts sensors' transmission range such that the k-vertex supernode connectivity requirement is met. Simulation results are presented to verify our approaches.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Fault-Tolerant Topology Control for Heterogeneous Wireless Sensor Networks
This paper addresses fault-tolerant topology control in a heterogeneous wireless sensor network consisting of several resource-rich supernodes used for data relaying and a large number of energy constrained wireless sensor nodes. We introduce the fc-degree Anycast Topology Control (fc-ATC) problem with the objective of selecting each sensor's transmission range such that each sensor is fc-vertex supernode connected and the maximum sensor transmission power is minimized. Such topologies are needed for applications that support sensor data reporting even in the event of failures of up to k-1 sensor nodes. We propose two solutions for the k-ATC problem: a greedy centralized algorithm that produces the optimal solution and a distributed and localized algorithm that incrementally adjusts sensors' transmission range such that the k-vertex supernode connectivity requirement is met. Simulation results are presented to verify our approaches.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Destination-Region-Based Local Minimum Aware Geometric Routing
Geometric routing in mobile ad-hoc networks (MANETs) is comprised of two forwarding modes: greedy forwarding and face forwarding. It is known that face forwarding is inefficient and fails frequently in practical situations. A previous work, NEAR [2], avoids switching to face forwarding by predicting local minima and not forwarding messages to them. However, NEAR predicts excessive local minima, which results in subop- timal routing performance. Also, it is not fully localized due to its bridge detection scheme. Aiming to further improve the performance, we propose a destination- region-based Local minimum AwaRe GEometric Routing (LARGER) algorithm which improves the accuracy of the local minima prediction by dividing the network into a number of regions and predicting local minima based on the region where the destination is located. Simulation results show that LARGER substantially improves the prediction accuracy and the routing performance of NEAR and that of the other state-of-the-art geometric routing algorithms in terms of route length.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Destination-Region-Based Local Minimum Aware Geometric Routing
Geometric routing in mobile ad-hoc networks (MANETs) is comprised of two forwarding modes: greedy forwarding and face forwarding. It is known that face forwarding is inefficient and fails frequently in practical situations. A previous work, NEAR [2], avoids switching to face forwarding by predicting local minima and not forwarding messages to them. However, NEAR predicts excessive local minima, which results in subop- timal routing performance. Also, it is not fully localized due to its bridge detection scheme. Aiming to further improve the performance, we propose a destination- region-based Local minimum AwaRe GEometric Routing (LARGER) algorithm which improves the accuracy of the local minima prediction by dividing the network into a number of regions and predicting local minima based on the region where the destination is located. Simulation results show that LARGER substantially improves the prediction accuracy and the routing performance of NEAR and that of the other state-of-the-art geometric routing algorithms in terms of route length.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
Polylogarithmic Store-Carry-Forward Routing using Mobile Nodes
It is well known that mobility increases the capacity of mobile ad hoc networks (MANETs) by reducing the number of relays for routing, prolonging the lifespan of wireless sensor networks (WSNs) by using mobile nodes in place of bottleneck static sensors, and ensuring network connectivity in delay-tolerant networks (DTNs) using mobile nodes to connect different parts of a disconnected network. Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay, average number of relays, and moving distance. In this paper, we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals, including delay, the number of relays, and moving distance. The model is based on the small-world model where each static node has "short" link connections to its nearest neighbors and "long" link connections to other nodes following a certain probability distribution. Short links are regular wireless connections whereas long links are implemented using mobile nodes. Various issues are considered, including trade-offs between delay and average number of relays, selection of the number of mobile nodes, and selection of the number of long links. The effectiveness of the proposed model is evaluated analytically as well as through simulation.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
Polylogarithmic Store-Carry-Forward Routing using Mobile Nodes
It is well known that mobility increases the capacity of mobile ad hoc networks (MANETs) by reducing the number of relays for routing, prolonging the lifespan of wireless sensor networks (WSNs) by using mobile nodes in place of bottleneck static sensors, and ensuring network connectivity in delay-tolerant networks (DTNs) using mobile nodes to connect different parts of a disconnected network. Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay, average number of relays, and moving distance. In this paper, we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals, including delay, the number of relays, and moving distance. The model is based on the small-world model where each static node has "short" link connections to its nearest neighbors and "long" link connections to other nodes following a certain probability distribution. Short links are regular wireless connections whereas long links are implemented using mobile nodes. Various issues are considered, including trade-offs between delay and average number of relays, selection of the number of mobile nodes, and selection of the number of long links. The effectiveness of the proposed model is evaluated analytically as well as through simulation.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 197-201
CAGE: Clique-based Assignment of Group kEy
Due to the unique operational environment of WSNs combined with their communication medium that is open to eavesdroppers, the traditional wireless network threats manifest in new forms. Consequently, key management protocols have become paramount in mitigating the damage caused. Numerous group-key protocols have been proposed in an effort to restrict access to only legitimate users. However, the group-key assignment protocols in literature neither address the issue of the size of a group nor its geographic boundaries. Consequently, in applications like watchdog-based reputation monitoring systems, malicious users are encouraged to pollute the reputation values by bad-mouthing benign nodes. On the otherhand, pairwise- key protocols are very restrictive and impose substantial storage overhead on resource constrained sensors. They do not suit the reputation monitoring systems either, since messages encrypted with pairwise keys cannot be monitored by watchdogs. In this paper, we propose CAGE, a novel, distributed, clique-based group-key assignment protocol, which distinctly addresses the size and geographic restrictions on groups. Our protocol is a simple distributed method, yet effective in securing the neighborhood communication. We prove that CAGE is an optimal solution through simulations and analysis.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 197-201
CAGE: Clique-based Assignment of Group kEy
Due to the unique operational environment of WSNs combined with their communication medium that is open to eavesdroppers, the traditional wireless network threats manifest in new forms. Consequently, key management protocols have become paramount in mitigating the damage caused. Numerous group-key protocols have been proposed in an effort to restrict access to only legitimate users. However, the group-key assignment protocols in literature neither address the issue of the size of a group nor its geographic boundaries. Consequently, in applications like watchdog-based reputation monitoring systems, malicious users are encouraged to pollute the reputation values by bad-mouthing benign nodes. On the otherhand, pairwise- key protocols are very restrictive and impose substantial storage overhead on resource constrained sensors. They do not suit the reputation monitoring systems either, since messages encrypted with pairwise keys cannot be monitored by watchdogs. In this paper, we propose CAGE, a novel, distributed, clique-based group-key assignment protocol, which distinctly addresses the size and geographic restrictions on groups. Our protocol is a simple distributed method, yet effective in securing the neighborhood communication. We prove that CAGE is an optimal solution through simulations and analysis.