This　paper　considers　wireless　link　scheduling　in　a　new　setting:　nodes　with　Energy　Harvesting　(EH)　as　well　as　energy　sharing　capabilities.　We　propose　a　Mixed　Integer　Linear　Program　(MILP)　to　determine　1)　the　shortest　link　schedule,　whereby　active　links　in　the　same　slot　adhere　to　the　physical　interference　model;　2)　the　optimal　transmission　power　of　active　links;　and　3)　the　amount　of　energy　shared　by　nodes　in　each　slot.　We　also　outline　a　novel　heuristic　algorithm　to　generate　a　link　schedule　for　large-scale　networks.　In　addition,　we　outline　a　distributed　protocol　that　is　used　by　nodes　to　independently　determine　whether　to　share　energy　and/or　transmit　data　in　each　slot.　Our　results　show　that　1)　energy　sharing　reduces　schedule　lengths　by　about　20%　and　2)　our　distributed　algorithm　generates　schedule　lengths　that　are　approximately　65%　shorter　as　compared　to　a　protocol　that　requires　nodes　to　decide　randomly　whether　to　transmit　data　or/and　share　energy.