Elysium Technologies Private Limitedelysiumtechnologies.com/wp-content/uploads/2015/08/... · Elysium Technologies Private Limited Singapore | Madurai ... are supported by the smallcell

Elysium Technologies Private Limited Singapore | Madurai | Chennai | Trichy | Ramnad Erode | Tirunelveli|

Sivakasi |Dindugul|

http://www.elysiumtechnologies.com, [email protected]


Sivakasi |Dindugul|



Sivakasi |Dindugul|



Sivakasi |Dindugul|


In this paper, we provide a general networked controller design methodology for networked plants and apply it

to solve the optimal H2 networked control problem. Both the plant and the controller are interconnected

systems, interacting over the same arbitrary directed network with noiseless and delay-free communication

links. We introduce the notions of network implementability and network realizability and analyze the

structure of network implementable and realizable systems. Based on the structural property of network

implementable systems, under certain network-related constraints, we characterize the set of all stabilizing

controllers that are implementable over the given network using the state-space version of Youla

parametrization. Moreover, we provide a constructive procedure to implement the controllers as sub-systems

interacting over the given network without affecting the stability of the feedback networked system. The

distributed H2 control problem is then cast as a convex optimization problem and its solution is shown to

provide the optimal distributed controller over the given network in terms of its network interacting

components. The results of this paper allow one to apply many classical results and approaches of multi-

variable robust control theory to networked systems.

ETPL

NW - 001

Optimal Distributed Controllers Realizable over Arbitrary Networks

Monitoring large-scale networks is a critical yet challenging task. Enormous number of nodes and links,

limited power, and lack of direct access to the entire network are the most important difficulties. In

applications such as network routing, where all nodes need to monitor the status of the entire network, the

situation is even worse. In this letter, a collaborative model in which nodes pick up information from

measurements generated by other nodes is proposed. Using this model, for the first time, an upper bound is

derived for the number of measurements that each node must generate, such that the expected number of

measurements observed by each node is sufficient to provide a global view of the entire networked data.

Finally, by using this upper bound, an efficient optimization method is introduced to minimize the total

number of measurements. The feasibility and accuracy of the proposed method is verified through extensive

numerical simulations.

ETPL

NW - 002

Peer-to-Peer Compressive Sensing for Network Monitoring


Sivakasi |Dindugul|


Multipath routing in wireless multimedia sensor network makes it possible to transfer data simultaneously so

as to reduce delay and congestion and it is worth researching. However, the current multipath routing strategy

may cause problem that the node energy near sink becomes obviously higher than other nodes which makes

the network invalid and dead. It also has serious impact on the performance of wireless multimedia sensor

network (WMSN). In this paper, we propose a pair-wise directional geographical routing (PWDGR) strategy

to solve the energy bottleneck problem. First, the source node can send the data to the pair-wise node around

the sink node in accordance with certain algorithm and then it will send the data to the sink node. These pair-

wise nodes are equally selected in 360° scope around sink according to a certain algorithm. Therefore, it can

effectively relieve the serious energy burden around Sink and also make a balance between energy

consumption and end-to-end delay. Theoretical analysis and a lot of simulation experiments on PWDGR have

been done and the results indicate that PWDGR is superior to the proposed strategies of the similar strategies

both in the view of the theory and the results of those simulation experiments. With respect to the strategies of

the same kind, PWDGR is able to prolong 70% network life. The delay time is also measured and it is only

increased by 8.1% compared with the similar strategies.

ETPL

NW - 003

PWDGR: Pair-Wise Directional Geographical Routing Based on Wireless

Sensor Network

In this paper, we study downlink beamforming for wireless heterogeneous networks with two groups of users.

The users in one group (group 1) are supported by the smallcell base station (SBS) as well as the macrocell

base station (MBS), while the users in the other group (group 2) are supported by the MBS only. The MBS is

equipped with an antenna array for downlink beamforming. We formulate a convex optimization problem,

which can be solved by semidefinite programming (SDP) relaxation, for downlink beamforming that takes

advantage of the presence of the SBS for group 1, but also takes into account the interfering signal from the

SBS for group 2.

ETPL

NW - 004

On Downlink Beamforming with Small Cells in Wireless Heterogeneous

Systems


Sivakasi |Dindugul|


In this paper, we investigate the wireless network deployment problem, which seeks the best deployment of a

given limited number of wireless routers. We find that many goals for networkdeployment, such as

maximizing the number of covered users, the size of the coverage area, or the total throughput of the network,

can be modeled with a submodular set function. Specifically, given a set of routers, the goal is to find a set of

locations S, each of which is equipped with a router, such that S maximizes a predefined submodular set

function. However, this deployment problem is more difficult than the traditional maximum submodular set

function problem, e.g., the maximum coverage problem, because it requires all the deployed routers to form a

connected network. In addition, deploying a router in different locations might consume different costs. To

address these challenges, this paper introduces two approximation algorithms, one for homogeneous

deployment cost scenarios and the other for heterogeneous deployment cost scenarios. Our simulations, using

synthetic data and real traces of census in Taipei, Taiwan, show that the proposed algorithms achieve better

performances than other heuristics. Optimal Configuration of Network Coding in Ad Hoc Networks

ETPL

NW - 006

Maximizing Submodular Set Function With Connectivity Constraint: Theory

and Application to Networks

Networks

This article presents an efficient optical service chaining architecture for network function virtualization in

data centers. Service chaining (i.e., steering traffic through a sequence of network functions) is one emerging

application of software-defined networking. However, existing schemes steer traffic solely in the packet

domain, which is well suited for fine-grained (e.g., peruser level) flows carrying a relatively small volume of

traffic. This article discusses how packet-based schemes do not yield sufficient efficiency for large/aggregated

flows steered through high-capacity core network functions. It introduces an optical steering domain into the

operator's data centers for NFV service chaining at a coarse-grained traffic level using wavelength switching.

Performance evaluation shows that the optical steering domain can achieve significant power savings

compared to using packet technologies as flow rates and the number of vNFs per service chain grow.

ETPL

NW - 005

Optical service chaining for network function virtualization


Sivakasi |Dindugul|


This paper presents a system for detecting intrusions when analyzing the network traffic payload looking for

malware evidences. The system implements the detection algorithm as a Snort preprocessor component. Since

they work together, a highly effective system against known attacks has been achieved (based on Snort rules)

and a highly effective system against unknown threats (which was the main aim of the designed system). As

the majority of such systems, the proposal consists of two phases: a training phase and a detection phase.

During the training phase a statistical model of the legitimate network usage is created through Bloom Filters

and N-grams techniques. Subsequently, the results obtained by analyzing a dataset of attacks are compared

with such model. This will allow a set of rules to be developed which will be able to determine whether the

packets payloads contain malware. In the detection phase, the traffic to analyze is compared with the model

created in the training phase and the results obtained when applying rules. The performed experiments showed

really satisfactory results, with 100% malware detection and just 0.15% false positives

ETPL

NW - 008

Malware Detection System by Payload Analysis of Network Traffic

In this paper, we investigate the network throughput and energy sustainability of green-energy-powered

maritime wireless communication networks. Specifically, we study how to optimize the schedule of data

traffic tasks to maximize the network throughput with Worldwide Interoperability for Microwave Access

technology. To this end, we formulate it as an optimization problem to maximize the weight of the total

delivered data packets, while ensuring that harvested energy can successfully support transmission tasks. The

formulated energy and content-aware vessel throughput maximize problem is proved to be NP-complete. We

propose a green energy and content-aware data transmission framework that incorporates the energy limitation

of both infostations and delay-tolerant network throw boxes. The green energy buffer is modeled as a G/G/1

queue, and two heuristic algorithms are designed to optimize the transmission throughput and energy

sustainability. Extensive simulations demonstrate that our proposed algorithms can provide simple yet

efficient solutions in a maritime wireless communication network with sustainable energy.

ETPL

NW - 007

Green Energy and Content-Aware Data Transmissions in Maritime Wireless

Communication Networks


Sivakasi |Dindugul|


Understanding the dynamics behind group formation and evolution in social networks is considered

an instrumental milestone to better describe how individuals gather and form communities, how they

enjoy and share the platform contents, how they are driven by their preferences/tastes, and how their

behaviors are influenced by peers. In this context, the notion of compactness of a social group is

particularly relevant. While the literature usually refers to compactness as a measure to merely

determine how much members of a group are similar among each other, we argue that the mutual

trustworthiness between the members should be considered as an important factor in defining such a

term. In fact, trust has profound effects on the dynamics of group formation and their evolution:

individuals are more likely to join with and stay in a group if they can trust other group members. In

this paper, we propose a quantitative measure of group compactness that takes into account both the

similarity and the trustworthiness among users, and we present an algorithm to optimize such a

measure. We provide empirical results, obtained from the real social networks EPINIONS and CIAO,

that compare our notion of compactness versus the traditional notion of user similarity, clearly

proving the advantages of our approach.

ETPL

NW - 009

Trust and Compactness in Social Network Groups

In this paper, two cooperative communications schemes with inter-relay interference (IRI) management are

proposed for wireless multi-user decode-and-forward (DF) relay networks. The schemes are based on a DF

half-duplex (HD) relaying protocol and a relay selection method which maximizes the signal-to-noise ratio

(SNR) of the second hop. To minimize the IRI, the first scheme [constellation real part (CRP)] uses a new

transmission scheme based on the constellation real parts of the modulated signals, and the second scheme

[previous message buffering (PMB)] uses a buffering technique at the relays. To assess the performance, we

derive the expressions of the average bit error rate (BER) for the proposed schemes. Numerical results are

given to confirm the analytical expressions and the advantage of the proposed schemes in enhancing

interference management for wireless cooperative networks.

ETPL

NW - 010

Inter-Relay Interference Management Schemes for Wireless Multi-User

Decode-and-Forward Relay Networks


Sivakasi |Dindugul|


Network-wide traffic measurement is of interest to network operators to uncover global network behavior for

the management tasks of traffic accounting, debugging or troubleshooting, security, and traffic engineering.

Increasingly, sophisticated network measurement tasks such as anomaly detection and security forensic

analysis are requiring in-depth fine-grained flow-level measurements. However, performing in-depth per-flow

measurements (e.g., detailed payload analysis) is often an expensive process. Given the fast-changing Internet

traffic landscape and large traffic volume, a single monitor is not capable of accomplishing the measurement

tasks for all applications of interest due to its resource constraint. Moreover, uncovering global network

behavior requires network-wide traffic measurements at multiple monitors across the network since traffic

measured at any single monitor only provides a partial view and may not be sufficient or accurate. These

factors call for coordinated measurements among multiple distributed monitors. In this paper, we present a

centralized optimization framework, LEISURE (Load-EqualIzed meaSUREment), for load-balancing network

measurement workloads across distributed monitors. Specifically, we consider various load-balancing

problems under different objectives and study their extensions to support both fixed and flexible monitor

deployment scenarios. We formulate the latter flexible monitor deployment case as an MILP (Mixed Integer

Linear Programming) problem and propose several heuristic algorithms to approximate the optimal solution

and reduce the computation complexity. We evaluate LEISURE via detailed simulations on Abilene and

GEANT network traces to show that LEISURE can achieve much better load-balanced performance (e.g.,

4.75× smaller peak workload and 70× smaller variance in workloads) across all coordinated monitors in

comparison to a naive solution (uniform assignment) to accomplish network-wide traffic measure- ent tasks

under the fixed monitor deployment scenario. We also show that under the flexible monitor deployment

setting, our heuristic solutions can achieve almost the same load-balancing performance as the optimal

solution while reducing the computation times by a factor up to 22.5× in Abilene and 800× in GEANT.

ETPL

NW - 011

LEISURE: Load-Balanced Network-Wide Traffic Measurement and Monitor

Placement


Sivakasi |Dindugul|


Photo sharing is an attractive feature which popularizes Online Social Networks (OSNs). Unfortunately, it

may leak users’ privacy if they are allowed to post, comment, and tag a photo freely. In this paper, we attempt

to address this issue and study the scenario when a user shares a photo containing individuals other than

himself/herself (termed co-photo for short). To prevent possible privacy leakage of a photo, we design a

mechanism to enable each individual in a photo be aware of the posting activity and participate in the decision

making on the photo posting. For this purpose, we need an efficient facial recognition (FR) system that can

recognize everyone in the photo. However, more demanding privacy setting may limit the number of the

photos publicly available to train the FR system. To deal with this dilemma, our mechanism attempts to utilize

users’ private photos to design a personalized FR system specifically trained to differentiate possible photo co-

owners without leaking their privacy. We also develop a distributed consensusbased method to reduce the

computational complexity and protect the private training set. We show that our system is superior to other

possible approaches in terms of recognition ratio and efficiency. Our mechanism is implemented as a proof of

concept Android application on Facebook’s platform

ETPL

NW - 012

My Privacy My Decision: Control of Photo Sharing on Online Social Networks

Online social networks (OSNs) suffer from the creation of fake accounts that introduce fake product reviews,

malware and spam. Existing defenses focus on using the social graph structure to isolate fakes. However, our

work shows that Sybils could befriend a large number of real users, invalidating the assumption behind social-

graph-based detection. In this paper, we present VoteTrust, a scalable defense system that further leverages

user-level activities. VoteTrust models the friend invitation interactions among users as a directed, signed

graph, and uses two key mechanisms to detect Sybils over the graph: a voting-based Sybil detection to find

Sybils that users vote to reject, and a Sybil community detection to find other colluding Sybils around

identified Sybils. Through evaluating on Renren social network, we show that VoteTrust is able to prevent

Sybils from generating many unsolicited friend requests. We also deploy VoteTrust in Renen, and our real

experience demonstrates that VoteTrust can detect large-scale collusion among Sybils.

ETPL

NW - 013

VoteTrust: Leveraging Friend Invitation Graph to Defend against Social

Network Sybils


Sivakasi |Dindugul|


In recent years, wireless sensor networks have been widely used in healthcare applications, such as hospital

and home patient monitoring. Wireless medical sensor networks are more vulnerable to eavesdropping,

modification, impersonation and replaying attacks than the wired networks. A lot of work has been done to

secure wireless medical sensor networks. The existing solutions can protect the patient data during

transmission, but cannot stop the inside attack where the administrator of the patient database reveals the

sensitive patient data. In this paper, we propose a practical approach to prevent the inside attack by using

multiple data servers to store patient data. The main contribution of this paper is securely distributing the

patient data in multiple data servers and employing the Paillier and ElGamal cryptosystems to perform statistic

analysis on the patient data without compromising the patients’ privacy.

ETPL

NW - 014

Privacy Protection for Wireless Medical Sensor Data

Securing the networks of large organizations is technically challenging due to the complex configurations and

constraints. Managing these networks requires rigorous and comprehensive analysis tools. A network

administrator needs to identify vulnerable configurations, as well as tools for hardening the networks. Such

networks usually have dynamic and fluidic structures, thus one may have incomplete information about the

connectivity and availability of hosts. In this paper, we address the problem of statically performing a rigorous

assessment of a set of network security defense strategies with the goal of reducing the probability of a

successful large-scale attack in a dynamically changing and complex network architecture. We describe a

probabilistic graph model and algorithms for analyzing the security of complex networks with the ultimate

goal of reducing the probability of successful attacks. Our model naturally utilizes a scalable state-of-the-art

optimization technique called sequential linear programming that is extensively applied and studied in various

engineering problems. In comparison to related solutions on attack graphs, our probabilistic model provides

mechanisms for expressing uncertainties in network configurations, which is not reported elsewhere. We have

performed comprehensive experimental validation with real-world network configuration data of a sizable

organization.

ETPL

NW - 015

Security Optimization of Dynamic Networks with Probabilistic Graph Modeling

and Linear Programming


Sivakasi |Dindugul|


K-anonymity has been used to protect location privacy for location monitoring services in wireless sensor

networks (WSNs), where sensor nodes work together to report k-anonymized aggregate locations to a server.

Each k-anonymized aggregate location is a cloaked area that contains at least k persons. However, we identify

an attack model to show that overlapping aggregate locations still pose privacy risks because an adversary can

infer some overlapping areas with less than k persons that violates the k-anonymity privacy requirement. In

this paper, we propose a reciprocal protocol for location privacy (REAL) in WSNs. In REAL, sensor nodes are

required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k-

anonymized aggregate locations. To confront the three key challenges in REAL, namely, self-organization,

reciprocity property and high accuracy, we design a state transition process, a locking mechanism and a time

delay mechanism, respectively. We compare the performance of REAL with current protocols through

simulated experiments. The results show that REAL protects location privacy, provides more accurate query

answers, and reduces communication and computational costs.

ETPL

NW - 017

REAL: A Reciprocal Protocol for Location Privacy in Wireless Sensor

Networks

We present a framework and a set of algorithms for determining faults in networks when large scale outages

occur. The design principles of our algorithm, netCSI, are motivated by the fact that failures are

geographically clustered in such cases.We address the challenge of determining faults with incomplete

symptom information due to a limited number of reporting nodes. netCSI consists of two parts: a hypotheses

generation algorithm, and a ranking algorithm. When constructing the hypothesis list of potential causes, we

make novel use of positive and negative symptoms to improve the precision of the results. In addition, we

propose pruning and thresholding along with a dynamic threshold value selector, to reduce the complexity of

our algorithm. The ranking algorithm is based on conditional failure probability models that account for the

geographic correlation of the network objects in clustered failures. We evaluate the performance of netCSI for

networks with both random and realistic topologies. We compare the performance of netCSI with an existing

fault diagnosis algorithm, MAX-COVERAGE, and demonstrate an average gain of 128% in accuracy for

realistic topologies.

ETPL

NW - 016

netCSI: A Generic Fault Diagnosis Algorithm for Large-Scale Failures in

Computer Networks


Sivakasi |Dindugul|


Low-rate denial of service (LDoS) attacks send periodic pulse sequences with relative low rate to form

aggregation flows at the victim end. LDoS attack flows have the characteristics of low average rate and great

concealment. It is hard to detect LDoS attack flows from normal traffic due to low rate property. Network

traffic measurement shows that aggregate network traffic is multifractal. In order to characterize and analyze

network traffic, researchers have developed concise mathematical models to explore complex multifractal

structure. Although the LDoS attack flows are very small, it will inevitably lead to the change of multifractal

characteristics of network traffic. This paper targets at exploiting and estimating the changes in multifractal

characteristics of network traffic for detecting LDoS attack flows. The algorithm of multifractal detrended

fluctuation analysis (MF-DFA) is used to explore the change in terms of multifractal characteristics over a

small scale of network traffic due to LDoS attacks. Through wavelet analysis, the singularity and bursty of

network traffic under LDoS attacks are estimated by using Hölder exponent. The difference values (D-value)

of Hölder exponent of network traffic between normal and under LDoS attack situations are calculated. The

D-value is used as the basis to determine LDoS attacks. A detection threshold is set based on the statistical

results. The presence of LDoS attacks can be confirmed through comparing D-value with detection threshold.

Experiments on detection performance have been performed in the test-bed network and simulation platform.

The extensive experimental results are congruent with the theoretical analysis.

ETPL

NW - 018

Low-Rate DoS Attacks Detection Based on Network Multifractal

Host cardinality is defined as the number of distinct peers that a host communicates with in the network. There

have been several algorithms proposed to monitor network traffic and identify high-cardinality hosts at a

centralized network operation center (NOC). Due to massive amounts of distributed data and limitations on

transforming and processing them at the NOC, it is desirable to design mergable and reversible data structures

summarizing traffic measurements in a distributed network monitoring system. A mergable data structure

summarizes traffic measurements at each local monitor, and these summaries from different monitors can be

merged at the NOC, while preserving the error guarantee without increasing space. A reversible data structure

can report interested (high-cardinality) hosts efficiently using compressed information without querying every

single host in the network. In this paper, we propose a new data streaming algorithm to identify high-

cardinality hosts over the networkwide traffic measurements. Our algorithm introduces a new mergable and

reversible data structure for the distributed network monitoring system, which is designed by Noisy Group

Testing. We have theoretically analyzed our algorithm and evaluated it against real-world data sets.

ETPL

NW - 019

Identifying High-Cardinality Hosts from Network-wide Traffic Measurements


Sivakasi |Dindugul|


IEEE 802.11s mesh networking standard supports Mesh Coordinated Channel Access (MCCA) to provide

better quality of service (QoS) through channel reservation during the MAC layer channel access. According

to the current QoS specifications, network traffic can be broadly classified into four classes - voice, video,

background and best effort. However, MCCA does not directly support the standard service differentiation that

is essential for service level QoS assurance. Further, assuring fairness among the flows of similar service

classes is required for effective bandwidth utilization. Providing service differentiation along with the fairness

is challenging in a distributed environment due to their non-linearity and non-additive properties. This paper

uses the concept of (; p)-proportional fairness to design a distributed method for providing service

differentiation with minimum fairness guarantee. An admission control mechanism is designed over standard

mesh protocols to manage the minimum service guarantee for existing flows in the network. The effectiveness

of the proposed scheme is analyzed using experimental results from an IEEE 802.11n+s mesh networking

testbed. The scalability and performance bound of the proposed scheme is further analyzed using simulation

results.

ETPL

NW - 021

Distributed Service Level Flow Control and Fairness in Wireless Mesh

Networks

Software-Defined Networking (SDN) is an emerging network paradigm that simplifies network management by

decoupling the control plane and data plane, such that switches become simple data forwarding devices and network

management is controlled by logically centralized servers. In SDN-enabled networks, network flow is managed by a set

of associated rules that are maintained by switches in their local Ternary Content Addressable Memories (TCAMs) which

support high-speed parallel lookup on wildcard patterns. Since TCAM is an expensive hardware and extremely power-

hungry, each switch has only limited TCAM space and it is inefficient and even infeasible to maintain all rules at local

switches. On the other hand, if we eliminate TCAM occupation by forwarding all packets to the centralized controller for

processing, it results in a long delay and heavy processing burden on the controller. In this paper, we strive for the fine

balance between rule caching and remote packet processing by formulating a minimum weighted flow provisioning

(MWFP) problem with an objective of minimizing the total cost of TCAM occupation and remote packet processing. We

propose an efficient offline algorithm if the network traffic is given, otherwise, we propose two online algorithms with

guaranteed competitive ratios. Finally, we conduct extensive experiments by simulations using real network traffic traces.

The simulation results demonstrate that our proposed algorithms can significantly reduce the total cost of remote

controller processing and TCAM occupation, and the solutions obtained are nearly optimal.

ETPL

NW - 020

Cost Minimization for Rule Caching in Software Defined Networking


Sivakasi |Dindugul|


Cloud-based radio access networks (C-RAN) have been proposed as a cost-efficient way of deploying small cells. Unlike

conventional RANs, a C-RAN decouples the baseband processing unit (BBU) from the remote radio head (RRH),

allowing for centralized operation of BBUs and scalable deployment of light-weight RRHs as small cells. In this work,

we argue that the intelligent configuration of the front-haul network between the BBUs and RRHs, is essential in

delivering the performance and energy benefits to the RAN and the BBU pool, respectively. We propose FluidNet—a

scalable, light-weight framework for realizing the full potential of C-RAN. FluidNet deploys a logically re-configurable

front-haul to apply appropriate transmission strategies in different parts of the network and hence cater effectively to both

heterogeneous user profiles and dynamic traffic load patterns. FluidNet's algorithms determine configurations that

maximize the traffic demand satisfied on the RAN, while simultaneously optimizing the compute resource usage in the

BBU pool. We prototype FluidNet on a 6 BBU, 6 RRH WiMAX C-RAN testbed. Prototype evaluations and large-scale

simulations reveal that FluidNet's ability to re-configure its front-haul and tailor transmission strategies provides a 50%

improvement in satisfying traffic demands, while reducing the compute resource usage in the BBU pool by 50%

compared to baseline schemes.

ETPL

NW - 022

FuidNelt: A Flexible Cloud-Based Radio Access Network for Small Cells

This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters

are capable of harvesting renewable energy from the environment and compete for one shared channel by random access.

In particular, we focus on two different scenarios: the constant energy harvesting (EH) rate model where the EH rate

remains constant within the time of interest and the i.i.d. EH rate model where the EH rates are independent and

identically distributed across different contention slots. To quantify the roles of both the energy state information (ESI)

and the channel state information (CSI), a distributed opportunistic scheduling (DOS) framework with two-stage probing

and save-then-transmit energy utilization is proposed. Then, the optimal throughput and the optimal scheduling strategy

are obtained via one-dimension search, i.e., an iterative algorithm consisting of the following two steps in each iteration:

First, assuming that the stored energy level at each transmitter is stationary with a given distribution, the expected

throughput maximization problem is formulated as an optimal stopping problem, whose solution is proven to exist and

then derived for both models; second, for a fixed stopping rule, the energy level at each transmitter is shown to be

stationary and an efficient iterative algorithm is proposed to compute its steady-state distribution. Finally, we validate our

analysis by numerical results and quantify the throughput gain compared with the best-effort delivery scheme.

ETPL

NW - 023

Distributed Opportunistic Scheduling for Energy Harvesting Based Wireless

Networks: A Two-Stage Probing Approach


Sivakasi |Dindugul|


The problem of distributed rate maximization in multichannel ALOHA networks is considered. First, we study

the problem of constrained distributed rate maximization, where user rates are subject to total transmission

probability constraints. We propose a best-response algorithm, where each user updates its strategy to increase

its rate according to the channel state information and the current channel utilization. We prove the

convergence of the algorithm to a Nash equilibrium in both homogeneous and heterogeneous networks using

the theory of potential games. The performance of the best-response dynamic is analyzed and compared to a

simple transmission scheme, where users transmit over the channel with the highest collision-free utility.

Then, we consider the case where users are not restricted by transmission probability constraints. Distributed

rate maximization under uncertainty is considered to achieve both efficiency and fairness among users. We

propose a distributed scheme where users adjust their transmission probability to maximize their rates

according to the current network state, while maintaining the desired load on the channels. We show that our

approach plays an important role in achieving the Nash bargaining solution among users. Sequential and

ETPL

NW - 025

Distributed Game-Theoretic Optimization and Management of Multichannel

ALOHA Networks

Underlying link-layer protocols of well-established wireless networks that use the conventional “store-and-

forward” design paradigm cannot provide highly sustainable reliability and stability in wireless

communication, which introduce significant barriers and setbacks in scalability and deployments of wireless

networks. In this paper, we propose a Code Embedded Distributed Adaptive and Reliable (CEDAR) link-layer

framework that targets low latency and balancing en/decoding load among nodes. CEDAR is the first

comprehensive theoretical framework for analyzing and designing distributed and adaptive error recovery for

wireless networks. It employs a theoretically sound framework for embedding channel codes in each packet

and performs the error correcting process in selected intermediate nodes in a packet's route. To identify the

intermediate nodes for the decoding, we mathematically calculate the average packet delay and formalize the

problem as a nonlinear integer programming problem. By minimizing the delays, we derive three propositions

that: 1) can identify the intermediate nodes that minimize the propagation and transmission delay of a packet;

and 2) and 3) can identify the intermediate nodes that simultaneously minimize the queuing delay and

maximize the fairness of en/decoding load of all the nodes. Guided by the propositions, we then propose a

scalable and distributed scheme in CEDAR to choose the intermediate en/decoding nodes in a route to achieve

its objective. The results from real-world testbed “NESTbed” and simulation with MATLAB prove that

CEDAR is superior to schemes using hop-by-hop decoding and destination decoding not only in packet delay

and throughput but also in energy-consumption and load distribution balance

ETPL

NW - 024

CEDAR: A Low-Latency and Distributed Strategy for Packet Recovery in

Wireless Networks


Sivakasi |Dindugul|


Recently, in online social networks (OSNs), the least cost influence (LCI) problem has become one of the

central research topics. It aims at identifying a minimum number of seed users who can trigger a wide cascade

of information propagation. Most of existing literature investigated the LCI problem only based on an

individual network. However, nowadays users often join several OSNs such that information could be spread

across different networks simultaneously. Therefore, in order to obtain the best set of seed users, it is crucial to

consider the role of overlapping users under this circumstances. In this article, we propose a unified

framework to represent and analyze the influence diffusion in multiplex networks. More specifically, we

tackle the LCI problem by mapping a set of networks into a single one via lossless and lossy coupling

schemes. The lossless coupling scheme preserves all properties of original networks to achieve high-quality

solutions, while the lossy coupling scheme offers an attractive alternative when the running time and memory

consumption are of primary concern. Various experiments conducted on both real and synthesized datasets

have validated the effectiveness of the coupling schemes, which also provide some interesting insights into the

process of influence propagation in multiplex networks.

ETPL

NW - 026

Least Cost Influence Maximization Across Multiple Social Networks

A new paradigm in wireless network access is presented and analyzed. In this concept, certain classes of

wireless terminals can be turned temporarily into an access point (AP) anytime while connected to the

Internet. This creates a dynamic network architecture (DNA) since the number and location of these APs vary

in time. In this paper, we present a framework to optimize different aspects of this architecture. First, the

dynamic AP association problem is addressed with the aim to optimize the network by choosing the most

convenient APs to provide the quality-of-service (QoS) levels demanded by the users with the minimum cost.

Then, an economic model is developed to compensate the users for serving as APs and, thus, augmenting the

network resources. The users' security investment is also taken into account in the AP selection. A

preclustering process of the DNA is proposed to keep the optimization process feasible in a high dense

network. To dynamically reconfigure the optimum topology and adjust it to the traffic variations, a new

specific encoding of genetic algorithm (GA) is presented. Numerical results show that GA can provide the

optimum topology up to two orders of magnitude faster than exhaustive search for network clusters, and the

improvement significantly increases with the cluster size.

ETPL

NW - 027

iPath: Path Inference in Wireless Sensor Networks


Sivakasi |Dindugul|


Intradomain traffic engineering (TE) has become an indispensable tool for Internet service providers

(ISPs) to optimize network performance and utilize network resources efficiently. Various explicit

routing TE methods were recently proposed and have been able to achieve high network

performance. However, explicit routing has high complexity and requires large ternary content

addressable memories (TCAMs) in the routers. Moreover, it is costly to deploy explicit routing in IP

networks. In this paper, we present an approach, called generalized destination-based multipath

routing (GDMR), to achieve the same high performance as explicit routing. The main contribution of

this paper is that we prove that an arbitrary explicit routing can be converted to a loop-free

destination-based routing without any performance penalty for a given traffic matrix. We present a

systematic approach including a heuristic algorithm to realize GDMR. Extensive evaluation

demonstrates the effectiveness and robustness of GDMR.

ETPL

NW - 028

Load Balancing in IP Networks Using Generalized Destination-Based Multipath

Routing

LTE Advanced and other 4G cellular standards allow relay nodes (RNs) to be deployed as a substitute for base

stations (BSs). Unlike a BS, an RN is not directly connected to the backbone. Rather, each RN is associated

with a donor BS, to which it is connected through the OFDMA wireless link. A very important task in the

operation of a wireless network is packet scheduling. In a network with RNs, such scheduling decisions must

be made in each cell not only for the BS, but also for the RNs. Because the scheduler in a network with RNs

must take into account the transmission resources of the BS and the RNs, it needs to find a feasible schedule

that does not exceed the resources of a multidimensional resource pool. This makes the scheduling problem

computationally harder than in a network without RNs. In this paper, we define and study the packet-level

scheduling problem for a network with RNs. This problem is not only NP-hard, but also admits no efficient

polynomial-time approximation scheme. To solve it, we propose an efficient algorithm with a performance

guarantee and a simple water-filling heuristic. To the best of our knowledge, our algorithm is the first packet-

level scheduling algorithm that provides a performance guarantee for a network with RNs. Using simulations,

we evaluate our new algorithms and show that they perform very well.

ETPL

NW - 029

Multidimensional OFDMA Scheduling in a Wireless Network With Relay Nodes


Sivakasi |Dindugul|


We consider the problem of routing packets across a multi-hop network consisting of multiple sources of

traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard

by a random subset of receiver nodes among which the next relay is selected opportunistically. The main

challenge in the design of minimum-delay routing policies is balancing the trade-off between routing the

packets along the shortest paths to the destination and distributing the traffic according to the maximum

backpressure. Combining important aspects of shortest path and backpressure routing, this paper provides a

systematic development of a distributed opportunistic routing policy with congestion diversity (D-ORCD). D-

ORCD uses a measure of draining time to opportunistically identify and route packets along the paths with an

expected low overall congestion. D-ORCD with single destination is proved to ensure a bounded expected

delay for all networks and under any admissible traffic, so long as the rate of computations is sufficiently fast

relative to traffic statistics. Furthermore, this paper proposes a practical implementation of D-ORCD which

empirically optimizes critical algorithm parameters and their effects on delay as well as protocol overhead.

Realistic QualNet simulations for 802.11-based networks demonstrate a significant improvement in the

average delay over comparable solutions in the literature.

ETPL

NW - 030

Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks

Many applications, such as Intelligent Transport System (ITS), and mobile multimedia, use Internet-based

Vehicular Ad Hoc Networks (IVANETs). In IVANETs, users often access multimedia content from anywhere

using Internet connectivity to remote video streaming servers. Due to the high mobility of the nodes in

IVANETS, however, maintaining Quality of Service (QoS) for these video streaming applications with respect

to parameters such as jitter, throughput, buffering, and transmission delay is a challenging task. To address

these challenges, we propose a new QoSaware Hierarchical Web Caching (QHWC) scheme in IVANETs. We

propose two new metrics, Load Utilization Ratio (LUR) and Query to Connectivity Ratio (QCR), to maintain

the QoS for various video streaming applications in IVANETs. We compare the performance of our proposed

QHWC scheme, with past approaches, such as Dynamic Service, Weighted Segment, and Machine Learning

based using various parameters such as QCR, communication cost, query delay, Cache hit ratio, Query

Generation Rate, Invalidation cost, and Cache update interval. Our results demonstrate that the proposed

QHWC scheme yields an average decrease of 16.75 % and 22 % in communication Cost and Query Delay,

respectively, and an average increase of 9.31 % in Cache Hit Ratio. Moreover, the Invalidation Cost reduces

by 26.26 % (on average) with our proposed scheme compared to other schemes.

ETPL

NW - 031

QoS-aware Hierarchical Web Caching Scheme for Online Video Streaming

Applications in Internet-Based Vehicular Ad Hoc Networks


Sivakasi |Dindugul|


Thank You !

Documents

Elysium Technologies Private Limitedelysiumtechnologies.com/wp-content/uploads/2015/08/... · Elysium Technologies Private Limited Singapore | Madurai ... are supported by the smallcell