[go: up one dir, main page]

WO2012047178A1 - Procédé d'affectation d'intervalles de temps distribué dans des systèmes de communication mobile - Google Patents

Procédé d'affectation d'intervalles de temps distribué dans des systèmes de communication mobile Download PDF

Info

Publication number
WO2012047178A1
WO2012047178A1 PCT/TR2011/000039 TR2011000039W WO2012047178A1 WO 2012047178 A1 WO2012047178 A1 WO 2012047178A1 TR 2011000039 W TR2011000039 W TR 2011000039W WO 2012047178 A1 WO2012047178 A1 WO 2012047178A1
Authority
WO
WIPO (PCT)
Prior art keywords
time interval
systems
assignment
framework
bandwidth
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/TR2011/000039
Other languages
English (en)
Inventor
Omer Aydin
Tugrul Akyuz
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nortel Networks Netas Telekomunikasyon AS
Original Assignee
Nortel Networks Netas Telekomunikasyon AS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nortel Networks Netas Telekomunikasyon AS filed Critical Nortel Networks Netas Telekomunikasyon AS
Priority to GB1307948.8A priority Critical patent/GB2498676B/en
Publication of WO2012047178A1 publication Critical patent/WO2012047178A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/02—Selection of wireless resources by user or terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/04—Scheduled access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • Time division is a commonly used technique in the networks with air medium formed of a structure comprising mobile communication systems.
  • Time division can be assigned in the mobile data systems of the prior art constantly or dynamically according to topology. Time division assignment is based on being calculated by a central system and then being announced to other systems through a control channel. As a measure for this central system being out of service, different systems are assigned in different times with the task of the "central time interval assigning system", but the mobile networks can not be completely prevented from the risk of being left in the unstable state.
  • the process of forming the timing criteria for determination of this central system may be complex.
  • Ad - Hoc structures are the systems which can communicate with each other wirelessly without needing establishment of a wireless infrastructure. Stations or equipments (computer etc.) can be directly connected to each other without using an access point (AP) and peer to peer communication is possible between these systems, which are connected to each other.
  • AP access point
  • ad hoc structures instead of restricting the time interval assignment to a central system, calculation of the time interval assignment of each system in the same way and in a distributed manner would be more convenient.
  • the purpose of the invention is to define the algorithm wherein the system decides which time interval it will use and will be assigned to itself.
  • a purpose of the invention is to eliminate the need for the central control system identification or automatic determination structure in the mobile systems moving a lot via assignment of the time interval to be used by the system by itself.
  • a purpose of the invention is to provide calculation of the time interval assignment of each system in the same way in a distributed manner in the ad - hoc structures instead of using a central system.
  • the preliminary condition for time assignment is to give different and unique identity numbers (ID) to each of the systems.
  • another purpose of the invention is to develop an algorithm such that its input data would consist of all the system's system identity numbers (ID), location data, required amount of time interval, and previously used amount of this time interval and to determine which system would use which time interval during the relevant framework period at the output of this algorithm.
  • a purpose of the invention is to provide assignment of time intervals by making use of the location information in order to minimize the guard time period determined for preventing the mobile communication systems broadcasting in sequential time intervals from disrupting the broadcasts of each other.
  • the channel usage guard time is minimized by using the location information broadcasted from the control channel as the algorithm input.
  • time interval (2) assignment is performed by starting from the system having the smallest or the largest system identity number (ID) (1 ).
  • Figure 1 is the view of the embodiment wherein five mobile systems communicating with each other and their system identity numbers are shown.
  • Figure 2 is the view related to the application of the method of the invention within the embodiments of the present invention, which are presented here.
  • Figure 3 is the view related to the application of the method of the invention within the embodiments of the present invention, which are presented here.
  • Figure 4 is the view wherein the relationship between the mobile systems that are communicating with each other is shown.
  • Figure 5 is the view related to the application of the method of the invention within the embodiments of the present invention, which are presented here.
  • Figure 6 is the view wherein the systems communicating with the method of the invention.
  • Figure 7 is the schematic view of the data communication between the systems. - Drawings do not have to be scaled and details not necessary for understanding the present invention may be neglected. Moreover, components which are at least widely equal or which have at least widely equal functions are shown with the same number.
  • Power interface NTS Time interval demand
  • time interval assignment method which is the subject of the invention, will only be disclosed for better understanding of the subject, and will not form any limiting effect.
  • ID identity numbers
  • Algorithms are individually performed in these systems which have different identity numbers (1 ).
  • Input data of the algorithm comprises:
  • Identity number (ID) (1 ) can be a number given to platforms or systems by the producer during production and peculiar to the platform or the system like the IMEI number (mobile phone serial number) given to mobile phones.
  • Location data can be obtained from the geographical location derived from a source like GPS (Global Positioning System) or the location data of platforms can be determined according to each other by algorithms measuring the corresponding travelling times of the signals broadcasted by the platforms.
  • Dynamic assignment methods can be applied according to various criteria. One of these is to provide assignment of time intervals (2) by making use of location data in order to minimize the guard time period.
  • time interval (2) demands etc. data of the systems with equal values are entered into the input of the algorithm; the output of the algorithm used would be the same for every system that has equality in its inputs.
  • identity number (D) (1 ) information of the systems and giving priority to the system (1 ) with the smallest identity number (ID) or to the system (1 ) with the largest identity number (ID) the said algorithm can be ensured to give the same result for every system. In this way, time interval (2) assignment is no longer centralized.
  • time interval assignment method (A) of the invention when the location data broadcasted through the control channel is used as input in the algorithm, a better result can be obtained by minimizing the guard time in channel usage.
  • the operation steps of the algorithm are sorted as follows: 1.
  • the vector formed of the system identity number (ID) (2), location data, demanded bandwidth, and the previous bandwidth usage information is sequenced by any sequencing algorithm.
  • a time interval (2) or time intervals in a previously determined ratio or number are given to each of the systems respectively until the bandwidth demand is met,
  • This algorithm is developed according to one of the solution algorithms of the problem known as the Travelling Salesman Problem" and based on providing the salesman visit all of the cities with the shortest path available by visiting each of them at most once. Time interval (2) assignment according to guard time is optimized according to this solution algorithm.
  • the said algorithm proposes making time assignment (2) calculation by starting from the system with the smallest or the largest system identity number (ID) (1 ) among any system.
  • ID system identity number
  • time interval assignment method (A) which is the subject of the invention:
  • system identity numbers (ID) (1 ) of five mobile systems communicating with each other are given. Said five mobile systems broadcast together with their * system identity numbers (ID) (1) through the control channel to each other that how many time intervals (2) they demand.
  • ID system identity numbers
  • sequencing is made as given in Figure 2. This sequencing is made according to time interval (2) demand.
  • time interval (2) demand is sequenced in a way that the system larger than the other systems would be at the top. With such an algorithm, arbitrarily making a sequence wherein the time interval (2) demand starts from the smallest system is also possible.
  • time interval (2) assignment is made according to this criterion during the framework (3) period.
  • the time interval (2) assigned to the system with larger time interval (2) demand would be at the beginning within the framework (3).
  • the other systems are sequenced along the framework (3) from the one having larger time interval (2) demand to the one having smaller within the said framework (3).
  • the time interval (2) demand of the system with the system identity number (ID) 1 is selected as: 22
  • the time interval (2) demand of the system with the system identity number (ID) 2 is selected as: 12
  • the time interval (2) demand of the system with the system identity number (ID) 3 is selected as: 45
  • the time interval (2) demand of the system with the system identity number (ID) 4 is selected as: 6
  • the time interval (2) demand of the system with the system identity number (ID) 5 is selected as: 33
  • Time interval (2) assignment is made according to previously determined criteria, for instance, one by one or two by two on the vector sequenced according to the system identity number (ID) (1) or the bandwidth. In cases when there are equal distances between the systems, priority is given to the system having the smallest identity number (ID) (1 ) and thus time interval (2) assignment is made in the same way in all the systems.
  • the invention is a set of algorithms operating as parts of the "Communication Subsystem (4)" in mobile systems. Since mobile systems generally have not centralized structures, they form the largest area of application of the invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention porte sur un procédé d'affectation d'intervalles de temps distribué (A) qui, d'une manière distribuée, met en œuvre la bande passante, ou en d'autres termes, l'affectation d'intervalles de temps requis par des systèmes pour communiquer dans une période de fonctionnement (3) ; permet un séquencement selon la demande d'intervalles de temps (2) entre les systèmes, une communication entre les systèmes étant réalisée ; et affecte l'intervalle de temps (2) pour lesdits systèmes dans la période de fonctionnement (3) par mise en œuvre d'une comparaison de numéros d'identité (ID) de système dans le cas où il y a les mêmes données sur les systèmes et en empêchant ainsi une affectation aléatoire de l'intervalle de temps à un système.
PCT/TR2011/000039 2010-10-04 2011-02-01 Procédé d'affectation d'intervalles de temps distribué dans des systèmes de communication mobile Ceased WO2012047178A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB1307948.8A GB2498676B (en) 2010-10-04 2011-02-01 Distributed time interval assignment method in mobile communication systems

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
TR2010/08095A TR201008095A2 (tr) 2010-10-04 2010-10-04 Gezgin haberleşme sistemlerinde dağıtık zaman aralığı tahsisi yöntemi.
TR2010/08095 2010-10-04

Publications (1)

Publication Number Publication Date
WO2012047178A1 true WO2012047178A1 (fr) 2012-04-12

Family

ID=44022836

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/TR2011/000039 Ceased WO2012047178A1 (fr) 2010-10-04 2011-02-01 Procédé d'affectation d'intervalles de temps distribué dans des systèmes de communication mobile

Country Status (3)

Country Link
GB (1) GB2498676B (fr)
TR (1) TR201008095A2 (fr)
WO (1) WO2012047178A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9473882B2 (en) 2014-06-16 2016-10-18 Motorola Solutions, Inc. Enhanced location data throughput on a windowed data channel in a radio communication system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040156312A1 (en) * 2002-12-17 2004-08-12 Theodoros Salonidis Distributed bandwidth allocation and transmission coordination method for quality of service provision in wireless AD HOC networks
WO2005076544A1 (fr) * 2004-02-06 2005-08-18 Koninklijke Philips Electronics, N.V. Systeme et procede pour un protocole de reservation repartie de commande d'acces au support a bande ultra large
US20070111757A1 (en) * 2005-10-24 2007-05-17 Nec Laboratories America, Inc. Method and Apparatus for Cross Layer Resource Allocation for Wireless Backhaul Networks
WO2007071198A1 (fr) * 2005-12-23 2007-06-28 Hongkong Applied Science And Technology Research Institute Co., Ltd. Reseau sans fil distribue a allocation de largeur de bande dynamique
EP1936871A1 (fr) * 2006-12-21 2008-06-25 Palo Alto Research Center Incorporated Ordonnancement dynamique du traffic trames fondé sur des permutations des identificateurs des sous-canaux
EP1962460A2 (fr) * 2007-02-21 2008-08-27 Itt Manufacturing Enterprises, Inc. Système et procédé d'accès à canal pratiquement sans collisions
WO2008155737A2 (fr) * 2007-06-20 2008-12-24 Selex Communications S.P.A. Système et procédé pour gérer un réseau radio à large bande du type point à multipoint programmé avec une structure de trame divisée en intervalles de temps pour des applications en mouvement dans des réseaux maillés
US7596113B1 (en) * 2006-09-28 2009-09-29 L-3 Communications, Corp. Transmission scheduling for TDMA networks

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040156312A1 (en) * 2002-12-17 2004-08-12 Theodoros Salonidis Distributed bandwidth allocation and transmission coordination method for quality of service provision in wireless AD HOC networks
WO2005076544A1 (fr) * 2004-02-06 2005-08-18 Koninklijke Philips Electronics, N.V. Systeme et procede pour un protocole de reservation repartie de commande d'acces au support a bande ultra large
US20070111757A1 (en) * 2005-10-24 2007-05-17 Nec Laboratories America, Inc. Method and Apparatus for Cross Layer Resource Allocation for Wireless Backhaul Networks
WO2007071198A1 (fr) * 2005-12-23 2007-06-28 Hongkong Applied Science And Technology Research Institute Co., Ltd. Reseau sans fil distribue a allocation de largeur de bande dynamique
US7596113B1 (en) * 2006-09-28 2009-09-29 L-3 Communications, Corp. Transmission scheduling for TDMA networks
EP1936871A1 (fr) * 2006-12-21 2008-06-25 Palo Alto Research Center Incorporated Ordonnancement dynamique du traffic trames fondé sur des permutations des identificateurs des sous-canaux
EP1962460A2 (fr) * 2007-02-21 2008-08-27 Itt Manufacturing Enterprises, Inc. Système et procédé d'accès à canal pratiquement sans collisions
WO2008155737A2 (fr) * 2007-06-20 2008-12-24 Selex Communications S.P.A. Système et procédé pour gérer un réseau radio à large bande du type point à multipoint programmé avec une structure de trame divisée en intervalles de temps pour des applications en mouvement dans des réseaux maillés

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KUNOLD I ET AL: "SIMULATION VON DIGITALFILTERN MIT EINEM SIGNAL-COMPILER", THE EMBO JOURNAL, IRL PRESS LIMITED, DE, vol. 39, no. 7, 30 March 1990 (1990-03-30), pages 76 - 78,80, XP000112977, ISSN: 0013-5658 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9473882B2 (en) 2014-06-16 2016-10-18 Motorola Solutions, Inc. Enhanced location data throughput on a windowed data channel in a radio communication system

Also Published As

Publication number Publication date
GB201307948D0 (en) 2013-06-12
GB2498676A (en) 2013-07-24
TR201008095A2 (tr) 2011-09-21
GB2498676B (en) 2015-06-17

Similar Documents

Publication Publication Date Title
CN102448180B (zh) 用于车辆网络的自适应多信道接入
KR101564799B1 (ko) 디지털 방송 신호를 이용한 백색 공간 무선 스펙트럼의 사용 가능 방법 및 시스템
CN103220724B (zh) 一种蜂窝与d2d通信混合系统中d2d用户频谱接入方法
CN105517059B (zh) 一种车联网终端的设备到设备d2d资源分配方法及设备
CN102960008B (zh) 用于在空白空间中使用和/或实现控制信道的方法和装置
EP3254410B1 (fr) Procédé et système de sélection de paramètres de communication dans un réseau sans fil
EP2710845A1 (fr) Terminaux statiques
KR20140138878A (ko) 상이한 동작 대역폭들을 갖는 사용자 장비들이 공존하는 시스템에서의 랜덤 액세스를 위한 방법 및 장치
EP2283672A1 (fr) Procédé et appareil associés à la détection de spectre
CN109451583B (zh) 基于超帧的自组网方法、装置、节点终端和存储介质
CN106922018A (zh) 一种定位方法和装置
US10326492B2 (en) Communication method between short range radio communication devices
Brahmi et al. A hidden Markov model based scheme for efficient and fast dissemination of safety messages in VANETs
CN105530604B (zh) 基于位置信息的通信控制方法和系统
US20120195230A1 (en) Method for multiple access to the radio resources in a mobile ad hoc network and system implementing the method
Zhang et al. Opportunistic spectrum scheduling for mobile cognitive radio networks in white space
CN106412957B (zh) 基于WiFi芯片电视白频谱通信系统频谱分配方法
CN105101216B (zh) 频谱资源配置方法、装置及系统
WO2012047178A1 (fr) Procédé d'affectation d'intervalles de temps distribué dans des systèmes de communication mobile
CN102724669A (zh) 认知无线电网络中基于主用户保护的路由和时隙分配方法
CN116347558A (zh) 多跳中继通信系统和多跳中继通信网络的构建方法
JP2007165997A (ja) 移動無線システム及び移動無線チャネル割当方法
JP2009284032A (ja) 基地局装置、無線制御装置及び端末装置並びに方法
CN106411492B (zh) 一种srs资源配置方法及装置
Zhou et al. Trajectory-based reliable content distribution in D2D-based cooperative vehicular networks: A coalition formation approach

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11709508

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 1307948

Country of ref document: GB

Kind code of ref document: A

Free format text: PCT FILING DATE = 20110201

WWE Wipo information: entry into national phase

Ref document number: 1307948.8

Country of ref document: GB

122 Ep: pct application non-entry in european phase

Ref document number: 11709508

Country of ref document: EP

Kind code of ref document: A1