MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "ef646902-a1aa-418e-a391-34b41566e992"}, "_deposit": {"id": "1851", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "1851"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/1851", "sets": ["user-uy"]}, "communities": ["ccm", "ccp", "kyauksetu", "ltc", "maas", "miit", "mlmu", "mmu", "mtlu", "mtu", "mub", "mude", "mufl", "pathein", "scu", "suoe", "tcu", "tgu", "tuh", "tum", "ucsm", "ucsmtla", "ucsmub", "ucspathein", "ucstaungoo", "ucsy", "udmm", "udmy", "uit", "um", "um1", "um2", "umkn", "umm", "uphy", "urj", "uvs", "uy", "yau", "ydbu", "ytu", "yude", "yueco", "yufl", "yuoe"], "control_number": "1851", "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "ANALYSIS OF PROXY-BASED PASSIVE DUPLICATE ADDRESS DETECTION FOR WIRELESS SENSOR NETWORKS", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "With the large number of nodes expected in Wireless Sensor Networks (1000\u0027s or more), allocating unique IPv6 addresses to these nodes can be challenging. This is because the resource-limited nodes may not be able to participate in a full address discovery protocol and they may not have unique identifying information upon boot. Therefore lightweight protocols are needed to support address allocation in IPv6 WSNs. Typical approaches for address allocation, where nodes request addresses from central servers (e.g. state-based address configuration with DHCP), are usually too resource demanding on nodes and highly dependent on centralized servers. Decentralized, state-less approaches are necessary, where a node chooses or is allocated an address and in the \r case the address is duplicated in the network, a different address is assigned. The detection of duplicate addresses can be active,\r occurring when the addresses assignment takes place, or passive, only performed if an address in use is later detected to be a duplicate. Passive Duplicate Address Detection (DAD) allows for fast, lightweight address allocation, but at the expense of possible lost data when duplicates occur [1].\r The aim of this research is to design a passive DAD scheme for WSNs that minimizes the traffic and processing overhead, as well as the delay incurred in address allocation. To achieve this we present detailed analysis of a new passive DAD scheme that uses proxy nodes in the address assignment. The system model assumes G gateways from the WSN to the Internet, and N nodes in the WSN. Each node will use one gateway (selected by the WSN routing protocol); the gateway has a 64-bit routing prefix (and subnet ID), x-bit gateway ID and y-bit device ID (x+y64). Before nodes can communicate with devices on the Internet that must learn the routing prefix, x-bit gateway ID and select a y-bit device ID (which should be unique). We assume P percent of the N nodes will act as proxies: normal sensor nodes that also maintain state about the available routing prefix and gateway ID. When a new sensor node joins the network it broadcasts a request for the routing prefix and gateway ID using an expanding ring search (first l-hop, and if no response, then 2-hops, and so on). When proxy or gateway receives a request it responds with the addresses. Importantly, DAD does yet not take place; it only occurs when the gateway receives packets identifying duplicates. This improves address allocation delay, but may lead to extra data packet loss/delay. 2\r A mathematical model of the address acquisition delay, DAD delay, traffic overhead and storage requirements has been developed. Using numerical analysis to determine the expected number of hops between nodes and proxies/gateways for different network densities and configurations, we have obtained results that show the impact of gateway address length (x), number of proxies (P), link delay and density versus the different performance metrics. Figure 1 shows selected results for how the acquisition delay varies the different number of proxies. It shows with proxy density less than 40%, acquisition delay is significant (and maybe too much) especially for sparse networks (range of 15m). Our analysis identifies the key trade offs in lightweight passive DAD, including under which scenarios is proxy-based passive DAD the most suitable address allocation scheme. It also allows comparison with other state-of-the-art passive DAD solutions [2]"}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "addressing"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-05-05"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Analysis of Proxy-Based Passive duplicate address detection for Wireless Sensor Networks.pdf", "filesize": [{"value": "1170 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1170000.0, "url": {"url": "https://meral.edu.mm/record/1851/files/Analysis of Proxy-Based Passive duplicate address detection for Wireless Sensor Networks.pdf"}, "version_id": "dbf99707-ee33-4d5c-945c-ee6672a883a3"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "8th AUN/SEED-Net Regional Conference on Electrical and Electronics Engineering"}]}, "item_1583103147082": {"attribute_name": "Conference papaers", "attribute_value_mlt": [{}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_supervisor(s)": []}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Dana Blouin"}, {"subitem_authors_fullname": "Steven Gordon"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Other"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Other"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2015"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "https://uyr.uy.edu.mm/handle/123456789/414"}, "item_title": "ANALYSIS OF PROXY-BASED PASSIVE DUPLICATE ADDRESS DETECTION FOR WIRELESS SENSOR NETWORKS", "item_type_id": "21", "owner": "1", "path": ["1582967549708"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000001851", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-03-05"}, "publish_date": "2020-03-05", "publish_status": "0", "recid": "1851", "relation": {}, "relation_version_is_last": true, "title": ["ANALYSIS OF PROXY-BASED PASSIVE DUPLICATE ADDRESS DETECTION FOR WIRELESS SENSOR NETWORKS"], "weko_shared_id": -1}
ANALYSIS OF PROXY-BASED PASSIVE DUPLICATE ADDRESS DETECTION FOR WIRELESS SENSOR NETWORKS
http://hdl.handle.net/20.500.12678/0000001851
http://hdl.handle.net/20.500.12678/0000001851b8713489-d578-4d5e-8f0b-98e29bc1dc7b
ef646902-a1aa-418e-a391-34b41566e992
Name / File | License | Actions |
---|---|---|
![]() |
|
Publication type | ||||||
---|---|---|---|---|---|---|
Other | ||||||
Upload type | ||||||
Other | ||||||
Title | ||||||
Title | ANALYSIS OF PROXY-BASED PASSIVE DUPLICATE ADDRESS DETECTION FOR WIRELESS SENSOR NETWORKS | |||||
Language | en | |||||
Publication date | 2015 | |||||
Authors | ||||||
Dana Blouin | ||||||
Steven Gordon | ||||||
Description | ||||||
With the large number of nodes expected in Wireless Sensor Networks (1000's or more), allocating unique IPv6 addresses to these nodes can be challenging. This is because the resource-limited nodes may not be able to participate in a full address discovery protocol and they may not have unique identifying information upon boot. Therefore lightweight protocols are needed to support address allocation in IPv6 WSNs. Typical approaches for address allocation, where nodes request addresses from central servers (e.g. state-based address configuration with DHCP), are usually too resource demanding on nodes and highly dependent on centralized servers. Decentralized, state-less approaches are necessary, where a node chooses or is allocated an address and in the case the address is duplicated in the network, a different address is assigned. The detection of duplicate addresses can be active, occurring when the addresses assignment takes place, or passive, only performed if an address in use is later detected to be a duplicate. Passive Duplicate Address Detection (DAD) allows for fast, lightweight address allocation, but at the expense of possible lost data when duplicates occur [1]. The aim of this research is to design a passive DAD scheme for WSNs that minimizes the traffic and processing overhead, as well as the delay incurred in address allocation. To achieve this we present detailed analysis of a new passive DAD scheme that uses proxy nodes in the address assignment. The system model assumes G gateways from the WSN to the Internet, and N nodes in the WSN. Each node will use one gateway (selected by the WSN routing protocol); the gateway has a 64-bit routing prefix (and subnet ID), x-bit gateway ID and y-bit device ID (x+y64). Before nodes can communicate with devices on the Internet that must learn the routing prefix, x-bit gateway ID and select a y-bit device ID (which should be unique). We assume P percent of the N nodes will act as proxies: normal sensor nodes that also maintain state about the available routing prefix and gateway ID. When a new sensor node joins the network it broadcasts a request for the routing prefix and gateway ID using an expanding ring search (first l-hop, and if no response, then 2-hops, and so on). When proxy or gateway receives a request it responds with the addresses. Importantly, DAD does yet not take place; it only occurs when the gateway receives packets identifying duplicates. This improves address allocation delay, but may lead to extra data packet loss/delay. 2 A mathematical model of the address acquisition delay, DAD delay, traffic overhead and storage requirements has been developed. Using numerical analysis to determine the expected number of hops between nodes and proxies/gateways for different network densities and configurations, we have obtained results that show the impact of gateway address length (x), number of proxies (P), link delay and density versus the different performance metrics. Figure 1 shows selected results for how the acquisition delay varies the different number of proxies. It shows with proxy density less than 40%, acquisition delay is significant (and maybe too much) especially for sparse networks (range of 15m). Our analysis identifies the key trade offs in lightweight passive DAD, including under which scenarios is proxy-based passive DAD the most suitable address allocation scheme. It also allows comparison with other state-of-the-art passive DAD solutions [2] |
||||||
Keywords | ||||||
addressing | ||||||
Identifier | https://uyr.uy.edu.mm/handle/123456789/414 | |||||
Journal articles | ||||||
8th AUN/SEED-Net Regional Conference on Electrical and Electronics Engineering | ||||||
Conference papaers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |