Showing papers by "Arzad A. Kherani published in 2016"

Method and system for dynamically forming service aware bluetooth low energy (BLE) mesh network

Abstract: A method of dynamically forming a service aware Bluetooth low energy (BLE) mesh network is provided. The method includes deriving service requirements for a BLE mesh service based on a unique identifier associated with the BLE mesh service, determining a BLE mesh service to be provided based on at least one BLE parameter, and dynamically forming a BLE mesh network based on the determined BLE mesh service, the service requirements and the at least one BLE parameter. The BLE mesh network is one of connection-oriented, or connection-less.

Hybrid location tracking in BLE beacon systems with in-network coordination

Abstract: Bluetooth Low Energy (BLE)-based beacons are expected to be used to provide various short range services in near future. We consider a system where mobile devices send periodic BLE beacons (consisting of the devices' identity) and the infrastructure nodes are required to track these devices to gather information about the users behavior in order to improve customized services provided to the user. For such systems, we propose the design and present a prototype (on CSR 1010 kits) where location detection and tracking are done via vision-based approach assisted by the RF observations. Features, extensions and optimizations of this system are discussed in detail. Emphasis is provided on in-network processing to disambiguate the multiple objects detected using image processing and assign the right identities as received via BLE beacons to the right objects. Further, the approach provides reduction in the beacon generation rate from the user devices, thereby improving the battery lifetime of the end devices.

Mechanisms for dynamically forming mesh network

Abstract: The present invention relates to mechanisms for dynamically forming a mesh network, capable of performing an adjacent list update procedure. According to the embodiment of the present invention, a service aware Bluetooth low energy (BLE) mesh network is dynamically formed. According to the method, service requirements of BLE mesh service are derived based on an intrinsic identifier related to BLE mesh service. According to the method, a BLE mesh service to be provisioned based on one or more BLE parameters is determined. According to the method, the BLE mesh network is dynamically determined based on the determined BLE mesh service, the service requirements and the one or more BLE parameters, wherein the BLE mesh network is one of connection oriented, or disconnection.

Cognitive algorithms for LTE cloud-RAN

Abstract: In order to maximize the overall system throughput and cope with increasing user density and traffic distribution as also limited spectrum availability in dense urban scenario, next generation small cell networks need to be equipped with dynamic spectrum management schemes through centralized or distributed co-ordination approach. In this paper, we demonstrate using the theory of fluid queues that for a two transmitter case, centralized scheduling of component carrier (CC) of multiple Small Cells (SeNB) of a cellular operator can provide higher achievable throughput as compared to an uncoordinated approach. To quantify the gains in throughput for a realistic cellular setting, we evaluate a greedy CC scheduler on a LTE System Level Simulator and show that up to 40% throughput gains as also energy efficiency gains are possible with joint scheduling. However, these gains are at the expense of the central controller having complete knowledge of the measurement reports of all the cells of each User Equipment (UE). We exploit the correlated nature of the interference in a dense small cell scenario and propose cognitive measurement algorithms considering realistic cellular settings. We show that using our proposed cognitive measurement algorithm, we can decrease the requirement of uplink(UL) overhead from 12.5 UL reports/UE/second to 0.7 UL reports/UE/second while still maintaining a desired gain in throughput over the uncoordinated scheduling scheme.