M phil-computer-science-mobile-computing-projects

M.Phil Computer Science Mobile Computing Projects
Web : www.kasanpro.com Email : sales@kasanpro.com
List Link : http://kasanpro.com/projects-list/m-phil-computer-science-mobile-computing-projects
Title :Throughput and Delay Analysis for Convergecast with MIMO in Wireless Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/throughput-delay-analysis-convergecast-mimo-wireless-networks
Abstract : This paper investigates throughput and delay based on a traffic pattern, called converge-cast, where each
of the n nodes in the network acts as a destination with k randomly chosen sources corresponding to it. Adopting
Multiple-Input-Multiple-Output (MIMO) technology, we devise two many-to-one cooperative schemes under
converge-cast for both static and mobile ad hoc networks (MANETs), respectively. We call them Convergimo
Schemes. In static networks, our Convergimo scheme highly utilizes hierarchical cooperation MIMO transmission.
This feature overcomes the bottleneck which hinders converge-cast traffic from yielding ideal performance in
traditional ad hoc network, by turning the originally interfering signals into interference-resistant ones. It helps to
achieve an aggregate throughput up to ?(n1??) for any ? > 0. In the mobile ad hoc case, our Convergimo scheme
characterizes on joint transmission from multiple nodes to multiple receivers. With optimal network division where the
number of nodes per cell is constantly bounded, the achievable per-node throughput can reach ?(1) with the
corresponding delay reduced to ?(k). The gain comes from the strong and intelligent cooperation between nodes in
our scheme, along with the maximum number of concurrent active cells and the shortest waiting time before
transmission for each node within a cell. This increases the chances for each destination to receive the data it needs
with minimum overhead on extra transmission. Moreover, our converge-based analysis well unifies and generalizes
previous work since the results derived from converge-cast in our schemes can also cover other traffic patterns. Last
but not least, our schemes are of interest not only from a theoretical perspective but also provide useful theoretical
guidelines to future design of MIMO schemes in wireless networks.
Title :Minimum Bandwidth Reservations for Periodic Streams in Wireless Real-Time Systems
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/minimum-bandwidth-reservations-periodic-streams-wireless-real-time-systems
Abstract : Reservation-based (as opposed to contention-based) channel access in WLANs provides predictable and
deterministic transmission and is therefore able to provide timeliness guarantees for wireless and embedded real-time
applications. Also, reservation-based channel access is energy efficient since a wireless adaptor is powered on only
during its exclusive channel access times. While scheduling for Quality of Service at the central authority (e.g., base
station) has received extensive attention, the problem of determining the actual resource a requirement of an
individual node in a wireless real-time system has been largely ignored.
This work aims at finding the minimum channel bandwidth reservation that meets the real-time constraints of all
periodic streams of a given node. Keeping the bandwidth reservation of a node to a minimum leads to reduced energy
and resource requirements and leaves more bandwidth for future reservations by other nodes. To obtain a solution to
the minimum bandwidth reservation problem, we transform it to a generic uniprocessor task schedulability problem,
which is then addressed using a generic algorithm. This algorithm works for a subclass of priority-driven packet
scheduling policies, including three common ones.
Fixed priority, EDF, and FIFO. Moreover, we then specialize the generic algorithm to these three policies according to
their specific characteristics. Their computation complexities and bandwidth reservation efficiencies are evaluated and
guidelines for choosing scheduling policies and stream parameters are presented.
Title :Converge-Cast On the Capacity and Delay Tradeoffs
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/converge-cast-on-capacity-delay-tradeoffs
Abstract : In this paper, we define an ad hoc network where multiple sources transmit packets to one destination as

Converge-Cast network. We will study the capacity delay tradeoffs assuming that n wireless nodes are deployed in a
unit square. For each session1, k nodes are randomly selected as active sources and transmit one packet to a
particular destination node, which is also randomly selected. We first consider the stationary case, where capacity is
mainly discussed and delay is entirely dependent on the average number of hops. We find that the per-node capacity
is ? (1/?n log n) 2, which is the same as that of unicast. Then node mobility is introduced to increase network
capacity, for which our study is performed in two steps. The first step is to establish the delay in single-session
transmission. We find that the delay is ? (n log k) under 1-hop strategy and ? (n log k/m) under 2-hop redundant
strategy, where m denotes the number of replicas for each packet. The second step is to find delay and capacity in
multisession transmission. We reveal that the per-node capacity and delay for 2-hop non-redundancy strategy are ?
(1) and ? (n log k) respectively. The optimal delay is ? (?n log k + k) with redundancy, corresponding to a capacity of ?
(root (1/n log k + k/n log k)). Therefore we obtain that the capacity delay tradeoff satisfies delay/rate ? ? (n log k) for
both strategies.
Title :Optimal Stochastic Location Updates in Mobile Ad Hoc Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/optimal-stochastic-location-updates-mobile-ad-hoc-networks
Abstract : We consider the location service in a mobile ad-hoc network (MANET), where each node needs to
maintain its location information by 1) frequently updating its location information within its neighboring region, which
is called neighborhood update (NU), and 2) occasionally updating its location information to certain distributed
location server in the network, which is called location server update (LSU). The tradeoff between the operation costs
in location updates and the performance losses of the target application due to location inaccuracies (i.e., application
costs) imposes a crucial question for nodes to decide the optimal strategy to update their location information, where
the optimality is in the sense of minimizing the overall costs. In this paper, we develop a stochastic sequential
decision framework to analyze this problem. Under a Markovian mobility model, the location update decision problem
is modeled as a Markov Decision Process (MDP). We first investigate the monotonicity properties of optimal NU and
LSU operations with respect to location inaccuracies under a general cost setting. Then, given a separable cost
structure, we show that the location update decisions of NU and LSU can be independently carried out without loss of
optimality, i.e., a separation property. From the discovered separation property of the problem structure and the
monotonicity properties of optimal actions, we find that 1) there always exists a simple optimal threshold-based
update rule for LSU operations; 2) for NU operations, an optimal threshold-based update rule exists in a low-mobility
scenario. In the case that no a priori knowledge of the MDP model is available, we also introduce a practical
model-free learning approach to find a near-optimal solution for the problem.
Title :Fast Data Collection in Tree-Based Wireless Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/fast-data-collection-tree-based-wireless-sensor-networks
Abstract : We investigate the following fundamental question - how fast can information be collected from a wireless
sensor network organized as tree? To address this, we explore and evaluate a number of different techniques using
realistic simulation models under the many-to-one communication paradigm known as convergecast. We first
consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required
(schedule length) to complete a convergecast. Next, we combine scheduling with transmission power control to
mitigate the effects of interference, and show that while power control helps in reducing the schedule length under a
single frequency, scheduling transmissions using multiple frequencies is more efficient. We give lower bounds on the
schedule length when interference is completely eliminated, and propose algorithms that achieve these bounds. We
also evaluate the performance of various channel assignment methods and find empirically that for moderate size
networks of about 100 nodes, the use of multi-frequency scheduling can suffice to eliminate most of the interference.
Then, the data collection rate no longer remains limited by interference but by the topology of the routing tree. To this
end, we construct degree-constrained spanning trees and capacitated minimal spanning trees, and show significant
improvement in scheduling performance over different deployment densities. Lastly, we evaluate the impact of
different interference and channel models on the schedule length.
Title :Optimal Scheduling for Multi-radio Multi-channel Multi-hop Cognitive Cellular Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/optimal-scheduling-multi-radio-multi-channel-multi-hop-cognitive-cellular-networks
Abstract : Due to the emerging various data services, current cellular networks have been experiencing a surge of

data traffic and already overloaded, thus not able to meet the ever exploding traffic demand. In this study, we first
introduce a Multi-radio Multi-channel Multi-hop Cognitive Cellular Network (M3C2N) architecture to enhance network
throughput. Under the proposed architecture, we then investigate the minimum length scheduling problem by
exploring joint frequency allocation, link scheduling, and routing. In particular, we first formulate a maximal
independent set based joint scheduling and routing optimization problem called Original Optimization Problem (OOP).
It is a Mixed Integer Non-Linear Programming (MINLP) and generally NP-hard problem. Then, employing a column
generation based approach, we develop an ?-bounded approximation algorithm which can obtain an ?-bounded
approximate result of OOP. Noticeably, in fact we do not need to find all the maximal independent sets in the
proposed algorithm, which are usually assumed to be given in previous works although finding all of them is
NP-complete. We also revisit the minimum length scheduling problem by considering uncertain channel availability.
Simulation results show that we can efficiently find the ?-bounded approximate results and the optimal result as well,
i.e., when ? = 0% in the algorithm.
Title :Optimal Scheduling for Multi-radio Multi-channel Multi-hop Cognitive Cellular Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/optimal-scheduling-multi-radio-multi-channel-cognitive-cellular-networks
Abstract : Due to the emerging various data services, current cellular networks have been experiencing a surge of
data traffic and already overloaded, thus not able to meet the ever exploding traffic demand. In this study, we first
introduce a Multi-radio Multi-channel Multi-hop Cognitive Cellular Network (M3C2N) architecture to enhance network
throughput. Under the proposed architecture, we then investigate the minimum length scheduling problem by
exploring joint frequency allocation, link scheduling, and routing. In particular, we first formulate a maximal
independent set based joint scheduling and routing optimization problem called Original Optimization Problem (OOP).
It is a Mixed Integer Non-Linear Programming (MINLP) and generally NP-hard problem. Then, employing a column
generation based approach, we develop an ?-bounded approximation algorithm which can obtain an ?-bounded
approximate result of OOP. Noticeably, in fact we do not need to find all the maximal independent sets in the
proposed algorithm, which are usually assumed to be given in previous works although finding all of them is
NP-complete. We also revisit the minimum length scheduling problem by considering uncertain channel availability.
Simulation results show that we can efficiently find the ?-bounded approximate results and the optimal result as well,
i.e., when ? = 0% in the algorithm.
Title :Fault Localization Using Passive End-to-End Measurements and Sequential Testing for Wireless Sensor
Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/fault-localization-using-passive-end-end-measurements-sequential-testing
Abstract : Faulty components in a network need to be localized and repaired to sustain the health of the network. In
this paper, we propose a novel approach that carefully combines active and passive measurements to localize faults
in wireless sensor networks. More specifically, we formulate a problem of optimal sequential testing guided by
end-to-end data. This problem determines an optimal testing sequence of network components based on end-to-end
data in sensor networks to minimize expected testing cost. We prove that this problem is NP-hard, and propose a
recursive approach to solve it. This approach leads to a polynomial-time optimal algorithm for line topologies while
requiring exponential running time for general topologies. We further develop two polynomial-time heuristic schemes
that are applicable to general topologies. Extensive simulation shows that our heuristic schemes only require testing a
very small set of network components to localize and repair all faults in the network. Our approach is superior to using
active and passive measurements in isolation. It also outperforms the state-of-the-art approaches that localize and
repair all faults in a network.
http://kasanpro.com/ieee/final-year-project-center-chennai-reviews
Title :Fault Localization Using Passive End-to-End Measurements and Sequential Testing for Wireless Sensor
Networks
Language : NS2
Project Link :
http://kasanpro.com/p/ns2/fault-localization-using-passive-end-end-measurements-sequential-testing-code
Abstract : Faulty components in a network need to be localized and repaired to sustain the health of the network. In
this paper, we propose a novel approach that carefully combines active and passive measurements to localize faults
in wireless sensor networks. More specifically, we formulate a problem of optimal sequential testing guided by

end-to-end data. This problem determines an optimal testing sequence of network components based on end-to-end
data in sensor networks to minimize expected testing cost. We prove that this problem is NP-hard, and propose a
recursive approach to solve it. This approach leads to a polynomial-time optimal algorithm for line topologies while
requiring exponential running time for general topologies. We further develop two polynomial-time heuristic schemes
that are applicable to general topologies. Extensive simulation shows that our heuristic schemes only require testing a
very small set of network components to localize and repair all faults in the network. Our approach is superior to using
active and passive measurements in isolation. It also outperforms the state-of-the-art approaches that localize and
repair all faults in a network.
Title :Reliable Anchor-Based Sensor Localization in Irregular Areas
Language : NS2
Project Link : http://kasanpro.com/p/ns2/reliable-anchor-based-sensor-localization-irregular-areas
Abstract : Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency
of location-aware protocols and applications, such as routing and storage. Most previous localization algorithms
assume that sensors are distributed in regular areas without holes or obstacles, which often does not reflect
real-world conditions, especially for outdoor deployment of wireless sensor networks. In this paper, we propose a
novel scheme called Reliable Anchor-based Localization (RAL), which can greatly reduce the localization error due to
the irregular deployment areas. We first provide theoretical analysis of the minimum hop length for uniformly
distributed networks and then show its close approximation to empirical results, which can assist in the construction of
a reliable minimal hop-length table offline. Using this table, we are able to tell whether a path is severely detoured and
compute a more accurate average hop length as the basis for distance estimation. At runtime, the RAL scheme 1)
utilizes the reliable minimal hop length from the table as the threshold to differentiate between reliable anchors and
unreliable ones, and 2) allows each sensor to determine its position utilizing only distance constraints obtained from
reliable anchors. The simulation results show that RAL can effectively filter out unreliable anchors and therefore
improve the localization accuracy.
Title :Reliable Anchor-Based Sensor Localization in Irregular Areas
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/reliable-anchor-based-sensor-localization-irregular-areas-code
Abstract : Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency
of location-aware protocols and applications, such as routing and storage. Most previous localization algorithms
assume that sensors are distributed in regular areas without holes or obstacles, which often does not reflect
real-world conditions, especially for outdoor deployment of wireless sensor networks. In this paper, we propose a
novel scheme called Reliable Anchor-based Localization (RAL), which can greatly reduce the localization error due to
the irregular deployment areas. We first provide theoretical analysis of the minimum hop length for uniformly
distributed networks and then show its close approximation to empirical results, which can assist in the construction of
a reliable minimal hop-length table offline. Using this table, we are able to tell whether a path is severely detoured and
compute a more accurate average hop length as the basis for distance estimation. At runtime, the RAL scheme 1)
utilizes the reliable minimal hop length from the table as the threshold to differentiate between reliable anchors and
unreliable ones, and 2) allows each sensor to determine its position utilizing only distance constraints obtained from
reliable anchors. The simulation results show that RAL can effectively filter out unreliable anchors and therefore
improve the localization accuracy.
Title :A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/time-slot-allocation-protocol-wireless-sensor-networks
Abstract : There are performance deficiencies that hamper the deployment of Wireless Sensor Networks (WSNs) in
critical monitoring applications. Such applications are characterized by considerable network load generated as a
result of sensing some characteristics of the monitored system. Excessive packet collisions lead to packet losses and
retransmissions, resulting in significant overhead costs and latency. In order to address this issue, we introduce a
distributed and scalable scheduling access scheme that mitigates high data loss in data-intensive sensor networks
and can also handle some mobility. Our approach alleviates transmission collisions by employing virtual grids that
adopt Latin Squares characteristics to time slot assignments. We show that our algorithm derives conflict-free time
slot allocation schedules without incurring global overhead in scheduling. Furthermore, we verify the effectiveness of
our protocol by simulation experiments. The results demonstrate that our technique can efficiently handle sensor
mobility with acceptable data loss, low packet delay, and low overhead.

Title :A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/time-slot-allocation-protocol-wireless-sensor-networks-code
Abstract : There are performance deficiencies that hamper the deployment of Wireless Sensor Networks (WSNs) in
critical monitoring applications. Such applications are characterized by considerable network load generated as a
result of sensing some characteristics of the monitored system. Excessive packet collisions lead to packet losses and
retransmissions, resulting in significant overhead costs and latency. In order to address this issue, we introduce a
distributed and scalable scheduling access scheme that mitigates high data loss in data-intensive sensor networks
and can also handle some mobility. Our approach alleviates transmission collisions by employing virtual grids that
adopt Latin Squares characteristics to time slot assignments. We show that our algorithm derives conflict-free time
slot allocation schedules without incurring global overhead in scheduling. Furthermore, we verify the effectiveness of
our protocol by simulation experiments. The results demonstrate that our technique can efficiently handle sensor
mobility with acceptable data loss, low packet delay, and low overhead.
Title :VeMAC: A TDMA-based MAC Protocol for Reliable Broadcast in VANETs
Language : NS2
Project Link : http://kasanpro.com/p/ns2/vemac-tdma-based-mac-protocol-reliable-broadcast-vanets-module
Abstract : The need of a medium access control (MAC) protocol for an efficient broadcast service is of great
importance to support the high priority safety applications in vehicular ad hoc networks (VANETs). This paper
introduces VeMAC, a novel multichannel TDMA MAC protocol proposed specifically for a VANET scenario. The
VeMAC supports efficient one-hop and multi-hop broadcast services on the control channel by using implicit
acknowledgments and eliminating the hidden terminal problem. The protocol reduces transmission collisions due to
node mobility on the control channel by assigning disjoint sets of time slots to vehicles moving in opposite directions
and to road side units. Analysis and simulation results in highway and city scenarios are presented to evaluate the
performance of VeMAC and compare it with ADHOC MAC, an existing TDMA MAC protocol for VANETs. It is shown
that, due to its ability to decrease the rate of transmission collisions, the VeMAC protocol can provide significantly
higher throughput on the control channel than ADHOC MAC.
Title :VeMAC: A TDMA-based MAC Protocol for Reliable Broadcast in VANETs
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/vemac-tdma-based-mac-protocol-reliable-broadcast-vanets
Abstract : The need of a medium access control (MAC) protocol for an efficient broadcast service is of great
importance to support the high priority safety applications in vehicular ad hoc networks (VANETs). This paper
introduces VeMAC, a novel multichannel TDMA MAC protocol proposed specifically for a VANET scenario. The
VeMAC supports efficient one-hop and multi-hop broadcast services on the control channel by using implicit
acknowledgments and eliminating the hidden terminal problem. The protocol reduces transmission collisions due to
node mobility on the control channel by assigning disjoint sets of time slots to vehicles moving in opposite directions
and to road side units. Analysis and simulation results in highway and city scenarios are presented to evaluate the
performance of VeMAC and compare it with ADHOC MAC, an existing TDMA MAC protocol for VANETs. It is shown
that, due to its ability to decrease the rate of transmission collisions, the VeMAC protocol can provide significantly
higher throughput on the control channel than ADHOC MAC.
Title :AMD: Audit-based Misbehavior Detection in Wireless Ad Hoc Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/amd-audit-based-misbehavior-detection-wireless-ad-hoc-networks
Abstract : We address the problem of identifying and isolating misbehaving nodes that refuse to forward packets in
multi-hop ad hoc networks. We develop a comprehensive system called Audit-based Misbehavior Detection (AMD)
that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates
reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral
audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing
energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect
selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multi-channel networks or

networks consisting of nodes with directional antennas. We show via simulations that AMD successfully avoids
misbehaving nodes, even when a large portion of the network refuses to forward packets.
Title :AMD: Audit-based Misbehavior Detection in Wireless Ad Hoc Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/amd-audit-based-misbehavior-detection-wireless-ad-hoc
Abstract : We address the problem of identifying and isolating misbehaving nodes that refuse to forward packets in
multi-hop ad hoc networks. We develop a comprehensive system called Audit-based Misbehavior Detection (AMD)
that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates
reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral
audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing
energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect
selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multi-channel networks or
networks consisting of nodes with directional antennas. We show via simulations that AMD successfully avoids
misbehaving nodes, even when a large portion of the network refuses to forward packets.
Title :A Scalable Server Architecture for Mobile Presence Services in Social Network Applications
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/server-architecture-mobile-presence-services-social-network-applications
Abstract : Social network applications are becoming increasingly popular on mobile devices. A mobile presence
service is an essential component of a social network application because it maintains each mobile user's presence
information, such as the current status (online/offline), GPS location and network address, and also updates the
user's online friends with the information continually. If presence updates occur frequently, the enormous number of
messages distributed by presence servers may lead to a scalability problem in a large-scale mobile presence service.
To address the problem, we propose an efficient and scalable server architecture, called PresenceCloud, which
enables mobile presence services to support large-scale social network applications. When a mobile user joins a
network, PresenceCloud searches for the presence of his/her friends and notifies them of his/her arrival.
PresenceCloud organizes presence servers into a quorum-based server-to-server architecture for efficient presence
searching. It also leverages a directed search algorithm and a one-hop caching strategy to achieve small constant
search latency. We analyze the performance of PresenceCloud in terms of the search cost and search satisfaction
level. The search cost is defined as the total number of messages generated by the presence server when a user
arrives; and search satisfaction level is defined as the time it takes to search for the arriving user's friend list. The
results of simulations demonstrate that PresenceCloud achieves performance gains in the search cost without
compromising search satisfaction.
Title :A Scalable Server Architecture for Mobile Presence Services in Social Network Applications
Language : NS2
Project Link :
http://kasanpro.com/p/ns2/server-architecture-mobile-presence-services-social-network-applications-code
Abstract : Social network applications are becoming increasingly popular on mobile devices. A mobile presence
service is an essential component of a social network application because it maintains each mobile user's presence
information, such as the current status (online/offline), GPS location and network address, and also updates the
user's online friends with the information continually. If presence updates occur frequently, the enormous number of
messages distributed by presence servers may lead to a scalability problem in a large-scale mobile presence service.
To address the problem, we propose an efficient and scalable server architecture, called PresenceCloud, which
enables mobile presence services to support large-scale social network applications. When a mobile user joins a
network, PresenceCloud searches for the presence of his/her friends and notifies them of his/her arrival.
PresenceCloud organizes presence servers into a quorum-based server-to-server architecture for efficient presence
searching. It also leverages a directed search algorithm and a one-hop caching strategy to achieve small constant
search latency. We analyze the performance of PresenceCloud in terms of the search cost and search satisfaction
level. The search cost is defined as the total number of messages generated by the presence server when a user
arrives; and search satisfaction level is defined as the time it takes to search for the arriving user's friend list. The
results of simulations demonstrate that PresenceCloud achieves performance gains in the search cost without
compromising search satisfaction.

Title :EMAP: Expedite Message Authentication Protocol for Vehicular Ad Hoc Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/emap-expedite-message-authentication-protocol-vehicular-ad-hoc-networks
Abstract : Vehicular Ad Hoc Networks (VANETs) adopt the Public Key Infrastructure (PKI) and Certificate Revocation
Lists (CRLs) for their security. In any PKI system, the authentication of a received message is performed by checking
if the certificate of the sender is included in the current CRL, and verifying the authenticity of the certificate and
signature of the sender. In this paper, we propose an Expedite Message Authentication Protocol (EMAP) for VANETs,
which replaces the time-consuming CRL checking process by an efficient revocation checking process. The
revocation check process in EMAP uses a keyed Hash Message Authentication Code (HMAC ), where the key used
in calculating the HMAC is shared only between non-revoked On-Board Units (OBUs). In addition, EMAP uses a
novel probabilistic key distribution, which enables non-revoked OBUs to securely share and update a secret key.
EMAP can significantly decrease the message loss ratio due to the message verification delay compared with the
conventional authentication methods employing CRL. By conducting security analysis and performance evaluation,
EMAP is demonstrated to be secure and efficient.
Title :EMAP: Expedite Message Authentication Protocol for Vehicular Ad Hoc Networks
Language : NS2
Project Link :
http://kasanpro.com/p/ns2/emap-expedite-message-authentication-protocol-vehicular-ad-hoc-networks-code
Abstract : Vehicular Ad Hoc Networks (VANETs) adopt the Public Key Infrastructure (PKI) and Certificate Revocation
Lists (CRLs) for their security. In any PKI system, the authentication of a received message is performed by checking
if the certificate of the sender is included in the current CRL, and verifying the authenticity of the certificate and
signature of the sender. In this paper, we propose an Expedite Message Authentication Protocol (EMAP) for VANETs,
which replaces the time-consuming CRL checking process by an efficient revocation checking process. The
revocation check process in EMAP uses a keyed Hash Message Authentication Code (HMAC ), where the key used
in calculating the HMAC is shared only between non-revoked On-Board Units (OBUs). In addition, EMAP uses a
novel probabilistic key distribution, which enables non-revoked OBUs to securely share and update a secret key.
EMAP can significantly decrease the message loss ratio due to the message verification delay compared with the
conventional authentication methods employing CRL. By conducting security analysis and performance evaluation,
EMAP is demonstrated to be secure and efficient.
Title :Mobile Relay Configuration in Data-intensive Wireless Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/mobile-relay-configuration-data-intensive-wireless-sensor-networks
Abstract : Wireless Sensor Networks (WSNs) are increasingly used in data-intensive applications such as
micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive
WSNs is to transmit all the data generated within an application's lifetime to the base station despite the fact that
sensor nodes have limited power supplies. We propose using low-cost disposable mobile relays to reduce the energy
consumption of data-intensive WSNs. Our approach differs from previous work in two main aspects. First, it does not
require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor
platforms. Second, we integrate the energy consumption due to both mobility and wireless transmissions into a
holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an
optimal routing tree assuming no nodes can move. The second algorithm improves the topology of the routing tree by
greedily adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree
by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for
each node given the constraint that the routing tree topology does not change. We present efficient distributed
implementations for each algorithm that require only limited, localized synchronization. Because we do not
necessarily compute an optimal topology, our final routing tree is not necessarily optimal. However, our simulation
results show that our algorithms significantly outperform the best existing solutions.
Title :Mobile Relay Configuration in Data-intensive Wireless Sensor Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/mobile-relay-configuration-data-intensive-wireless-sensor-networks-code

Abstract : Wireless Sensor Networks (WSNs) are increasingly used in data-intensive applications such as
micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive
WSNs is to transmit all the data generated within an application's lifetime to the base station despite the fact that
sensor nodes have limited power supplies. We propose using low-cost disposable mobile relays to reduce the energy
consumption of data-intensive WSNs. Our approach differs from previous work in two main aspects. First, it does not
require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor
platforms. Second, we integrate the energy consumption due to both mobility and wireless transmissions into a
holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an
optimal routing tree assuming no nodes can move. The second algorithm improves the topology of the routing tree by
greedily adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree
by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for
each node given the constraint that the routing tree topology does not change. We present efficient distributed
implementations for each algorithm that require only limited, localized synchronization. Because we do not
necessarily compute an optimal topology, our final routing tree is not necessarily optimal. However, our simulation
results show that our algorithms significantly outperform the best existing solutions.
Title :On Quality of Monitoring for Multi-channel Wireless Infrastructure Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/on-quality-monitoring-multi-channel-wireless-infrastructure-networks
Abstract : Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in
wireless infrastructure networks for fault diagnosis, resource management and critical path analysis. In this paper,
we introduce a quality of monitoring (QoM) metric defined by the expected number of active users monitored, and
investigate the problem of maximizing QoM by judiciously assigning sniffers to channels based on the knowledge of
user activities in a multi-channel wireless network. Two types of capture models are considered. The user-centric
model assumes frame-level capturing capability of sniffers such that the activities of different users can be
distinguished while the sniffer-centric model only utilizes the binary channel information (active or not) at a sniffer. For
the user-centric model, we show that the implied optimization problem is NP-hard, but a constant approximation ratio
can be attained via polynomial complexity algorithms. For the sniffer-centric model, we devise stochastic inference
schemes to transform the problem into the user-centric domain, where we are able to apply our polynomial
approximation algorithms. The effectiveness of our proposed schemes and algorithms is further evaluated using both
synthetic data as well as real-world traces from an operational WLAN.
Title :On Quality of Monitoring for Multi-channel Wireless Infrastructure Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/on-quality-monitoring-multi-channel-wireless-infrastructure-networks-code
Abstract : Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in
wireless infrastructure networks for fault diagnosis, resource management and critical path analysis. In this paper,
we introduce a quality of monitoring (QoM) metric defined by the expected number of active users monitored, and
investigate the problem of maximizing QoM by judiciously assigning sniffers to channels based on the knowledge of
user activities in a multi-channel wireless network. Two types of capture models are considered. The user-centric
model assumes frame-level capturing capability of sniffers such that the activities of different users can be
distinguished while the sniffer-centric model only utilizes the binary channel information (active or not) at a sniffer. For
the user-centric model, we show that the implied optimization problem is NP-hard, but a constant approximation ratio
can be attained via polynomial complexity algorithms. For the sniffer-centric model, we devise stochastic inference
schemes to transform the problem into the user-centric domain, where we are able to apply our polynomial
approximation algorithms. The effectiveness of our proposed schemes and algorithms is further evaluated using both
synthetic data as well as real-world traces from an operational WLAN.
Title :Optimal Multicast Capacity and Delay Tradeoffs in MANETs
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/optimal-multicast-capacity-delay-tradeoffs-manets
Abstract : In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Ad Hoc

Networks (MANETs). Specifically, we consider four node mobility models: (1) two-dimensional i.i.d. mobility, (2)
two-dimensional hybrid random walk, (3) one-dimensional i.i.d. mobility, and (4) one-dimensional hybrid random walk.
Two mobility time-scales are investigated in this paper: (i) Fast mobility where node mobility is at the same time-scale
as data transmissions; (ii) Slow mobility where node mobility is assumed to occur at a much slower time-scale than
data transmissions. Given a delay constraint D, we first characterize the optimal multicast capacity for each of the
eight types of mobility models, and then we develop a scheme that can achieve a capacity-delay tradeoff close to the
upper bound up to a logarithmic factor. In addition, we also study heterogeneous networks with infrastructure support.
Title :Optimal Multicast Capacity and Delay Tradeoffs in MANETs
Language : NS2
Project Link : http://kasanpro.com/p/ns2/optimal-multicast-capacity-delay-tradeoffs-manets-code
Abstract : In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Ad Hoc
Networks (MANETs). Specifically, we consider four node mobility models: (1) two-dimensional i.i.d. mobility, (2)
two-dimensional hybrid random walk, (3) one-dimensional i.i.d. mobility, and (4) one-dimensional hybrid random walk.
Two mobility time-scales are investigated in this paper: (i) Fast mobility where node mobility is at the same time-scale
as data transmissions; (ii) Slow mobility where node mobility is assumed to occur at a much slower time-scale than
data transmissions. Given a delay constraint D, we first characterize the optimal multicast capacity for each of the
eight types of mobility models, and then we develop a scheme that can achieve a capacity-delay tradeoff close to the
upper bound up to a logarithmic factor. In addition, we also study heterogeneous networks with infrastructure support.
Title :Towards a Statistical Framework for Source Anonymity in Sensor Networks
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/towards-statistical-source-anonymity-sensor-networks
Abstract : In certain applications, the locations of events reported by a sensor network need to remain anonymous.
That is, unauthorized observers must be unable to detect the origin of such events by analyzing the network traffic.
Known as the source anonymity problem, this problem has emerged as an important topic in the security of wireless
sensor networks, with variety of techniques based on different adversarial assumptions being proposed. In this work,
we present a new framework for modeling, analyzing and evaluating anonymity in sensor networks. The novelty of the
proposed framework is twofold: first, it introduces the notion of "interval indistinguishability" and provides a
quantitative measure to model anonymity in wireless sensor networks; second, it maps source anonymity to the
statistical problem of binary hypothesis testing with nuisance parameters. We then analyze existing solutions for
designing anonymous sensor networks using the proposed model. We show how mapping source anonymity to
binary hypothesis testing with nuisance parameters leads to converting the problem of exposing private source
information into searching for an appropriate data transformation that removes or minimize the effect of the nuisance
information. By doing so, we transform the problem from analyzing real-valued sample points to binary codes, which
opens the door for coding theory to be incorporated into the study of anonymous sensor networks. Finally, we discuss
how existing solutions can be modified to improve their anonymity.
Title :Towards a Statistical Framework for Source Anonymity in Sensor Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/towards-statistical-source-anonymity-sensor-networks-code
Abstract : In certain applications, the locations of events reported by a sensor network need to remain anonymous.
That is, unauthorized observers must be unable to detect the origin of such events by analyzing the network traffic.
Known as the source anonymity problem, this problem has emerged as an important topic in the security of wireless
sensor networks, with variety of techniques based on different adversarial assumptions being proposed. In this work,
we present a new framework for modeling, analyzing and evaluating anonymity in sensor networks. The novelty of the
proposed framework is twofold: first, it introduces the notion of "interval indistinguishability" and provides a
quantitative measure to model anonymity in wireless sensor networks; second, it maps source anonymity to the
statistical problem of binary hypothesis testing with nuisance parameters. We then analyze existing solutions for
designing anonymous sensor networks using the proposed model. We show how mapping source anonymity to
binary hypothesis testing with nuisance parameters leads to converting the problem of exposing private source
information into searching for an appropriate data transformation that removes or minimize the effect of the nuisance
information. By doing so, we transform the problem from analyzing real-valued sample points to binary codes, which
opens the door for coding theory to be incorporated into the study of anonymous sensor networks. Finally, we discuss
how existing solutions can be modified to improve their anonymity.
Title :Vampire attacks: Draining life from wireless ad-hoc sensor networks
Language : C#

Project Link : http://kasanpro.com/p/c-sharp/vampire-attacks-draining-life-wireless-ad-hoc-sensor-networks-module
Abstract : Ad-hoc low-power wireless networks are an exciting research direction in sensing and pervasive
computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium
access control levels. This paper explores resource depletion attacks at the routing protocol layer, which permanently
disable networks by quickly draining nodes' battery power. These "Vampire" attacks are not specific to any specific
protocol, but rather rely on the properties of many popular classes of routing protocols. We find that all examined
protocols are susceptible to Vampire attacks, which are devastating, difficult to detect, and are easy to carry out using
as few as one malicious insider sending only protocol- compliant messages. In the worst case, a single Vampire can
increase network-wide energy usage by a factor of O(N ), where N in the number of network nodes. We discuss
methods to mitigate these types of attacks, including a new proof-of-concept protocol that provably bounds the
damage caused by Vampires during the packet forwarding phase.
Title :Vampire attacks: Draining life from wireless ad-hoc sensor networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/vampire-attacks-draining-life-wireless-ad-hoc-sensor-networks
Abstract : Ad-hoc low-power wireless networks are an exciting research direction in sensing and pervasive
as few as one malicious insider sending only protocol- compliant messages. In the worst case, a single Vampire can
increase network-wide energy usage by a factor of O(N ), where N in the number of network nodes. We discuss
Title :Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/vampire-attacks-draining-life-wireless-ad-hoc-sensor-networks-implement
Abstract : Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive
as few as one malicious insider sending only protocol-compliant messages. In the worst case, a single Vampire can
increase network-wide energy usage by a factor of O(N), where N in the number of network nodes. We discuss
Title :Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/vampire-attacks-draining-life-wireless-ad-hoc-sensor-networks-module-code
Abstract : Ad hoc low-power wireless networks are an exciting research direction in sensing and pervasive

as few as one malicious insider sending only protocol-compliant messages. In the worst case, a single Vampire can
increase network-wide energy usage by a factor of O(N), where N in the number of network nodes. We discuss
Title :DOTS: A Propagation Delay-aware Opportunistic MAC Protocol for Underwater Sensor Networks
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/dots-propagation-delay-aware-opportunistic-mac-protocol-underwater-sensor-networks
Abstract : Underwater Acoustic Sensor Networks (UW-ASNs) use acoustic links as a means of communications and
are accordingly confronted with long propagation delays, low bandwidth, and high transmission power consumption.
This unique situation, however, permits multiple packets to concurrently propagate in the underwater channel, which
must be exploited in order to improve the overall throughput. To this end, we propose the Delay-aware Opportunistic
Transmission Scheduling (DOTS) algorithm that uses passively obtained local information (i.e., neighboring nodes'
propagation delay map and their expected transmission schedules) to increase the chances of concurrent
transmissions while reducing the likelihood of collisions. Our extensive simulation results document that DOTS
outperforms existing solutions and provides fair medium access.
Title :DOTS: A Propagation Delay-aware Opportunistic MAC Protocol for Underwater Sensor Networks
Language : NS2
Project Link : http://kasanpro.com/p/ns2/dots-propagation-delay-aware-opportunistic-mac-protocol-underwater-sensor-network
Abstract : Underwater Acoustic Sensor Networks (UW-ASNs) use acoustic links as a means of communications and
are accordingly confronted with long propagation delays, low bandwidth, and high transmission power consumption.
This unique situation, however, permits multiple packets to concurrently propagate in the underwater channel, which
must be exploited in order to improve the overall throughput. To this end, we propose the Delay-aware Opportunistic
Transmission Scheduling (DOTS) algorithm that uses passively obtained local information (i.e., neighboring nodes'
propagation delay map and their expected transmission schedules) to increase the chances of concurrent
transmissions while reducing the likelihood of collisions. Our extensive simulation results document that DOTS
outperforms existing solutions and provides fair medium access.
Title :From MAP to DIST: The Evolution of a Large-Scale WLAN Monitoring System
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/from-map-dist-the-evolution-large-scale-wlan-monitoring-system
Abstract : The edge of the Internet is increasingly becoming wireless. Therefore, monitoring the wireless edge is
important to understanding the security and performance aspects of the Internet experience. We designed and
implemented a large-scale WLAN monitoring system, the Dartmouth Internet security testbed (DIST), at Dartmouth
College. It is equipped with distributed arrays of "sniffers" that cover 210 diverse campus locations and more than
5,000 users. In this paper, we describe our approach, designs, and solutions for addressing the technical challenges
that have resulted from efficiency, scalability, security, and management perspectives. We also present extensive
evaluation results on a production network, and summarize the lessons learned.
Title :From MAP to DIST: The Evolution of a Large-Scale WLAN Monitoring System
Language : NS2
Project Link : http://kasanpro.com/p/ns2/from-map-dist-the-evolution-large-scale-wlan-monitoring-system-code
Abstract : The edge of the Internet is increasingly becoming wireless. Therefore, monitoring the wireless edge is
important to understanding the security and performance aspects of the Internet experience. We designed and
implemented a large-scale WLAN monitoring system, the Dartmouth Internet security testbed (DIST), at Dartmouth
College. It is equipped with distributed arrays of "sniffers" that cover 210 diverse campus locations and more than
5,000 users. In this paper, we describe our approach, designs, and solutions for addressing the technical challenges
that have resulted from efficiency, scalability, security, and management perspectives. We also present extensive
evaluation results on a production network, and summarize the lessons learned.

Title :DragonNet: A Robust Mobile Internet Service System for Long-Distance Trains
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/dragonnet-robust-mobile-internet-service-system-long-distance-trains
Abstract : Wide range wireless networks often suffer from annoying service deterioration due to ever-changing
wireless environments. This is especially the case with passengers on long-distance trains (LDT, such as intercity,
interprovincial, and international commuter trains) connecting to the Internet. To improve the service quality of
wide-area wireless networks, we present the DragonNet system and protocol with practical implementations. The
DragonNet system is a chained gateway that consists of a group of interlinked DragonNet routers running the
DragonNet protocol for node failure amortization across the long stretching router chain. The protocol makes use of
the spatial diversity of wireless signals when not all spots on a surface see the same level of radio frequency
radiation. In the case of an LDT of around 500 meters, it is highly possible that some of the DragonNet routers in the
gateway chain still see sound signal quality when the LDT is partially blocked from the wireless Internet. The
DragonNet protocol fully utilizes this feature to amortize single-point router failure over the whole router chain by
intelligently rerouting traffic on failed ones to sound ones. We have implemented the DragonNet system and tested it
in real railways over a period of three months. Our results have pinpointed two fundamental contributions of the
DragonNet protocol. First, DragonNet significantly reduces the average temporary communication blackout (i.e., no
Internet connection) to 1.5 seconds compared with 6 seconds without the DragonNet protocol. Second, DragonNet
nearly doubles the aggregate system throughput compared with gateway without running the DragonNet protocol.
Title :DragonNet: A Robust Mobile Internet Service System for Long-Distance Trains
Language : NS2
Project Link : http://kasanpro.com/p/ns2/dragonnet-robust-mobile-internet-service-system-long-distance-trains-code
Abstract : Wide range wireless networks often suffer from annoying service deterioration due to ever-changing
wireless environments. This is especially the case with passengers on long-distance trains (LDT, such as intercity,
interprovincial, and international commuter trains) connecting to the Internet. To improve the service quality of
wide-area wireless networks, we present the DragonNet system and protocol with practical implementations. The
DragonNet system is a chained gateway that consists of a group of interlinked DragonNet routers running the
DragonNet protocol for node failure amortization across the long stretching router chain. The protocol makes use of
the spatial diversity of wireless signals when not all spots on a surface see the same level of radio frequency
radiation. In the case of an LDT of around 500 meters, it is highly possible that some of the DragonNet routers in the
gateway chain still see sound signal quality when the LDT is partially blocked from the wireless Internet. The
DragonNet protocol fully utilizes this feature to amortize single-point router failure over the whole router chain by
intelligently rerouting traffic on failed ones to sound ones. We have implemented the DragonNet system and tested it
in real railways over a period of three months. Our results have pinpointed two fundamental contributions of the
DragonNet protocol. First, DragonNet significantly reduces the average temporary communication blackout (i.e., no
Internet connection) to 1.5 seconds compared with 6 seconds without the DragonNet protocol. Second, DragonNet
nearly doubles the aggregate system throughput compared with gateway without running the DragonNet protocol.
Title :Range-Based Skyline Queries in Mobile Environments
Language : Java
Project Link : http://kasanpro.com/p/java/range-based-skyline-queries-mobile-environments
Abstract : Skyline query processing for location-based services, which considers both spatial and nonspatial
attributes of the objects being queried, has recently received increasing attention. Existing solutions focus on solving
point- or line-based skyline queries, in which the query location is an exact location point or a line segment. However,
due to privacy concerns and limited precision of localization devices, the input of a user location is often a spatial
range. This paper studies a new problem of how to process such range-based skyline queries. Two novel algorithms
are proposed: one is index-based (I-SKY) and the other is not based on any index (N-SKY). To handle frequent
movements of the objects being queried, we also propose incremental versions of I-SKY and N-SKY, which avoid
recomputing the query index and results from scratch. Additionally, we develop efficient solutions for probabilistic and
continuous range-based skyline queries. Experimental results show that our proposed algorithms well outperform the
baseline algorithm that adopts the existing line-based skyline solution. Moreover, the incremental versions of I-SKY
and N-SKY save substantial computation cost, especially when the objects move frequently.
Title :Reliable Data Delivery in Mobile Adhoc Networks Using Light Weight Verification Algorithm with High Node
Mobility
Language : NS2

Project Link : http://kasanpro.com/p/ns2/reliable-data-delivery-mobile-adhoc-networks
Abstract : This paper addresses data aggregation and data packets issues for highly dynamic mobile ad hoc
networks and Wireless Sensor Networks thereby leading to a timely and reliable reduction in both communication and
energy consumption. But there might be node failures in existing systems and an aggregation framework does not
address issues of false sub-aggregate values due to compromised nodes leading to huge errors in base station
computed aggregates when data is transferred through mobile sensor nodes. It cannot also transfer data after nodes
fail at the intermediate level. This paper proposes a novel lightweight verification algorithm and Position-based
Opportunistic Routing (POR) protocol which reduces node failure and data loss issues. Theoretical analysis and
simulation prove that POR and the novel lightweight verification algorithm achieve excellent performance under high
node mobility with acceptable overhead. Also the new void handling scheme performs efficiently.
Title :Cloud-Assisted Mobile-Access of Health Data With Privacy and Auditability
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/cloud-assisted-mobile-access-health-data-with-privacy-auditability
Abstract : Motivated by the privacy issues, curbing the adoption of electronic healthcare systems and the wild
success of cloud service models, we propose to build privacy into mobile healthcare systemswith the help of the
private cloud. Our system offers salient features including efficient key management, privacy-preserving data storage,
and retrieval, especially for retrieval at emergencies, and auditability for misusing health data. Specifically, we
propose to integrate key management from pseudorandom number generator for unlinkability, a secure indexing
method for privacypreserving keyword searchwhich hides both search and access patterns based on redundancy,
and integrate the concept of attributebased encryption with threshold signing for providing role-based access control
with auditability to prevent potential misbehavior, in both normal and emergency cases.
Title :Cloud-Assisted Mobile-Access of Health Data With Privacy and Auditability
Language : NS2
Project Link : http://kasanpro.com/p/ns2/cloud-assisted-mobile-access-health-data-privacy-auditability
Abstract : Motivated by the privacy issues, curbing the adoption of electronic healthcare systems and the wild
success of cloud service models, we propose to build privacy into mobile healthcare systemswith the help of the
private cloud. Our system offers salient features including efficient key management, privacy-preserving data storage,
and retrieval, especially for retrieval at emergencies, and auditability for misusing health data. Specifically, we
propose to integrate key management from pseudorandom number generator for unlinkability, a secure indexing
method for privacypreserving keyword searchwhich hides both search and access patterns based on redundancy,
and integrate the concept of attributebased encryption with threshold signing for providing role-based access control
with auditability to prevent potential misbehavior, in both normal and emergency cases.
Title :Efficient Authentication for Mobile and Pervasive Computing
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/efficient-authentication-mobile-pervasive-computing
Abstract : With today's technology, many applications rely on the existence of small devices that can exchange
information and form communication networks. In a significant portion of such applications, the confidentiality and
integrity of the communicated messages are of particular interest. In this work, we propose two novel techniques for
authenticating short encrypted messages that are directed to meet the requirements of mobile and pervasive
applications. By taking advantage of the fact that the message to be authenticated must also be encrypted, we
propose provably secure authentication codes that are more efficient than any message authentication code in the
literature. The key idea behind the proposed techniques is to utilize the security that the encryption algorithm can
provide to design more efficient authentication mechanisms, as opposed to using standalone authentication
primitives.
Title :Efficient Authentication for Mobile and Pervasive Computing
Language : NS2
Project Link : http://kasanpro.com/p/ns2/efficient-authentication-mobile-pervasive-computing-code
Abstract : With today's technology, many applications rely on the existence of small devices that can exchange
information and form communication networks. In a significant portion of such applications, the confidentiality and

integrity of the communicated messages are of particular interest. In this work, we propose two novel techniques for
authenticating short encrypted messages that are directed to meet the requirements of mobile and pervasive
applications. By taking advantage of the fact that the message to be authenticated must also be encrypted, we
propose provably secure authentication codes that are more efficient than any message authentication code in the
literature. The key idea behind the proposed techniques is to utilize the security that the encryption algorithm can
provide to design more efficient authentication mechanisms, as opposed to using standalone authentication
primitives.
Title :Preserving Location Privacy in Geo-Social Applications
Language : C#
Project Link : http://kasanpro.com/p/c-sharp/preserving-location-privacy-geo-social-applications
Abstract : Using geo-social applications, such as FourSquare, millions of people interact with their surroundings
through their friends and their recommendations. Without adequate privacy protection, however, these systems can
be easily misused, e.g., to track users or target them for home invasion. In this paper, we introduce LocX, a novel
alternative that provides significantly-improved location privacy without adding uncertainty into query results or relying
on strong assumptions about server security. Our key insight is to apply secure user-specific, distance-preserving
coordinate transformations to all location data shared with the server. The friends of a user share this user's secrets
so they can apply the same transformation. This allows all location queries to be evaluated correctly by the server, but
our privacy mechanisms guarantee that servers are unable to see or infer the actual location data from the
transformed data or from the data access. We show that LocX provides privacy even against a powerful adversary
model, and we use prototype measurements to show that it provides privacy with very little performance overhead,
making it suitable for today's mobile devices.
Title :Preserving Location Privacy in Geo-Social Applications
Language : NS2
Project Link : http://kasanpro.com/p/ns2/preserving-location-privacy-geo-social-applications-code
Abstract : Using geo-social applications, such as FourSquare, millions of people interact with their surroundings
through their friends and their recommendations. Without adequate privacy protection, however, these systems can
be easily misused, e.g., to track users or target them for home invasion. In this paper, we introduce LocX, a novel
alternative that provides significantly-improved location privacy without adding uncertainty into query results or relying
on strong assumptions about server security. Our key insight is to apply secure user-specific, distance-preserving
coordinate transformations to all location data shared with the server. The friends of a user share this user's secrets
so they can apply the same transformation. This allows all location queries to be evaluated correctly by the server, but
our privacy mechanisms guarantee that servers are unable to see or infer the actual location data from the
transformed data or from the data access. We show that LocX provides privacy even against a powerful adversary
model, and we use prototype measurements to show that it provides privacy with very little performance overhead,
making it suitable for today's mobile devices.
Title :Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices
Language : C#
Project Link :
http://kasanpro.com/p/c-sharp/privacy-preserving-optimal-meeting-location-determination-mobile-devices
Abstract : Equipped with state-of-the-art smartphones and mobile devices, today's highly interconnected urban
population is increasingly dependent on these gadgets to organize and plan their daily lives. These applications often
rely on current (or preferred) locations of individual users or a group of users to provide the desired service, which
jeopardizes their privacy; users do not necessarily want to reveal their current (or preferred) locations to the service
provider or to other, possibly untrusted, users. In this paper, we propose privacy-preserving algorithms for determining
an optimal meeting location for a group of users. We perform a thorough privacy evaluation by formally quantifying
privacy-loss of the proposed approaches. In order to study the performance of our algorithms in a real deployment,
we implement and test their execution efficiency on Nokia smartphones. By means of a targeted user-study, we
attempt to get an insight into the privacy-awareness of users in locationbased services and the usability of the
proposed solutions.

Title :Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices
Language : NS2
Project Link :
http://kasanpro.com/p/ns2/privacy-preserving-optimal-meeting-location-determination-mobile-devices-code
Abstract : Equipped with state-of-the-art smartphones and mobile devices, today's highly interconnected urban
population is increasingly dependent on these gadgets to organize and plan their daily lives. These applications often
rely on current (or preferred) locations of individual users or a group of users to provide the desired service, which
jeopardizes their privacy; users do not necessarily want to reveal their current (or preferred) locations to the service
provider or to other, possibly untrusted, users. In this paper, we propose privacy-preserving algorithms for determining
an optimal meeting location for a group of users. We perform a thorough privacy evaluation by formally quantifying
privacy-loss of the proposed approaches. In order to study the performance of our algorithms in a real deployment,
we implement and test their execution efficiency on Nokia smartphones. By means of a targeted user-study, we
attempt to get an insight into the privacy-awareness of users in locationbased services and the usability of the
proposed solutions.

M phil-computer-science-mobile-computing-projects

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (20)

Similar to M phil-computer-science-mobile-computing-projects

Similar to M phil-computer-science-mobile-computing-projects (20)

More from Vijay Karan

More from Vijay Karan (20)

Recently uploaded

Recently uploaded (20)

M phil-computer-science-mobile-computing-projects