WO2007018296A1 - A method for assigning addresses to nodes in wireless networks - Google Patents
A method for assigning addresses to nodes in wireless networks Download PDFInfo
- Publication number
- WO2007018296A1 WO2007018296A1 PCT/JP2006/315974 JP2006315974W WO2007018296A1 WO 2007018296 A1 WO2007018296 A1 WO 2007018296A1 JP 2006315974 W JP2006315974 W JP 2006315974W WO 2007018296 A1 WO2007018296 A1 WO 2007018296A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- address
- nodes
- grid
- component
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5038—Address allocation for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5084—Providing for device mobility
Definitions
- This invention relates generally to networks, and more particularly to assigning addresses to nodes in wireless networks.
- wireless networks have enabled applications such as home and industrial automation, environment monitoring and sensing, security and surveillance, human and goods tracking, and medical monitoring.
- each node can communicate with other nodes that are in transmission range.
- Each node has a unique identity to facilitate communication among the nodes. Address assignment in an ad hoc network is a problem due to the irregular and spontaneous nature of the network topology.
- Some addressing schemes such as the one used by the ZigBee Alliance, use a hierarchical tree of addresses.
- a ZigBee coordinator (ZC) node initially has control over all allocated addresses. Subsequently, a parent node, beginning with the ZC node, allocates a portion of its address space to a child node when the child node joins network. Because the number of child nodes for any parent node is fixed as a configuration parameter, it is possible to systematically determine the portions of the address space that is allocated to a joining child node. That facilitates route discovery without explicit route discovery via broadcast messages.
- the static structure of the ZigBee scheme can waste addresses, or even deny some parent nodes from assigning addresses to potential child nodes.
- a failure of a single node can make nodes with addresses lower in the tree inaccessible. This is a serious problem when the failed node is near the root of the tree.
- Another addressing scheme uses a distributed dynamic address assignment protocol, S. Nesargi and R. Prakash, "MANETconf: Configuration of Hosts in a Mobile Ad Hoc Network," Proceedings of IEEE Infocom, June 2002.
- the protocol is based on a mutual exclusion process based on the Ricart-Agrawala algorithm, G. Spainrt and A.K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Comm. ACM, 24(1), pp. 9-17, 1981.
- a joining node selects a neighboring node as an initiator node.
- the initiator node selects an address and broadcasts a message to notify all other nodes in the network of the selected address.
- the initiator node waits for responses from the other nodes in the network. If the responses from all of the nodes are positive, meaning no other node is using the selected address, then the initiator node assign this address to the joining node. Otherwise, the initiator node selects another address, and so forth.
- All nodes must maintain information about the allocated addresses. This requires memory, which is a limited resource in small sensor nodes.
- the broadcast messages and other management messages consume network resources such as bandwidth and power.
- the initiator node can select any address. Therefore, the address assignment does not necessarily follow a regular or systematic pattern. This makes route discovery a problem.
- Another addressing scheme uses a binary split algorithm, M. Mohsin and R. Prakash, "IP Address Assignment in a Mobile Ad Hoc Network," IEEE Military Communications Conference (MILCOM 2002), volume 2, pp. 856-861, October 2002.
- Each node maintains a block of available addresses.
- the configuring node splits the block into two halves, and retains one half for itself and gives the other half to the requesting node. Every node maintains an address table to record the blocks of addresses.
- Each node also broadcasts periodically its block of addresses to enable other nodes to update their address tables. Addresses can also be 'borrowed' from other nodes. That scheme also leads to an address assignment that does not follow a regular or systematic pattern.
- Another scheme performs duplicate address detection, CE. Perkins, J.T. Malinen, R. Wakikawa, E.M. Belding-Royer, and Y. Sun, "IP Address Autoconfiguration for Ad Hoc Networks," IETF Internet Draft, draft-ietf- manet-autoconf-01.txt, November 2001.
- a joining node selects two random addresses for itself, each from a different group of available addresses. One address is used as a temporary source address for a verification process. The other address is intended for a final address assignment, pending the verification process. That scheme also requires a large number of broadcast messages, and addresses are generated randomly.
- the method can be used for ad hoc networks, sensor networks, mesh networks, multi-hop networks, and other networks.
- the method has a low overhead for memory and broadcast requirements. There are no restrictions on the maximum number of hops, or the number of parent-child node relationships. The method limits the waste of address space when the physical location of the nodes is not uniformly distributed.
- Figure 1 is a grid of nodes and corresponding addresses in a Cartesian coordinate space according to an embodiment of the invention.
- Figure 2 is grid showing multiple routes.
- FIG. 1 shows an example ⁇ -dimensional grid 100 of nodes, where n is 2, in a wireless network according to an embodiment of our invention.
- Each intersection of the grid has Cartesian coordinates, e.g., (0, 0), (0, 1), ... (4, 4).
- the coordinates of the nodes or w-tuples are logical addresses of corresponding nodes.
- the coordinates have a number of components that is equal to the dimensionality of the grid. For example, in two dimensions, each logical address has two components.
- a range of values for each component is expressed by the number of bits that are assigned to the component. For example, if a full address is specified by 16 bits, then each component can be assigned 8 bits for values in a range [0, 255]. Alternatively, the assignment can be 6 and 10 bits, and so forth.
- the grids can be a cube, rectangular or a higher order parallelepiped. Additional dimensions can also be used, e.g., in four dimensions the coordinates of the nodes are (k, I, m, ⁇ ).
- a 'corner' node 1 can be a coordinator node with a logical address (0, 0). Stippled nodes 2-3 have assigned addresses. Cross-hatched node 4 is requesting an address. It should be noted that address assignment can start at any corner node.
- each address component is allocated 8 bits, then the four corner addresses are (0x0, 0x0), (0x0, OxFF), (OxFF, 0x0), and (OxFF, OxFF).
- (0x0, 0x0) was selected as the starting address as a matter of convenience.
- An unallocated logical address is assigned to a child node joining the network by having the child node first broadcast an address request message. In a ZigBee network, this can be a 'beacon request' message. All potential parent nodes within transmission range reply by sending a beacon frame to the requesting node. That frame contains an identification of the sender in addition to some extra information. The child node selects one of the replying potential parent nodes as the parent node. The selection can consider the compactness of the logical address space or the signal strength of the responding node.
- the selected parent node then assigns a child node address to the joining child node as follows.
- the value of one component of the child node address is made one larger than the corresponding component of the parent node. For example, If the address of the parent node Ni is (0, 0), then the address of the joining child node N 2 can be (OxI, 0x0) or (0x0, 0x1).
- nodes 2 and 3 can assign the same address to node 4. If node 2 assigns first, then node 3 is informed by node 2 that the address (1, 1) has been allocated to node 4.
- the assignment order can be according to a predetermined indexing scheme of the coordinate components. For example, the first component is incremented before the second component.
- the ordering can cause the addresses to be uniformly distributed.
- the selected addressing order also implies possible routing between any two nodes.
- our addressing scheme allows multiple paths 21-23, as shown in Figure 2.
- the network is not affected by a failure of a single node. In fact, the network can continue to function even with multiple failed nodes, particularly if the number of dimensions of the grid is relatively high.
- More useful method for assigning addresses to nodes in a wireless communication network can be supplied.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
A method assigns addresses to nodes in a wireless network. An address space is defined as an n-dimensional grid. Each grid intersection has coordinates of a corresponding possible node of a wireless network. A number of components of each coordinate is equal to a dimensionality of the grid, and the coordinates form a logical address of the corresponding node. A parent node assigns an unallocated logical address as a child node address to a child node joining the wireless network such that one component of the child node address is one larger than a corresponding component of the parent node.
Description
DESCRIPTION
A Method for Assigning Addresses to Nodes in Wireless Networks
TECHNICAL FIELD
This invention relates generally to networks, and more particularly to assigning addresses to nodes in wireless networks.
BACKGROUND ART
The latest advances in wireless networks have enabled applications such as home and industrial automation, environment monitoring and sensing, security and surveillance, human and goods tracking, and medical monitoring.
In a wireless network, each node can communicate with other nodes that are in transmission range. Each node has a unique identity to facilitate communication among the nodes. Address assignment in an ad hoc network is a problem due to the irregular and spontaneous nature of the network topology.
Some addressing schemes, such as the one used by the ZigBee Alliance, use a hierarchical tree of addresses. For example, a ZigBee coordinator (ZC) node initially has control over all allocated addresses. Subsequently, a parent node, beginning with the ZC node, allocates a portion of its address space to a child node when the child node joins network. Because the number of child nodes for any parent node is fixed as a configuration parameter, it is possible to systematically determine the
portions of the address space that is allocated to a joining child node. That facilitates route discovery without explicit route discovery via broadcast messages.
However, the static structure of the ZigBee scheme can waste addresses, or even deny some parent nodes from assigning addresses to potential child nodes. In addition, there is a restriction on the maximum number of levels that the addressing tree can have in the network. Furthermore, a failure of a single node can make nodes with addresses lower in the tree inaccessible. This is a serious problem when the failed node is near the root of the tree.
Another addressing scheme uses a distributed dynamic address assignment protocol, S. Nesargi and R. Prakash, "MANETconf: Configuration of Hosts in a Mobile Ad Hoc Network," Proceedings of IEEE Infocom, June 2002. The protocol is based on a mutual exclusion process based on the Ricart-Agrawala algorithm, G. Ricart and A.K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Comm. ACM, 24(1), pp. 9-17, 1981. A joining node selects a neighboring node as an initiator node. The initiator node selects an address and broadcasts a message to notify all other nodes in the network of the selected address. Then, the initiator node waits for responses from the other nodes in the network. If the responses from all of the nodes are positive, meaning no other node is using the selected address, then the initiator node assign this address to the joining node. Otherwise, the initiator node selects another address, and so forth.
However, there are several problems with that protocol. All nodes must maintain information about the allocated addresses. This requires memory, which is a limited resource in small sensor nodes. In addition, the broadcast messages and other management messages consume network resources such as bandwidth and power. Moreover, the initiator node can select any address. Therefore, the address assignment does not necessarily follow a regular or systematic pattern. This makes route discovery a problem.
Another addressing scheme uses a binary split algorithm, M. Mohsin and R. Prakash, "IP Address Assignment in a Mobile Ad Hoc Network," IEEE Military Communications Conference (MILCOM 2002), volume 2, pp. 856-861, October 2002. Each node maintains a block of available addresses. When a node wants to join the network, the joining node requests an address from a neighboring configuring node. The configuring node splits the block into two halves, and retains one half for itself and gives the other half to the requesting node. Every node maintains an address table to record the blocks of addresses. Each node also broadcasts periodically its block of addresses to enable other nodes to update their address tables. Addresses can also be 'borrowed' from other nodes. That scheme also leads to an address assignment that does not follow a regular or systematic pattern.
Another scheme performs duplicate address detection, CE. Perkins, J.T. Malinen, R. Wakikawa, E.M. Belding-Royer, and Y. Sun, "IP Address Autoconfiguration for Ad Hoc Networks," IETF Internet Draft, draft-ietf- manet-autoconf-01.txt, November 2001. A joining node selects two random addresses for itself, each from a different group of available addresses. One address is used as a temporary source address for a verification process. The
other address is intended for a final address assignment, pending the verification process. That scheme also requires a large number of broadcast messages, and addresses are generated randomly.
DISCLOSURE OF INVENTION
Provided is a method for assigning addresses to nodes in a wireless communications network. The method can be used for ad hoc networks, sensor networks, mesh networks, multi-hop networks, and other networks.
The method has a low overhead for memory and broadcast requirements. There are no restrictions on the maximum number of hops, or the number of parent-child node relationships. The method limits the waste of address space when the physical location of the nodes is not uniformly distributed.
BRIEF DESCRIPTION OF DRAWINGS
Figure 1 is a grid of nodes and corresponding addresses in a Cartesian coordinate space according to an embodiment of the invention; and
Figure 2 is grid showing multiple routes.
BEST MODE FOR CARRYING OUT THE INVENTION Figure 1 shows an example ^-dimensional grid 100 of nodes, where n is 2, in a wireless network according to an embodiment of our invention. Each intersection of the grid has Cartesian coordinates, e.g., (0, 0), (0, 1), ... (4, 4). The coordinates of the nodes or w-tuples are logical addresses of corresponding nodes. The coordinates have a number of components that is
equal to the dimensionality of the grid. For example, in two dimensions, each logical address has two components.
A range of values for each component is expressed by the number of bits that are assigned to the component. For example, if a full address is specified by 16 bits, then each component can be assigned 8 bits for values in a range [0, 255]. Alternatively, the assignment can be 6 and 10 bits, and so forth. In other words, the grids can be a cube, rectangular or a higher order parallelepiped. Additional dimensions can also be used, e.g., in four dimensions the coordinates of the nodes are (k, I, m, ή).
A 'corner' node 1 can be a coordinator node with a logical address (0, 0). Stippled nodes 2-3 have assigned addresses. Cross-hatched node 4 is requesting an address. It should be noted that address assignment can start at any corner node.
If each address component is allocated 8 bits, then the four corner addresses are (0x0, 0x0), (0x0, OxFF), (OxFF, 0x0), and (OxFF, OxFF). We have selected (0x0, 0x0) as the starting address as a matter of convenience.
An unallocated logical address is assigned to a child node joining the network by having the child node first broadcast an address request message. In a ZigBee network, this can be a 'beacon request' message. All potential parent nodes within transmission range reply by sending a beacon frame to the requesting node. That frame contains an identification of the sender in addition to some extra information. The child node selects one of the replying potential parent nodes as the parent node. The selection can
consider the compactness of the logical address space or the signal strength of the responding node.
The selected parent node then assigns a child node address to the joining child node as follows. The value of one component of the child node address is made one larger than the corresponding component of the parent node. For example, If the address of the parent node Ni is (0, 0), then the address of the joining child node N2 can be (OxI, 0x0) or (0x0, 0x1).
Other nodes that can possibly assign the same address at a later time are notified of the address assignment. For example, in Figure 1, both nodes 2 and 3 can assign the same address to node 4. If node 2 assigns first, then node 3 is informed by node 2 that the address (1, 1) has been allocated to node 4.
In one embodiment of the invention, the assignment order can be according to a predetermined indexing scheme of the coordinate components. For example, the first component is incremented before the second component. Thus, the ordering can cause the addresses to be uniformly distributed.
It should be noted, that the selected addressing order also implies possible routing between any two nodes. In addition, unlike the tree- structured routing of ZigBee which only has one path to a particular node, our addressing scheme allows multiple paths 21-23, as shown in Figure 2. Thus, the network, as a whole, is not affected by a failure of a single node.
In fact, the network can continue to function even with multiple failed nodes, particularly if the number of dimensions of the grid is relatively high.
Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications may be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.
INDUSTRIAL APPLICABILITY
More useful method for assigning addresses to nodes in a wireless communication network can be supplied.
Claims
1. A method for assigning addresses to nodes in a wireless network, comprising: defining an address space as an ^-dimensional grid, each grid intersection having coordinates of a corresponding possible node of a wireless network, a number of components of each coordinate being equal to a dimensionality of the grid, and the coordinates forming a logical address of the corresponding possible node; and assigning, by a parent node to a child node joining the wireless network, an unallocated logical address as a child node address such that one component of the child node address is one larger than a corresponding component of the parent node.
2. The method of claim 1, in which a range of possible values of each component is determined by a number of bits used to express the component.
3. The method of claim 1 , in which the grid is in a form of a parallelepiped.
4. The method of claim 1, further comprising: assigning coordinates of a corner of the grid as the logical address of a coordinator node of the network.
5. The method of claim 1, further comprising: broadcasting, by the child node, an address request message; replying to the broadcast request message by one or more potential parent nodes; and selecting, in the child node, one of the potential parent nodes as the parent node.
6. The method of claim 1, in which the selecting is based on a signal strength of the replying nodes.
7. The method of claim 1, in which the logical address implies a route between the nodes.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP06782712A EP1913757A1 (en) | 2005-08-09 | 2006-08-07 | A method for assigning addresses to nodes in wireless networks |
| JP2007511148A JP2009505445A (en) | 2005-08-09 | 2006-08-07 | Method for assigning addresses to nodes in a wireless network |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US11/199,625 | 2005-08-09 | ||
| US11/199,625 US7535855B2 (en) | 2005-08-09 | 2005-08-09 | Structured addressing scheme for wireless networks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2007018296A1 true WO2007018296A1 (en) | 2007-02-15 |
Family
ID=37192564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2006/315974 WO2007018296A1 (en) | 2005-08-09 | 2006-08-07 | A method for assigning addresses to nodes in wireless networks |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US7535855B2 (en) |
| EP (1) | EP1913757A1 (en) |
| JP (1) | JP2009505445A (en) |
| CN (1) | CN101238700A (en) |
| WO (1) | WO2007018296A1 (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010053863A2 (en) | 2008-11-06 | 2010-05-14 | Qualcomm Incorporated | Static nodes positioning in a wireless network |
| CN101848459A (en) * | 2010-03-30 | 2010-09-29 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| CN101867919A (en) * | 2010-07-16 | 2010-10-20 | 王晓喃 | IPv6 address configuration method of wireless sensor network based on geographical position |
| WO2014016863A1 (en) * | 2012-07-23 | 2014-01-30 | 富士通株式会社 | Node and communication method |
| CN106060822A (en) * | 2016-08-18 | 2016-10-26 | 中国联合网络通信集团有限公司 | Method for accessing sensor node, enhancement device and sensor network |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7656804B2 (en) * | 2004-08-16 | 2010-02-02 | Motorola, Inc. | Method and apparatus for operating an AD-HOC communication system |
| JP4765973B2 (en) * | 2007-03-27 | 2011-09-07 | パナソニック電工株式会社 | Communication route construction method and communication terminal |
| US20090310544A1 (en) * | 2008-06-12 | 2009-12-17 | Praval Jain | Method and system for increasing throughput in a hierarchical wireless network |
| CN102164393A (en) * | 2011-03-11 | 2011-08-24 | 浙江生辉照明有限公司 | Physical layer address defining method for wireless sensor network |
| WO2013058574A1 (en) * | 2011-10-10 | 2013-04-25 | Samsung Electronics Co., Ltd. | Logical address assignment in a cloud cell |
| WO2013070034A1 (en) * | 2011-11-09 | 2013-05-16 | Samsung Electronics Co., Ltd. | Method and apparatus for assigning a logical address in a communication system |
| CN102625292B (en) * | 2012-03-02 | 2014-08-27 | 重庆邮电大学 | Social intermittent connection network dynamic address allocation and network performance optimization method |
| WO2014016922A1 (en) * | 2012-07-25 | 2014-01-30 | 富士通株式会社 | Data processing device, data processing system, and data processing method |
| CN103052032B (en) * | 2012-12-25 | 2016-01-27 | 上海桑锐电子科技股份有限公司 | The networking of broadcast wireless networks and data communication method |
| WO2015001657A1 (en) | 2013-07-04 | 2015-01-08 | 富士通株式会社 | Data network management system, data network management device, data processing device, and data network management method |
| CN104579567B (en) * | 2015-01-08 | 2018-10-12 | 无锡清华信息科学与技术国家实验室物联网技术中心 | The coding method of inverse path and device |
| CN112153656B (en) * | 2020-09-25 | 2024-05-14 | 北京百瑞互联技术股份有限公司 | Method, system and network for networking disclosed Bluetooth mesh network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5596687A (en) * | 1994-07-29 | 1997-01-21 | David Sarnoff Research Center, Inc. | Apparatus and method for addressing pixel values within an image pyramid using a recursive technique |
| JP2002534842A (en) * | 1998-12-23 | 2002-10-15 | ノキア・ワイヤレス・ルーターズ・インコーポレーテッド | Unified routing scheme for ad hoc internetworking |
| JP4020576B2 (en) * | 2000-09-14 | 2007-12-12 | 株式会社東芝 | Packet transfer method, mobile terminal device and router device |
-
2005
- 2005-08-09 US US11/199,625 patent/US7535855B2/en not_active Expired - Fee Related
-
2006
- 2006-08-07 EP EP06782712A patent/EP1913757A1/en not_active Withdrawn
- 2006-08-07 JP JP2007511148A patent/JP2009505445A/en not_active Withdrawn
- 2006-08-07 WO PCT/JP2006/315974 patent/WO2007018296A1/en active Application Filing
- 2006-08-07 CN CNA2006800285122A patent/CN101238700A/en active Pending
Non-Patent Citations (5)
| Title |
|---|
| CHOI J Y ET AL: "Cell based energy density aware routing: a new protocol for improving the lifetime of wireless sensor networks", COMPUTER COMMUNICATIONS, ELSEVIER SCIENCE PUBLISHERS BV, AMSTERDAM, NL, vol. 28, no. 11, 5 July 2005 (2005-07-05), pages 1293 - 1302, XP004949073, ISSN: 0140-3664 * |
| INSU JEONG, HYUNJUN CHOI, JOONGSOO MA: "Study on Address Allocation in Ad-hoc Networks", PROCEEDINGS OF THE FOURTH ANNUAL ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS'05), 14 July 2005 (2005-07-14), pages 1 - 6, XP002406218, Retrieved from the Internet <URL:ieeexplore.ieee.org/iel5/10154/32462/01515472.pdf?arnumber=1515472> [retrieved on 20061108] * |
| JOBIN J ET AL: "A scheme for the assignment of unique addresses to support self-organization in wireless sensor networks", 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE. VTC2004-FALL (IEEE CAT. NO.04CH37575) IEEE PISCATAWAY, NJ, USA, vol. 6, 2004, pages 4578 - 4582 Vol., XP002406217, ISBN: 0-7803-8521-7 * |
| MCAULEY A J ET AL: "Self-configuring networks", MILCOM 2000. 21ST CENTURY MILITARY COMMUNICATIONS CONFERENCE PROCEEDINGS 22-25 OCTOBER 2000, PISCATAWAY, NJ, USA,IEEE, 22 October 2000 (2000-10-22), pages 315 - 319, XP010532606, ISBN: 0-7803-6521-6 * |
| NAKJUNG CHOI ET AL: "Random and linear address allocation for mobile ad hoc networks", WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, 2005 IEEE NEW ORLEANS, LA, USA 13-17 MARCH 2005, PISCATAWAY, NJ, USA,IEEE, 13 March 2005 (2005-03-13), pages 2231 - 2237, XP010791525, ISBN: 0-7803-8966-2 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101369056B1 (en) * | 2008-11-06 | 2014-03-05 | 퀄컴 인코포레이티드 | Static nodes positioning in a wireless network |
| WO2010053863A3 (en) * | 2008-11-06 | 2010-07-15 | Qualcomm Incorporated | Static nodes positioning in a wireless network |
| WO2010053863A2 (en) | 2008-11-06 | 2010-05-14 | Qualcomm Incorporated | Static nodes positioning in a wireless network |
| JP2012507736A (en) * | 2008-11-06 | 2012-03-29 | クゥアルコム・インコーポレイテッド | Static node positioning in wireless networks |
| JP2014161061A (en) * | 2008-11-06 | 2014-09-04 | Qualcomm Incorporated | Static node positioning in wireless network |
| US8639184B2 (en) | 2008-11-06 | 2014-01-28 | Qualcomm Incorporated | Static nodes positioning in a wireless network |
| CN101848459A (en) * | 2010-03-30 | 2010-09-29 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| CN101848459B (en) * | 2010-03-30 | 2012-10-31 | 北京交通大学 | Wireless transducer network address configuration method based on IEEE 802.15.4 |
| CN101867919A (en) * | 2010-07-16 | 2010-10-20 | 王晓喃 | IPv6 address configuration method of wireless sensor network based on geographical position |
| CN101867919B (en) * | 2010-07-16 | 2012-11-14 | 常熟理工学院 | IPv6 address configuration method of wireless sensor network based on geographical position |
| WO2014016863A1 (en) * | 2012-07-23 | 2014-01-30 | 富士通株式会社 | Node and communication method |
| US9614822B2 (en) | 2012-07-23 | 2017-04-04 | Fujitsu Limited | Node device, communication method and network system |
| CN106060822A (en) * | 2016-08-18 | 2016-10-26 | 中国联合网络通信集团有限公司 | Method for accessing sensor node, enhancement device and sensor network |
| CN106060822B (en) * | 2016-08-18 | 2019-09-17 | 中国联合网络通信集团有限公司 | Access the method, enhancing equipment and sensor network of sensor node |
Also Published As
| Publication number | Publication date |
|---|---|
| EP1913757A1 (en) | 2008-04-23 |
| US20070060134A1 (en) | 2007-03-15 |
| US7535855B2 (en) | 2009-05-19 |
| CN101238700A (en) | 2008-08-06 |
| JP2009505445A (en) | 2009-02-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1941704B1 (en) | A method for assigning addresses to nodes in wireless networks | |
| US7535855B2 (en) | Structured addressing scheme for wireless networks | |
| US7672289B2 (en) | Method for defining, allocating and assigning addresses in ad hoc wireless networks | |
| JP3860175B2 (en) | Efficient IP address assignment and duplicate detection method in ad hoc network environment | |
| EP2457360B1 (en) | Network address allocation method | |
| CN103037361A (en) | Internet protocol (IP) distribution system in wireless Mesh network based on Ad-hoc and IP distribution method in the wireless Mesh network based on the Ad-hoc | |
| Shin et al. | Spectrum: Lightweight hybrid address autoconfiguration protocol based on virtual coordinates for 6LoWPAN | |
| US8248966B2 (en) | Address assignment method and transmission method of mobile nodes for hierarchical routing in LoWPANs | |
| Sheu et al. | A distributed IP address assignment scheme in ad hoc networks | |
| Ye et al. | A survey of addressing algorithms for wireless sensor networks | |
| Taghiloo et al. | New approach for address auto-configuration in manet based on virtual address space mapping (vasm) | |
| Bhatti et al. | A structured addressing scheme for wireless multi-hop networks | |
| Taghiloo et al. | Partitioning and merging of VASM protocol for IP address auto-configuration in MANETs | |
| Park et al. | A distributed dynamic address assignment scheme for tactical mobile ad hoc networks | |
| KR101690787B1 (en) | Apparatus and method on assignment of short address for nodes in wireless networks, and method for processing received frame | |
| Li et al. | Spanning-tree based autoconfiguration for mobile ad hoc networks | |
| Teng | Sequence Configuration With Self-Organized Function Structure for Networking of Smart Sensors | |
| KR20180076810A (en) | Apparatus to build a distributed schedule for p2p in TSCH and AODV based Industrial IoT Networks | |
| Ul Huq et al. | Dynamic IP Address Auto-configuration in MANETs | |
| Rakotondravelona et al. | Hierarchical area-based address autoconfiguration protocol for self-organized networks | |
| Khatri et al. | Dynamic Address Allocation Algorithm for Mobile Ad hoc Networks | |
| Indrasinghe et al. | Disjointed Conflict Free Address Auto-Configuration for Mobile Ad Hoc Networks | |
| Li et al. | Optimistic dynamic address allocation for large scale MANETs | |
| Anand | A Dynamic Filter Based Addressing for Node Auto Configuration in Mobile AD HOC Networks | |
| Matesanz et al. | An Improved Buddy System Auto-Configuration Protocol for Mobile Ad Hoc Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| WWE | Wipo information: entry into national phase |
Ref document number: 200680028512.2 Country of ref document: CN |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 2007511148 Country of ref document: JP |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 2006782712 Country of ref document: EP |