Search

In this paper we present Clustering Protocol for Sensor networks (CPS). Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach is based on the Covering Problem that aims at covering an area with minimum number of circular disks. CPS is a lightweight protocol that does not require any neighborhood information and imposes low communication overhead. We present simulation results to show the efficiency of CPS in both ideal cases and randomly distributed networks. Moreover, CPS is scalable with respect to density and network size. [ABSTRACT FROM AUTHOR]

We present Delay-Energy Aware Routing (DEAP) a novel protocol for heterogeneous wireless ad hoc networks. DEAP is a crosslayer scheme that: first, manages adaptively the energy control by controlling the wakeup cycle of sensors based on the experienced packet delay; and second, rout packet in each hoc by distributing the load a group of neighboring nodes. The primary result of DEAP is that it enables a flexible and wide range of tradeoffs between the packet delay and the energy consumption. Therefore, DEAP supports delay sensitive applications of heterogeneous networks that include sensors and actors. DEAP is scalable to the change in network size, node type, node density and topology. DEAP accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed, while DEAP does not count on actors, it takes advantage of them, and uses their resources when possible, thus reducing the energy consumption of sensor nodes. Through analysis and simulation evaluations, we show that DEAP improves the packet delay and network lifetime compared to other protocols. [ABSTRACT FROM AUTHOR]

We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broadcasting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is a very energy expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. GBS is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. GBS does not need any neighborhood information and imposes very low communication overhead. GBS is scalable to the change in network size, node type, node density and topology. Furthermore it accommodates seamlessly such network changes, including the presence of actors in heterogeneous sensor networks. Indeed, GBS takes advantage of actor nodes, and uses their resources when possible, thus reducing the energy consumption by sensor nodes. Through simulation evaluations, we show that GBS is very scalable and its performance is improved by the presence of actors. At the best of our knowledge, GBS is the first broadcast protocol designed specifically for heterogeneous sensor and actor networks. [ABSTRACT FROM AUTHOR]

The design of the IF protocol makes it difficult to reliably identify the originator of an IF packet, causing the defense against Distributed Denial of Service attacks to become one of the hardest problems on the Internet today. Previous solutions for this problem try to traceback to the exact origin of the attack by requiring every router's participation. For many reasons this requirement is impractical and the victim results with an approximate location of the attacker. Reconstruction of the whole path is also very difficult due to the sheer size of the Internet. This paper presents lightweight schemes for tracing back to the attack-originating AS instead to the exact origin itself. Once the attack-originating AS is determined, all further routers in the path to the attacker are within that AS and under the control of a single entity; which can presumably monitor local traffic in a more direct way than a generalized, Internet scale, packet marking scheme can. We furthermore, provide a scheme to prevent compromised routers from forging markings. [ABSTRACT FROM AUTHOR]