Results 1 - 10
of
14
Maximum Damage Malware Attack in Mobile Wireless Networks
"... Malware attacks constitute a serious security risk that threatens to slow down the large scale proliferation of wireless applications. As a first step towards thwarting this security threat, we seek to quantify the maximum damage inflicted on the system owing to such outbreaks and identify the most ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
(Show Context)
Malware attacks constitute a serious security risk that threatens to slow down the large scale proliferation of wireless applications. As a first step towards thwarting this security threat, we seek to quantify the maximum damage inflicted on the system owing to such outbreaks and identify the most vicious attacks. We represent the propagation of malware in a battery-constrained mobile wireless network by an epidemic model in which the worm can dynamically control the rate at which it kills the infected node and also the transmission range and/or the media scanning rate. At each moment of time, the worm at each node faces the following trade-offs: (i) using larger transmission range and media scanning rate to accelerate its spread at the cost of exhausting the battery and thereby reducing the overall infection propagation rate in the long run or (ii) killing the node to inflict a large cost on the network, however at the expense of loosing the chance of infecting more susceptible nodes at later times. We mathematically formulate the decision problems and utilize Pontryagin Maximum Principle from optimal control theory to quantify the damage that the malware can inflict on the network by deploying optimum decision rules. Next, we establish structural properties of the optimal strategy of the attacker over time. Specifically, we prove that it is optimal for the attacker to defer killing of the infective nodes in the propagation phase until reaching a certain time and then start the slaughter with maximum effort. We also show that in the optimal attack policy, the battery resources are used according to a decreasing function of time, i.e., mostly during the initial phase of the outbreak. Finally, our numerical investigations reveal a framework for identifying intelligent defense strategies that can limit the damage by appropriately selecting network parameters.
Routing in Delay Tolerant Networks Comprising Heterogeneous Node Populations
"... Communication networks are traditionally assumed to be connected. However, emerging wireless applications such as vehicular networks, pocket-switched networks, etc. coupled with volatile links, node mobility, and power outages, will require the network to operate despite frequent disconnections. To ..."
Abstract
-
Cited by 13 (3 self)
- Add to MetaCart
Communication networks are traditionally assumed to be connected. However, emerging wireless applications such as vehicular networks, pocket-switched networks, etc. coupled with volatile links, node mobility, and power outages, will require the network to operate despite frequent disconnections. To this end, opportunistic routing techniques have been proposed, where a node may store-and-carry a message for some time, until a new forwarding opportunity arises. Although a number of such algorithms exist, most focus on relatively homogeneous settings of nodes. However, in many envisioned applications, participating nodes might include handhelds, vehicles, sensors, etc. These various “classes ” have diverse characteristics and mobility patterns, and will contribute quite differently to the routing process. In this paper, we address the problem of routing in intermittently connected wireless networks comprising multiple classes of nodes. We show that proposed solutions, which perform well in homogeneous scenarios, are not as competent in this setting. To this end, we propose a class of routing schemes that can identify the nodes of “highest utility” for routing, improving the delay and delivery ratio by 4 − 5×. Additionally, we propose an analytical framework based on fluid models that can be used to analyze the performance of various opportunistic routing strategies, in heterogeneous settings.
Performance Analysis of Self Limiting Epidemic Forwarding
"... Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to preserve a meaningful service. We analyze the per ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Self limiting epidemic forwarding is a method of epidemic information dissemination in wireless ad-hoc networks that achieves congestion control by limiting spread (i.e. the number of nodes that receive a given message) and injection rate in order to preserve a meaningful service. We analyze the performance of various methods for spread control: on one hand, the classical method, which consists in decrementing the TTL of a packet when it is transmitted, on the other hand, two methods based on “aging”, where the TTL of a packet may be decremented while it is waiting for transmission in the epidemic buffer. The aging methods are: (selective aging) decrement TTL of a waiting packet when a duplicate is received and (global aging) decrement when any packet is received. The performance metrics are based on injection rates of messages, on amount of redundant information and on spread. We use detailed, realistic simulation for medium scale networks (up to 800 nodes); for networks of any size, we use an analytical method based on fluid approximation and solution of a fixed point problem. We find that the classical method does not perform well. Selective aging improves the performance, and global aging performs much better; it manages to control the spread so that the rate of injection remains good with fixed parameters across a wide range of settings. I.
Hop limited flooding over dynamic networks,”
- in Proceedings IEEE INFOCOM,
, 2011
"... Abstract-We study the performance of hop-limited broadcasting of a message in dynamic graphs where links between nodes switch between active and inactive states. We analyze the performance with respect to the completion time, defined as the time for the message to reach a given portion of nodes, an ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Abstract-We study the performance of hop-limited broadcasting of a message in dynamic graphs where links between nodes switch between active and inactive states. We analyze the performance with respect to the completion time, defined as the time for the message to reach a given portion of nodes, and the communication complexity, defined as the number of message forwarding per node. We analyze two natural flooding algorithms. First is a lazy algorithm where the message can be forwarded by a node only if it was first received by this node through a path shorter than the hop limit count. Second is a more complex protocol where each node forwards the message at a given time, if it could have been received by this node through a path shorter than the hop limit count. We derive exact asymptotics for the completion time and the communication complexity for large network size which reveal the effect of the hop limit count. Perhaps surprisingly, we find that both flooding algorithms perform near optimum and that the simpler (lazy) algorithm is only slightly worse than the other, more complicated algorithm. The results provide insights into performance of networked systems that use hop limits, for example, in the contexts of peer-to-peer systems and mobile ad-hoc networks.
Multi-hop Broadcast from Theory to Reality: Practical Design for Ad Hoc Networks
- First International Conference on Autonomic Computing and Communication Systems
, 2007
"... We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We address practical problems posed by: the imp ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
(Show Context)
We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We address practical problems posed by: the impossibility to set the TTL correctly at all times, the poor performance of multiple access protocols in broadcast mode, flow control when there is no acknowledgment and scheduling of multiple concurrent broadcasts. Our design, called “Self Limiting Epidemic Forwarding” (SLEF), automatically adapts its behavior from single hop MAC layer broadcast to epidemic forwarding when the environment changes from being extremely dense to sparse, sporadically connected. A main feature of SLEF is a nonclassical manipulation of the TTL field, which combines the usual decrement-when-sending to many very small decrements when receiving. SLEF is intended as a replacement of k-hop limited broadcast for the unlimited ad-hoc setting. 1.
G.: A Mobility Model for Pedestrian Content Distribution
- In: SIMUTools 2009: Proceedings of the 2nd International Conference on Simulation Tools and Techniques
, 2009
"... Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distribution system ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
(Show Context)
Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distribution system that spans vast urban areas. The transport mechanism is the flow of people and it can be studied but not engineered. The question addressed in this paper is how well pedestrian content distribution may work. We answer this question by modeling the mobility of people moving around in a city, constrained by a given topology. Our contributions are both the queuing analytic model that captures the flow of people and the results on the feasibility of pedestrian content distribution. Furthermore, we discuss possible extensions to the mobility model to capture speed-distance relations that emerge in dense crowds.
Dynamic Malware Attack in Energy-Constrained Mobile Wireless Networks
"... Large scale proliferation of wireless technologies are dependent on developing reliable security measures against outbreaks of malware. The first step toward this goal is investigating the possible attack strategies of wireless malware and the extent of damage they can incur. A malware in a mobile w ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Large scale proliferation of wireless technologies are dependent on developing reliable security measures against outbreaks of malware. The first step toward this goal is investigating the possible attack strategies of wireless malware and the extent of damage they can incur. A malware in a mobile wireless network relies on the infrastructure of the network and the constrained resources to spread itself. In this paper, we consider a battery-constrained mobile wireless network. The worm at each infective node at any given time may choose to amplify the transmission range and elevate the media scanning rate and thus increase the chance of contacting susceptible nodes and accelerate its spread. However, a larger transmission range and an elevated media scanning rate results in (a) easier detection of the malware and thus more effective counter-measure by the network, and (b) faster depletion of the battery and thus losing the node. Even if depleting the battery is an objective of the malware, early loss of infective nodes may thwart the spread of the malware. We assume the viewpoint of the malware and cast the problem of dynamically selecting the transmission range and media accessing rate in the infective nodes as an optimal control problem. We utilize Pontryagin’s Maximum Principle to find an optimum solution. Moreover, we investigate the structural properties of an optimal solution to develop intuition about the nature of optimum attacks.
On the Performance of Pedestrian Content Distribution
"... ABSTRACT—Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distributio ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
ABSTRACT—Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distribution system that spans vast urban areas. There are basically only three system parameters that can be determined in the design: the transmission range of the nodes, the setup time when nodes make a contact, and their storage capacity. The transport mechanism is the flow of people and it can be studied but not engineered. The question addressed in this paper is how well pedestrian content distribution may work. We answer this question by modeling the mobility of people moving around in a city, constrained by a given topology. The model is supplemented by simulation of similar or related scenarios for validation and extension. Our conclusion is that contents spread well with pedestrian speeds already at low arrival rates into a studied region. Our contributions are both the results on the feasibility of pedestrian content distribution and the queuing analytic model that captures the flow of people.
An analytical model for pedestrian content distribution in a grid of streets
, 2013
"... a b s t r a c t Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content dis ..."
Abstract
- Add to MetaCart
(Show Context)
a b s t r a c t Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distribution system that spans vast urban areas. The transport mechanism is the flow of people and it can be studied but not engineered. We study the efficiency of pedestrian content distribution by modeling the mobility of people moving around in a city, constrained by a given topology. The model is supplemented by simulation of similar or related scenarios for validation and extension. The results show that contents spread well with pedestrian speeds already at low arrival rates into a studied region. Our contributions are both the queuing analytic model that captures the flow of people and the results on the feasibility of pedestrian content distribution.
