IEEE Projects | ieee projects 2012 | IEEE Projects 2011 | IEEE Projects 2010 | IEEE Project | Final year Projects | Ns2 Projectsieee projects, ieee projects 2011,ieee projects 2012, NS2 Projects,IEEE Academic Projects, IEEE 2011 Projects, IEEE, IEEE Projects Chennai,IEEE Software Projects, Latest IEEE Projects,IEEE Student Projects, IEEE Final year Student Projects,Final Year Projects, ENGINEERING PROJECTS, MCA projects, BE projects, Embedded Projects, JAVA projects, J2EE projects, .NET projects, Students projects, MATLAB Projects
Valuable Detours: Least-Cost Anypath Routing
Technology Used: Dot Net IEEE 2011 In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each node a group of candidate relays for [...]
SRLG Failure Localization in Optical Networks
SRLG Failure Localization in Optical Networks Technology Used: Dot Net IEEE 2011 We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An SRLG failure causes multiple links to break simultaneously due to the failure of a common resource. MCs [...]
Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions
Technology Used: Java IEEE 2011 Download IEEE Projects 2011 Basepaper ABSTRACT It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no [...]
Novel Defense Mechanism Against Data Flooding Attacks In Wireless Ad Hoc Networks
Technology Used: Java Consumer Electronics, IEEE 2010 Mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Hence, we expect that wireless ad hoc networks will be widely used in the near future since these networks form the topology with low cost on the fly. However, consumer [...]
Mitigating Selective Forwarding Attacks With A Channel-Aware Approach In WMNS-java
Technology Used: Java Wireless Communications, IEEE 2010 In this paper, we consider a special case of denial of service (DoS) attack in wireless mesh networks (WMNs) known as selective forwarding attack (a.k.a gray hole attacks). With such an attack, a misbehaving mesh router just forwards a subset of the packets it receives but drops the [...]
Efficient and Dynamic Routing Topology Inference from End-To-End Measurements
Technology Used: Java IEEE 2010 Inferring the routing topology and link performance from a node to a set of other nodes is an important component in network monitoring and application design. In this paper we propose a general framework for designing topology inference algorithms based on additive metrics. The framework can flexibly fuse information from [...]
A Dynamic En-Route Filtering Scheme For Data Reporting In Wireless Sensor Networks
Technology Used: Java IEEE 2010 In wireless sensor networks, adversaries can inject false data reports via compromised nodes and launch DoS attacks against legitimate reports. Recently, a number of filtering schemes against false reports have been proposed. However, they either lack strong filtering capacity or cannot support highly dynamic sensor networks very well. Moreover, few [...]
A Distributed CSMA Algorithm For Throughput And Utility Maximization In Wireless Networks
Technology Used: Java IEEE 2010 In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE [...]
On Wireless Scheduling Algorithms For Minimizing The Queue-Overflow Probability
Technology Used: Java IEEE 2010 In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay-rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. We first [...]
