Vijay Ukani

Energy and Throughput Analysis of Hierarchical Routing Protocol (LEACH) for Wireless Sensor Network

ABSTRACT Wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. The efficient utilization of energy source in a sensor node is very important criteria to prolong the life time of wireless sensor network. Wireless sensor networks have explored to many new protocols specifically designed for sensor networks where energy consideration is very crucial. Most of importance, given to hierarchical routing protocols based on clustering has better scalability. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. There are several energy efficient hierarchical routing protocols among this LEACH is famous protocol, we have simulated LEACH in NS2 and analyzed performance of LEACH in terms of energy, throughput and lifetime. Keywords : LEACH, Hierarchical Routing Algorithms, clustering, wireless sensor networks.

Efficient Vehicle Detection and Classification for Traffic Surveillance System

Video surveillance systems is a key component of any security system. Making an intelligent system that can detect and track multiple moving objects from video and also deals with dynamic backgrounds, illumination problem and environment conditions is a challenging task. The proposed system is designed for real-time vehicle detection and classification. The traffic is increasing day by day due to increase in number of vehicles. Vehicle detection, classification, and counting is a very important application by which highway monitoring, traffic planning, analysis of the traffic flow, etc. can be easily done. In this paper, vehicle detection is done by background subtraction and from each detected vehicles Scale-Invariant Feature Transform (SIFT) features is extracted. Vehicles are classified using the neural network and Support Vector Machine (SVM). SVM showed better generalization than Artificial Neural Networks.

QoS aware geographic routing protocol for multimedia transmission in wireless sensor network

Wireless sensor network (WSN) is a network of small, low power, resource constrained devices distributed in a large area. The principle focus of such network is to monitor some well-defined phenomenon in the sensor field. Availability of low power CMOS camera has offered wings to WSN applications. Broadening the range of applications from monitoring to multimedia surveillance. Multimedia transmission brings newer challenges primarily provisioning of the quality of service. Realtime video surveillance is one class of application which expects timely delivery of the packets. QoS aware routing protocols are required to cater to this demand. Geographic routing protocols are most suited WSN due to its scalability. GPSR, SPEED, and MMSPEED are the protocols which explore 1-hop neighborhood information in packet forwarding. Most of these protocols stations their routing decision on the location of sink and ignoring energy reserves of a node, which is crucial in each WSN application. A geographic routing protocol is proposed in this paper, which is energy aware. Also rather than sticking to maintaining 1-hop neighborhood information, it maintains n-hop neighborhood which helps early detection of void.

Optimized handoff process in IEEE802.11p based VANET

The IEEE802.11p is a draft standard intended to support wireless access in the vehicular environment (WAVE). IEEE802.11p offers the connectivity to the highly mobile vehicular network. The IEEE802.11p standard has introduced the multichannel concept but it does not specify the mechanism for channel access and handoff process for V2I (Vehicle-to Infrastructure) communication. We present handoff process in vehicular communications by adopting IEEE 802.11p based communication systems. This research mainly focuses on reducing the total time taken by handoff and support seamless handoff process for application demanding the real-time services. The proposed scheme reduces the control messages latency and uses the multi-channel operation of IEEE802.11p that has optimized handoff process. The Simulation result shows that the time taken by handoff and delay regarding control message is reduced. Simulation results show best performance of the proposed scheme compared to existing scheme.

Open Issues in Named Data Networking – A Survey

Internet is now being used as content distribution network also. Internet users are interested in specific contents rather than host machines where the content is located. Named Data Networking (NDN) is a step towards future Internet architecture that would be based on named data rather than numerically identified hosts. Many projects are in progress to architect the structure of the future Internet. It is envisaged that NDN would provide functional efficiency with named content applied as the core concept. NDN offers lot of research opportunities to contribute for design of future Internet architecture. In this paper we analyze the modern Internet Protocol (IP) based host- centric architecture and explore the newer scalable and more efficient architecture, based on content-centric approach. Open research issues in various area of NDN are also addressed in the paper.

Routing Protocols for Wireless Multimedia Sensor Networks: Challenges and Research Issues

Due to miniaturization of hardware and availability of low-cost, low-power sensors, Wireless Sensor Network and Multimedia Sensor Network applications are increasing day by day. Each application has a specific quality of service and experience requirements. The design of routing and MAC protocol which can fulfill the requirements of the application is challenging given the constrained nature of these devices. Considerable efforts are directed towards the design of energy efficient QoS-aware routing protocols. In this article, we present state of the art review of routing protocols for Wireless Multimedia Sensor Networks while addressing the challenges and providing insight into research issues.

Outcome Fusion-Based Approaches for User-Based and Item-Based Collaborative Filtering

Collaborative Filtering (CF) is one of the most effective approaches to engineer recommendation systems. It recommends those items to user which other users with related preferences and tastes liked in the past. User-based and Item-based Collaborative Filtering (IbCF) are two flavours of collaborative filtering. Both of these methods are used to estimate target user’s rating for the target item. In this paper, these methods are implemented and their performance is evaluated on the large dataset. The major attention of this paper is on exploring different ways in which predictions from UbCF and IbCF can be combined to minimize overall prediction error. Predictions from UbCF and IbCF are combined through simple and weighted averaging and performance of these fusion approaches is compared with the performance of UbCf & IbCF when implemented individually. Results are encouraging and demonstrate usefulness of fusion approaches.

Computation of Coverage Backup Set for Wireless Video Sensor Network

Use of camera sensors has increased the scope of applications visualized by Wireless Sensor Networks (WSN). Video sensors increases the clarity of capture and reduces false alarm rate. Continuous capture and transmission of video streams can be highly energy consuming task given the resource constrained nature of sensor nodes. Also transmission of video stream demands high bandwidth. In applications like border patrolling, in event of intrusion, the system is expected to report the event. High deployment density of nodes results in larger overlap across the area covered by various nodes. Transmission of video streams by all video sensors detecting the intrusion can result in redundant streams, thus increasing energy consumption. Video sensors can vary their capture quality as a function of their backup nodes. Given the directional coverage of video sensor nodes, it becomes a challenging task to identify the set of backup nodes covering the same area. In this paper we investigate existing techniques for backup set computation and suggest a dynamic sized backup set computation method which is efficient and computes minimum sized backup set, minimizing the number of active nodes in the network.