Invention Grant
- Patent Title: Analysis of connection patterns in a communication network
-
Application No.: US15524214Application Date: 2014-11-04
-
Publication No.: US10375593B2Publication Date: 2019-08-06
- Inventor: Subramanian Shivashankar , Ankur Dauneria , Saket Gurukar , Sayan Ranu , Balaraman Ravindran
- Applicant: Telefonaktiebolaget LM Ericsson (publ)
- Applicant Address: SE Stockholm
- Assignee: Telefonaktiebolaget LM Ericsson (publ)
- Current Assignee: Telefonaktiebolaget LM Ericsson (publ)
- Current Assignee Address: SE Stockholm
- Agency: Sage Patent Group
- International Application: PCT/SE2014/051303 WO 20141104
- International Announcement: WO2016/072889 WO 20160512
- Main IPC: H04W24/08
- IPC: H04W24/08 ; H04W76/11 ; H04W24/02 ; H04L5/00

Abstract:
The present disclosure relates to a method performed by a network node (54) in a communication network (50) comprising a plurality of communication devices (51), for finding temporally connected connection patterns of the communication devices in the network. The method comprises identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes. The method also comprises partitioning the main communication graph for a time period comprised in said time duration to capture temporally connected signalling between some of the communication devices as illustrated in the main communication graph in a partitioned communication graph. The method also comprises forming at least one subgraph from the partitioned communication graph, comprising m nodes corresponding to m communication devices of said some of the communication devices. The method also comprises constructing a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the vector such that, for each component in the vector, the component value is set to “1” if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the element, and the component value is otherwise set to “0”. The method also comprises testing whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that the number of consecutive “0” element(s), if any, between any two “1” elements is less than a predefined ΔT.
Public/Granted literature
- US20170339590A1 ANALYSIS OF CONNECTION PATTERNS IN A COMMUNICATION NETWORK Public/Granted day:2017-11-23
Information query