Wireless Sensor Networks (WSNs) are composed of large number of nodes referred to as sensors. Sensors are low cost, low-power, multi-functional devices that communicate untethered in short distances. Hence, sensors are resource-low devices equipped with lower processing and transmission capabilities, and less battery life. In WSNs, the collaborative operation of the sensors enables the distributed sensing of a physical phenomenon. After sensors detect an event in the deployment field, the event data is distributive processed and transmitted to other sensor which act as the cluster head, which gather, process, and eventually reconstruct the event data. WSNs can be considered a distributed control system designed to react to sensor information with an effective and timely action. For this reason, in WSNs it is important to provide real-time coordination and communication to guarantee timely execution of the right actions and energy efficiency of the networking protocols is also a major concern, since sensors are resource-constrained devices. We propose an energy efficient routing protocol for wireless sensor networks to cope with these challenges keeping in mind the resource constraints of the network and the early response by the actor nodes for delay sensitive applications with number of transmissions as less as possible. Our protocol is based on clustering (virtual grid) and
Voronoi region concept.

Keywords— Wireless Sensor Networks, Voronoi Diagram, sensor, clustering

Border Gateway routing protocol (BGP) is the de-facto inter-domain routing protocol. Threat vulnerabilities and security issues of BGP have been addressed various times by different researchers through different angles including its functionality, operations and mechanism. BGP security classification is broadly classified in two planes, control plane and data plane. Control plane deals with routing policies whereas data plane talks about secure data delivery. This paper advocates the BGP security in data plane believing in its security and efficiency. In this paper a BGP threat model is designed and an attack overcoming procedure is suggested using peer link elliptic curve cryptography (PLECC) algorithm and session key concept in the network. The design is further implemented using network simulator taking into consideration some of the major attacks associated with data delivery. The result thus obtained concludes that the opinion of securing data delivery instead of securing routing protocol is more effective, easier and robust to reduce performance overhead.

Keywords- BGP, PLECC, Subverted Unauthorized, Misrounding, Power Control, Masquerading.

This paper discuss the design, implementation and evaluation of a new network layer for Mozart. Mozart is one of the distributed programming platform which is based on the multi paradigm language namely Mozart supplies a factual network transparent implementation by maintaining network awareness, openness, and also fault tolerance. Its network layer provides message passing service to its higher layers which run protocols to uphold the state of distributed entities. In the study of the old network layer problems, a new model was designed and implemented. With this the Solutions achieved includes  less fragmented sending of data, more efficient usage of file descriptors and similar resources, leaner memory usage, improved multiplexing over communication channels and a monitor mechanism for error handling. This paper also focuses on some other languages distribution models and the message passing services. It come out that the many different aspects of a multi paradigm language also require more of such service. When we compare the performance of the network layer of Mozart with Java’s RMI it is competitive , or even higher than the performance of Java’s RMI, which uses a more simplistic message passing service.

Keywords— Distributed, layer, ByteBuffer , message passing, binding,  remote.

In this paper, we propose a Channel Management Algorithm at the Access Points (APs) of Wireless Local Area Network (WLAN) in order to maximize the efficiency of the network by managing users on different channels[1] such that the overall throughput is maximized. We start with the channel assignment at the APs, which is based on minimizing the total interference between APs. Initially we assign the users at different APs on the basis of the users load. The solution developed in this paper uses a distributed algorithm by assigning non-overlapping channels and managing fixed and roaming users in network. One software agent manages all APs and is able to communicate with its neighbors in order to optimize channel utilization[3] for global throughput. Results show that the proposed algorithm is capable of managing the users on APs as significantly manages the channels in WLAN, which in turn improves the network throughput.

Keywords:- WLAN, Channel Management, Access Points, Roaming, Channel

          

A Mobile Adhoc Network is a collection of autonomous nodes or terminals which communicate with each other by forming a multihop radio network without the aid of any established infrastructure or centralized administration such as a base station. Routing is an important component in mobile ad hoc networks and it has several routing protocols, which are affected from different attacks. Ad hoc On demand Distance Vector (AODV) is one of the most suitable routing protocol for the MANETs and it is more vulnerable to black hole attack by the malicious nodes. In this paper we attempt to focus on analyzing and improving the security of one of the routing protocol ( AODV). Our main focus will be on the effect of black hole attack in MANET

Keyword: MANET, Black hole, Routing protocol, AODV