Abstract:
A method and a system is disclosed herein for co-operative on-path and off-path caching policy for information centric networks (ICN). In an embodiment, a computer implemented method and system is provided for cooperative on-path and off-path caching policy for information centric networks in which the edge routers or on-path routers optimally store the requested ICN contents and are supported by a strategically placed central off-path cache router for additional level of caching. A heuristic mechanism has also been provided to offload and to optimally store the contents from the on-path routers to off-path central cache router. The present scheme optimally stores the requested ICN contents either in the on-path edge routers or in strategically located off-path central cache router. The present scheme also ensures optimal formulation resulting in reduced cache duplication, delay and network usage.
Abstract:
This disclosure relates generally to autonomous devices, and more particularly to method and system to optimally allocate warehouse procurement tasks to distributed autonomous devices. The method includes obtaining, at a coordinating agent, a global task associated with the warehouse and information associated with the robotic agents. The information includes a count and status of the robotic agents. The global task is profiled to obtain a set of sub-tasks and constraints associated with the set of sub-tasks are identified. The constraints include utilization constraint and/or pricing constraints. A distributed, decentralized optimal task allocation is performed amongst the robotic agents based on constraints to obtain optimal performance of robotic agents. The distributed optimal task allocation includes performing primal or dual decomposition of the set of sub-tasks by each robotic agent and updating corresponding primal/dual variables by the coordinating agent when the optimization is performed based on utilization constraint and pricing constraints, respectively.
Abstract:
A technique for estimating cache size for cache routers in information centric networks (ICNs) is disclosed. In an example, an average rate of incoming requests and a probability of occurrence of each request at a cache router in a predefined time interval is determined. Further, a relation between cache hit and cache miss with and without replacement is derived based on the probability of occurrence of each request. Furthermore, an entropy of the requests is computed based on the probability of occurrence of each request. Moreover, a diversity index of the requests is calculated based on the entropy and the average rate of the requests. A cache size for the cache router is then estimated based on a user defined probability of cache hit, the average rate of the requests, the diversity index of the requests and the relation between the cache hit and cache miss with and without replacement.
Abstract:
A method and system is provided for scheduling interference aware optimal uplink for device-to-device communication underlying LTE networks. The present application provides a method and system for scheduling interference aware optimal uplink for device-to-device communication underlying LTE networks, comprises registering a plurality of users equipment (UEs) with a single cell with one Evolved Node B (eNB) over the Long Term Evolution (LTE) network; initiating connection by the plurality of users equipment (UEs) with Evolved Node B (eNB); discovering device-to-device (D2D) communication between the actively connected plurality of users equipment (UEs); segregating the actively connected plurality of users equipment (UEs) in device-to-device and cellular users by the Evolved Node B (eNB); and scheduling the two-phase interference aware optimal uplink for device-to-device communication for segregated actively connected device-to-device (D2d) and cellular users by the Evolved Node B (eNB), underlying the Long Term Evolution (LTE) network.
Abstract:
A method and system is provided for scheduling interference aware optimal uplink for device-to-device communication underlying LTE networks. The present application provides a method and system for scheduling interference aware optimal uplink for device-to-device communication underlying LTE networks, comprises registering a plurality of users equipment (UEs) with a single cell with one Evolved Node B (eNB) over the Long Term Evolution (LTE) network; initiating connection by the plurality of users equipment (UEs) with Evolved Node B (eNB); discovering device-to-device (D2D) communication between the actively connected plurality of users equipment (UEs); segregating the actively connected plurality of users equipment (UEs) in device-to-device and cellular users by the Evolved Node B (eNB); and scheduling the two-phase interference aware optimal uplink for device-to-device communication for segregated actively connected device-to-device (D2d) and cellular users by the Evolved Node B (eNB), underlying the Long Term Evolution (LTE) network.
Abstract:
Fifth generation and beyond (5G+) systems are expected to adopt new network architectures, services, and deployment schemes for compatibility with the latest technologies and end user's needs. With increase in user equipment (UE), also come variety of advanced applications and use-cases, wherein each application type has its own KPI requirements. Existing resource allocation schemes in cellular networks are not able to handle such dynamic requirements due to which network slice can lead to unwanted mismanagement of resources. Present application provides systems and methods for application-aware dynamic slicing in radio access network (RAN), wherein RAN slicing is proactively managed by learning historical slice demands and consumptions. Once slices are created, the system allocates resources to user equipment by following optimal inter-slice and intra-slice mechanisms based on application type(s), traffic demand(s) and wireless characteristics of UE. Upon resource allocation the UE are further monitored to avoid resource misutilization and resource wastage.
Abstract:
Video conferencing involves transmission of video as well as audio over a network between people involved in the video conferencing, over a network. Typically, quality of conference sessions are affected by quality of network connection. If the bandwidth of the network is low, that that may cause call quality issues or call drops, which is not desirable especially in certain applications such as a surgery over video conferencing. Disclosed herein is a Conference Manager (CM) that can facilitate video conferencing over a low bandwidth network. The CM uses a producer unit and a consumer unit, for video capture and transmission, and a communication device for audio capture and transmission. The CM captures and combines audio and video data at a receiving end of the communication network. The CM also uses a fast block-wise data transfer mechanism for facilitating communication between the transmitting end and the receiving end.
Abstract:
This disclosure relates generally to a method and system for multi-hop path selection for mobile robots based on cloud platform providing an optimal path for end-to-end communication in the multi-hop network. Multi-hop path selection for mobile robots, conventionally performed at mobile robot end, may not provide an optimal path as mobile robots are unaware of the global scenario of the multi-hop network. Further, computation at mobile robot end is not an energy efficient solution. The disclosed cloud system communicates the optimal path to the source mobile robot to reach the destination mobile robot through the plurality of Access Points (APs). Multi-hop path selection for mobile robots, currently performed at mobile robot end, may not provide an optimal path as mobile robots are unaware of the global scenario of the multi-hop network. The optimal path computed at cloud system increases the life-time of robotics network there by increasing the efficiency.
Abstract:
Robotic applications are important in both indoor and outdoor environments. Establishing reliable end-to-end communication among robots in such environments are inevitable. Many real-time challenges in robotic communications are mainly due to the dynamic movement of robots, battery constraints, absence of Global Position System (GPS), etc. Systems and methods of the present disclosure provide assisted link prediction (ALP) protocol for communication between robots that resolves real-time challenges link ambiguity, prediction accuracy, improving Packet Reception Ratio (PRR) and reducing energy consumption in-terms of lesser retransmissions by computing link matrix between robots and determining status of a Collaborative Robotic based Link Prediction (CRLP) link prediction based on a comparison of link matrix value with a predefined covariance link matrix threshold. Based on determined status, robots either transmit or receive packet, and the predefined covariance link matrix threshold is dynamically updated. If the link to be predicted is unavailable, the system resolves ambiguity thereby enabling communication between robots.
Abstract:
This disclosure relates to managing Fog computations between a coordinating node and Fog nodes. In one embodiment, a method for managing Fog computations includes receiving a task data and a request for allocation of at least a subset of a computational task. The task data includes data subset and task constraints associated with at least the subset of the computational task. The Fog nodes capable of performing the computational task are characterized with node characteristics to obtain resource data associated with the Fog nodes. Based on the task data and the resource data, an optimization model is derived to perform the computational task by the Fog nodes. The optimization model includes node constraints including battery degradation constraint, communication path loss constraint, and heterogeneous computational capacities of Fog nodes. Based on the optimization model, at least the subset of the computational task is offloaded to a set of Fog nodes.