Elysium Technologies Private Limited

ISO 9001:2008 A leading Research and Development Division

Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

Abstract Mobile Computing 2010 - 2011

01 SIP-Based IMS Signaling Analysis for WiMax-3G Interworking Architectures

The third-generation partnership project (3GPP) and 3GPP2 have standardized the IP multimedia subsystem (IMS) to
provide ubiquitous and access network-independent IP-based services for next-generation networks via merging
cellular networks and the Internet. The application layer Session Initiation Protocol (SIP), standardized by 3GPP and
3GPP2 for IMS, is responsible for IMS session establishment, management, and transformation. The IEEE 802.16
worldwide interoperability for microwave access (WiMax) promises to provide high data rate broadband wireless
access services. In this paper, we propose two novel interworking architectures to integrate WiMax and third-
generation (3G) networks. Moreover, we analyze the SIP-based IMS registration and session setup signaling delay for
3G and WiMax networks with specific reference to their interworking architectures. Finally, we explore the effects of
different WiMax-3G interworking architectures on the IMS registration and session setup signaling delay

02 Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks

Existing localization algorithms for mobile sensor networks are usually based on the Sequential Monte Carlo (SMC)
method. They either suffer from low sampling efficiency or require high beacon density to achieve high localization
accuracy. Although papers can be found for solving the above problems separately, there is no solution which
addresses both issues. In this paper, we propose an energy efficient algorithm, called WMCL, which can achieve both
high sampling efficiency and high localization accuracy in various scenarios. In existing algorithms, a technique called
bounding-box is used to improve the sampling efficiency by reducing the scope from which the candidate samples are
selected. WMCL can further reduce the size of a sensor node’s bounding-box by a factor of up to 87 percent and,
consequently, improve the sampling efficiency by a factor of up to 95 percent. The improvement in sampling efficiency
dramatically reduces the computational cost. Our algorithm uses the estimated position information of sensor nodes
to improve localization accuracy. Compared with algorithms adopting similar methods, WMCL can achieve similar
localization accuracy with less communication cost and computational cost. Our work has additional advantages.
First, most existing SMC-based localization algorithms cannot be used in static sensor networks but WMCL can work
well, even without the need of experimentally tuning parameters as required in existing algorithms like MSL*. Second,
existing algorithms have low localization accuracy when nodes move very fast. We propose a new algorithm in which
WMCL is iteratively executed with different assumptions on nodes’ speed. The new algorithm dramatically improves
localization accuracy when nodes move very fast. We have evaluated the performance of our algorithm both
theoretically and through extensive simulations. We have also validated the performance results of our algorithm by
implementing it in real deployed static sensor networks. To the best of our knowledge, we are the first to implement
SMC-based localization algorithms for wireless sensor networks in real environment

03 Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes

Compromised node and denial of service are two key attacks in wireless sensor networks (WSNs). In this paper, we
study data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. We
argue that classic multipath routing approaches are vulnerable to such attacks, mainly due to their deterministic
nature. So once the adversary acquires the routing algorithm, it can compute the same routes known to the source,
hence, making all information sent over these routes vulnerable to its attacks. In this paper, we develop mechanisms

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

that generate randomized multipath routes. Under our designs, the routes taken by the “shares” of different packets
change over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot
pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly Dispersive
and energy efficient, making them quite capable of circumventing black holes. We analytically investigate the security
and energy performance of the proposed schemes. We also formulate an optimization problem to minimize the end-to-
end energy consumption under given security constraints. Extensive simulations are conducted to verify the validity of
our mechanisms.

04 SAM AC: A Cross-Layer Communication Protocol for Sensor Networks with Sectored Antennas

Wireless sensor networks have been used to gather data and information in many diverse application settings. The
capacity of such networks remains a fundamental obstacle toward the adaptation of sensor network systems for
advanced applications that require higher data rates and throughput. In this paper, we explore potential benefits of
integrating directional antennas into wireless sensor networks. While the usage of directional antennas has been
investigated in the past for ad hoc networks, their usage in sensor networks bring both opportunities as well as
challenges. In this paper, Sectored-Antenna Medium Access Control (SAMAC), an integrated cross-layer protocol that
provides the communication mechanisms for sensor network to fully utilize sectored antennas, is introduced.
Simulation studies show that SAMAC delivers high energy efficiency and predictable delay performance with graceful
degradation in performance with increased load.

05 Reliable Anchor-Based Sensor Localization in Irregular Areas

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

06 Optimal Cooperative Relaying Schemes in IR-UWB Networks

Cooperation between wireless nodes to retransmit data for the other users introduces multiuser diversity to a wireless
network and increases the system throughput. In this paper, the optimal cooperative relaying strategies in the MAC
layer are analyzed while considering the UWB unique properties such as fine ranging and immunity to small scale
fading. Specifically, the optimal cooperation strategies in the absence of coordination message passing between
relays are determined in order to maximize the system throughput while reducing the control packet overhead. Mobile
networks are also considered, in which the relays should exchange their ranging information together in some update

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

intervals. The optimal update interval length is calculated in order to maximize the system throughput. More
importantly, we show that if this optimal update interval is used, the optimal cooperation strategies in the mobile case
will be similar to those in the static network. Two different relay selection schemes, namely proactive and reactive
settings, are considered. Analysis and simulations confirm that the proposed UWB-based Cooperative Relaying
Scheme, UCoRS, can achieve a considerable diversity gain in spite of its implementation simplicity. UCoRS also
minimizes the number of control packets that are required for the optimal cooperation, which leads to the energy
efficiency in the UWB costly data-receiving process.

07 On Multihop Distances in Wireless Sensor Networks with Random Node Locations

Location and inter sensor distance estimations are important functions for the operation of wireless sensor networks,
especially when protocols can benefit from the distance information prior to network deployment. The maximum
multihop distance that can be covered in a given number of hops in a sensor network is one such parameter related
with coverage area, delay, and minimal multihop transmission energy consumption estimations. In randomly deployed
sensor networks, inter sensor distances are random variables. Hence, their evaluations require probabilistic methods,
and distance models should involve investigation of distance distribution functions. Current literature on analytical
modeling of the maximum distance distribution is limited to 1D networks using the Gaussian pdf. However,
determination of the maximum multihop distance distribution in 2D networks is a quite complex problem. Furthermore,
distance distributions in 2D networks are not accurately modeled by the Gaussian pdf. Hence, we propose a greedy
method of distance maximization and evaluate the distribution of the obtained multihop distance through analytical
approximations and simulations.

08 A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs

A Virtual Backbone (VB) of a wireless network is a subset of nodes such that only VB nodes are responsible for
routing related tasks. Since a smaller VB causes less overhead, size is the primary quality factor of VB. Frequently,
Unit Disk Graphs (UDGs) are used to model 2D homogeneous wireless networks, and the problem of finding minimum
VBs in the networks is abstracted as Minimum Connected Dominating Set (MCDS) problem in UDGs. In some
applications, the altitude of nodes can be hugely different and UDG cannot abstract the networks accurately. Then,
Unit Ball Graph (UBG) can replace UDG. In this paper, we study how to construct quality CDSs in UBGs in distributed
environments. We first give an improved upper bound of the number of independent nodes in a UBG, and use this
result to analyze the Performance Ratio (PR) of our new centralized algorithm C-CDS-UBG, which computes CDSs in
UBGs. Next, we propose a distributed algorithm D-CDS-UBG originated from C-CDS-UBG and analyze its message and
time complexities. Our theoretical analysis shows that the PR of D-CDS-UBG is 14.937, which is better than current
best, 22. Our simulations also show that D-CDS-UBG outperforms the competitor, on average.

09 A Coverage Inference Protocol for Wireless Sensor Networks

After a wireless sensor network (WSN) is deployed, sensor nodes are usually left unattended for a long period of time.
There is an inevitable devolution of the connected coverage of the WSN due to battery exhaustion of sensor nodes,
intended physical destruction attacks on sensor nodes, unpredictable node movement by physical means like wind,
and so on. It is, therefore, critical that the base station (BS) learns in real time how well the WSN performs the given
sensing task (i.e., what is the current connected coverage) under a dynamically changing network topology. In this
paper, we propose a coverage inference protocol (CIP), which can provide the BS an accurate and in-time

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

measurement of the current connected coverage in an energy-efficient way. Especially, we show that the scheme
called BOND, which our CIP requires to be implemented on each sensor node, enables each node to locally self-detect
whether it is a boundary node with the minimal communication and computational overhead. The BOND can also be
exploited to seamlessly integrate multiple functionalities with low overhead. Moreover, we devise extensions to CIP
that can tolerate location errors and actively predict the change of the connected coverage based on residual energy of
sensor nodes.

10 A Distributed Contention Vector Division Multiple Access (D-CVDM A) Protocol for Wireless Networks

Traditional Time Division Multiple Access (TDMA) protocol provides deterministic periodic collision-free data
transmissions. However, TDMA lacks flexibility and exhibits low efficiency in dynamic environments such as wireless
LANs. On the other hand, contention-based MAC protocols such as the IEEE 802.11 DCF are adaptive to network
dynamics but are generally inefficient in heavily loaded or large networks. To take advantage of the both types of
protocols, a D-CVDMA protocol is proposed. It is based on the k-round elimination contention (k-EC) scheme, which
provides fast contention resolution for Wireless LANs. D-CVDMA uses a contention mechanism to achieve TDMA-like
collision-free data transmissions, which does not need to reserve time slots for forthcoming transmissions. These
features make the D-CVDMA robust and adaptive to network dynamics such as node leaving and joining, changes in
packet size and arrival rate, which, in turn, make it suitable for the delivery of hybrid traffic including multimedia and
data content. D-CVDMA is designed for single-hop wireless ad hoc networks. Analyses and simulations demonstrate
that D-CVDMA outperforms the IEEE 802.11 DCF and k-EC in terms of network throughput, delay, jitter, and fairness.

11 A Scalable and Energy-Efficient Context Monitoring Framework for Mobile Personal Sensor Networks

The key feature of many emerging pervasive computing applications is to proactively provide services to mobile
individuals. One major challenge in providing users with proactive services lies in continuously monitoring users’
context based on numerous sensors in their PAN/BAN environments. The context monitoring in such environments
imposes heavy workloads on mobile devices and sensor nodes with limited computing and battery power. We present
SeeMon, a scalable and energy-efficient context monitoring framework for sensor-rich, resource-limited mobile
environments. Running on a personal mobile device, SeeMon effectively performs context monitoring involving
numerous sensors and applications. On top of SeeMon, multiple applications on the mobile device can proactively
understand users’ contexts and react appropriately. This paper proposes a novel context monitoring approach that
provides efficient processing and sensor control mechanisms. We implement and test a prototype system on two
mobile devices: a UMPC and a wearable device with a diverse set of sensors. Example applications are also developed
based on the implemented system. Experimental results show that SeeMon achieves a high level of scalability and
energy efficiency.

12 Asymptotic Distortion Performance of Source-Channel Diversity over Multihop and Relay Channels

A key challenge in the design of real-time wireless multimedia systems is the presence of fading coupled with strict
delay constraints. A very effective answer to this problem is the use of diversity achieving techniques to overcome the
fading nature of the wireless channels caused by the mobility of the nodes. The mobility of the nodes gives rise to the
need of cooperation among the nodes to enhance the system performance. This paper focuses on comparing systems
that exhibit diversity of three forms: source coding diversity, channel coding diversity, and user cooperation diversity
implemented through multihop or relay channels with amplify and- forward or decode-and-forward protocols.

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

Commonly used in multimedia communications, performance is measured in terms of the distortion exponent, which
measures the rate of decay of the end-to-end distortion at asymptotically high signal-to-noise ratio (SNR). For the case
of repetition coding at the relay nodes, we prove that having more relays is not always beneficial. For the general case
of having a large number of relays that can help the source using repetition coding, the optimum number of relay
nodes that Maximizes the distortion exponent is determined in this paper. This optimum number of relay nodes will
depend on the system bandwidth as well as the channel quality. The derived result shows a trade-off between the
qualities (resolution) of the source encoder and the amount of cooperation (number of relay nodes). Also, the
performances of the channel coding diversity-based scheme and the source coding diversity-based scheme are
compared. The results show that for both relay and multihop channels, channel coding diversity provides the best
performance, followed by the source coding diversity

13 Back-of-the-Envelope Computation of Throughput Distributions in CSM A Wireless Netw orks

This work started out with our discovery of a pattern of throughput distributions among links in IEEE 802.11 networks
from experimental results. This pattern gives rise to an easy computation method, which we term back-of-the-envelop
(BoE) computation. For many network configurations, very accurate results can be obtained by BoE within minutes, if
not seconds, by simple hand computation. This allows us to make shortcuts in performance evaluation, bypassing
complicated stochastic analysis. To explain BoE, we construct a theory based on the model of an “ideal CSMA
network” (ICN). The BoE computation method emerges from ICN when we take the limit c ! 0, where c is the ratio of the
mean back off countdown time to the mean transmission time in the CSMA protocol. Importantly, we derive a new
mathematical result: the link throughputs of ICN are insensitive to the distributions of the back off countdown time and
transmission time (packet duration) given the ratio of their means c. This insensitivity result explains why BoE works
so well for practical 802.11 networks, in which the back off countdown process is one that has memory, and in which
the packet size can be arbitrarily distributed. Our results indicate that BoE is a good approximation technique for
modest-size networks such as those typically seen in 802.11 deployments. Beyond explaining BoE, the theoretical
framework of ICN is also a foundation for fundamental understanding of very-large-scale CSMA networks. In particular,
ICN is similar to the Using model in statistical physics used to explain phenomena arising out of the interactions of a
large number of entities. Many new research directions arise out of the ICN model.

14 Beacon- Assisted Spectrum Access with Cooperative Cognitive Transmitter and Receiver

Spectrum access is an important function of cognitive radios for detecting and utilizing spectrum holes without
harming the legacy systems. In this paper, we propose novel cooperative communication models and show how
deploying such cooperation’s between a pair of secondary transmitter and receiver assist them in identifying spectrum
opportunities more reliably. These cooperation are facilitated by dynamically and opportunistically assigning one of
the secondary users as a relay to assist the other one, which results in more efficient spectrum whole detection. Also,
we investigate the impact of erroneous detection of spectrum holes and thereof missing communication opportunities
on the capacity of the secondary channel. The capacity of the secondary users with interference-avoiding spectrum
access is affected by 1) how effectively the availability of vacant spectrum is sensed by the secondary transmitter-
receiver pair, and 2) how correlated are the perceptions of the secondary transmitter-receiver pair about network
spectral activity. We show that both factors are improved by using the proposed cooperative protocols. One of the
proposed protocols requires explicit information exchange in the network. Such information exchange in practice is
prone to wireless channel errors (i.e., is imperfect) and costs bandwidth loss. We analyze the effects of such imperfect
information exchange on the capacity as well as the effect of bandwidth cost on the achievable throughput. The
protocols are also extended to multiuser secondary networks.

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

15 Combined Authentication-Based Multilevel Access Control in Mobile Application for DailyLifeService

In current computing environments, collaborative computing has been a central concern in Ubiquitous, Convergent,
and Social Computing. “MobiLife” and “MyLifeBits” are the leading projects for representing daily life services and
their systems require complicate and collaborative network systems. The collaborative computing environments
remain in high potential risks for users’ security and privacy because of diverse attack routes. In order to solve the
problems, we design combined authentication and multilevel access control, which deals with cryptographic methods
in a personal database of “MyLifeBits” system. We propose a scheme which is flexible in dynamic access
authorization changes, secure against all the attacks from various routes, a minimum round of protocol, privacy
preserving access control, and multifunctional.

16 Controlled Wi-Fi Sharing in Cities: A Decentralized Approach Relying on Indirect Reciprocity

In densely populated cities, Wi-Fi networks—private or otherwise—are ubiquitous. We focus on the provision of
citywide broadband communication capability to mobile users through private Wi-Fi networks that are in range but
belong to others. We form a club that relies on indirect reciprocity: Members participate in the club and provide free
Wi-Fi access to other members in order to enjoy the same benefit when they are away from their own Wi-Fi network.
Our club scheme does not require registration with an authority and does not rely on centrally issued club identities:
Members create their own identities (public-private key pairs) and receive signed digital receipts when they provide Wi-
Fi service to other members. These receipts form a distributed receipt graph, parts of which are used as input to an
indirect reciprocity algorithm that classifies club members according to their contribution. We show that our algorithm
can sustain cooperation within the club and is robust to attacks by free-riders. We implement and evaluate our
proposed club algorithms on commodity Wi-Fi routers and dual-mode cellular/Wi-Fi phones. Because we anticipate
that Wi-Fi telephony will be a popular club application, we present and evaluate a secure and decentralized
architecture for citywide voice (and multimedia) communications that is compatible with our club both from an
architectural as well as an incentives perspective.

17 Cost Analysis of Short Message Retransmissions

Short Message Service (SMS) is the most popular mobile data service today. In Taiwan, a subscriber sends more than
200 short messages per year on average. The huge demand for SMS significantly increases network traffic, and it is
essential that mobile operators should provide efficient SMS delivery mechanism. In this paper, we study the short
message retransmission policies and derive some facts about these policies. Then, we propose an analytic model to
investigate the short message retransmission performance. The analytic model is validated against simulation
experiments. We also collect SMS statistics from a commercial mobile telecommunications network. Our study
indicates that the performance trends for the analytic/simulation models and the measured data are consistent.

18 Dealing with Selfishness and Moral Hazard in Noncooperative Wireless Networks

For noncooperative networks in which each node is a selfish agent, certain incentives must be given to intermediate
nodes to let them forward the data for others. What makes the scenario worse is that, in a multihop noncooperative

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

network, the end points can only observe whether or not the end-to-end transaction was successful or not, but not the
individual actions of intermediate nodes. Thus, in the absence of properly designed incentive schemes, rational and
selfish intermediate nodes may choose to forward data packets at a very low priority or simply drop the packets, and
they could put the blame on the unreliable channel. In this paper, assuming the receiver is a trusted authority, we
propose several methods that discourage the hidden actions under hidden information in multihop noncooperative
networks with high probability. We design several algorithmic mechanisms for a number of routing scenarios such
that each selfish agent will maximize its expected utility (i.e., profit) when it truthfully declares its type (i.e., cost and its
actions) and it truthfully follows its declared actions. Our simulations show that the payments by our mechanisms are
only slightly larger by all intermediate nodes

19 Decentralized QoS- Aw are Check pointing Arrangement in Mobile Grid Computing

This paper deals with decentralized, QoS-aware middleware for check pointing arrangement in Mobile Grid (MoG)
computing systems. Check pointing is more crucial in MoG systems than in their conventional wired counterparts due
to host mobility, dynamicity, less reliable wireless links, frequent disconnections and variations in mobile systems.
We’ve determined the globally optimal checkpoint arrangement to be NP-complete and so consider Reliability Driven
(ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior check pointing arrangements
efficiently. With ReD, an MH (mobile host) simply sends its check pointed data to one selected neighboring MH, and
also serves as a stable point of storage for check pointed data received from a single approved neighboring MH. ReD
works to maximize the probability of check pointed data recovery during job execution, Increasing the likelihood that a
distributed application, executed on the MoG, completes without sustaining an unrecoverable failure. It allows
collaborative services to be offered practically and autonomously by the MoG. Simulations and actual test bed
implementation show ReD’s favorable recovery probabilities with respect to Random Check pointing Arrangement
(RCA) middleware, a QoS-blind comparison protocol producing random arbitrary check pointing arrangements.

20 Detection and Tracking Using Particle-Filter-Based Wireless Sensor Networks

The work reported in this paper investigates the performance of the Particle Filter (PF) algorithm for tracking a moving
object using a wireless sensor network (WSN). It is well known that the PF is particularly well suited for use in target
tracking applications. However, a comprehensive analysis on the effect of various design and calibration parameters
on the accuracy of the PF has been overlooked. This paper outlines the results from such a study. In particular, we
evaluate the effect of various design parameters (such as the number of deployed nodes, number of generated
particles, and sampling interval) and calibration parameters (such as the gain, path loss factor, noise variations, and
nonlinearity constant) on the tracking accuracy and computation time of the particle-filter-based tracking system.
Based on our analysis, we present recommendations on suitable values for these parameters, which provide a
reasonable trade-off between accuracy and complexity. We also analyze the theoretical Crame´r-Rao Bound as the
benchmark for the best possible tracking performance and demonstrate that the results from our simulations closely
match the theoretical bound. In this paper, we also propose a novel technique for calibrating off-the-shelf sensor
devices. We implement the tracking system on a real sensor network and demonstrate its accuracy in detecting and
tracking a moving object in a variety of scenarios. To the best of our knowledge, this is the first time that empirical
results from a PF-based tracking system with off-the-shelf WSN devices have been reported. Finally, we also present
simple albeit important building blocks that are essential for field deployment of such a system.

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

21 Distributed Energy Optimization for Target Tracking in Wireless Sensor Networks

Energy constraint is an important issue in wireless sensor networks. This paper proposes a distributed energy
optimization method for target tracking applications. Sensor nodes are clustered by maximum entropy clustering.
Then, the sensing field is divided for parallel sensor deployment optimization. For each cluster, the coverage and
energy metrics are calculated by grid exclusion algorithm and Dijkstra’s algorithm, respectively. Cluster heads perform
parallel particle swarm optimization to maximize the coverage metric and minimize the energy metric. Particle filter is
improved by combining the radial basis function network, which constructs the process model. Thus, the target
position is predicted by the improved particle filter. Dynamic awakening and optimal sensing scheme are then
discussed in dynamic energy management mechanism. A group of sensor nodes which are located in the vicinity of
the target will be awakened up and have the opportunity to report their data. The selection of sensor node is optimized
considering sensing accuracy and energy consumption. Experimental results verify that energy efficiency of wireless
sensor network is enhanced by parallel particle swarm optimization, dynamic awakening approach, and sensor node
selection

22 Distributed Localization Scheme for Mobile Sensor Networks

Localization is an essential and important research issue in wireless sensor networks (WSNs). Most localization
schemes focus on static sensor networks. However, mobile sensors are required in some applications such that the
sensed area can be enlarged. As such, a localization scheme designed for mobile sensor networks is necessary. In
this paper, we propose a localization scheme to improve the localization accuracy of previous work. In this proposed
scheme, the normal nodes without location information can estimate their own locations by gathering the positions of
location-aware nodes (anchor nodes) and the one-hop normal nodes whose locations are estimated from the anchor
nodes. In addition, we propose a scheme that predicts the moving direction of sensor nodes to increase localization
accuracy. Simulation results show that the localization error in our proposed scheme is lower than the previous
schemes in various mobility models and moving speeds.

23 Efficient Load- Aw are Routing Scheme for Wireless Mesh Networks

This paper proposes a load-aware routing scheme for wireless mesh networks (WMNs). In a WMN, the traffic load
tends to be unevenly distributed over the network. In this situation, the load-aware routing scheme can balance the
load, and consequently, enhance the overall network capacity. We design a routing scheme which maximizes the
utility, i.e., the degree of user satisfaction, by using the dual decomposition method. The structure of this method
makes it possible to implement the proposed routing scheme in a fully distributed way. With the proposed scheme, a
WMN is divided into multiple clusters for load control. A cluster head estimates traffic load in its cluster. As the
estimated load gets higher, the cluster head increases the routing metrics of the routes passing through the cluster.
Based on the routing metrics, user traffic takes a detour to avoid overloaded areas, and as a result, the WMN achieves
global load balancing. We present the numerical results showing that the proposed scheme effectively balances the
traffic load and outperforms the routing algorithm using the expected transmission time (ETT) as a routing metric.

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

24 Energy- Aware Tag Anti-collision Protocols for RFID Systems

Energy consumption of portable RFID readers is becoming an important issue as applications of RFID systems
pervade many aspects of our lives. Surprisingly, however, these systems are not energy-aware with the focus till date
being on reducing the time to read all tags by the reader. In this work, we consider the problem of tag arbitration in
RFID systems with the aim of designing energy-aware anti-collision protocols. We explore the effectiveness of using
multiple time slots per node of a binary search tree through three anti-collision protocols. We further develop an
analytical framework to predict the performance of our protocols and enable protocol parameter selection. We
demonstrate that all three protocols provide significant energy savings both at the reader and tags (if they are active
tags) compared to the existing Query Tree protocol, while sharing the deterministic property of the latter. Further, we
show that our protocols provide similar benefits even with correlated tag IDs.

25 Extended Knowledge-Based Reasoning Approach to Spectrum Sensing for Cognitive Radio

In this paper, a novel scheme for Cognitive Radio (CR) spectrum sensing in Medium Access Control (MAC) layer,
called as Extended Knowledge-Based Reasoning (EKBR), is proposed. The target of EKBR is to improve the fine
sensing efficiency by jointly considering a number of network states and environmental statistics, including fast
sensing results, short-term statistical information, channel quality, data transmission rate, and channel contention
characteristics. This is for a better estimation on the optimal range of spectrum for fine sensing so as to adaptively
reduce the overall channel sensing time. Performance analysis is conducted on the proposed EKBR scheme using a
multidimensional absorbing Markov chain to evaluate various performance metrics of interest, such as average
sensing delay (or referred to as sensing overhead in the study), average data transmission rate, and percentage of
missed spectrum opportunities. Numerical results show that the proposed EKBR scheme achieves better performance
than that by the state or- the-art techniques while yielding less computation complexity and sensing overhead

26 Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks

Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically
assumes homogeneous wireless sensor nodes with an identical transmission radius. In contrast, this paper addresses
the problem of deploying relay nodes to provide fault tolerance with higher network connectivity in heterogeneous
wireless sensor networks, where sensor nodes possess different transmission radii. Depending on the level of desired
fault tolerance, such problems can be categorized as: 1) full fault-tolerant relay node placement, which aims to deploy
a minimum number of relay nodes to establish kðk _ 1Þ vertex disjoint paths between every pair of sensor and/or relay
nodes and 2) partial fault-tolerant relay node placement, which aims to deploy a minimum number of relay nodes to
establish kðk _ 1Þ vertex-disjoint paths only between every pair of sensor nodes. Due to the different transmission
radii of sensor nodes, these problems are further complicated by the existence of two different kinds of
communication paths in heterogeneous wireless sensor networks, namely, two-way paths, along which wireless
communications exist in both directions; and one-way paths, along which wireless communications exist in only one
direction. Assuming that sensor nodes have different transmission radii, while relay nodes use the same transmission
radius, this paper comprehensively analyzes the range of problems introduced by the different levels of fault tolerance
(full or partial) coupled with the different types of path (one-way or two way). Since each of these problems is NP-hard,
we develop Oð_k2Þ-approximation algorithms for both one-way and two-way partial fault-tolerant relay node
placement, as well as Oð_k3Þ-approximation algorithms for both one-way and two-way full fault-tolerant relay node
placement (_ is the best performance ratio of existing approximation algorithms for finding a minimum k-vertex
connected spanning graph). To facilitate the applications in higher dimensions, we also extend these algorithms and

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

derive their performance ratios in d-dimensional heterogeneous wireless sensor networks ðd _ 3Þ. Finally, heuristic
implementations of these algorithms are evaluated via QualNet simulations.

27 Handling Mobility in Wireless Sensor and Actor Networks

In Wireless Sensor and Actor Networks (WSANs), the collaborative operation of sensors enables the distributed
sensing of a physical phenomenon, while actors collect and process sensor data and perform appropriate actions.
WSANs can be thought of as a distributed control system that needs to timely react to sensor information with an
effective action. In this paper, coordination and communication problems in WSANs with mobile actors are studied.
First, a new location management scheme is proposed to handle the mobility of actors with minimal energy
expenditure for the sensors, based on a hybrid strategy that includes location updating and location prediction. Actors
broadcast location updates limiting their scope based on Voronoi diagrams, while sensors predict the movement of
actors based on Kalman filtering of previously received updates. The location management scheme enables efficient
geographical routing, and based on this, an optimal energy-aware forwarding rule is derived for sensor-actor
communication. Consequently, algorithms are proposed that allow controlling the delay of the data-delivery process
based on power control, and deal with network congestion by forcing multiple actors to be recipients for traffic
generated in the event area. Finally, a model is proposed to optimally assign tasks to actors and control their motion in
a coordinated way to accomplish the tasks based on the characteristics of the events. Performance evaluation shows
the effectiveness of the proposed solution

28 Handoff Performance in Wireless Mobile Networks with Unreliable Fading Channel

Handoff is an indispensable operation in wireless networks to guarantee continuous, effective, and resilient services
during a Mobile Station (MS) mobility. Handoff counting, handoff rate, and handoff probability are important metrics to
characterize the handoff performance. Handoff counting defines the number of handoff operations during an active call
connection. Handoff rate specifies the expected number of handoff operations during an active call, or equivalently,
the average handoff counting. Handoff probability refers to the probability that an MS will perform a handoff before call
completion. In the literature, the fading channel is not incorporated in deriving these metrics. In addition, the teletraffic
parameters are usually simplified into exponentially distributed variables for the sake of analytical tractability. In this
paper, we derive the formulas for these metrics over Rayleigh fading. In particular, the results can demonstrate the
explicit relationship between the handoff metrics and the physical layer characteristics, e.g., carrier frequency,
maximum Doppler frequency, and fade margin. Furthermore, the formulas are developed with the generalized
teletraffic parameters. Numerical examples are presented to demonstrate the impact of physical layer on the handoff
metrics. The techniques and the results are significant for both deploying practical wireless networks and evaluating
the system resilience over an unreliable radio channel.

29 A Multichannel Scheduler for High-Speed Wireless Backhaul Links with Packet Concatenation

Capacity has been an important issue for many wireless backhaul networks. Both the multihop nature and the large
per packet channel access overhead can lead to its low channel efficiency. The problem may get even worse when
there are many applications transmitting packets with small data payloads, e.g., Voice over Internet Protocol (VoIP).
Previously, the use of multiple parallel channels and employing packet concatenation were treated as separate
solutions to these problems. However, there is no available work on the integrated design and performance analysis of
a complete scheduler architecture combining these two schemes. In this paper, we propose a scheduler that

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

concatenates small packets into large frames and sends them through multiple parallel channels with an intelligent
channel selection algorithm between neighboring nodes. Besides the expected capacity improvements, we also derive
delay bounds for this scheduler. Based on the delay bound formula, call admission control (CAC) of a broad range of
scheduling algorithms can be obtained. We demonstrate the significant capacity and resequencing delay
improvements of this novel design with a voice-data traffic mixing example, via both numerical and simulation results.
It is shown that the proposed packet concatenation and channel selection algorithms greatly outperform the round-
robin scheduler in a multihop scenario.

Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference
30 Models

Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a
challenging Problem. For general traffic models (given a set of source-destination pairs), optimization of throughput
entails design of “efficient” Routes between the given source-destination pairs, in conjunction with 1) assignment of
channels to interfaces and communication Links and 2) scheduling of no interfering links for simultaneous
transmission. Prior work has looked at restricted versions of the above problem. In this paper, we design
approximation algorithms for the joint routing, channel assignment, and link scheduling problem in wireless networks
with general interference models. The unique contributions of our work include addressing the above joint problem in
the context of physical interference model and single-path routing (wherein, traffic between a source-destination pair
is restricted to a single path). To the best of our knowledge, ours is the first work to address the throughput
maximization problem in such general contexts. For each setting, we design approximation algorithms with provable
performance guarantees. We demonstrate the effectiveness of our algorithms in general contexts through simulations.

31 Localized Multicast: Efficient and Distributed Replica Detection in Large-Scale Sensor Networks

Due to the poor physical protection of sensor nodes, it is generally assumed that an adversary can capture and
compromise a small number of sensors in the network. In a node replication attack, an adversary can take advantage
of the credentials of a compromised node to surreptitiously introduce replicas of that node into the network. Without
an effective and efficient detection mechanism, these replicas can be used to launch a variety of attacks that
undermine many sensor applications and protocols. In this paper, we present a novel distributed approach called
Localized Multicast for detecting node replication attacks. The efficiency and security of our approach are evaluated
both theoretically and via simulation. Our results show that, compared to previous distributed approaches proposed
by Parno et al., Localized Multicast is more efficient in terms of communication and memory costs in large-scale
sensor networks, and at the same time achieves a higher probability of detecting node replicas.

32 Modeling Power Saving Protocols for Multicast Services in 802.11 Wireless LANs

In recent years, a series of power saving (PS) protocols has been proposed in the family of 802.11 standards to save
energy for mobile devices. To evaluate their performance, many works have been carried out on test beds or
simulation platforms. However, till now, there is a lack of accurate theoretical models to analyze the performance for
these protocols. In an effort to fill this gap, we present a Markov chain-based analytical model in this paper to model
these PS protocols, with its focus on multicast services in wireless LANs. The proposed analytical model successfully
captures the key characteristic of the power saving system: the data delivery procedure starts periodically at the
previously negotiated time, but ends at a rather random time with its distribution depending on the end time of data
delivery in the last delivery period as well as the arrival rate of incoming traffic. In the situations with light to moderate

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
 Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division
Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

traffic loads and under the Poisson assumption for incoming traffic, the amount of data delivered between consecutive
delivery periods possesses the Markov property, which builds up our Markov chain-based model. For incoming traffic
with long-range dependence (LRD), a multistate Markov-Modulated Poisson Process (MMPP) is used to approximate
the traffic, making the analytical model valid in more general cases. We verify our model by simulations on ns2 and the
results show that the model can faithfully predict the performance of these PS protocols over a wide variety of testing
scenarios.

33 On Multihop Distances in Wireless Sensor Networks with Random Node Locations

Location and intersensor distance estimations are important functions for the operation of wireless sensor networks,
especially when protocols can benefit from the distance information prior to network deployment. The maximum
multihop distance that can be covered in a given number of hops in a sensor network is one such parameter related
with coverage area, delay, and minimal multihop transmission energy consumption estimations. In randomly deployed
sensor networks, intersensor distances are random variables. Hence, their evaluations require probabilistic methods,
and distance models should involve investigation of distance distribution functions. Current literature on analytical
modeling of the maximum distance distribution is limited to 1D network using the Gaussian pdf. However,
determination of the maximum multihop distance distribution in 2D networks is a quite complex problem. Furthermore,
distance distributions in 2D networks are not accurately modeled by the Gaussian pdf. Hence, we propose a greedy
method of distance maximization and evaluate the distribution of the Simulations.

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com