Abstract:
This disclosure relates generally to distributed robotic networks, and more particularly to communication link-prediction in the distributed robotic networks. In one embodiment, robots in a robotic network, which are mobile, can establish communication with a cloud network through a fog node, wherein the fog node is a static node. A robot can directly communicate with a fog node (R2F) if the fog node is in the communication range of the robot. If there is no fog node in the communication range of the robot, then the robot can establish communication with another robot (R2R) and indirectly communicate with the fog node through the connected robot. Communication link prediction is used to identify one or more communication links that can be used by a robot for establishing communication with the cloud network. A link that satisfies requirements in terms of link quality and any other parameter is used for communication purpose.
Abstract:
In LTE Random Access Channel (RACH) mechanism, devices use slotted ALOHA based protocol for RACH message exchange. During these messages exchange, if a device does not get a response from a base-station (BS), the device assumes that it is not able to reach base station due to insufficient transmission power and increases transmit power to reach to the base station. However, at higher density most of requests are lost due to collision. In existing RACH procedure, device unnecessarily ramps power in next RACH process which leads to power wastage in already resource constrained device. When there is failure of reception of RACH process, the present disclosure computes time delays (TD) based on a RSSI value obtained from a message transmitted by the BS, and initiates RACH process accordingly. The embodiments further enable requests transmission from device to BS by ramping power of the devices based on the computed TD.
Abstract:
Optimization of control plane in a software defined network includes obtaining peer information of at least one neighbouring network controller by a network controller and determining a traffic profile variation. The method further includes computing of a self payoff value indicative of one of optimum utilization, underutilization and overutilization of the network controller. The method further includes initiating a non-zero sum game based network control plane optimization operation based on the self payoff value and the traffic profile of the neighbouring network controllers, and may include one of activating additional network controller(s), transferring control of one or more network devices managed by the network controller(s) to a neighbouring greedy network controller, deactivating the network controller, and transferring control of one or more additional network devices managed by the neighbouring network controller(s) to the greedy network controller.
Abstract:
The present application provides a method and system for optimal caching of content in the Information Centric Networks (ICN) and a cache replacement based on a content metric value. The method and system comprises requesting for a plurality of content by a user to a nearest local or edge ICN cache router; delivering by the local or edge ICN cache router the requested plurality of content to the user if it is available in its cache; else forwarding the request for the plurality of content to any of intermediate ICN cache router for finding source of the requested plurality of content; downloading the plurality of content in its downstream path; and storing the downloaded plurality of content based on a content metric value derived by a content metric system (CMS) based on a plurality of network parameters for the requested plurality of content.
Abstract:
Methods and systems for providing requested content to a user device in an Overlay Information Centric Network (O-ICN) architecture are disclosed herein. The method may include receiving a request for accessing content, from the user device. The request is routed to the ICN manager from an ICN router. The method may also include parsing the request to determine whether the request is an ICN based request. The ICN-based request is associated with a flag. Further, the method includes based on the determination, identifying at least one network entity hosting the requested content. The identification is based on a name of the content. The method also includes sending a notification to the at least one identified network entity for providing the requested content to the user device.
Abstract:
A method for uplink scheduling over a communication channel in a communication network including at least one UE and an eNodeB, is described. The method comprises determining whether the UE is associated with at least one of Guaranteed Bit Rate (GBR) bearers and non-Guaranteed Bit Rate (non-GBR) bearers. Based on the determining, for each of the GBR-bearers and the non-GBR-bearers, computing a demand for resources for establishing an uplink communication, wherein the demand is computed based physical layer characteristics and transport layer characteristics associated with the communication channel. The demand computed is communicated as a request message to the eNodeB. In response to the request message, receiving an allocation of the resources for uplink scheduling from the eNodeB.
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.