ieee projects 2012 2013 - networks

Elysium Technologies Private Limited Approved by ISO 9001:2008 and AICTE for SKP Training Singapore | Madurai | Trichy | Coimbatore | Cochin | Kollam | Chennai http://www.elysiumtechnologies.com, [email protected]

IEEE Final Year Projects 2012 |Student Projects | Networks Projects

IEEE FINAL YEAR PROJECTS 2012 – 2013

NETWORKS

Corporate Office: Madurai

227-230, Church road, Anna nagar, Madurai – 625 020.

0452 – 4390702, 4392702, +9199447933980

Email: [email protected], [email protected]

Website: www.elysiumtechnologies.com

Branch Office: Trichy

15, III Floor, SI Towers, Melapudur main road, Trichy – 620 001.

0431 – 4002234, +919790464324.

Email: [email protected], [email protected].


Branch Office: Coimbatore

577/4, DB Road, RS Puram, Opp to KFC, Coimbatore – 641 002.

+919677751577

Website: Elysiumtechnologies.com, Email: [email protected]

Branch Office: Kollam

Surya Complex, Vendor junction, Kollam – 691 010, Kerala.

0474 – 2723622, +919446505482.

Email: [email protected].


Branch Office: Cochin

4th

Floor, Anjali Complex, near south over bridge, Valanjambalam,

Cochin – 682 016, Kerala.

0484 – 6006002, +917736004002.

Email: [email protected], Website: www.elysiumtechnologies.com

mailto:[email protected]









EGC

5301

EGC

5302

NETWORKS 2012 - 2013

Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset

of the network nodes. For a desired quality of service (QoS), as measured by network throughput, the problem of

maximizing anonymity is investigated from a game-theoretic perspective. Quantifying anonymity using conditional

entropy of the routes given the adversary's observation, the problem of optimizing anonymity is posed as a two-player

zero-sum game between the network designer and the adversary: The task of the adversary is to choose a subset of

nodes to monitor so that anonymity of routes is minimum, whereas the task of the network designer is to maximize

anonymity by choosing a subset of nodes to evade flow detection by generating independent transmission schedules. In

this two-player game, it is shown that a unique saddle-point equilibrium exists for a general category of finite networks.

At the saddle point, the strategy of the network designer is to ensure that any subset of nodes monitored by the

adversary reveals an identical amount of information about the routes. For a specific class of parallel relay networks, the

theory is applied to study the optimal performance tradeoffs and equilibrium strategies. In particular, when the nodes

employ transmitter-directed signaling, the tradeoff between throughput and anonymity is characterized analytically as a

function of the network parameters and the fraction of nodes monitored. The results are applied to study the

relationships between anonymity, the fraction of monitored relays, and the fraction of hidden relays in large networks.

Route-vector protocols, such as the Border Gateway Protocol (BGP), have nodes elect and exchange routes in order to

discover paths over which to send traffic. We ask the following: What is the minimum number of links whose failure

prevents a route-vector protocol from finding such paths? The answer is not obvious because routing policies prohibit

some paths from carrying traffic and because, on top of that, a route-vector protocol may hide paths the routing policies

would allow. We develop an algebraic theory to address the above and related questions. In particular, we characterize a

broad class of routing policies for which we can compute in polynomial time the minimum number of links whose failure

leaves a route-vector protocol without a communication path from one given node to another. The theory is applied to a

publicly available description of the Internet topology to quantify how much of its intrinsic connectivity is lost due to the

traditional customer-provider, peer-peer routing policies and how much can be regained with simple alternative policies

A Game-Theoretic Approach to Anonymous Networking

A Theory for the Connectivity Discovered by Routing Protocols



EGC

5303

EGC

5305

EGC

5306

EGC

5304

Denial-of-service (DoS) attacks are considered within the province of a shared channel model in which attack rates may

be large but are bounded and client request rates vary within fixed bounds. In this setting, it is shown that clients can

adapt effectively to an attack by increasing their request rate based on timeout windows to estimate attack rates. The

server will be able to process client requests with high probability while pruning out most of the attack by selective

random sampling. The protocol introduced here, called Adaptive Selective Verification (ASV), is shown to use bandwidth

efficiently and does not require any server state or assumptions about network congestion. The main results of the

paper are a formulation of optimal performance and a proof that ASV is optimal.

Future wireless networks will dynamically access spectrum to maximize its utilization. Conventional design of dynamic

spectrum access focuses on maximizing spectrum utilization, but faces the problem of degraded reliability due to

unregulated demands and access behaviors. Without providing proper reliability guarantee, dynamic spectrum access

is unacceptable to many infrastructure networks and services. In this paper, we propose SPARTA, a new architecture

for dynamic spectrum access that balances access reliability and spectrum utilization. SPARTA includes two

complementary techniques: proactive admission control performed by a central entity to determine the set of wireless

nodes to be supported with only statistical information of their spectrum demands, and online adaptation performed by

admitted wireless nodes to adjust their instantaneous spectrum usage to time-varying demand. Using both theoretical

analysis and simulation, we show that SPARTA fulfills the reliability requirements while dynamically multiplexing

spectrum demands to improve utilization. Compared to conventional solutions, SPARTA improves spectrum utilization

by 80%-200%. Finally, SPARTA also allows service providers to explore the tradeoff between utilization and reliability to

make the best use of the spectrum. To our best knowledge, our work is the first to identify and address such a tradeoff.

We present a distinct longest prefix matching (LPM) lookup scheme able to achieve exceedingly concise lookup tables

(CoLT), suitable for scalable routers. Based on unified hash tables for handling both IPv4 and IPv6 simultaneously, CoLT

excels over previous mechanisms in: 1) lower on-chip storage for lookup tables; 2) simpler table formats to enjoy richer

prefix aggregation and easier implementation; and 3) most importantly, deemed the only design able to accommodate

both IPv4 and IPv6 addresses uniformly and effectively. As its hash tables permit multiple possible buckets to hold each

prefix (following a migration rule to avoid false positives altogether), CoLT exhibits the best memory efficiency and can

launch parallel search over tables during every LPM lookup, involving fewer cycles per lookup when on-chip memory is

used to implement hash tables. With 16 (or 32) on-chip SRAM blocks clocked at 500 MHz (achievable in today's 65-nm

Adaptive Selective Verification: An Efficient Adaptive Countermeasure to Thwart DoS

Attacks

Balancing Reliability and Utilization in Dynamic Spectrum Access 3 Results returned

Design of Wireless Sensor Networks for Mobile Target Detection

Concise Lookup Tables for IPv4 and IPv6 Longest Prefix Matching in Scalable Routers



EGC

5307

EGC

5308

technology), it takes 2 (or 1.6) cycles on average to complete a lookup, yielding 250 (or 310+) millions of packets per

second (MPPS) mean throughput. Being hash-oriented, CoLT well supports incremental table updates, besides its high

table utilization and lookup throughput.

We consider surveillance applications through wireless sensor networks (WSNs) where the areas to be monitored are

fully accessible and the WSN topology can be planned a priori to maximize application efficiency. We propose an

optimization framework for selecting the positions of wireless sensors to detect mobile targets traversing a given area.

By leveraging the concept of path exposure as a measure of detection quality, we propose two problem versions: the

minimization of the sensors installation cost while guaranteeing a minimum exposure, and the maximization of the

exposure of the least-exposed path subject to a budget on the sensors installation cost. We present compact mixed-

integer linear programming formulations for these problems that can be solved to optimality for reasonable-sized

network instances. Moreover, we develop Tabu Search heuristics that are able to provide near-optimal solutions of the

same instances in short computing time and also tackle large size instances. The basic versions are extended to

account for constraints on the wireless connectivity as well as heterogeneous devices and nonuniform sensing. Finally,

we analyze an enhanced exposure definition based on mobile target detection probability.

This paper presents DAWN, a declarative platform that creates highly adaptive policy-based mobile ad hoc network

(MANET) protocols. DAWN leverages declarative networking techniques to achieve extensible routing and forwarding

using declarative languages. We make the following contributions. First, we demonstrate that traditional MANET

protocols can be expressed in a concise fashion as declarative networks and policy-driven adaptation can be specified

in the same language to dictate the dynamic selection of different protocols based on various network and traffic

conditions. Second, we propose interprotocol forwarding techniques that ensure packets are able to seamlessly

traverse across clusters of nodes running different protocols selected based on their respective policies. Third, we have

developed a full-fledged implementation of DAWN using the RapidNet declarative networking system. We experimentally

validate a variety of policy-based adaptive MANETs in various dynamic settings using a combination of ns-3 simulations

and deployment on the ORBIT testbed. Our experimental results demonstrate that hybrid protocols developed using

DAWN outperform traditional MANET routing protocols and are able to flexibly and dynamically adapt their routing

mechanisms to achieve a good tradeoff between bandwidth utilization and route quality. We further demonstrate

DAWN's capabilities to achieve interprotocol forwarding across different protocols..

This paper investigates design methods of protection schemes in survivable WDM networks that use preconfigured

Declarative Policy-Based Adaptive Mobile Ad Hoc Networking

Differentiated Quality-of-Recovery in Survivable Optical Mesh Networks Using p -

Structures



EGC

5309

EGC

5310

protection structures (p-structures) in order to provide different quality-of-recovery (QoR) classes within 100% resilient

single-link protection schemes. QoR differentiation is a practical and effective approach in order to strike different

balances among protection cost, recovery delay, and management complexity. Based on the degree of pre-cross

connectivity of the protection structures, we develop three design approaches of shared protection capacity schemes

based on the following: 1) fully pre-cross-connected p-structures (fp-structures); 2) partially pre-cross-connected p-

structures (pp-structures); and 3) dynamically reconfigured p -structures (dp -structures). In order to identify the optimal

combinations of protection structures to meet the requirements of the three QoR classes, we use a column generation

(CG) model that we solve using large-scale optimization techniques. Our CG decomposition approach is based on the

separation processes of the design and selection of the protection structures. In the design process of the protection

structures, the shape and protection capability of each p-structure is decided dynamically during the selection process

depending on the network topology and the targeted QoR parameters. Extensive experiments are carried out on several

data instances with different design constraints in order to measure the protection capacity cost and the recovery delay

for the three QoR classes

Cognitive radio (CR) allows unlicensed users to access the licensed spectrum opportunistically (i.e., when the spectrum

is left unused by the licensed users) to enhance the spectrum utilization efficiency. In this paper, the problem of

allocating resources (channels and transmission power) in multihop CR networks is modeled as a multicommodity flow

problem with the dynamic link capacity resulting from dynamic resource allocation, which is in sharp contrast with

existing flow-control approaches that assume fixed link capacity. Based on queue-balancing network flow control that is

ideally suited for handling dynamically changing spectrum availability in CR networks, we propose a distributed scheme

(installed and operational in each node) for optimal resource allocation without exchanging spectrum dynamics

information between remote nodes. Considering the power masks, each node makes resource-allocation decisions

based on current or past local information from neighboring nodes to satisfy the throughput requirement of each flow.

Parameters of these proposed schemes are configured to maintain the network stability. The performance of the

proposed scheme for both asynchronous and synchronous scenarios is analyzed comparatively. Both cases of

sufficient and insufficient network capacity are considered.

In this paper, we establish that the rate region of a large class of IEEE 802.11 mesh networks is log-convex, immediately

allowing standard utility fairness methods to be generalized to this class of networks. This creates a solid theoretical

underpinning for fairness analysis and resource allocation in this practically important class of networks. For the special

case of max-min fairness, we use this new insight to obtain an almost complete characterization of the fair rate

allocation and a remarkably simple, practically implementable method for achieving max-min fairness in 802.11 mesh

Distributed Resource Allocation Based on Queue Balancing in Multihop Cognitive Radio

Networks

Max-Min Fairness in 802.11 Mesh Networks



EGC

5311

EGC

5312

EGC

5313

networks.

It has been shown in a previous version of this paper that hierarchical cooperation achieves a linear throughput scaling

for unicast traffic, which is due to the advantage of long-range concurrent transmissions and the technique of

distributed multiple-input-multiple-output (MIMO). In this paper, we investigate the scaling law for multicast traffic with

hierarchical cooperation, where each of the n nodes communicates with k randomly chosen destination nodes.

Specifically, we propose a new class of scheduling policies for multicast traffic. By utilizing the hierarchical cooperative

MIMO transmission, our new policies can obtain an aggregate throughput of Ω(( [( n)/( k)])1-ε) for any ε >; 0. This

achieves a gain of nearly √{[( n)/( k)]} compared to the noncooperative scheme in Li 's work (Proc. ACM MobiCom, 2007,

pp. 266-277). Among all four cooperative strategies proposed in our paper, one is superior in terms of the three

performance metrics: throughput, delay, and energy consumption. Two factors contribute to the optimal performance:

multihop MIMO transmission and converge-based scheduling. Compared to the single-hop MIMO transmission strategy,

the multihop strategy achieves a throughput gain of ( [( n)/( k)])[(h-1)/( h(2h-1))] and meanwhile reduces the energy

consumption by k[( α-2)/ 2] times approximately, where h >; 1 is the number of the hierarchical layers, and α >; 2 is the

path-loss exponent. Moreover, to schedule the traffic with the converge multicast instead of the pure multicast strategy,

we can dramatically reduce the delay by a factor of about ( [( n)/( k)])[(h)/ 2]. Our optimal cooperative strategy achieves

an approximate delay-throughput tradeoff D(n,k)/T(n,k)=Θ(k) when h&- x2192; ∞. This tradeoff ratio is identical to that of

noncooperative scheme, while the throughput is greatly improved.

Randomized Accurate and timely identification of the router-level topology of the Internet is one of the major unresolved

problems in Internet research. Topology recovery via tomographic inference is potentially an attractive complement to

standard methods that use TTL-limited probes. Unfortunately, limitations of prior tomographic techniques make timely

resolution of large-scale topologies impossible due to the requirement of an infeasible number of measurements. In this

paper, we describe new techniques that aim toward efficient tomographic inference for accurate router-level topology

measurement. We introduce methodologies based on Depth-First Search (DFS) ordering that clusters end-hosts based

on shared infrastructure and enables the logical tree topology of a network to be recovered accurately and efficiently.

We evaluate the capabilities of our algorithms in large-scale simulation and find that our methods will reconstruct

topologies using less than 2% of the measurements required by exhaustive methods and less than 15% of the

measurements needed by the current state-of-the-art tomographic approach. We also present results from a study of the

live Internet where we show our DFS-based methodologies can recover the logical router-level topology more accurately

and with fewer probes than prior techniques.

Multicast Performance With Hierarchical Cooperation

Efficient Network Tomography for Internet Topology Discovery

Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network

Decomposition Approach



EGC

5315

EGC

5314

In geographic (or geometric) routing, messages are by default routed in a greedy manner: The current node always

forwards a message to its neighbor node that is closest to the destination. Despite its simplicity and general efficiency,

this strategy alone does not guarantee delivery due to the existence of local minima (or dead ends). Overcoming local

minima requires nodes to maintain extra nonlocal state or to use auxiliary mechanisms. We study how to facilitate

greedy forwarding by using a minimum amount of such nonlocal states in topologically complex networks. Specifically,

we investigate the problem of decomposing a given network into a minimum number of greedily routable components

(GRCs), where greedy routing is guaranteed to work. We approach it by considering an approximate version of the

problem in a continuous domain, with a central concept called the greedily routable region (GRR). A full characterization

of GRR is given concerning its geometric properties and routing capability. We then develop simple approximate

algorithms for the problem. These results lead to a practical routing protocol that has a routing stretch below 7 in a

continuous domain, and close to 1 in several realistic network settings.

In this paper, we present a new routing paradigm that generalizes opportunistic routing for wireless multihop networks.

In multirate anypath routing, each node uses both a set of next-hops and a selected transmission rate to reach a

destination. Using this rate, a packet is broadcast to the nodes in the set, and one of them forwards the packet on to the

destination. To date, there is no theory capable of jointly optimizing both the set of next-hops and the transmission rate

used by each node. We solve this by introducing two polynomial-time routing algorithms and provide the proof of their

optimality. The proposed algorithms have roughly the same running time as regular shortest-path algorithms and are

therefore suitable for deployment in routing protocols. We conducted measurements in an 802.11b testbed network, and

our trace-driven analysis shows that multirate anypath routing is on average 80% better than 11-Mbps anypath routing,

with a factor of 6.4 improvements in the best case. If the rate is fixed at 1 Mbps instead, performance improves by a

factor of 5.4 on average.

Abstract— In this paper, we study the problem of identifying constant additive link metrics using linearly independent

monitoring cycles and paths. A monitoring cycle starts and ends at the same monitoring station, while a monitoring path

starts and ends at distinct monitoring stations. We show that three-edge connectivity is a necessary and sufficient

condition to identify link metrics using one monitoring station and employing monitoring cycles. We develop a

polynomial-time algorithm to compute the set of linearly independent cycles. For networks that are less than three-edge-

connected, we show how the minimum number of monitors required and their placement may be computed. For

networks with symmetric directed links, we show the relationship between the number of monitors employed, the

number of directed links for which metric is known a priori, and the identifiability for the remaining links. To the best of

our knowledge, this is the first work that derives the necessary and sufficient conditions on the network topology for

Polynomial-Time Algorithms for Multi rate Any path Routing in Wireless Multihop

Networks

On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths



EGC

5317

EGC

5316

EGC

5318

identifying additive link metrics and develops a polynomial-time algorithm to compute linearly independent cycles and

paths.

In this paper, we study periodic query scheduling for data aggregation with minimum delay under various wireless

interference models. Given a set Q of periodic aggregation queries, each query Qi ∈ Q has its own period pi and the

subset of source nodes Si containing the data. We first propose a family of efficient and effective real-time scheduling

protocols that can answer every job of each query task Qi ∈ Q within a relative delay O(pi) under resource constraints by

addressing the following tightly coupled tasks: routing, transmission plan constructions, node activity scheduling, and

packet scheduling. Based on our protocol design, we further propose schedulability test schemes to efficiently and

effectively test whether, for a set of queries, each query job can be finished within a finite delay. Our theoretical analysis

shows that our methods achieve at least a constant fraction of the maximum possible total utilization for query tasks,

where the constant depends on wireless interference models. We also conduct extensive simulations to validate the

proposed protocol and evaluate its practical performance. The simulations corroborate our theoretical analysis.

The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It

also presents new challenges to the classical problem of interference management in wireless networks. This paper

develops an axiomatic framework for power allocation in cognitive radio networks based on four goals: QoS protection

to primary users, opportunism to secondary users, admissibility to secondary users, and autonomous operation by

individual users. Two additional goals, licensing and versatility, which are desirable rather than essential, are also

presented. A general class of Duo Priority Class Power Control (DPCPC) policies that satisfy such goals is introduced.

Through theoretical analysis and simulation, it is shown that a specific interference-aware power-control algorithm

reaches such goals.

In this paper, we study the problem of reliable collective communication (broadcast or gossip) with the objective of

maximizing the reliability of the collective communication. The need for collective communication arises in many

problems of parallel and distributed computing, including Grid or cloud computing and database management. We

describe the network model, formulate the reliable collective communication problem, prove that the maximum reliable

collective communication problem is NP-hard, and provide an integer linear program (ILP) formulation for the problem.

We then provide a greedy approximation algorithm to construct collective communication (through a spanning tree) that

achieves an approximation ratio of 1 + ln(|V|+α|E|-1) , where α is the average number of shared link risk groups (SRLGs)

along links, and |V| and |E| are the total number of vertices and edges of the network, respectively. Simulations

Power Control for Cognitive Radio Networks: Axioms, Algorithms, and Analysis

Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks

Reliable Collective Communications With Weighted SRLGs in Optical Networks



EGC

5319

EGC

5321

EGC

5320

demonstrate that our approximation algorithm achieves good performance in both small and large networks and that, in

almost 95% of total cases, our algorithm outperforms the modified minimum spanning tree algorithms.

An increasing number of datacenter network applications, including automated trading and high-performance

computing, have stringent end-to-end latency requirements where even microsecond variations may be intolerable. The

resulting fine-grained measurement demands cannot be met effectively by existing technologies, such as SNMP,

NetFlow, or active probing. We propose instrumenting routers with a hash-based primitive that we call a Lossy

Difference Aggregator (LDA) to measure latencies down to tens of microseconds even in the presence of packet loss.

Because LDA does not modify or encapsulate the packet, it can be deployed incrementally without changes along the

forwarding path. When compared to Poisson-spaced active probing with similar overheads, our LDA mechanism

delivers orders of magnitude smaller relative error; active probing requires 50-60 times as much bandwidth to deliver

similar levels of accuracy. Although ubiquitous deployment is ultimately desired, it may be hard to achieve in the shorter

term; we discuss a partial deployment architecture called mPlane using LDAs for intrarouter measurements and

localized segment measurements for interrouter measurements..

Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access algorithms can achieve the

maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-

time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance

of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as greedy maximal

scheduling) can yield much better delay performance for a large set of arrival rates, in general they may only achieve a

fraction of the capacity region. In this paper, we propose a discrete-time version of the CSMA algorithm. Central to our

results is a discrete-time distributed randomized algorithm that is based on a generalization of the so-called Glauber

dynamics from statistical physics, where multiple links are allowed to update their states in a single timeslot. The

algorithm generates collision-free transmission schedules while explicitly taking collisions into account during the

control phase of the protocol, thus relaxing the perfect CSMA assumption. More importantly, the algorithm allows us to

incorporate heuristics that lead to very good delay performance while retaining the throughput-optimality property.

Router Support for Fine-Grained Latency Measurements

Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum

Throughput and Low Delay in Wireless

Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection



EGC

5322

Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes

that can be detected using a single chip for a reasonable throughput. This limit on the number of RegExes impairs the

scalability of today's RegEx detection systems. The scalability of existing schemes is generally limited by the traditional

detection paradigm based on per-character-state processing and state transition detection. The main focus of existing

schemes is on optimizing the number of states and the required transitions, but not on optimizing the suboptimal

character-based detection method. Furthermore, the potential benefits of allowing out-of-sequence detection, instead of

detecting components of a RegEx in the order of appearance, have not been explored. Lastly, the existing schemes do

not provide ways to adapt to the evolving RegExes. In this paper, we propose Lookahead Finite Automata (LaFA) to

perform scalable RegEx detection. LaFA requires less memory due to these three contributions: 1) providing specialized

and optimized detection modules to increase resource utilization; 2) systematically reordering the RegEx detection

sequence to reduce the number of concurrent operations; 3) sharing states among automata for different RegExes to

reduce resource requirements. Here, we demonstrate that LaFA requires an order of magnitude less memory compared

to today's state-of-the-art RegEx detection systems. Using LaFA, a single-commodity field programmable gate array

(FPGA) chip can accommodate up to 25 000 (25 k) RegExes. Based on the throughput of our LaFA prototype on

FPGA, we estimate that a 34-Gb/s throughput can be achieved.

Denial-of-service (DoS) attacks are considered within the province of a shared channel model in which attack rates may

be large but are bounded and client request rates vary within fixed bounds. In this setting, it is shown that clients can

adapt effectively to an attack by increasing their request rate based on timeout windows to estimate attack rates. The

server will be able to process client requests with high probability while pruning out most of the attack by selective

random sampling. The protocol introduced here, called Adaptive Selective Verification (ASV), is shown to use bandwidth

efficiently and does not require any server state or assumptions about network congestion. The main results of the

paper are a formulation of optimal performance and a proof that ASV is optimal.

Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version)

ieee projects 2012 2013 - networks

Education