Ali Kashif Bashir

Energy Efficient In-network RFID Data Filtering Scheme in Wireless Sensor Networks

RFID (Radio frequency identification) and wireless sensor networks are backbone technologies for pervasive environments. In integration of RFID and WSN, RFID data uses WSN protocols for multi-hop communications. Energy is a critical issue in WSNs; however, RFID data contains a lot of duplication. These duplications can be eliminated at the base station, but unnecessary transmissions of duplicate data within the network still occurs, which consumes nodes’ energy and affects network lifetime. In this paper, we propose an in-network RFID data filtering scheme that efficiently eliminates the duplicate data. For this we use a clustering mechanism where cluster heads eliminate duplicate data and forward filtered data towards the base station. Simulation results prove that our approach saves considerable amounts of energy in terms of communication and computational cost, compared to existing filtering schemes.

A collaborative scheme for boundary detection and tracking of continuous objects in WSNs

With rapid advancements in MEMS technologies, sensor networks have made possible a broad range of applications in real time. Object tracking and detection is one of the most prominent applications for wireless sensor networks. Individual object tracking and detection has been intensively discussed, such as tracking enemy vehicles and detecting illegal border crossings. The tracking and detection of continuous objects such as fire smoke, nuclear explosions and hazardous bio-chemical material diffusions pose new challenges because of the characteristics of such objects, i.e., expanding and shrinking in size, changing in shape, splitting into multiple objects or merging multiple objects into one over time. A continuous object covers a large area over the network and requires extensive communication to detect and track. Tracking continuous objects accurately and efficiently is challenging, whereas extensive communication consumes massive energy in the network, and handling energy in wireless sensor network (W...

A Context-Aware Service Discovery Consideration in 6LoWPAN

To make the revelation of ubiquity true different kind of networks integration is going on and this assimilation makes service discovery more challenging because different types of service discovery have been develop for the particular network. A Context-Aware Service Discovery for these amalgam networks is different from usual, especially when we talk about 6LoWPANs functioning with IP Networks, as 6LoWPAN are characterized by low power and low bandwidth, short range and low cost that make the challenge hard. Moreover Interworking of 6LoWPAN with IP networks brings in many challenges for Context-Aware based service discovery issues.In this paper we suggest an advanced service discovery architecture and mechanism that assist proximity and Context Aware based service discovery in IP network and LoWPAN interworked environment. The results show that our architecture helps to discover the closest and exact services from inside as well as outside the LoWPAN according to user requirement. It also reduces the traffic overhead for service discovery considerably.

GARPAN: gateway-assisted Inter-PAN routing for 6LoWPANs

IEEE802.15.4 devices are all geared up for deployment as sensor net-orks that are ubiquitous yet cost effective. An emphasis on keeping costs down results into sensor networks that do not warrant high connectivity, thereby making routing a more crucial activity. In the purview of routing, ZigBee consortium has developed a PAN routing protocol. Other notable efforts are underway chartered by IETF as 6LoWPAN working group. In this paper, we have revisited the routing approaches suggested both for intra-PAN and mesh. Our contribution here is first to identify the plausibility of using gateways in routing functionality in 6LoWPAN networks. Second, we propose a protocol that defines the role of gateways for enhancing the routability of 6LoWPANs. Through NS2-based simulation study, our performance analysis amenably supports the applicability of our protocol.

Mobile RFID and its design security issues

Mobile RFID is a new research direction and it will act as a backbone technology for ubiquity. It is a combination of two technologies: RFID and telecommunication. It is categorized into three application zones: LBZs, EZs, and PZs.Our work is divided into two phases. In first phase, we discussed numerous applications for mobile RFID zones. Each application zone possesses certain char acteristics, hence a set of design require ments for all future applications in that zone. We have provided the first working environment for mobile RFID, which shows all possible locations of its zones. In second phase, we discussed the security issues of mobile RFID application zones, as mobile RFID does not have any standard security design requirements.

Mobile Ad Hoc Computational Grid for Low Constraint Devices

We are not far from the time when environments will be smart and intelligent having capability to compute and communicate with other environments and artifacts. These environments and everyday objects will be equipped with small, inexpensive, and low power devices having capability to communicate with each other in order to organize and coordinate their actions. Computation will be freely available everywhere allowing us to perform tasks anywhere at anytime. The individuals will be equipped with lightweight devices instead of heavy devices that condense the effectiveness of individual. Furthermore, there is increasing trend towards anytime, anywhere computing paradigm that allow user to work at home, while traveling or at any location. Due to this increasing trend and availability of hundreds of low constrained devices, it will be possible for individuals to form a mobile ad hoc computational grid by integrating piecemeal devices into a single, unified computing resource that could achieve the desired result. The purpose of study is to propose architecture for mobile ad hoc computational grid for low constraint devices in order to perform high processing tasks.

Collaborative Detection and Agreement Protocol for Routing Malfunctioning in Wireless Sensor Networks

Routing is one of the most important activities performed in a sensor network. Routing nodes can behave either maliciously or may malfunction due to failed system components, affecting the overall network throughput adversely. In this paper, a distributed cooperative routing failure detection mechanism is introduced. The neighbors of a suspected node collaborate with each other to generate consensus about the misbehaving node. A logical tree is formed among the peer nodes to avoid messaging overhead and to allow the final consensus to be notified to every neighbor of the suspect. A simple algorithm for consensus is then presented; every neighbor considers a decision factor for every other neighbor in order to generate a unified agreement about the node under suspicion. We analyze and show that our approach performs better for energy conservation and node lifetime better than previously reported flooding schemes

[ETCTR] Efficient Target Localization by Controlling the Transmission Range in Wireless Sensor Networks

The applications of sensor networks are getting critical and important particularly in strategic, applications such as corresponding target detection, surveillance, and target localization. To accomplish target detection and localization data from more then three sensors which receive signals from moving targets, measure RSSI, and translate RSSI into the distance between sensor and target. All this process involves more sensor and energy consumption. Whereas the energy is a critical resource in wireless sensor networks and network lifetime needs to be long-drawn out through the use of energy-conscious sensing strategies during system operations. We introduce an efficient-localization algorithm using only one sensor and auto controlling the transmission rage of its one hope neighbor sensors. Algorithm provides the precise location of the target by using signal strength and velocity of the object. It takes minimum resources of networks, which makes the network prolong. Our approach ETCTR adopt the multicasting for transmission settlement rather then broad casting that minimize the communication cost of the network. This algorithm contributes to increase the overall lifetime of sensor networks. Results illustrate that our approach provide better localization of the target utilizing less power consumption, less communication cost and extended network life.

An Efficient Channel Access Scheme for Vehicular Ad Hoc Networks

Vehicular Ad Hoc Networks (VANETs) are getting more popularity due to the potential Intelligent Transport Systems (ITS) technology. It provides many efficient network services such as safety warnings (collision warning), entertainment (video and voice), maps based guidance, and emergency information. VANETs most commonly use Road Side Units (RSUs) and Vehicle-to-Vehicle (V2V) referred to as Vehicle-to-Infrastructure (V2I) mode for data accessing. IEEE 802.11p standard which was originally designed for Wireless Local Area Networks (WLANs) is modified to address such type of communication. However, IEEE 802.11p uses Distributed Coordination Function (DCF) for communication between wireless nodes. Therefore, it does not perform well for high mobility networks such as VANETs. Moreover, in RSU mode timely provision of data/services under high density of vehicles is challenging. In this paper, we propose a RSU-based efficient channel access scheme for VANETs under high traffic and mobility. In the proposed scheme, the contention window is dynamically varied according to the times (deadlines) the vehicles are going to leave the RSU range. The vehicles with shorter time deadlines are served first and vice versa. Simulation is performed by using the Network Simulator (NS-3) v. 3.6. The simulation results show that the proposed scheme performs better in terms of throughput, backoff rate, RSU response time, and fairness.

In-network RFID Data Filtering Scheme in RFID-WSN for RFID Applications

In the integration of wireless sensor networks (WSN) and radio frequency identification (RFID), RFID data can use WSN protocols for multi-hop communication. Due to readers overlapped regions in dense areas and due to readers multiple read cycles, a lot of duplicate data is produced. Transmitting such duplicates towards base station waste node energies. In-network filtering of these duplicates can save transmission overhead, but on the other hand it increases computation cost. Delay is an important parameter in RFID applications that has not been considered yet by existing approaches. Both communication overhead and computation overhead can affect the delay performance in terms of queuing delay and processing delay respectively. Therefore, it is required to tune the filtering algorithm. In this paper, our in-network filtering scheme tend to find this trade-off between these two costs for better delay performance. In simulation part, we showed the effect of these costs on delay performance.