{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F3MVUZCLCHKGOIRMKYDWASJONE","short_pith_number":"pith:F3MVUZCL","schema_version":"1.0","canonical_sha256":"2ed95a644b11d467222c560760492e690d285e7247dfe94b11ea51d07ef0e6f5","source":{"kind":"arxiv","id":"1701.09010","version":2},"attestation_state":"computed","paper":{"title":"Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dimitrios J. Vergados, Katina Kralevska, Natalia Amelina, Oleg Granichin, Yuming Jiang","submitted_at":"2017-01-31T12:27:09Z","abstract_excerpt":"In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.09010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-31T12:27:09Z","cross_cats_sorted":[],"title_canon_sha256":"de56979b8a6df14c6f1eed5c5cdbbc524957a4720e413dcb366edec27ae9ea7f","abstract_canon_sha256":"b52e2d284c9740d67b10e65ac927f855b317af22b6b9d2b7741f85e66de09171"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:09.270417Z","signature_b64":"JIVCwUfDhzVgg+EEUscLnYfTbEwc7cPnqaOK2T7eFoloDP/WI4o+7sNwjgwisW7NurFFcdgM4wLtqku4gY32DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed95a644b11d467222c560760492e690d285e7247dfe94b11ea51d07ef0e6f5","last_reissued_at":"2026-05-18T00:35:09.269890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:09.269890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Dimitrios J. Vergados, Katina Kralevska, Natalia Amelina, Oleg Granichin, Yuming Jiang","submitted_at":"2017-01-31T12:27:09Z","abstract_excerpt":"In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.09010","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.09010","created_at":"2026-05-18T00:35:09.269967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.09010v2","created_at":"2026-05-18T00:35:09.269967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.09010","created_at":"2026-05-18T00:35:09.269967+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3MVUZCLCHKG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3MVUZCLCHKGOIRM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3MVUZCL","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE","json":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE.json","graph_json":"https://pith.science/api/pith-number/F3MVUZCLCHKGOIRMKYDWASJONE/graph.json","events_json":"https://pith.science/api/pith-number/F3MVUZCLCHKGOIRMKYDWASJONE/events.json","paper":"https://pith.science/paper/F3MVUZCL"},"agent_actions":{"view_html":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE","download_json":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE.json","view_paper":"https://pith.science/paper/F3MVUZCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.09010&json=true","fetch_graph":"https://pith.science/api/pith-number/F3MVUZCLCHKGOIRMKYDWASJONE/graph.json","fetch_events":"https://pith.science/api/pith-number/F3MVUZCLCHKGOIRMKYDWASJONE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE/action/storage_attestation","attest_author":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE/action/author_attestation","sign_citation":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE/action/citation_signature","submit_replication":"https://pith.science/pith/F3MVUZCLCHKGOIRMKYDWASJONE/action/replication_record"}},"created_at":"2026-05-18T00:35:09.269967+00:00","updated_at":"2026-05-18T00:35:09.269967+00:00"}